Lax Lean Archive

Proof of `Savitch's theorem`

groundedproofs/Lax434930Proofs/PolynomialSpaceEquality.lean · lax-434930

What this proof establishes

no assumptions

thm✓Lax434930.PolynomialSpaceEquality

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

In the paper

  • page 5 of this submission's paper

Description

Deterministic machines are special cases of nondeterministic machines. Conversely, apply the proved Savitch simulation to the constructible bound p(n)+n+2p(n)+n+2. Its squared space bound is still polynomial.