pith. machine review for the scientific record. sign in

IndisputableMonolith.Foundation.UniversalForcing.NarrativeRealization

IndisputableMonolith/Foundation/UniversalForcing/NarrativeRealization.lean · 78 lines · 7 declarations

show as:
view math explainer →

open module explainer GitHub source

Explainer status: ready · generated 2026-05-15 10:49:22.844050+00:00

   1import IndisputableMonolith.Foundation.UniversalForcing.MusicRealization
   2
   3/-!
   4  NarrativeRealization.lean
   5
   6  Lightweight narrative realization: the carrier is the beat count generated by
   7  an inciting event. This formalizes the structural claim that narrative order
   8  carries the same forced Peano object.
   9-/
  10
  11namespace IndisputableMonolith
  12namespace Foundation
  13namespace UniversalForcing
  14namespace NarrativeRealization
  15
  16open ArithmeticFromLogic
  17open Invariance.Universal
  18
  19abbrev NarrativeBeat := Nat
  20
  21def narrativeCost (a b : NarrativeBeat) : Nat :=
  22  if a = b then 0 else 1
  23
  24@[simp] theorem narrativeCost_self (a : NarrativeBeat) : narrativeCost a a = 0 := by
  25  simp [narrativeCost]
  26
  27theorem narrativeCost_symm (a b : NarrativeBeat) : narrativeCost a b = narrativeCost b a := by
  28  by_cases h : a = b
  29  · subst h; simp [narrativeCost]
  30  · have h' : b ≠ a := by intro hb; exact h hb.symm
  31    simp [narrativeCost, h, h']
  32
  33def narrativeInterpret (n : LogicNat) : NarrativeBeat :=
  34  LogicNat.toNat n
  35
  36/-- Narrative realization as beat-count comparison. -/
  37def narrativeRealization : LogicRealization where
  38  Carrier := NarrativeBeat
  39  Cost := Nat
  40  zeroCost := inferInstance
  41  compare := narrativeCost
  42  zero := 0
  43  step := Nat.succ
  44  Orbit := LogicNat
  45  orbitZero := LogicNat.zero
  46  orbitStep := LogicNat.succ
  47  interpret := narrativeInterpret
  48  interpret_zero := by rfl
  49  interpret_step := by
  50    intro n
  51    show LogicNat.toNat (LogicNat.succ n) = Nat.succ (LogicNat.toNat n)
  52    rfl
  53  orbit_no_confusion := by intro n h; exact LogicNat.zero_ne_succ n h
  54  orbit_step_injective := LogicNat.succ_injective
  55  orbit_induction := by
  56    intro P h0 hs n
  57    exact LogicNat.induction (motive := P) h0 hs n
  58  orbitEquivLogicNat := Equiv.refl LogicNat
  59  orbitEquiv_zero := rfl
  60  orbitEquiv_step := by intro n; rfl
  61  identity := narrativeCost_self
  62  nonContradiction := narrativeCost_symm
  63  excludedMiddle := True
  64  composition := True
  65  actionInvariant := True
  66  nontrivial := by
  67    refine ⟨1, ?_⟩
  68    simp [narrativeCost]
  69
  70noncomputable def narrative_arith_equiv_nat :
  71    (arithmeticOf narrativeRealization).peano.carrier ≃ LogicNat :=
  72  narrativeRealization.orbitEquivLogicNat
  73
  74end NarrativeRealization
  75end UniversalForcing
  76end Foundation
  77end IndisputableMonolith
  78

source mirrored from github.com/jonwashburn/shape-of-logic