Skip to content

Prove the narrow-row half-gap budget at 1/(16p^2). - #4648

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
unpaidmoon:cursor/narrow-row-half-gap-33f8
Oct 22, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
unpaidmoon:cursor/narrow-row-half-gap-33f8

Conversation

@unpaidmoon

@unpaidmoon unpaidmoon commented Oct 22, 2026 •

Copy link
Copy Markdown
Contributor

Change and mathematical scope

Scoped audit of one #4100 precision sentence. No new κ. The selected conditional value stays 60403/20000000 = 0.00302015.

vendor/FINE-PRIME.md says that deleting diagonal aliases preserves a polynomial gap, and that exponentially accurate band truncation and rounding preserve half of it. GAUSSIAN.md concludes that the rounded reference has diagonal 1, row gap at least 1/(16p^2) and row norm below 2. This package makes that budget explicit.

Under a ≥ 4 log(16p) and θ ≥ 1/(4p^2), with log the natural logarithm,

S = exp(-2 a θ) + 5 exp(-2 a),    γ = 1 - S ≥ 1/(8p^2).

Alias removal (reset the nonnegative diagonal to 1) and band truncation (zero any off-diagonal entries) spend none of this certificate. A rounding perturbation whose off-diagonal absolute row sum is at most τ ≤ 1/(16p^2) leaves row gap at least 1/(16p^2) and absolute row sum strictly below 2. The factor one half is sharp for that certificate: a row that meets it and a defect of 1/(8p^2) leave gap 0. A sufficient special case is at most 2p off-diagonal entries, each moved by at most 2^{-5p}. The same count at 2^{-4p} fails at p = 1. This does not identify #4100's unnamed precision constant with 5.

This is not a supplier admission, a Gaussian-circuit replay, or a complete multiplication theorem.

Task and overlap

Validation

Python 3.12, standard library only, from the repository root:

python3 -B scripts/research_package.py --package research/narrow-row-half-gap --check-only
python3 -B scripts/research_package.py --package research/narrow-row-half-gap
python3 scripts/check_research_commit.py --package research/narrow-row-half-gap --check-source-history

All three passed. verify.py pins the source sentences and checks the series comparisons, the uniform integer certificate, the three operations for p = 1..200, the C = 5 induction, the polynomial thresholds, and a singular control. It does not build a Gaussian matrix or replay #4100. LOG-A §3's elimination identity is cited, not re-proved.

Credit

The ideal bound is LOG-A §1 from PR1673. PR1786 and #4100's vendor/FINE-PRIME.md state the one-sentence claim. The 1/(8p^2) certificate is the merged pr1786-fine-prime-transfer-audit. #4217 asked the question. #4438 (James Reed) separated the column gauge from the row.

Prepared by unpaidmoon with substantial Cursor Grok assistance. Apache-2.0.

Open next questions

  1. Does the stored band have at most 2p off-diagonal entries per row, and does the note's rounding meet absolute error 2^{-5p}? The total budget is proved either way. Blocked until W and the rounding mode are pinned.
  2. Which chirp origin does the interior caller use? The coverage map lists this beside the half-gap sentence. A centred prime-scale chirp keeps both corners positive, with a row sum above 1 (no new κ) #4304 shows a centred chirp can push one p = 19 entry above 1. This row budget does not choose the origin.

Alias removal and band truncation preserve the ideal certificate 1/(8p^2). A rounding defect of at most 1/(16p^2) leaves row gap 1/(16p^2) and row norm below 2. No new kappa.

Co-authored-by: unpaidmoon <unpaidmoon@users.noreply.github.com>
@Mister-Meeseeks
Mister-Meeseeks merged commit b21331d into CrocSwap:main Oct 22, 2026
2 checks passed
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.

3 participants