Proposition 2.2 (complete-lattice clause)
OpenQAlgorithms.Papers.Independent.Intakethird100.P20.commutant_complete_closureprove2quantum
In a complete orthomodular lattice the commutant is closed under arbitrary ambient joins and meets. Thus its inherited order is complete; the empty join and meet are included.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P20
Formal statement
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 2.2; de Groote, Observables I, PDF pp. 22.
Restored in moderation: source background status is not a formalization obstacle. -/
theorem commutant_complete_closure {L : Type u} [CompleteLattice L]
(perp : L → L) (horth : IsOrthomodular perp) (S : Set L) :
∀ t : Set L, t ⊆ latticeCommutant perp S →
sSup t ∈ latticeCommutant perp S ∧ sInf t ∈ latticeCommutant perp S := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P20
end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 22, Proposition 2.2
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any complete lattice and let satisfy, for every ,
and suppose that whenever and . For any subset , put
Then for every subset with , both and belong to . This includes , whose supremum and infimum are and , respectively, and includes , for which .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.