Lax Lean Archive

Proof of `The inclusion chain of complexity classes` (3rd statement)

groundedproofs/Lax434930Proofs/NPPolynomialSpace.lean · lax-434930

What this proof establishes

thm✓Lax434930.BasicProperties (3rd statement)

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

A finite nondeterministic machine guesses a bounded certificate and runs the original polynomial-time verifier within polynomial work space. Savitch's theorem, proved separately, then gives deterministic polynomial space and the inclusion.