Corollary 3.1
OpenQAlgorithms.Papers.Independent.Intakethird100.P20.boolean_finite_type_iff_frame_lawFor a complete Boolean algebra , the source's complete-distributivity property is equivalent to finite type:
The finite-type condition ranges over directed nets, not only sequences.
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
/-- Corollary 3.1; de Groote, Observables I, PDF p./pp. 46.
-/
theorem boolean_finite_type_iff_frame_law {L : Type u} [CompleteBooleanAlgebra L] : HasFrameLaw L ↔ IsFiniteType L := 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 any complete Boolean algebra. Let consist of the inclusion-maximal nonempty subsets excluding such that any two members have a common lower bound in , and equip with the topology generated by . Then the following two conditions are equivalent: for every and every subset , ; and for every nonempty subset that is directed upward within itself, meaning that each have some with and , one has . The first condition quantifies over all subsets, including the empty subset, whereas the second quantifies only over nonempty directed subsets.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.