Repository navigation
Prove the exact input-dimension price of unequal Fourier reads - #5946
Merged
Mister-Meeseeks merged 1 commit intoOct 28, 2026
Merged
Mister-Meeseeks merged 1 commit into
Mister-Meeseeks merged 1 commit into
Conversation
This was referenced Oct 27, 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.
Summary
Scoped mathematical proof with exact finite corroboration. For a fixed phase-weighted permutation of the second Fourier spectrum, while the first input is unrestricted and the first/final Fourier charts are standard:
An explicit cycle basis attains the bound. Translation by an element of order d with constant phase lambda admits exactly the time inputs supported on the character level chi(b,x)=lambda. The dimension is N/d when lambda^d=1, and zero otherwise. On (Z/4)^2, translation by (1,0) and phase i admit exactly the four-dimensional space supported on x_0=1; no five-dimensional linear input space works for this wrapper.
This changes the arbitrary-second-input contract of Hanson Sun / bbMisk's #1477, with Ross Richardson's #940 as its unweighted predecessor. Their results are cited, not audited or replayed. Weighted-permutation cycle decomposition, character orthogonality and rank-nullity are classical. The new maximal-input contract, construction and verifier were produced by Nick Petalas.
Only
research/fourier-input-defect/is added. Advance CLAIM.Evidence
04a5da5ce867cc965103094b8e52d51368291fac. The orientation-only selected binding check passes. No predecessor scientific suite was run.From the repository root:
Substitute another CPython 3.12 executable elsewhere. Expected markers are
PASS_FOURIER_INPUT_DEFECT,PASS_REGISTERED_RESEARCH_PACKAGEandPASS_RESEARCH_COMMIT_BYTES. The direct verifier generates receipts on stdout bound to all six package files. There is no hand-authored receipt.Limitations
The written claim covers finite abelian groups with a standard nondegenerate symmetric pairing, arbitrary permutations and unit phases. The finite corroboration uses fourth roots, rank dimensions up to four and the explicitly listed groups up to sixteen coordinates. No dimension-three Fourier computation is claimed.
The first and final maps are fixed. Coupled restrictions on both operands, arbitrary final-map changes and approximation remain outside scope. Physical sparse-input preparation, movement, restoration, native execution, precision/storage, stock and a complete supplier invoice remain unresolved. No selected assumption, supplier admission, new kappa or complete multiplication theorem is claimed. Independent human and formal proof-kernel review are unclaimed. Lean, Docker and the selected cold replay were not run.
Open next questions
Can an actual convolution caller provide one of the character-level sparse operands and absorb the shifted read and phase at a favorable complete cost? First identify a literal operand and translation, prove its support contract, then charge preparation, movement, restoration, precision and the complete wrapper. This PR supplies no physical caller or invoice.
Related open work
The completion refresh read the titles and bodies of all ten other open account PRs created since the advance CLAIM. None studies this restricted-input dimension or computes the sparse-wrapper maximum; no conflicting shared value was identified. No additional computations were run to check those contributions.
The directly related predecessors #1477 and #940 are merged. These publication searches do not establish absence of unpublished work.
CI notes
Both hosted checks passed for
04a5da5ce867cc965103094b8e52d51368291facin run 40530455596: plan in 4m30s and replay (research/fourier-input-defect) in 2m59s. The completed check list was read once, and the run head equals the PR head. The registered replay executes both normal and optimized commands and confirms committed inputs remain unchanged.This certifies the bounded registered checks, not independent human or formal proof-kernel acceptance of the written theorem. All local checks listed above also passed. No CI failure remains.
Merge danger
Door: two-way. Blast radius: isolated. The change adds a scoped proof package and its opted-in replay; the selected frontier and predecessor source bytes are unchanged.