The Truth Gate: Locking Lean Formalizations to Their Papers' Exact Claims

DRAFT, version 1.0. A methods note on the Truth Gate, a mechanical check that binds a Lean 4 formalization to the exact claim its paper makes. Each formalization repository carries Semantics.lean with formal_claim (the statement of the main Lean theorem) and paper_claim, an independent Lean transcription of a verbatim sentence of the paper, recorded with the paper's path, its SHA-256 and its section. paper_claim is never defined as, unfolded to or aliased to formal_claim. The theorem intended_correspondence : formal_claim ↔ paper_claim must be proved by real reasoning (no rfl/Iff.rfl), with no sorry, admit or native_decide, and only the axioms propext, Classical.choice and Quot.sound. CI fails on drift, and the lock must carry the author's approval. The reusable checker (BenFrohman/PipelineHalt PR #4, merge commit 56e29ecaf9b1616eaa327543d7e357d8f5d86fd8) rejects aliasing, rfl correspondences, sorry, admit, native_decide, nonstandard axioms, missing provenance and failed builds. Its CI run 43993050555 on that commit reports 15/15 locked-and-approved negative fixtures rejected and 6/6 post-approval tamper cases correct (one passing demo, five rejections). No partial locks and reporting solved problems. The note states the author's no-partial-locks rule (a lock certifies only a kernel-proved step on the correct path; drift and stand-in types or names are rejected) and his rule of 16 November 2026, 7:49 PM CT, quoted verbatim: “Always tell user immediately when an OPEN problem is SOLVED regardless if it is the open problem i am working on or another that happens to be resolved by proxy of nearby findings or by direct aim or by side tangental work that brings about other findings.” “Solved” means honestly proved: kernel-checked under every gate rule (independent paper_claim, no aliasing or rfl, standard axioms only, no sorry, no partial locks). A lock certifies that the Lean matches the paper's locked claim; whether that claim settles an open problem depends on what it states, and conditional locks stay conditional. No lock in this note states that an open problem is solved. Re-audit. On 17 November 2026 (UTC) a re-audit under the no-partial-locks rule reopened 11 merged locks as draft pull requests, gate red on purpose: frohmanian-tether-verified #8, frohmanian-tether-sdiff #11, frohmanian-strain-eigenvalue #5, frohmanian-symplectic-tether #6, frohmanian-symplectic-tether-may-form #4, frohmanian-symplectic-tether-regularity #4, metriplectic-world-model #4, weighted-enstrophy-identities #4, periodic-ns-classical-continuation #5, HODGE #57, frohmanian-tether-manuscript-2026-06-01 #6. The note's case study is the frohmanian-tether-verified lock (merged at 9acd434, hardened at fa82d34): it passed every mechanical check and was reopened because its main theorem restates its own hypothesis (a tautology), the quoted sentence is a refuted-claims item rather than a step, and a type name is a stand-in. This shows what the mechanical checks do not detect. The frohmanian-tether-sdiff lock (56b540c) is among the reopened ones. The eth-conflict-clause-lattice lock (797f029) has no reopen PR, but no published verdict of the re-audit on it was found, so the note gives no confirmed sound example. Two drift items reported red in NS_Millennium_Proof PR #34 (open) are also described. Reproducibility. https://github.com/BenFrohman/PipelineHalt at commit 56e29ecaf9b1616eaa327543d7e357d8f5d86fd8; fixture toolchain leanprover/lean4:v4.34.0 (core Lean, no Mathlib). Verify: git clone https://github.com/BenFrohman/PipelineHalt && cd PipelineHalt && git checkout 56e29ecaf9b1616eaa327543d7e357d8f5d86fd8 && npm install && npx tsc -b && cd test/fixtures/truth-gate-lean && lake build && ./run-negatives.sh && ./run-tamper.sh. The case study is at frohmanian-tether-verified fa82d34a15a0c61d2ba24167517896ab5276c52d (Lean v4.30.0-rc1, Mathlib 0c154d67103f74be3a0f2c509f72ccbf5be9f2a7; axioms [propext, Classical.choice, Quot.sound]). © 2026 Benjamin Stanley Frohman. Licensed under CC BY 4.0.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24296029
Primary Topic
Logic, programming, and type systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Truth Gate: Locking Lean Formalizations to Their Papers' Exact Claims

Benjamin Frohman
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
preprint

The Truth Gate: Locking Lean Formalizations to Their Papers' Exact Claims

Benjamin Frohman
preprint en

Abstract

DRAFT, version 1.0. A methods note on the Truth Gate, a mechanical check that binds a Lean 4 formalization to the exact claim its paper makes. Each formalization repository carries Semantics.lean with formal_claim (the statement of the main Lean theorem) and paper_claim, an independent Lean transcription of a verbatim sentence of the paper, recorded with the paper's path, its SHA-256 and its section. paper_claim is never defined as, unfolded to or aliased to formal_claim. The theorem intended_correspondence : formal_claim ↔ paper_claim must be proved by real reasoning (no rfl/Iff.rfl), with no sorry, admit or native_decide, and only the axioms propext, Classical.choice and Quot.sound. CI fails on drift, and the lock must carry the author's approval. The reusable checker (BenFrohman/PipelineHalt PR #4, merge commit 56e29ecaf9b1616eaa327543d7e357d8f5d86fd8) rejects aliasing, rfl correspondences, sorry, admit, native_decide, nonstandard axioms, missing provenance and failed builds. Its CI run 43993050555 on that commit reports 15/15 locked-and-approved negative fixtures rejected and 6/6 post-approval tamper cases correct (one passing demo, five rejections). No partial locks and reporting solved problems. The note states the author's no-partial-locks rule (a lock certifies only a kernel-proved step on the correct path; drift and stand-in types or names are rejected) and his rule of 16 November 2026, 7:49 PM CT, quoted verbatim: “Always tell user immediately when an OPEN problem is SOLVED regardless if it is the open problem i am working on or another that happens to be resolved by proxy of nearby findings or by direct aim or by side tangental work that brings about other findings.” “Solved” means honestly proved: kernel-checked under every gate rule (independent paper_claim, no aliasing or rfl, standard axioms only, no sorry, no partial locks). A lock certifies that the Lean matches the paper's locked claim; whether that claim settles an open problem depends on what it states, and conditional locks stay conditional. No lock in this note states that an open problem is solved. Re-audit. On 17 November 2026 (UTC) a re-audit under the no-partial-locks rule reopened 11 merged locks as draft pull requests, gate red on purpose: frohmanian-tether-verified #8, frohmanian-tether-sdiff #11, frohmanian-strain-eigenvalue #5, frohmanian-symplectic-tether #6, frohmanian-symplectic-tether-may-form #4, frohmanian-symplectic-tether-regularity #4, metriplectic-world-model #4, weighted-enstrophy-identities #4, periodic-ns-classical-continuation #5, HODGE #57, frohmanian-tether-manuscript-2026-06-01 #6. The note's case study is the frohmanian-tether-verified lock (merged at 9acd434, hardened at fa82d34): it passed every mechanical check and was reopened because its main theorem restates its own hypothesis (a tautology), the quoted sentence is a refuted-claims item rather than a step, and a type name is a stand-in. This shows what the mechanical checks do not detect. The frohmanian-tether-sdiff lock (56b540c) is among the reopened ones. The eth-conflict-clause-lattice lock (797f029) has no reopen PR, but no published verdict of the re-audit on it was found, so the note gives no confirmed sound example. Two drift items reported red in NS_Millennium_Proof PR #34 (open) are also described. Reproducibility. https://github.com/BenFrohman/PipelineHalt at commit 56e29ecaf9b1616eaa327543d7e357d8f5d86fd8; fixture toolchain leanprover/lean4:v4.34.0 (core Lean, no Mathlib). Verify: git clone https://github.com/BenFrohman/PipelineHalt && cd PipelineHalt && git checkout 56e29ecaf9b1616eaa327543d7e357d8f5d86fd8 && npm install && npx tsc -b && cd test/fixtures/truth-gate-lean && lake build && ./run-negatives.sh && ./run-tamper.sh. The case study is at frohmanian-tether-verified fa82d34a15a0c61d2ba24167517896ab5276c52d (Lean v4.30.0-rc1, Mathlib 0c154d67103f74be3a0f2c509f72ccbf5be9f2a7; axioms [propext, Classical.choice, Quot.sound]). © 2026 Benjamin Stanley Frohman. Licensed under CC BY 4.0.

Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon