Foundation Pair Kernel Gap2a Phase Bearing Transaction Residual Phase Bearing Ad

The eight-step rule

A dial with eight positions, numbered 0 through 7, like the hours on a clock face. The declaration phaseBearingAdvance3_ne_self_before_eight concerns a simple operation: move forward by a given number of steps, wrapping around when you pass 7. The theorem states that if you move forward by any positive number of steps less than eight, you will never land on the position you started from. Moving one, two, three, four, five, six, or seven steps always takes you somewhere else; only moving eight steps, a full circuit, brings you back.

This is a property of modular arithmetic, the same mathematics that governs clock faces and calendar cycles. The proof in the machine-checked library of formal theorems verifies the rule for every starting position and every step count in that range. It is a small, precise fact, but it underpins a larger construction: the framework uses an eight-phase transaction cycle, where each phase carries a posting event and the state advances through a Gray code, a sequence where consecutive states differ by exactly one bit. The rule guarantees that the cycle cannot terminate early or loop back on itself before completing all eight phases.

In Recognition Science, this theorem is part of a chain that builds an explicit eight-step transaction from more basic components. The framework models a ledger, a discrete record of events, and recognition events, the acts of recording, as its fundamental objects. Within this framework, the theorem helps certify that the eight-phase transaction is genuine: it takes exactly eight commits and cannot return sooner. The declaration is a theorem, a statement proved from the framework's axioms, with no gaps and no unproven assumptions.

What the theorem does not claim is just as important. It does not say anything about the physical meaning of the eight steps. The framework explicitly notes that the construction does not select a physical action scale; the Gray state and its period are dimensionless data. The theorem does not assert that any real-world process must follow this eight-step cycle, nor does it identify the transaction with any specific physical phenomenon. It is a structural guarantee about a formal object, not a statement about the empirical world.

The value of the rule is in what it enables. By proving that the cycle cannot close early, the framework can rely on the eight-phase transaction as a complete and well-defined unit. This is a building block for further results, and the theorem's strength is precisely its narrowness: it proves one thing, and it proves it exactly.

/-- No positive proper prefix of the octave returns to its initial phase. -/
theorem phaseBearingAdvance3_ne_self_before_eight
    (phase : Fin 8) (commits : ℕ)
    (hpositive : 0 < commits)
    (hshort : commits < 8) :
    phaseBearingAdvance3 phase commits ≠ phase := by
  intro hreturn
  have hval := congrArg Fin.val hreturn
  simp only [phaseBearingAdvance3, Fin.val_mk] at hval
  omega

/-- No positive proper prefix of the octave returns to its initial phase. -/
theorem phaseBearingAdvance3_ne_self_before_eight
    (phase : Fin 8) (commits : ℕ)
    (hpositive : 0 < commits)
    (hshort : commits < 8) :
    phaseBearingAdvance3 phase commits ≠ phase := by
  intro hreturn
  have hval := congrArg Fin.val hreturn
  simp only [phaseBearingAdvance3, Fin.val_mk] at hval
  omega

theorem phaseBearingProductionTransaction_gap2a_residual :
    Gap2aPhaseBearingTransactionResidualCert3 where
  actual_exact_eight_transaction :=
    phaseBearingActualTransaction_cert
  absolute_action_still_not_selected :=
    no_phaseTransaction_selector_recovers_absolutePostingAction
  action_dual_source_still_not_selected :=
    no_phaseTransaction_sourceSelector_is_actionDual_for_all_representatives
  full_scale_breaking_law_still_absent :=
    no_currentBoundary_phaseBearingScaleBreakingTransactionLaw

What this page does not claim

The theorem does not claim that any physical process must follow an eight-step cycle. The theorem does not identify the transaction with any specific physical phenomenon. The theorem does not assign a physical meaning or scale to the eight steps.

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/PairKernelGap2aPhaseBearingTransactionResidual.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: