pith. machine review for the scientific record. sign in
module module high

IndisputableMonolith.Information.SimulationHypothesisStructure

show as:
view Lean formalization →

This module defines the formal structure for the simulation hypothesis in Recognition Science, introducing RSUniverse as the type of all recognition events together with SimulatedUniverse and IsSimulation predicates. Researchers in foundational physics and information-theoretic derivations cite it when examining whether physical processes admit simulation within the RS framework. The module organizes definitions and lemmas that draw directly from the imported Constants, Cost, and Church-TuringPhysicsStructure without containing proofs.

claimThe module introduces the RS physical universe as a type representing all recognition events, together with a simulated-universe type and predicates capturing simulation relations and unprovability of simulation.

background

Recognition Science treats the physical universe as built from recognition events whose costs are measured by the J-function and organized on the phi-ladder. The module sits in the Information domain and imports the fundamental time quantum τ₀ = 1 tick, the cost structure, and the RS derivation of the Physical Church-Turing Thesis, which asserts that every physical process is simulable by a Turing machine.

proof idea

this is a definition module, no proofs

why it matters in Recognition Science

The module supplies the type and relation infrastructure that supports downstream claims such as simulation_hypothesis_from_ledger, rs_exists_iff_zero_cost, and ledger_self_grounding. It thereby contributes to the framework's treatment of the outer universe as the RS universe and to the self-grounded character of the ledger.

scope and limits

depends on (3)

Lean names referenced from this declaration's body.

declarations in this module (19)