pith. machine review for the scientific record. sign in
theorem proved wrapper high

midlife_inverts_first

show as:
view Lean formalization →

The theorem shows that the reversal map on Fin 8 sends stage 6 to index 1 and stage 0 to index 7, so the former precedes the latter numerically. Modelers of neurodegeneration as an involution on the eight-stage Erikson cycle cite it to confirm that mid-life stages invert before early ones in the reversed sequence. The proof is a one-line simp wrapper on the reverse definition.

claimLet $r(k) = 7 - k$ for $k$ in Fin 8. Then $r(6) < r(0)$.

background

The module formalizes Erikson's eight life stages as a 2³ tick cycle under Recognition Science, with neurodegeneration running the ladder in reverse. The reversal map is the order-reversing involution reverse k = 7 - k on Fin 8. This local setting draws from the eight-tick octave landmark where the period equals 2³.

proof idea

The proof is a one-line wrapper that applies simp [reverse] to unfold the map and reduce the claim to the numerical inequality 1 < 7.

why it matters in Recognition Science

This result supplies the midlife inversion field in developmentReversalCert, which aggregates stage count, the 2³ equality, the involution property, endpoint swap, and this inequality. It fills the C6 structural claim on the involution for the 2³ Erikson cycle and connects directly to the eight-tick octave in the forcing chain.

scope and limits

Lean usage

example : (reverse ⟨6, by decide⟩).val < (reverse ⟨0, by decide⟩).val := midlife_inverts_first

formal statement (Lean)

  56theorem midlife_inverts_first :
  57    (reverse ⟨6, by decide⟩).val < (reverse ⟨0, by decide⟩).val := by

proof body

One-line wrapper that applies simp.

  58  simp [reverse]
  59

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (1)

Lean names referenced from this declaration's body.