rem-2.1 (complete-lattice clause)
ProvedQAlgorithms.Papers.Independent.Intakethird100.P20.orthocomplement_complete_demorganprove2quantum
If the ortholattice is complete, orthocomplement interchanges arbitrary meets and joins, including empty families: and .
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
/-- rem-2.1; de Groote, Observables I, PDF pp. 20.
Restored in moderation: source background status is not a formalization obstacle. -/
theorem orthocomplement_complete_demorgan {L : Type u} [CompleteLattice L]
(perp : L → L) (hperp : IsOrthocomplement perp) :
∀ s : Set L, perp (sInf s) = sSup (perp '' s) ∧
perp (sSup s) = sInf (perp '' s) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P20
end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 20, rem-2.1
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any complete lattice and let satisfy, for all ,
Then for every subset ,
The subset may be empty; in that case these identities assert and , respectively.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.