You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
Repository navigation
Long proofs exploiting loopholes in proof-length checker #723
In PR #712 I implemented a new proof-length checker using Lean's syntax trees rather than the existing ad-hoc Python source parsing. This fails CI because it correctly identifies several very long proofs in existing LeanPool code, which are missed by the existing proof-length checker:
Several files in AndersonConjecture, e.g. LeanPool/AndersonConjecture/Jensen/KrullDomain/KrullDomain.lean: use PLift to disguise propositions as data
Two files in PLAcceleratedNesterov, e.g. LeanPool/PLAcceleratedNesterovLean/MorseBott/TubularProjection/Derivative.lean: long proofs declared as private abbrev
Checked the published sources at 94739c353b4c2ceacb577a4eefad3a9210597484. The Nesterov scope extends to eight large proof abbreviations across seven files. The table uses each outer proof assignment, excluding assignments inside statement-level let expressions.
These are static written non-comment line counts, with blank lines retained; semantic-linter validation remains required.
In AndersonConjecture/KrullDomain, the main inner Prop proof packaged in PLift spans lines 327–837 (487 written non-comment lines). Its cardinal-bound subproof at 469–765 accounts for 288. The two kernel proofs are only 61 each; their shared coefficient-map, quotient-evaluation and coset-avoidance arguments offer reusable helper boundaries, rather than additional demonstrated over-limit proofs. Extract finite-fiber/countability lemmas and the two modular-cardinality bounds before assembling the avoiding pair and final theorem. Preserve the three public theorem contracts and prove every intermediate fact from the existing hypotheses.
For the derivative file, I worked out a bounded three-helper split: scalar projection displacement, the epsilon/error estimate, and the chart derivative chain rule. Its complete source proposal preserves all existing headers/imports and has a byte-exact inverse outside those extractions; its written proof count falls from 253 to 187. That proposal is unapplied and uncompiled. The remaining seven Nesterov proofs and the Anderson argument require substantial mathematical decomposition.
Please land the repairs as separate proof-preserving content changes. Validate each changed module with the unchanged intended semantic checker and normal build/lint/quality checks, then close this issue when the complete affected scope passes. Keep the 200-line limit and mathematical statements intact. PR712’s separate scoped gate authorization and its paired PR719 fixture-selector integration remain independent conditions.
Activity
Vilin97 commentedon Nov 5, 2026
Checked the published sources at
94739c353b4c2ceacb577a4eefad3a9210597484. The Nesterov scope extends to eight large proof abbreviations across seven files. The table uses each outer proof assignment, excluding assignments inside statement-levelletexpressions.These are static written non-comment line counts, with blank lines retained; semantic-linter validation remains required.
LeanPool/PLAcceleratedNesterovLean/tubularProj_hasFDerivAt_starProjectionsmooth_embedding_local_graphbootstrapTotalDisplacementProofbootstrapTotalDisplacementGenProoflocalConvergenceAtBasePointGenProoflocalFiberwiseGeometryProoflyapunovContractionProoflyapunovContractionGenProofIn AndersonConjecture/KrullDomain, the main inner
Propproof packaged inPLiftspans lines 327–837 (487 written non-comment lines). Its cardinal-bound subproof at 469–765 accounts for 288. The two kernel proofs are only 61 each; their shared coefficient-map, quotient-evaluation and coset-avoidance arguments offer reusable helper boundaries, rather than additional demonstrated over-limit proofs. Extract finite-fiber/countability lemmas and the two modular-cardinality bounds before assembling the avoiding pair and final theorem. Preserve the three public theorem contracts and prove every intermediate fact from the existing hypotheses.For the derivative file, I worked out a bounded three-helper split: scalar projection displacement, the epsilon/error estimate, and the chart derivative chain rule. Its complete source proposal preserves all existing headers/imports and has a byte-exact inverse outside those extractions; its written proof count falls from 253 to 187. That proposal is unapplied and uncompiled. The remaining seven Nesterov proofs and the Anderson argument require substantial mathematical decomposition.
Please land the repairs as separate proof-preserving content changes. Validate each changed module with the unchanged intended semantic checker and normal build/lint/quality checks, then close this issue when the complete affected scope passes. Keep the 200-line limit and mathematical statements intact. PR712’s separate scoped gate authorization and its paired PR719 fixture-selector integration remain independent conditions.
refactor: split tubular projection derivative proof
Preserve the public filtration lifting lemma
Split over-long proofs in AndersonConjecture (LeanPool#756)
Split over-long proofs in PLAcceleratedNesterovLean (LeanPool#757)