Foundation Gray Code Chirality Cycle Is Chiral

What the chirality theorem shows

A Gray code is a sequence of binary numbers in which consecutive entries differ by exactly one bit. The standard 3-bit Gray code runs 000, 001, 011, 010, 110, 111, 101, 100. This ordering is classical and appears in rotary encoders and puzzle solutions. The Recognition Science framework's machine-checked library of formal theorems proves that this particular directed cycle is chiral, a term meaning the cycle's structure is not identical to its mirror image. The proof is computational: it counts how often each of the three bits flips as the walk traverses the cycle.

The counts are 4, 2, and 2. Bit 0 flips four times, while bits 1 and 2 each flip twice. Because the three axes of a cube are interchangeable by permutation symmetry, a symmetric cycle would flip all three bits equally often. The 4:2:2 split breaks that symmetry, and the framework's theorem cycle_is_chiral states exactly this: the flip counts are not all equal. The asymmetry vector, (4/3, −2/3, −2/3), has nonzero norm, which is the formal measure of chirality. Reversing the cycle swaps the signs of the winding components, which the framework identifies with CP violation while the underlying cost function remains symmetric under particle–antiparticle exchange, its expression of CPT invariance.

The framework links this bit-flip asymmetry to particle generations: it defines generation flip counts that mirror the bit counts, so one generation sees four flips and the other two see two. This asymmetric coupling is presented as the origin of flavor mixing, the CKM and PMNS matrices. The declaration also bundles its results into a certificate structure that records the chirality, the CPT preservation, the flip counts, the 2:1 asymmetry, and the fact that the cycle visits all eight vertices exactly once.

What the theorem does not claim is as important as what it proves. It does not claim that the Gray code cycle is the physical cause of CP violation in the actual universe; it establishes a formal correspondence within the framework. The identification of face-pairs with generations and the leap from bit-flip counts to the CKM matrix are interpretive steps, not consequences of the theorem. The theorem itself is a statement about a finite combinatorial object: a specific directed cycle on the three-dimensional cube has unequal bit-flip counts.

/-- **THEOREM**: The canonical Gray code cycle on Q₃ is chiral.

    PROOF: bitFlipCount 0 = 4 ≠ 2 = bitFlipCount 1, so the flip counts
    are not all equal.

    This is the foundational result for CP violation in RS: the 8-tick
    recognition cycle treats different axes (= generations) differently. -/
theorem cycle_is_chiral : IsChiral grayFlipCounts := by
  intro h
  have h4 : bitFlipCount 0 = 4 := by native_decide
  have h2 : bitFlipCount 1 = 2 := by native_decide
  have h01 := h 0 1
  simp only [grayFlipCounts] at h01
  rw [h4, h2] at h01
  norm_num at h01

/-- The flip counts are [4, 2, 2], not [8/3, 8/3, 8/3].
    This proves the S₃ axis-permutation symmetry is broken. -/
theorem flipAsymmetryNonzero :
    ¬(bitFlipCount 0 = bitFlipCount 1 ∧ bitFlipCount 1 = bitFlipCount 2) := by
  native_decide

/-- Bit 0 flips 4 times. -/
theorem bit0_flips_four : bitFlipCount 0 = 4 := by native_decide

/-- Bit 1 flips 2 times. -/
theorem bit1_flips_two : bitFlipCount 1 = 2 := by native_decide

/-- Bit 2 flips 2 times. -/
theorem bit2_flips_two : bitFlipCount 2 = 2 := by native_decide

/-- CPT is preserved: the cost function treats x and 1/x identically.
    Particle and antiparticle have equal cost. -/
theorem cpt_preserved :
    ∀ x : ℝ, 0 < x → Cost.Jcost x = Cost.Jcost x⁻¹ := by
  intro x hx
  simp [Cost.Jcost]
  ring

/-- The cycle visits each vertex exactly once (bijectivity), so the total
    interaction is balanced — but the per-axis distribution is not. -/
theorem cycle_visits_all_vertices :
    Function.Bijective grayCycle3Path := grayCycle3_bijective

What this page does not claim

This answer does not claim that the Gray code cycle is the physical cause of CP violation in the actual universe. This answer does not claim that the framework derives the numerical values of the CKM matrix elements. This answer does not claim that the chirality theorem alone establishes the generation-flavor correspondence.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Foundation/GrayCodeChirality.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: