Domain equivalence is an equivalence relation
ProvedAssumptionsOfPhysics.domainEquiv_equivalenceEquivalence of experimental domains is reflexive, symmetric and transitive.
import Mathlib import Definitions.Def_AoP_ExperimentalDomains import Definitions.Def_AoP_DomainRelationships
namespace AssumptionsOfPhysics
theorem domainEquiv_equivalence {Ω : Type*} :
Equivalence (ExperimentalDomain.DomainEquiv (Ω := Ω)) := 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.
For two experimental domains on the same (families , possibility types , verifiable sets , natural topologies ): " depends on " means there is a map with for all (equivalently ); " and are equivalent" means each depends on the other; a function is a causal relationship if (as subsets of ) for every . For a family indexed by a countable type , the combined domain has as statements the closure of all statements of all (together with , ) under binary intersection and countable unions.
Statement. For every type , the relation " and are equivalent" on experimental domains over is an equivalence relation: it is reflexive, symmetric and transitive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.