Characterizations of decidable experimental domains
ProvedAssumptionsOfPhysics.decidable_tfaeFor an experimental domain the following are equivalent: (1) is decidable; (2) coincides with its theoretical domain ; (3) all possibilities are verifiable; (4) the possibilities form a countable basis of .
import Mathlib import Definitions.Def_AoP_ExperimentalDomains
namespace AssumptionsOfPhysics
theorem decidable_tfae {Ω : Type*} (D : ExperimentalDomain Ω) :
List.TFAE [D.IsDecidable, D.theoretical = D.stmts,
∀ x : D.Possibility, x.val ∈ D.stmts,
D.possibilities.Countable ∧ IsBasis D.stmts D.possibilities] := 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.
Statement. For every type and every experimental domain on , the following four propositions are pairwise equivalent:
- is decidable: for every ;
- (equality of families of subsets of );
- every possibility (as a subset of ) belongs to ;
- the set of all possibilities (as a family of subsets of ) is countable and is a basis of , i.e. and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.