We are looking for an explicit bijection for the KR1 partition identity (mod 9): a reversible, weight-preserving map between two families of partitions. This page reports where that construction stands. More of the map is built than before, and we now know precisely why the remaining part is hard. The full bijection is still open.
Explore the diagrams with us: Christopher's intuitions become concrete handoffs to separate Claude Code or Codex worktrees. We bring their results and failures back into the next visual discussion.
Latest checkpoint: the support obstruction is proved with an actual-column Lean certificate. The conditional accepted-preservation theorem and terminal-gap kernel have separate certificates; the positive auxiliary models and uniform C↔A endpoint have reviewed ordinary arguments. The full structural C↔U bridge remains open. The article records exact assurance and missing transfers. Earlier sector counts below retain their historical scope.
The plan is a chain of four reversible maps. The two outer links use established constructions: Andrews–Keith and Stockhofe between B and U, and Kurşungöz between C and A. The middle link, U to C, remains incomplete in our construction.
F(h), height drops ≤ 4(a, b, μ, ν), weight Q(a,b)+Σμ+3ΣνHere Q(a,b) = a² + 3ab + 3b² and F(h) = 9⌊h/5⌋ + (0,1,3,6,8)[h mod 5]. The two sides are known to have equal counts (Mizuno, Theorem 1.1), but a count is not a bijection. The goal is an explicit object-by-object map with an explicit inverse.
These counts are finite checks, not percentages of the infinite problem. Several pieces are proved for every weight: all of a ≤ 2, the sector a = 3, b = 0, the high-b tails, and the new all-a family G6.
These earlier sector counts add up to 1485; the notebook doesn't break down the other 2. The first open pair at that checkpoint was C=(3,1,(0,0,0),(0)) ↔ U=(9,9,3) at weight 21. The corrected boundary plane now covers it; see iteration 02.
Each column is one value of a. Height is b on a log scale. Green regions have a proved map. The amber core near the origin has none: the funded constructions only start once b is large.
G6 thresholds: T(6)=119, T(7)=155, … T(15)=507, rising to T(100)=8197. G6's smallest weight is 44661, far above the open core.
The guiding intuition is Christopher Yamba's: when two inputs collide on one output, move the obstructed box into an extra direction so the collision splits. In the smallest example, two different tableaux collapse to the same output under the planar slide. Lifting the corner box into a third direction stores where the slide cut, and rotating it back into the plane gives two distinct outputs.
What does the extra direction remember? In this restricted ordinary-tableau family, the corner label and cut position can be recovered; one extra axis suffices, including for a traced ten-input fiber. Christopher's broader proposal allows a fresh dimension for every numbered-square assignment. Its general construction and original-target decoder remain open; explore the 2D, 3D, 4D and 7D illustrations in iteration 03.
In KR1, G6 uses a related multiplicity-coordinate encoding: one free axis per μ-gap quotient and one binary axis per residue bit (18 axes at a = 6, 67 at a = 15). It covers every a ≥ 6 once b meets its safe funding threshold T(a). This is a restricted encoding, not the complete per-square placement procedure.
Every lift we tried separates its collision. The hard part is putting the stored information inside a valid, ordinary target that no other sector already uses. Three obstructions explain why the open core resists:
The reviewed obstruction excludes the specified single global affine-rule ansatz. Residue branches are one proposed way around it; it does not exclude all higher-dimensional procedures.
restricted obstruction; independently reviewedEach marker axis costs weight, which something must pay: the doubled ν-contour or a large μ-part. Near the apex of a sector nothing can pay. That is why the H3 tails and G6 only start at large b.
G6 starts at T(6) = 119The open states have to land on outputs H3 doesn't already use. The natural rules for (3,1) all land on outputs from five other sectors.
sectors (2,1), (4,0), (2,2), (1,3), (0,3)Placing 5 at (2,0,1) leaves it unsupported along axis 0. The lift is valid only under a weaker “hanging” convention.
T2=((1,2),(3,5),(4))The reviewed corner lift to (0,0,1) retains the moved label and has an exact inverse on its image. It does not alone give the required general original-target decoder.
lossless restricted lift; general bridge unresolved4 of the 20 colliding sources produce an invalid tableau: 4→5 is not a P-chain.
h=(1,2,4,5,5), ((1,4),(2,5),(3))The printed rotation formula changes inv_g on 2 inputs. The code avoids this by filtering, so the printed formula and the code differ.
h=(2,2,4,5,5): inv_g 1→2, 2→112 singleton fibers at n=5 aren't recovered. Fixed by taking the least tail entry above v.
((1,4),(2),(3),(5))Every checked point with x = 0 lands on an output H3 already uses.
(4,0,(0,t,t+3,t+3+z)), t,z ≤ 4Free 3s on the (9,9) core collide with sector (2,2) for every ν ≥ 3 (45 of 90 checked).
(9,9,3,3,3,3), weight 30A single assignment for the whole sector is impossible: residue classes (0,0), (0,1) and (2,0) have no free head.
forced apex (9,9,3) vs retained (9,9,3⁴)How: a ping-pong (finite Schröder–Bernstein) walk. Design one explicit injection on the retained sources plus the new sector, then walk between it and the reviewed map until the walk leaves the old image. Every reviewed assignment stays as it is, and the new sector lands in the open part.
How: for sector (3,1), split by residues of the gaps and give each class its own head on a distinct marker core. Candidate families that avoid every used output are already recorded through weight 46, for example (15,8) + {6,9,3,1}.
How: a large smallest μ-part can pay for marker axes when b is small. That would lower the funding thresholds toward the core, using the same axis vocabulary as G6.
How: a combinatorial proof of a signed KR1 identity would give an explicit bijection through the Garsia–Milne involution principle. The first step is checking whether any published proof of the mod-9 identities is already combinatorial.
The public Yamba AI Math repository contains definitions, checks and earlier research records. The regrouping archive also summarizes locally recorded follow-up work, with checkpoint identifiers and explicit assurance boundaries. It does not publish the private journal.