Configuration
plain-language theorem explainer
The Configuration structure packages a positive real number as the basic value for a recognition configuration. Physicists modeling ledger entries or extraction costs cite it when building positive-ratio states from the cost foundation. The declaration is a direct structure with a single positivity field and no further proof obligations.
Claim. A configuration consists of a real number $v$ together with a proof that $0 < v$.
background
The RecognitionForcing module establishes that recognition structures are forced by the underlying cost foundation. ObservableExtractionMechanism supplies an extract map from a type S to reals together with a nonconstant witness. RecognitionStructure equips a type with a recognizes relation that is reflexive and symmetric. Upstream, InitialCondition.Configuration assembles N positive real ledger entries, while the spin value definition returns the numerical spin as twice the spin label divided by two.
proof idea
Structure definition; the two fields are introduced directly with no lemmas or tactics applied.
why it matters
This type appears in forty downstream sites, including the no_singularity theorem that resolves the Big Bang by exhibiting a zero-defect initial state, the entropy definition that equates entropy with total defect, and the nonunity_positive_entropy result. It supplies the positive-real carrier used throughout the T0-T8 forcing chain and the Recognition Composition Law derivations.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.