Repository navigation
Prove four-call Q8 central-minus-one minimum for all r - #2047
Merged
Mister-Meeseeks merged 5 commits intoOct 15, 2026
Merged
Mister-Meeseeks merged 5 commits into
Mister-Meeseeks merged 5 commits into
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.
Result
This adds a uniform four-call minimum for the 12 mixed diagonal targets in
F2[Q8]with one central[-1]entry and two{[i],[j]}entries, for every finite register countr >= 3and arbitrary dirty identity-target roles.The direct word costs four calls (
2+1+1). InJ/J^2, the traces of the two generator coefficient matrices force every exact word to have even length. At length two, the exact central term[-1]+[1]=([i]+[1])^2=([j]+[1])^2is absent: with equal labels, the two rank-one idempotents that sum to the rank-two target projection have zero product; with different labels, the first-order matrices force distinct coordinate projections, also with zero product. Thus lengths zero through three are impossible at every finite width.This resolves the arbitrary-dirty-role gap left by Q8 PR #1925 for these 12 tuples. PR #1925's
r=3,4exact search is retained as predecessor evidence; the new all-rstatement is a written algebraic argument, not a larger finite search. Q8 PR #1822 addresses a different two-role repeated central-commutator target.Reproduction
The registered replay checks 8-element Q8 multiplication, the augmentation quotient, all twelve exact four-call words at
r=3,4, every relevant idempotent pair for rank-two coordinate projections, three negative controls, exact source pins, and four package tests under optimized Python. Expected verifier marker:The package is pinned to base
c676548106012571fefa1dce0ec16f1bcfe11dceand selected-record SHA-25610b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32. The selected supplier and frontier remain unchanged; this is not a physical supplier mapping or newkappaclaim.Prepared by Cinna Davis with substantial OpenAI Codex assistance. No independent human review or proof-assistant formalization is claimed. Apache-2.0.