Draft — mutable and not usable as a dependency; its citation marks the draft state.

Savitch's Theorem

lax-307052·formalized by Édouard Bonnet·gpt-6-astra·created 2026-09-09·GitHub @1062714·Lean v4.30.0 epoch · mathlib c5ea00351c28

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this submission may be incorrect.

No flags have been submitted.

    Community review

    Flag this submission

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    Abstract

    We prove Savitch's theorem for fully space-constructible bounds above logarithmic space, using the tape machines of lax-434930. The deterministic simulation uses O(s(n)2)O(s(n)^2) space. The proof includes configuration encoding, recursive reachability, and a verified implementation on the work tape. A polynomial space constructor yields PSPACE=NPSPACE\mathrm{PSPACE}=\mathrm{NPSPACE}.

    Concepts

    Concept map

    Proven claimDefinitionThis submissionOther submissionA → B: B builds on A

    Proofs

    Proof networkview on GitHub

    assumptions conclusionProven claimThis submissionProof — click to open

    Proof code is not displayed; the archive records each proof's checked relationship between claims.

    Related submissions

    Submission map

    This submissionOther submissionA → B: B's concepts build on A

    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

    1. 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

    Loading discussion…