Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Possibilities of a combined domain

Proved
AssumptionsOfPhysics.combined_isPossibility_iff

by Lucas · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

foundations-of-physicsmathematical-physicstopology

Let {DXi}i∈ι\{\mathcal D_{X_i}\}_{i\in\iota}{DXi​​}i∈ι​ be a countable family of experimental domains and DX\mathcal D_XDX​ their combined domain. A statement xxx is a possibility of DX\mathcal D_XDX​ if and only if xxx is not impossible and x=⋀ixix=\bigwedge_i x_ix=⋀i​xi​ for some choice of possibilities xi∈Xix_i\in X_ixi​∈Xi​.

Preamble
import Mathlib
import Definitions.Def_AoP_ExperimentalDomains
import Definitions.Def_AoP_DomainRelationships
Formal statement
namespace AssumptionsOfPhysics
theorem combined_isPossibility_iff {Ω : Type*} {ι : Type*} [Countable ι]
    (Dfam : ι → ExperimentalDomain Ω) (x : Set Ω) :
    (ExperimentalDomain.combined Dfam).IsPossibility x ↔
      x.Nonempty ∧ ∃ xs : ι → Set Ω, (∀ i, (Dfam i).IsPossibility (xs i)) ∧ x = ⋂ i, xs i := by sorry
end AssumptionsOfPhysics
Source
G. Carcassi, C. A. Aidala, Assumptions of Physics, Ver. 3.0 (Dec 31, 2025), https://assumptionsofphysics.org/book — Part II, Chapter 2 (pp. 149–168), Proposition 2.14, p. 157; Definition 2.13, p. 156
Read-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). Ω\OmegaΩ is an arbitrary type (it may be empty), and a statement is a subset s⊆Ωs \subseteq \Omegas⊆Ω. DDD is an arbitrary experimental domain on Ω\OmegaΩ, i.e. a family D\mathcal DD of subsets of Ω\OmegaΩ such that

  • Ω∈D\Omega \in \mathcal DΩ∈D and ∅∈D\emptyset \in \mathcal D∅∈D;
  • s∩t∈Ds \cap t \in \mathcal Ds∩t∈D whenever s,t∈Ds, t \in \mathcal Ds,t∈D;
  • ⋃n∈Nfn∈D\bigcup_{n \in \mathbb N} f_n \in \mathcal D⋃n∈N​fn​∈D whenever fn∈Df_n \in \mathcal Dfn​∈D for all n∈Nn \in \mathbb Nn∈N;
  • there is a countable family B0⊆DB_0 \subseteq \mathcal DB0​⊆D such that every member of D\mathcal DD belongs to ⟨B0⟩\langle B_0 \rangle⟨B0​⟩, the smallest family containing B0B_0B0​, Ω\OmegaΩ and ∅\emptyset∅ and closed under binary intersections and countable unions.

The theoretical domain Dˉ\bar{\mathcal D}Dˉ is the smallest family of subsets of Ω\OmegaΩ that contains D\mathcal DD and Ω\OmegaΩ and is closed under complement, binary intersection and countable union. A possibility is a set x∈Dˉx \in \bar{\mathcal D}x∈Dˉ with x≠∅x \neq \emptysetx=∅ such that for every t∈Dˉt \in \bar{\mathcal D}t∈Dˉ either x⊆tx \subseteq tx⊆t or x∩t=∅x \cap t = \emptysetx∩t=∅. XXX is the type of possibilities (two possibilities are equal exactly when their underlying sets are equal). For s⊆Ωs \subseteq \Omegas⊆Ω the verifiable set is U(s)={x∈X:x∩s≠∅}U(s) = \{x \in X : x \cap s \neq \emptyset\}U(s)={x∈X:x∩s=∅}. The space XXX carries the topology T\mathcal TT generated by {U(s):s∈D}\{U(s) : s \in \mathcal D\}{U(s):s∈D}, i.e. the coarsest topology on XXX in which every U(s)U(s)U(s) with s∈Ds \in \mathcal Ds∈D is open.

For two experimental domains DX,DYD_X, D_YDX​,DY​ on the same Ω\OmegaΩ (families DX,DY\mathcal D_X,\mathcal D_YDX​,DY​, possibility types X,YX, YX,Y, verifiable sets UX,UYU_X, U_YUX​,UY​, natural topologies TX,TY\mathcal T_X,\mathcal T_YTX​,TY​): "DYD_YDY​ depends on DXD_XDX​" means there is a map r:DY→DXr:\mathcal D_Y\to\mathcal D_Xr:DY​→DX​ with r(s)=sr(s)=sr(s)=s for all s∈DYs\in\mathcal D_Ys∈DY​ (equivalently DY⊆DX\mathcal D_Y\subseteq\mathcal D_XDY​⊆DX​); "DXD_XDX​ and DYD_YDY​ are equivalent" means each depends on the other; a function f:X→Yf: X\to Yf:X→Y is a causal relationship if x⊆f(x)x\subseteq f(x)x⊆f(x) (as subsets of Ω\OmegaΩ) for every x∈Xx\in Xx∈X. For a family (Di)i∈ι(D_i)_{i\in\iota}(Di​)i∈ι​ indexed by a countable type ι\iotaι, the combined domain has as statements the closure ⟨⋃iDi⟩\langle\bigcup_i\mathcal D_i\rangle⟨⋃i​Di​⟩ of all statements of all DiD_iDi​ (together with Ω\OmegaΩ, ∅\emptyset∅) under binary intersection and countable unions.

Statement. For every type Ω\OmegaΩ, every countable type ι\iotaι, every family (Di)i∈ι(D_i)_{i\in\iota}(Di​)i∈ι​ of experimental domains on Ω\OmegaΩ and every x⊆Ωx\subseteq\Omegax⊆Ω: xxx is a possibility of the combined domain if and only if x≠∅x\neq\emptysetx=∅ and there is a family (xi)i∈ι(x_i)_{i\in\iota}(xi​)i∈ι​ of subsets of Ω\OmegaΩ such that each xix_ixi​ is a possibility of DiD_iDi​ and x=⋂i∈ιxix=\bigcap_{i\in\iota}x_ix=⋂i∈ι​xi​. (If ι\iotaι is empty, the intersection is Ω\OmegaΩ.)

Human review
  • Endorsed by Shuze Chen · Oct 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 3, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me