Repository navigation
Prove two rank-q maps in one gap can fill every helped core block (no κ) - #273
Draft
unpaidmoon wants to merge 2 commits into
Draft
unpaidmoon wants to merge 2 commits into
unpaidmoon wants to merge 2 commits into
Conversation
The complementary copies of the rank-q witness do not reach rank 2q. With invertible off-diagonal blocks an explicit pair makes each helped block the identity, so the uniform q(g-1) lift does not survive. No kappa change. Co-authored-by: unpaidmoon <unpaidmoon@users.noreply.github.com>
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
Proof, not a κ change. On the paired-star one-gap schedule, two matrices of rank at most
qin the same internal gap, each withP_s Z P_f = 0, can make every helped core block equalI_{2q}.The first step from open PR CrocSwap#7053 does not. Two copies of that rank-
qwitness on complementary leaf halves, or split onto complementary core directions, do not reach rank2qwhile obeying the square equation. WithB12 = B21 = 0both outside blocks have rank at mostqfor any number of internal matrices, because each factors through a projector image of dimensionq. That failed step is not unrestricted nonexistence.The positive pair uses
B12 = B21 = I_q, over any field of characteristic two. Each factor has rankqand kills the image of the first half. For both half orders the three blocks of the sum areI_{2q}. A helped leaf can meetA_j + B_j = I_dwith external block zero. The uniform lift of CrocSwap#7053 to external rankq(g - 1)therefore does not apply to every placement. The dropped-leaf boundq(g - 3)of CrocSwap#7025 still applies.With those identity blocks the parity count is sharp for the rank inequalities:
g, even stage: at leastq(g - 1), for any internal matrices, because only one even leaf is helped;g, odd stage: at leastq(g - 3), and a gap tuple meets it;g: at leastq(g - 2)at every stage, and a gap tuple meets it.At
g = 31,q = 26the odd-gnumbers are 780 and 728. The tuples are not words.The selected frontier stays
κ = 363005817/100000000000. This does not construct a word, does not retake the one-map theorem, and does not replace CrocSwap#7025, CrocSwap#7005, CrocSwap#7050, or CrocSwap#7126.Task and overlap
e54523517d0f03e58352e647c403a5af3e525a57(upstreamCrocSwap/integer-mult-boundsmain, re-fetched at session start; unchanged). This fork PR usescursor/upstream-e545235-base-03aaat that same commit so the diff is only the new package. Forkmainis not upstream main.research/two-rank-q-same-gap.66405802f1eaac23d7b19759db1fc5d68b409397.joint-query-controller, catalogue priority revision 8,scope_status: changed. The card asks for a changed query demand or caller. The assigned question is open question 1 of Prove one rank-q internal map raises the paired-star external bound to q(g-1) CrocSwap/integer-mult-bounds#7053.q(g - 3)bound of Prove one internal paired-star gap still needs thin rank at least q(g… CrocSwap/integer-mult-bounds#7025, the consecutive bound of Prove consecutive paired-star words need thin rank at least g q. CrocSwap/integer-mult-bounds#7005, and the every-stage theorems of Prove every-stage internal gaps need thin rank at least q g / 2 CrocSwap/integer-mult-bounds#7050 and Prove rank factor 1 for every-stage paired-star gaps and raise the thin-rank bound to 2q⌈g/3⌉ (no κ) CrocSwap/integer-mult-bounds#7126. Not taken: Prove one rank-q internal map raises the paired-star external bound to q(g-1) CrocSwap/integer-mult-bounds#7053 question 2, the leaf-to-core every-stage question, or theg = 13remainders.docs/research/current-priorities.mdon this base still quotes an older κ. The selected record above is the one used.Validation
Evidence class: proof over any characteristic-2 field, for the stated halves and matrices. The
q = 1census is an exhaustive check of every rank-at-most-1 matrix on the eight coordinates (all scalar(B12, B21), both half orders). It is not a census of words. The gap tuples are inequality witnesses, not words.Python 3.12, no dependencies. Both registered commands (
python -Bandpython -O -B) print:PASS_TWO_RANK_Q_SAME_GAP blocks=I_2q singular_next_cap=q+rank(B21) odd_stage_external=728 even_stage_external=780 uniform_q(g-1)_lift=does_not kappa=363005817/100000000000scripts/check_research_commit.py --package research/two-rank-q-same-gap --check-source-history --check-modesreportsPASS_RESEARCH_COMMIT_BYTESfor the package at66405802f1eaac23d7b19759db1fc5d68b409397, with source history ancestore54523517d0f03e58352e647c403a5af3e525a57.Failure controls: clearing one column of the first map makes the next block leave
I_2, and one map alone is not the next identity.Credit
The one-gap schedule and
q(g - 3)are open PR CrocSwap#7025. The three blocks, the one-map cap, the rank-qwitness, and this question are open PR CrocSwap#7053. The paired-star contract and the commuting map-count are from PR CrocSwap#5747 (Ali Romman), including PR CrocSwap#5673, PR CrocSwap#5631, and PR CrocSwap#5617. Cinna Davis supplied the controller and simplex lineage those packages retain. Open PR CrocSwap#7005 is the consecutive-halves bound. Open PR CrocSwap#7126 is the every-stage factor.Prepared by unpaidmoon with substantial Cursor Grok assistance. Apache-2.0.
Open next questions
q(g - 3), together with these two maps, meetA_j + B_j = I_don every leaf atg = 31,q = 26? First step: staget = 1, place the maps, set the three helped external blocks to zero, and test the cover on the remaining leaves. The monomial transport is not rebuilt here, so a passing rank tuple would still not be a word. This is not Prove one rank-q internal map raises the paired-star external bound to q(g-1) CrocSwap/integer-mult-bounds#7053 question 2 and not the every-stage question.0 < rank(B21) < q, can two rank-at-most-qmaps attain next-block rankq + rank(B21)and own-block rank2qtogether? First step: atq = 4, takeB21of rank 1 andB12 = I_4. The identity witness usesB21 = I_q, so its functionals need not kill the smaller image.Workflow feedback (optional)
CrocSwap#1200