Recognition Cycle3

The three-tick ledger

A recognition cycle is the repeating pattern of states that a discrete record of events, called a ledger, must pass through as it registers one tick after another. In Recognition Science, the ledger is not a metaphor: it is a formal object with a finite set of states and a rule that says which state follows which. The smallest nontrivial cycle has three states, and cycle3 is the machine-checked construction of exactly that object.

The construction works like a clock face with three positions. The ledger's states are the numbers 0, 1, and 2, and the transition rule sends each state to the next one modulo 3: 0 goes to 1, 1 goes to 2, 2 goes to 0. The construction defines this structure explicitly, then proves two properties that matter. First, the ledger conserves a quantity called flux, which here is identically zero, so nothing is created or destroyed as the cycle runs. Second, at every time step exactly one state is posted, and no two states can be posted at the same time. That second property is what makes the cycle a genuine tick rather than a jumble of simultaneous updates.

In plain language, the construction establishes that a three-state repeating ledger is internally consistent: it can run forever, each step is unambiguous, and it satisfies the conservation law the framework requires. This is the seed from which the framework derives the number 3 as the dimension of space. The forcing chain in the library shows that the eight-tick cycle, which emerges from the cost function, collapses to three spatial dimensions through a linking argument. Cycle3 is the smallest concrete instance of that pattern, a proof that a three-step cycle can be built and verified from the framework's own definitions.

The value of this construction is not that it discovers a new fact about the number 3, which has been known since antiquity. Its value is that it shows the framework can construct a three-cycle from its own primitives without importing any external assumption about dimension. A reader who wants to see how the framework earns its geometry can start here: a finite set, a rotation rule, and two verified properties. The rest of the forcing chain builds on this foundation.

def M : RecognitionStructure :=
  { U := Fin 3
  , R := fun i j => j = ⟨(i.val + 1) % 3, by
      have h : (i.val + 1) % 3 < 3 := Nat.mod_lt _ (by decide : 0 < 3)
      simpa using h⟩ }

def L : Ledger M :=
  { debit := fun _ => 0
  , credit := fun _ => 0 }

def postedAt : Nat → M.U → Prop := fun t v =>
  v = ⟨t % 3, by
    have : t % 3 < 3 := Nat.mod_lt _ (by decide : 0 < 3)
    simpa using this⟩

What this page does not claim

This construction does not prove that space has three dimensions; that conclusion comes from the forcing chain's linking argument. The three-state cycle is not claimed to be the only possible cycle; it is the smallest nontrivial one. No claim is made that the number 3 is unique to Recognition Science; the construction only shows the framework can construct it.

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/Recognition/Cycle3.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: