SimulatedUniverse
plain-language theorem explainer
The SimulatedUniverse structure encodes a Bostrom-style simulation as a positive real sequence of events. Foundations researchers cite it when formalizing that perfect reproduction of RS events collapses any simulation-reality distinction. The declaration is a direct structure definition with an events map and a positivity constraint.
Claim. A simulated universe is a pair consisting of a function $e : ℕ → ℝ$ together with a proof that $e(n) > 0$ for every natural number $n$.
background
Recognition Science dissolves the simulation hypothesis by equating the ledger with physical reality, so no external substrate remains. The module states that any computational process producing identical observables is operationally indistinguishable from the ledger itself. Upstream ledger factorization supplies the event structure while the integration gap fixes the active edge count per tick at A = 1.
proof idea
The declaration is a structure definition that directly introduces the two fields events and events_pos.
why it matters
It supplies the type used by the parent theorems simulated_rs_is_rs and simulation_reduces_to_tautology, which establish that any faithful simulation of an RS universe is itself an RS universe. This fills IC-004 by rendering the simulation question a tautology, consistent with the ledger being the unique substrate and the phi-ladder grounding all event sequences.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.