Theorems are the gates
Theorem.Theorems are the gates — a gate is legitimate when it is an algebraic fact that computes: the registry conjunction blocks the build (gate ≡ theorem in one object), the crack lattice is a 5-smooth characterization, census and ceilings are arithmetic;.
Proof.a gate is legitimate when it is an algebraic fact that computes: the registry conjunction blocks the build (gate ≡ theorem in one object), the crack lattice is a 5-smooth characterization, census and ceilings are arithmetic; the textual remainder (3 regex gates) is queued with named algebraic restatements — what cannot be explained in algebra is examined closely, not trusted.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/4/6/index.ts#theoremsAreTheGates
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Theorems are the gates" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation theoremsAreTheGates.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (theoremsAreTheGates @ src/4/6) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes theoremsAreTheGates (src/4/6/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.