Repository navigation
Formalize normal-class rank and complete count/price bounds in Lean - #2404
Merged
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
PR #2338's all-batch P112 argument uses a normal-class rank implication that had not been kernel-checked here. This contribution formalizes that implication, its rectangular fixed-space transfer and its complete count/price consequences, with the exact premises exposed.
For any field and finite term set, distinct endpoint classes and
K[i,j] != 0 -> beta[i] = alpha[j]imply2 dim ker(I-K) <= t. For rectangular factors withAC+DE=I_N, the same hypotheses onCAgive2N <= 2n+t; charging every term yields64k+3t <= 7t+8nwhenN=8k, plus the real-power analogue. The proof includes empty term sets. Explicit counterexamples show why equal classes, zero diagonal alone and a one-third replacement fail.The source mathematics belongs to DreamingOfClouds' #2338, pinned at
82700676e1d42acf98dc1921cb6ef82551620008; exact README/NOTICE copies and hashes are retained. #2342 supplies a narrower independent three-call argument and explicitly excludes auditing the broader all-batch proof. This PR does not verify the geometric/frame premises, run the source SAT/DRAT rigidity check, audit all of #2338 or admit a physical supplier. Selected certificates and kappa are unchanged.Validation performed locally:
propext,Classical.choice,Quot.sound; three false proof attempts rejected after valid imports.Replay:
python3.12 -B scripts/research_package.py --package research/lean-normal-class-rank. That default checks sources/finite evidence and explicitly does not run Lean. README documents the separate full kernel command; VALIDATION.json records the executed checks and their limits.One fresh random draw selected independent-verification, second suggestion
formal-interface-lemma; TASK.json records the scope change and no reroll. Canonical main remained0fdd7d82de03e43c9e5a1000dfbcd380d1b687d2, priority revision 4. Final overlap covered 607 open PRs and 1,137 Discussion records with complete pagination and no warnings.Coordination: #2380. Open next question: formally bind the actual P112 normal-class/frame evidence to the matrix compatibility premise.
Gareth Davidson (@bitplane), with substantial OpenAI Codex assistance in proof, implementation, verification and writing; no subagents or independent human review. Wrapper/workflow/control structure adapts our #2341/#2295 harnesses, with attribution. New finite engines import no predecessor checker.