Skip to content

Count intermediate carries of the frame-506 inverse elimination (no κ) - #268

Draft
unpaidmoon wants to merge 1 commit into
cursor/upstream-e545235-pin-01e6from
cursor/frame506-inverse-row-carries-01e6
Draft

unpaidmoon wants to merge 1 commit into
cursor/upstream-e545235-pin-01e6from
cursor/frame506-inverse-row-carries-01e6

Conversation

@unpaidmoon

Copy link
Copy Markdown
Owner

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.

  • Every low row, at every odd integer q, has at most 19 nonzero digits. Nineteen is strictly less than 48.
  • On the PR Record the sharp frame-506 carry envelope: 48 per route, pair 96 (no κ) CrocSwap/integer-mult-bounds#7104 return row 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 integer q ≥ 5. For every odd integer q ≥ 7 the digits are the constant list in PROOF.md. The one row q = 5 differs at the two sites around q - 6 and keeps the same count.
  • Those 13 quotients compose to the 6-nonzero closed-form correction of Record the sharp frame-506 carry envelope: 48 per route, pair 96 (no κ) CrocSwap/integer-mult-bounds#7104. The closed-form route envelope remains 48 per route and 96 for the pair. Repeating u(q) on eight rows would emit 104 intermediate nonzeros; that route total is not priced here.
  • Exhaustive base-q censuses: maximum 18 on all 3^8 = 6561 rows, maximum 18 on all 5^8 = 390625 rows, and maximum 19 on all 7^8 = 5764801 rows. The uniform site bound is attained at q = 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 card supplier-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 for elimination 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.

python3 -B research/frame506-inverse-row-carries/verify.py
python3 -B scripts/research_package.py --package research/frame506-inverse-row-carries

Observed PASS_FRAME506_INVERSE_ROW_CARRIES and PASS_REGISTERED_RESEARCH_PACKAGE research/frame506-inverse-row-carries outcome=partial. The same checker passed under python3 -I -B.

Evidence class: a proof for this one word (the 19-site bound for every odd integer q, and the closed-form digits on u(q) for every odd integer q ≥ 7), one direct evaluation of the single row at q = 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 - 6 at q = 5 and accepts it for odd q ≥ 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, at q ∈ {3, 5, 7}.

Not run: a q = 9 census, 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

  1. For which odd primes is the one-row maximum of this word exactly 19? It is 18 at q = 3 and q = 5, and 19 at q = 7. The next domain is q = 9, with 9^8 = 43046721 rows.
  2. Does another elimination word for 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

Open in Web Open in Cursor 

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>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants