Repository navigation
Decoder floors, case (c): the A2 family of non-B-form rank-9 realisations (P112 ≥ 64, #968 P104 ≥ 56, E8 ≥ 72; no κ claim) - #2784
Merged
Mister-Meeseeks merged 1 commit intoOct 16, 2026
Conversation
…ions (P112 >= 64, CrocSwap#968 P104 >= 56, E8 >= 72; no kappa claim) Research note: an explicit family of rank-9 iff-pattern realisations of the P112 / P104 / E8 orthogonality pattern that are not B-form (Gram except the three rows of an A2 triangle, piecewise rescaled); Theorem G (rows outside X Gram => B-form or A2) and Lemma E; every 9-term (square) decoder of every family member costs >= 64 / 56 / 72, sharp on P112 and E8 at special points (exact tie decoders 64 and 72); Case II(b) by an exact class-level min-cost relaxation (65 / 62 / 74 off the B-locus) with a checked merged-class kill fact; m >= 10 with both factors in the realisation's spaces, off the B-locus gamma2 != gamma3, >= 68 / 64 / 77 (the B-locus case is open). Decoders with factors outside col M / row M at m >= 10 and other rank-9 realisations are not covered. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This was referenced Oct 15, 2026
Rank-9 realisations of the E8 pattern are B-form or the A2 family (classification; no κ claim)
#2819
Merged
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 16, 2026
…'s m >= 10 claim: P112 >= 64, #968 P104 >= 56, E8 >= 72; no kappa claim) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
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.
Status: research note with exact finite computations and written proofs (not a SAT/DRAT proof). No κ claim, no supplier word. Only
research/a2-family-decoder-floors/is added; nothing existing is changed.What this proves (scope is the claim)
Model of #2338 / #2277 / #2724: exact masked decoders
N = Σ_{j≤m} p_j q_jᵀof a pattern realisation (zero on orthogonal pairs, nonzero elsewhere on the diagonal and off it: the "iff pattern"), arbitrary factors over a field of characteristic 0, dense pairing tableB, costΣ_j rank_F2 B[R_j, A_j].N̄(u_i) ∩ O_{u_j}and another onN̄(u_i) ∩ O_{u_k}(7 parameters plus diagonal scalings). They are not of B-formD₁GD₂ + cβᵀ(withc_uβ_s = 0on orthogonal pairs): a counterexample to our working "Conjecture B" for rank-9 realisations. Exact certificate (three random exact members per unit, plus the two tie members below).Xof a rank-9 pattern realisation are Gram rows, it is B-form withsupp c ⊆ X, or in the A2 family on an A2 triangle insideX(columns: transposed). Lemma E (PROVEN): rank ≤ 8 onV∖Xplus a rigid sub-unit (Research: rank-8 complex decoders are gauge-rigid; E-graph eight-term floor (no new kappa) #1212 and extensions) gives Gram rows. The existence step ("every rank-9 realisation has such anX") is OPEN and not claimed.e_9) and Case II (none; II(b) by an exact class-level min-cost relaxation, 65 / 62 / 74 off the B-locus, 66 / 63 / 75 on it, using the checked fact that two merged column classes are co-killable only onγ₂ = γ₃); includes the E8 near-miss (the three punctured normalsr_1, r_2, r_3are dependent).m ≥ 10, both factors in the realisation's two 9-dimensional spaces (M), off the B-locusγ₂ ≠ γ₃. Cost ≥ 68 (P112), 64 (P104), 77 (E8) (merge lemma + exact class-level min-cost relaxation). On the B-locus the relaxation is lower (62 / 58 / 70) and that case is open.Not covered (stated up front)
col M/row Mon the A2 family withm ≥ 10are NOT covered (form = 10they are exactly the one-sided frame-expansion decoders; only a heuristic search was done, which found ties and nothing proven).m ≥ 10on the B-locusγ₂ = γ₃: open (not claimed).Bof rank ≥ 10, other P104 units. Not claimed: that the A2 family is an irreducible component; the variant of the non-B-form statement without the orthogonal-pair condition.Labels (every step is in the README)
PROVEN: square-decoder normal form, merge lemma, A2 facts, the construction, Theorem G, Lemma E, the non-B-form argument, Case I and II(a). PROVEN from CHECKED: Case II(b) (row census parameter-free, column census treats
γsymbolically; merged-kill fact; class-level relaxation) andm ≥ 10off the B-locus. CHECKED (exact computation): members with the iff pattern and rank 9; rank certificates (mod p, safe direction); span facts S1/S2; the unit census on all three units and all 28 P104 representatives; survivor-pair ranks; the row-puncture floorsP_k(exact branch-and-bound on P112/P104, structural on E8); the tie decoders; exact optima at fixed members (65 / 64 / 73 / 72); the merged-kill fact (P112, E8, all 28 P104 representatives); the class-level relaxations; pair tables at the members checked (corroboration). RECORDED (logs shipped, hash-pinned, headline lines asserted, not re-run): the robust CP-SAT / CEGAR runs over all parameters (no square decoder ≤ 63 on P112, ≤ 71 on E8) and the all-parameter special-locus census behind the pair tables.Verification
bash research/a2-family-decoder-floors/verify.sh /fresh/dir(Python ≥ 3.11,numpy,networkx; one process at a time; no SAT solver). On a freshgit archiveexport: 102 PASS, 0 FAIL, 941 s wall (15.4 min user CPU, one process at a time,nice 10; venv Python 3.14, numpy 2.5, networkx 3.7).What
verify.shre-runs: units; survivor classes and survivor-pair ranks; S1/S2; exact A2 members and the non-B certificate on all three units; the unit census (replayed and compared line for line with the recorded logs) on the first triangle of each unit and all 28 P104 representatives; triangle-orbit counts;P_kand the case arithmetic; the merged-kill fact and the Case II(b) /m ≥ 10class-level relaxations (P112, E8, all 28 P104 representatives); the tie decoders and the tie members' certificates; exact optima at fixed members; pair tables at members (corroboration). RECORDED, not re-run: the CP-SAT / CEGAR logs and special-locus census (evidence/logs/hunt-a2/, pinned inMANIFEST.sha256).Overlap
Searched (2026-10-15): "A2 family / triangle / subsystem", "rank 9 / rank-9 / rank nine realisation", "non-B-form", "B-form", "Conjecture B", "square decoder", "decoder floor", "masked P112 decoder", "co-star", "rank-8 rigidity", "non-Gram rank" and the unit sizes. No PR body found that states an A2-family (non-B-form) rank-9 realisation, Theorem G / Lemma E, or these floors. Nearest: #2338 / #2724 (ours; case (c) open item and sibling), #1212 and extensions (rank 8 only), #2321 / #2385 / #2398 / #2515 (one fixed rank-9 P112 completion under a COPY-power cost). Bodies read, proofs not; discussions not searched.
Parents: #2338 (open item "factors outside
col M,m ≥ 9", case (c)), #2724, #2639, #2277 (ours). Cited from their statements: #1212, #1389, #1399, #1419, #1425, #1616 (rank-8 rigidity, used only to state Lemma E), #968 (the P104 unit), #1224, #1180, #1320, D1267 (context, not covered).Prepared by DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code; Apache-2.0.
🤖 Generated with Claude Code