Lemma 3.7
OpenQAlgorithms.Papers.Independent.Intakethird100.P20.boolean_quasipoint_generates_sectorIf a Boolean sector in a complete orthomodular lattice contains a Boolean quasipoint , then
Source correction. Generation uses finite meets, finite joins, the designated orthocomplement, and the bounds. The proof obtains an element from its complement; generation by finite meets and joins alone would not yield this assertion.
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
/-- Lemma 3.7; de Groote, Observables I, PDF p./pp. 69.
Source convention: Boolean sectors are maximal distributive sub-ortholattices; generation includes complements and bounds.
-/
theorem boolean_quasipoint_generates_sector {L : Type u} [CompleteLattice L] (perp : L → L) (horth : IsOrthomodular perp)
(S : Set L) (hS : IsBooleanSector perp S)
(B : Set L) (hB : IsBooleanQuasipoint perp B) (hBS : B ⊆ S) :
ortholatticeGenerated perp B = S := 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 complete lattice, and let satisfy , , both De Morgan identities and , and . Assume also that and imply for all . Let contain , be closed under , binary meets, and binary joins, satisfy both distributive identities and for all , and be maximal under inclusion among subsets with these closure and distributivity properties. Let be nonempty, exclude , have a common lower bound in for every pair of its members, and satisfy for every ; assume is maximal among all subsets of with these properties. Then
Thus an element belongs to exactly when it belongs to every subset containing and closed under those operations; the subsets in this intersection are not required to satisfy either distributive identity.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.