Repository navigation
Count intermediate carries of the frame-506 inverse elimination (no κ) - #268
Draft
unpaidmoon wants to merge 1 commit into
Draft
unpaidmoon wants to merge 1 commit into
unpaidmoon wants to merge 1 commit into
Conversation
The inverse of the published 5/5/14 word emits one carry digit on each scale and shear. Every low row has at most 19 nonzero digits, and the CrocSwap#7104 return row u(q) has exactly 13 for every odd integer q >= 5. The selected frontier is unchanged. 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, plus three exhaustive finite censuses. No new κ. The selected frontier stays
363005817/100000000000.The published frame-506 elimination has 5 swaps, 5 scales and 14 shears. Reversing it and inverting each factor is an elimination word for
S^{-1}. PR CrocSwap#4957 does not fix that word as the physical return. Under the section-3 quotient(z - h) / q, each scale and each shear emits one carry digit on a low row, and each swap emits none.q, has at most 19 nonzero digits. Nineteen is strictly less than 48.u(q) = (q-2, q-2, q-5, q-5, 0, q-1, 0, 0), exactly 13 of the 19 digits are nonzero for every odd integerq ≥ 5. For every odd integerq ≥ 7the digits are the constant list inPROOF.md. The one rowq = 5differs at the two sites aroundq - 6and keeps the same count.u(q)on eight rows would emit 104 intermediate nonzeros; that route total is not priced here.qcensuses: maximum 18 on all3^8 = 6561rows, maximum 18 on all5^8 = 390625rows, and maximum 19 on all7^8 = 5764801rows. The uniform site bound is attained atq = 7. These censuses do not determine the maximum at any other prime.This does not change the 5/5/14 word, owners, ROW restoration, P1–P3, the native compiler, or any exponent gap.
Task and overlap
Base
e54523517d0f03e58352e647c403a5af3e525a57. Catalogue cardsupplier-boundary-audit, scope refined. This answers open question 1 of PR CrocSwap#7104. Question 2 of that PR, a charged ordinary bill that moves an exponent, is not taken.python3 scripts/find_overlap.py --offline --limit 5 "elimination word for"on this base searched 10180 local notes with a complete head inventory. The only hits are this package. Remote PR and discussion snapshots were unavailable in that offline run. A separate reading of open upstream PR titles through CrocSwap#7200, and a GitHub search of open PRs forelimination word, found the question only in CrocSwap#7104, which states that an elimination-word tally is not claimed. The search API was rate-limited, so this is not a full refreshed overlap certificate.Validation
Python 3.12, standard library only. No Lean, Docker, or predecessor suite.
Observed
PASS_FRAME506_INVERSE_ROW_CARRIESandPASS_REGISTERED_RESEARCH_PACKAGE research/frame506-inverse-row-carries outcome=partial. The same checker passed underpython3 -I -B.Evidence class: a proof for this one word (the 19-site bound for every odd integer
q, and the closed-form digits onu(q)for every odd integerq ≥ 7), one direct evaluation of the single row atq = 5, and exhaustive censuses of three finite domains. The censuses are not a search, and they are not a proof for any unlisted prime.Controls: the range test rejects residue
q - 6atq = 5and accepts it for oddq ≥ 7; the zero row emits no digit; dropping the quotients misses the closed-form high row; the integer census test agrees with the rational quotient on every digit of every coefficient that occurs, atq ∈ {3, 5, 7}.Not run: a
q = 9census, any other factorization, exponent-gap substitution, native/ROW replay, Lean, Docker.Credit
The matcher, the 5/5/14 elimination and the carry formula are from PR CrocSwap#4957 (Chris R / Clear1nsight, with the retained CrocSwap#4760/CrocSwap#4814 lineage). The named row and the closed-form correction are from PR CrocSwap#7104. Prepared by unpaidmoon with substantial Cursor Grok assistance. Apache-2.0.
Open next questions
q = 3andq = 5, and 19 atq = 7. The next domain isq = 9, with9^8 = 43046721rows.S^{-1}emit 48 or more nonzero intermediate digits on one row? The 19-site bound uses this inverse of the published word. PR Verify the conditional completed BIT backend API edge with independent source checks (no new κ) CrocSwap/integer-mult-bounds#4957 does not designate a second return word.Workflow feedback (optional)
The closed-form correction and the intermediate digits of a factorization are different functions: this row has 13 nonzero intermediate digits and 6 nonzero closed-form corrections, and the intermediates compose to the closed form. Feedback discussion: CrocSwap#1200