Proposition 3.10
OpenQAlgorithms.Papers.Independent.Intakethird100.P20.sigma_point_iff_countably_meet_closedFor a quasipoint in an abstract countably complete Boolean algebra, countable primeness is equivalent to closure under countable meets:
No underlying topological space is required; all joins and meets refer to their order-theoretic universal properties.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P20
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P20
open Set TopologicalSpace
open QAlgorithms.Papers.Independent.Next46.P33 (Projection)
open scoped Topology
universe u v
/-- Proposition 3.10; de Groote, Observables I, PDF p./pp. 50.
-/
theorem sigma_point_iff_countably_meet_closed {L : Type u} [BooleanAlgebra L] (hcomplete : IsSigmaComplete L)
(B : StoneSpectrum L) :
IsSigmaPoint B.val ↔ ∀ a : ℕ → L, (∀ n, a n ∈ B.val) →
∀ b : L, IsGLB (Set.range a) b → b ∈ B.val := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P20
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a Boolean algebra such that every sequence in has a least upper bound, and let be an inclusion-maximal nonempty subset excluding in which any two members have a common lower bound belonging to . Then the following are equivalent: is nonempty, excludes , is upward closed and closed under binary meets, and for every sequence and every least upper bound of its range, implies for some ; and for every sequence whose terms all belong to , every greatest lower bound of its range belongs to . The quantified sequences include constant sequences and sequences with repeated terms; the statement uses sequences indexed by all natural numbers, not empty families.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.