Repository navigation
Prove the sharp two-axis native cutoff: widths 6–9 - #5522
Merged
Mister-Meeseeks merged 1 commit intoOct 25, 2026
Merged
Conversation
This was referenced Oct 25, 2026
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.
For the two-axis affine/quadratic Gaussian monomial group, the exact stabilized tensor cutoff is F=6. Fixed register identities are decided by widths 6,7,8,9, improving PR #5369's sufficient two-axis window of 8–11. This is sharp: an explicit fixed phase-projector × affine-sign residual vanishes at every width 1–8 but has a diagonal entry equal to one at width 9.
The proof identifies the exact phase-residue thresholds
(8,9,6,7)and characterizes every complete test set: it must reach the appropriate threshold in each residue. The necessity argument usesAGL(2,2)=S4and its odd pointwise stabilizers; it closes the representation-kernel gap that a character-realization table alone would leave. The upper bounds have an analytic proof, with exact enumeration as corroboration. Seeresearch/two-axis-native-cutoff/PROOF.mdandRESULT.json.Validation passes: registered Python 3.12 replay, optimized replay, committed-byte/source-history preflight, official 14-file export and optimized Git-free replay with
PATH=/nonexistent. Separate implementations check all 128 character minima against 625 count normal forms, 24 affine maps, 128 phase polynomials, all 15 stabilizers, 1,364 below-threshold ordered tuples, 2,856 phase sums, all four sharp witnesses and semantic controls.This answers the two-axis portion of #5369's open least-cutoff question. It complements Mihir Srivastava's active one-axis/general-proof audit, which excludes least cutoffs for n>=2. No predecessor files, general-axis theorem, selected nine-axis supplier or κ are changed. Fixed external coefficients and complete dirty input/output endpoints remain essential; physical costs, full supplier admission, n>=3 and nonmonomial Clifford cutoffs remain outside this result. No human or proof-kernel acceptance is claimed.
Credit Ali Romman's native cutoff theorem and open question, Jose Manuel's phase/native conventions, ywz65's affine-basis argument, Chris R's tensor-separation lineage and retained source contributors. Substantial OpenAI Codex assistance, including separate automated proof/checker/review subagents, is disclosed. Fourier inversion and symmetric-group sign representations are classical; no global literature-priority claim.
Canonical scoped result. Base
32890bc5de034ab8fc93ac88ead7279a6a416d04; predecessor head18354f41de4dc7bfda4692e814cf1d91a6d619ef. Submission overlap covers 379 open PR bodies, 4,797 Discussion records and every base local note; no matching two-axis result found within that coverage.