KR1: what the new proof checkpoint establishes
The search for an explicit, reversible KR1 partition bijection has reached a useful checkpoint. The full structural proof remains unresolved. The new article records what has been proved, what Lean checks, and the precise construction still missing.
The support theorem shows that a map covering an entire cluster sector cannot keep the number of distinct final column values uniformly below the sector’s number of arm parameters. This constrains compact encodings while leaving variable support, two-dimensional placements and temporary extra axes available.
A conditional preservation theorem removes another obstacle: once a complete structural seed exists, finite alternating paths can preserve every previously accepted assignment. The seed is still required.
The construction also gives positive colored auxiliary models at every level. Their terminal-gap normalization is reversible. The next task is to connect these models by literal branch moves, especially at the first normalization threshold from level 2 to level 3. Equal counting formulas alone do not provide those moves.
Read the full article, explore the visual regroup, or download the proofs, implementations, three Lean certificates, scope notes, reviews and next-researcher handoff.
Research direction and fiber-splitting motivation: Christopher Yamba. Development used Codex with separate constructive, formal and critic roles. This is an author-published research checkpoint, not external peer review. Novelty remains unverified; finite experiments remain empirical evidence.