Before-statements are verifiable and ordered like the possibilities
ProvedAssumptionsOfPhysics.beforeStmt_mem_and_orderIsoLet be a natural order on the possibilities of an experimental domain . Then for every the statement is a verifiable statement of , and if and only if . In particular is linearly ordered and order isomorphic to .
import Mathlib import Definitions.Def_AoP_ExperimentalDomains import Definitions.Def_AoP_PropertiesQuantities
namespace AssumptionsOfPhysics
theorem beforeStmt_mem_and_orderIso {Ω : Type*} (D : ExperimentalDomain Ω)
(r : LinearOrder D.Possibility) (hr : D.IsNaturalOrder r) :
(∀ x₁ : D.Possibility, D.beforeStmt r x₁ ∈ D.stmts) ∧
∀ x₁ x₂ : D.Possibility, r.le x₁ x₂ ↔ D.beforeStmt r x₁ ⊆ D.beforeStmt r x₂ := by sorry
end AssumptionsOfPhysicsRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, with full knowledge of the source text and of the intended meaning. It was not produced by a blind, independent auditor, so it must not be mistaken for independent testimony; reviewers should compare the Lean code against the source themselves.
Setting (common to all statements of this mission). is an arbitrary type (it may be empty), and a statement is a subset . is an arbitrary experimental domain on , i.e. a family of subsets of such that
- and ;
- whenever ;
- whenever for all ;
- there is a countable family such that every member of belongs to , the smallest family containing , and and closed under binary intersections and countable unions.
The theoretical domain is the smallest family of subsets of that contains and and is closed under complement, binary intersection and countable union. A possibility is a set with such that for every either or . is the type of possibilities (two possibilities are equal exactly when their underlying sets are equal). For the verifiable set is . The space carries the topology generated by , i.e. the coarsest topology on in which every with is open.
Order notions. For a (pre)ordered set : is sparse if every closed interval is finite; is dense (book sense) if is infinite whenever ; is a dense subset if for all there is with ; is complete if every nonempty subset that is bounded above has a least upper bound in . A linear order on is a natural order if the order topology of (generated by all rays and ) equals the natural topology . is fully characterized by a topological space if there is a homeomorphism . "Decidable" means for all .
Statement. For every type , every experimental domain on and every linear order on that is a natural order (order topology of equals ): (a) for every the set belongs to ; and (b) for all : if and only if .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.