Skip to content

Construct an inequivalent one-edge binary maximizer - #7749

Open
petalas wants to merge 2 commits into
CrocSwap:mainfrom
petalas:research/w3-1118d-even-one-edge-maximizer
Open

petalas wants to merge 2 commits into
CrocSwap:mainfrom
petalas:research/w3-1118d-even-one-edge-maximizer

Conversation

@petalas

@petalas petalas commented Nov 18, 2026 •

Copy link
Copy Markdown
Contributor

Summary

This scoped construction gives a second complete binary projector pool with pattern dimension k=3, matching number ν=1 and irreducible joint-image dimension n=4. Two unordered pairs of its projectors have a trace-one product. Four pairs do in the published maximizer. The trace count is preserved by simultaneous conjugation, so the two actions are inequivalent even after relabelling the projectors.

The new construction was produced by Nick Petalas. Credit aliromman for the even maximum and comparison pool in #7707 and the matching theorem in #7692. Advance claim.

Evidence

The written proof finds the complete pool by its two cross rectangles and shows irreducibility by a directed walk through the four basis images. Both verifier modes scan all 120 rank-one idempotents at width four and find four lifts in the seven nonzero patterns. All 15 nonzero starting vectors reach all four basis images. Both modes print PASS_EVEN_ONE_EDGE_MAXIMIZER and took 0.01 seconds each locally.

Run from the repository root with CPython 3.12.15 and its standard library. Local verification ran on macOS arm64.

python3.12 -B research/even-one-edge-maximizer/verify.py
python3.12 -B -O research/even-one-edge-maximizer/verify.py
python3.12 -B scripts/research_package.py --package research/even-one-edge-maximizer
python3.12 -B scripts/check_research_commit.py --package research/even-one-edge-maximizer --check-source-history --check-modes

The upper bound is cited from the pinned matching result. The verifier checks the new witness. Predecessor replays, selected cold replay, Lean and Docker were unrun. Independent human and formal proof-kernel review are unclaimed. The native word, dirty-state restoration and recursive invoice remain open.

Open next questions

  • Classify the actions at (3,1,4). Enumerate complete pools containing a fixed unit at width four before considering wider embeddings.
  • Look for a rank-saving paid word in the new alphabet. Specify the saturated exponent lattice and the full ambient endpoint first.

Related open work

  • #7707 attains the same maximum of four. This package supplies an inequivalent attaining action.
  • #7692 gives the matching-dependent upper bound used here.
  • #7703 classifies the strict equality case on the odd side of the matching bound.
  • #7693 classifies actions at the unrestricted maximum n=2k−1. At k=3, its maximum uses two edges.
  • #7710 studies paid words on the prescribed orthogonal fresh-bridge family, which includes the comparison alphabet. The changed old factors of the new links fall outside that family.
  • #7711 gives a four-relation word obstruction on Prove sharp even-difference image maxima and the small exception (no κ) #7707’s six-projector (4,0,5) maximizer. The new alphabet has four projectors.
  • #7742 studies a single pass through that six-projector alphabet. The new result stops at the geometry of the four-projector alphabet.

CI notes

This PR carries the shared CI-doc and replay-gap sync used by other open PRs.

The six local current-status tests and the registered historical replay-gap check passed with CPython 3.12.15. All three hosted jobs passed at 6bd8a384d64b6da2334bc94f6a97cdd74d710780. The jobs were plan and the registered replays for research/even-one-edge-maximizer and research/historical-selected-replay-gap. Run 44400399401

Before the sync, the canonical base e54523517d0f03e58352e647c403a5af3e525a57 failed test_current_ci_section_matches_selected_record locally because the CI guide names make frontier6030-verify while the selected record requires make frontier7000-verify. The same planning failure skipped hosted replay on #7740 and #7711.

Merge danger

Two-way. The construction adds five files under research/even-one-edge-maximizer/. The CI sync is a separate commit.

Give a second complete width-four projector pool at the even matching
maximum. Pair-product traces distinguish its action from the existing
maximizer, and finite enumeration checks every lift and starting vector.
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