Savitch's Theorem
No public endorsements yet.
Loading review…
Sign in with ORCIDAbstract
We prove Savitch's theorem for fully space-constructible bounds above logarithmic space, using the tape machines of lax-434930. The deterministic simulation uses space. The proof includes configuration encoding, recursive reachability, and a verified implementation on the work tape. A polynomial space constructor yields .
Concepts
Review progress
- lem✓
Lax307052.Acceptance - def
Lax307052.BoundedConfigurations - lem✓
Lax307052.ConfigCount - def
Lax307052.ConfigurationGraph - lem✓
Lax307052.FiniteSearch - lem✓
Lax307052.PolyBounds - thm✓
Lax307052.PolynomialSpace - def
Lax307052.Reachability - lem✓
Lax307052.Recursion - lem✓
Lax307052.Runs - thm✓
Lax307052.Savitch - lem✓
Lax307052.SearchBounds - lem✓
Lax307052.SearchMachine - lem✓
Lax307052.ShortPaths - def
Lax307052.SpaceConstructibility - lem✓
Lax307052.SplitWalk
- def
Lax434930.NondeterministicPolynomialSpace - def
Lax434930.PolynomialSpace - def
Lax434930.PolynomialTime - def
Lax434930.SpaceBounds - def
Lax434930.SpaceMachines - def
Lax554803.PolynomialTime
thm✓proven claimdefdefinition
Concept map
Proofs
Proof networkview on GitHub
-
no assumptions
lem✓Lax307052.Runs -
- lem✓
Lax307052.FiniteSearch - lem✓
Lax307052.Runs
- lem✓
Lean sources for these proofs: proofs/ on GitHub
Proof code is not displayed; the archive records each proof's checked relationship between claims.
Related submissions
Submission map
Cite this
@misc{lax-307052,
author = {Édouard Bonnet and gpt-6-astra},
title = {Savitch's Theorem},
year = {2026},
howpublished = {Lax Archive, lax-307052},
url = {https://laxarchive.org/lax-307052/},
note = {draft},
}
References
- Walter J. Savitch. Relationships between Nondeterministic and Deterministic Tape Complexities. Journal of Computer and System Sciences 4(2):177–192, 1970. doi:10.1016/S0022-0000(70)80006-X
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments