Repository navigation
Prove every rational splitting of 2I fails the length-6 character count (no κ) - #271
Draft
unpaidmoon wants to merge 1 commit into
Draft
unpaidmoon wants to merge 1 commit into
unpaidmoon wants to merge 1 commit into
Conversation
Every primitive splitting beside A, B, P, and Q extends both old-lattice characters and detects two calls against four targets. The displayed t=2 frames have an exhaustive residue census. No selected-frontier change. Co-authored-by: unpaidmoon <unpaidmoon@users.noreply.github.com>
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.
Change and mathematical scope
Scoped impossibility proof. No new κ and no word.
Every rational rank-one splitting of
2I, placed beside the four projectors with old callBand frozen framesA,P, andQ, meets target support and fails both the extendedP-coefficient and theAB-coefficient. Each character detects two calls and four targets. At the displayedt=2frames(-2/5, 4/5, 8/5)and(12/5, 6/5, -8/5), every integer lift gives that same count. Inside the splitting lattice, a word that uses all six labels has at least ten calls. Length 7 is impossible because one extra label cannot restore the sum4I.Selected κ stays
363005817/100000000000. The eight-call minimum is not lowered and not raised.Evidence classes:
m = |u|^2 / gcd(|u|^2, 4)makesm candm(a+b)integer characters. Both detect two calls and four targets, and every other lift is even on the splitting. No rank-one matrix in the lattice has character(1,1).t=2, each family has 125 residue classes and 25 integral lifts, all even on both frames. Period steps of 5 change the value by an even integer.[-24, 24].Task and overlap
Base commit:
e54523517d0f03e58352e647c403a5af3e525a57(upstream CrocSwapmain, “Admit conditional frontier 7000 with complete source application audit”).Task card:
bit-new-register-model, priority revision 8. Scope changed. The card asks for a larger or nonabelian native alphabet. This package stays in the abelian symmetric 2-by-2 model and answers the rational-splitting question left open by unpaidmoon PR CrocSwap#7067.Concrete object: the six labels
A, B, P, Q, X, 2I-Xfor a rational splittingX. The residue census is the 125 classes of each character family att=2. The direction box is a control only.Not redone: the length-6 support census of CrocSwap#7067, the five-call theorem of CrocSwap#7024, the six-frame classification of CrocSwap#7076, the length-5 four-frame result of CrocSwap#7083, and the two-old equation of CrocSwap#7100. No open upstream PR states this character count. A search for the displayed frames and for “rational splitting of 2I” hits CrocSwap#7067, which leaves the count open, and does not hit a later proof.
Validation
Environment: Python 3.12. Registered replay:
Both registered commands passed (
PASS_REGISTERED_RESEARCH_PACKAGE, outcomenegative-result), including thepython -Orerun. Direct check:python3 -I -W error -B research/rational-split-p-coefficient/verify.py.The
t=2parity census is exhaustive for that denominator. The statement for every primitive direction is a proof. The 1440-vector box is a finite control, not a census. Predecessor replays, Lean, Docker, and the selected-result cold replay were not run.Failure controls:
Iand zero are not rank one; the rawc-coordinate of thet=2frame is not an integer; addingAbreaks the splitting; a non-primitive direction is rejected; the integral splittings2A+2Band2P+2Qstill fail the count. Boundary:P/2lies outside the lattice, everyP-coefficient shape misses it, and theABlifta+3bstill detects two calls against four targets on the eight-label pair.Credit
The register model is Cinna Davis's PR2085/2112 formal model. The determinant identity and the character inequality are the PR2910 package as recorded in apoursh's two-signed-frame floor, PR6190. The
ABandPQshapes areresearch/three-signed-old-once. The integralP-coefficient count is the language ofresearch/four-signed-once-parity. The length-6 support shape, the displayedt=2frames, and the open question are unpaidmoon PR CrocSwap#7067, heade6aac77f79560add2c47c761d9defff96934d88d. None of those theorems is redone.Prepared by unpaidmoon with substantial Cursor Grok assistance. No independent human or formal-kernel review. New work is Apache-2.0.
Open next questions
Is there a rank-one matrix
Youtside thet=2lattice for which everyABlift and everyP-coefficient lift integral on the displayed frames detectsY? A cancelling pairY, -Ywould then meet both inequalities at length 8. Passing that count would still not be a word: support and the product remain. The half projectorP/2is a negative example, killed by the lifta+3b. The smallest next matrix is(0,0,1/3).Workflow feedback (optional)
CrocSwap#1200