Skip to content

Three-gate four-address words in (Z/2)^3 have total rank at least 5 - #36

Open
cursor[bot] wants to merge 1 commit into
mainfrom
cursor/repository-research-contribution-8f5b
Open

cursor[bot] wants to merge 1 commit into
mainfrom
cursor/repository-research-contribution-8f5b

Conversation

@cursor

@cursor cursor Bot commented Nov 18, 2026

Copy link
Copy Markdown

Change and mathematical scope

Scoped register-model floor, not a supplier or κ change. In K[(Z/2)^3], for every four distinct nonzero addresses, every three-gate realization has total projector rank at least 5. Four rank-one coordinate gates realize the same target at total rank 4, so the shorter unit-gate word is not a rank saving. Ranks (2,1,1) do not occur.

The rank-one count 4 and the general total-rank floor 4 are already theorems upstream (Wentao Li's F2 elementary-abelian diagonal minimum, and the prime-exponent theorem in CrocSwap PR CrocSwap#6008). Those packages are not in this checkout and were not replayed. The new comparison is the exclusion of total rank 4 for three-gate words.

No selected-frontier edit. make frontier1094-verify, Lean, and predecessor suites were not run.

Task and overlap

Validation

CPython 3.12, standard library only. PYTHONOPTIMIZE was unset for the first run; the second run passes -O.

python3 -B research/elementary-abelian-four-label-floor/verify.py
python3 -I -O -B research/elementary-abelian-four-label-floor/verify.py
python3 -B scripts/research_package.py --package research/elementary-abelian-four-label-floor --check-only
PASS_ELEMENTARY_ABELIAN_FOUR_LABEL_FLOOR quadruples=35 bases=168 label_triples=512 unit_gates=3 rank_one_gates=4 total_rank_at_least=5 standard_weight_range=5..9 omissions=105 cleared_bits=240 idempotents=120 engines=3 no_new_kappa
PASS_PACKAGE_METADATA_AND_PINS (not a mathematical acceptance check)

The checker exhausts all 35 quadruples, all 168 ordered bases and all 512 label triples, rebuilds both words in bit-mask, frozenset, and nonnegative-integer algebras, and rejects omitted gates and cleared projector bits. The integer engine shows the words do not use characteristic-2 cancellation. The rank inequality rank(BNA) <= rank N is the written argument; the script checks the counting lemma and the explicit words, not a search over free scalar maps.

Credit

Ali Romman for the three-register rational bound and for the three-label unit/rank separation (PR CrocSwap#5394). Wentao Li for the F2[(C2)^k] rank-one count. The prime-exponent total-rank floor is the result recorded with PR CrocSwap#6008. eumemic's PR CrocSwap#288 is the pinned source of the rational register model.

Substantial AI assistance was used for the argument, the verifier, and the checks. Apache-2.0.

Open next questions

Does A4 still force rank-one cost four for four distinct non-identity addresses? It has no homomorphism onto Z/2, so this character cut is blind, and its exponent is not prime, so PR CrocSwap#6008 does not cover it. A length-three rank-one word would be real compression. Free scalar maps are infinite, so the search needs a normal form or a C3 coefficient cut before it is a proof.

Workflow feedback

The useful overlap was a merged prime-exponent theorem that does not appear in open PR bodies. Searching default-branch package READMEs, not only open PRs and discussions, would have surfaced it earlier.

Open in Web View Automation 

Every three-gate realization of four distinct nonzero addresses in
(Z/2)^3 has total projector rank at least 5. Four rank-one gates have
total rank 4, so the shorter unit-gate word is not a rank saving.

Co-authored-by: riquelme.pereira <riquelme.pereira@amentoriaenem.com>
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.

1 participant