Repository navigation
Conversation
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
Classify every equality case in PR5146's sharp binary character remainder bound, answering its Open next question 2.
Claim type: scoped mathematical proof with an exhaustive finite equality lemma, for every k>=3 and every zero-diagonal binary character matrix with at least two entries. The multiplicity is the coefficient in the unnormalized signed character power sum; Fourier and finite-GL normalizations remain separate. No new kappa or selected-frontier change.
The three-vertex equality lemma forces every induced outside field and constant to vanish. Single-vertex and two-vertex outside assignments then exclude every extra arrow. This adds the complete equality classification to the predecessor's bound and attaining example. PR5146 is a cited premise, not an audit deliverable. No predecessor executable or spectrum table is imported.
This contribution was produced by Nick Petalas. Credit Nick Petalas / PR5146 for the explicit equality question and sharp bound, PR4275 for the character law and PR4599 for the four-event antecedent; Ryanson Jonathan / pinterbanget PR4607 for the five-event predecessor and structural-spectrum motivation; and Cinna Davis, source527, commdata2338 and Jose Manuel for the retained request and normalizer lineage. Conditioning and character orthogonality are classical.
Evidence
Before: one sharp family, with complete equality classification explicitly open. After: all-dimension necessity, an attaining construction, and exact labelled signed multiplicity.
Local CPython 3.12.15/macOS arm64 checks pass:
From the worktree root, reproduce with these exact commands; another CPython 3.12 path can replace the local interpreter:
Expected markers are
PASS_BINARY_CHARACTER_EXTREMIZERS,PASS_REGISTERED_RESEARCH_PACKAGEandPASS_RESEARCH_COMMIT_BYTES. The current selected-baseline orientation also passes, with metadata-only scope.Limitations and unrun obligations
Zero diagonal, F2 and the uniform three-state sum are essential. The universal proof uses the finite equality lemma and PR5146's published reciprocal/matching bounds. Finite corroboration does not enumerate every dimension. No fourth-mode bound, full all-k probability inequality, negative-association extension, odd-field/weighted analogue, request producer, sampling/emission, native implementation, dirty restoration or complete physical invoice is supplied. All five selected framework assumptions remain. Selected cold replay, native builds, Lean and Docker were not run. Independent human and formal proof-kernel review are unclaimed.
Open next questions
Related open work
No open PR classifying this character-sum equality was found in the refreshed main, open/merged searches, claims and reservations. PR5146 and PR4607 are merged predecessors. PR5860's five-indicator probability theorem is separate and is not generalized. Sparse notes, unpublished work and arbitrary historical diffs remain overlap-coverage limits.
The completion refresh checked the twelve other account PRs still open and created after the advance CLAIM. They study different objects or quantities; none supplies a competing classification or common numerical instance for this character sum. No additional computations audited another contribution.
CI notes
Both hosted checks passed at exact head
f41c74eb9c628c4998b8f7ed9813a7585d4bb301in run 41543826856:planin 3m52s andreplay (research/binary-character-extremizers)in 1m17s. The completed checks were read once, and run metadata confirms completed success and the matching head. CI certifies execution of the registered finite checks and source bindings, not independent human or formal proof-kernel acceptance. All registered scientific obligations also ran locally; none was deferred to CI.Merge Danger
Door: two-way.
Blast Radius: package. Only the new six-file research package is added. Scientific admission and selected-frontier changes remain separate decisions.