The proof is certain, only its reach is bounded
Theorem.The proof is certain, only its reach is bounded.
Proof.a proven theorem is TRUE with certainty — the algebra is not doubted, and every registry atom that computes is trusted without external validation. What a boundary bounds is never the truth of the computation but its REACH into the physical world or deployment. DISHONESTY IS SYMMETRIC: overclaiming a proof into fact AND underclaiming a theorem that computed are both lies; honesty is full commitment inside the proof and a flag only at its edge. HARMONY ≠ TRUTH governs the edge, never the algebra.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/4/6/index.ts#theProofIsCertainOnlyItsReachIsBounded
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
"The proof is certain, only its reach is bounded" 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 theProofIsCertainOnlyItsReachIsBounded.
- 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 (theProofIsCertainOnlyItsReachIsBounded @ 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 theProofIsCertainOnlyItsReachIsBounded (src/4/6/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.