How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Read-only-input nondeterministic work space is closed under complement above logarithmic space
Statement
If is work-space constructible and , then This is the read-only-input work-space notation introduced on this page, not an unqualified assertion about the library's all-tapes NSPACE convention.
Facts & Assumptions
Given: a work-space-constructible satisfying .
The general read-only-input complement equality is established by the Immerman--Szelepcsényi theorem (Immerman-Szelepcsényi theorem: NL equals coNL).
Proof
The hypotheses here are exactly the hypotheses of the general clause in [L1].
Applying that clause gives , which is closure under complement.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Arora and Barak, Computational Complexity, Corollary 3.19 (standard reference, not scraped)