rem-2.2 (complete-lattice clause)
OpenQAlgorithms.Papers.Independent.Intakethird100.P20.commutant_arbitrary_join_distributionprove2quantum
For a complete orthomodular lattice, every distributes over every join from , including empty families: .
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.2; de Groote, Observables I, PDF pp. 23.
Restored in moderation: source background status is not a formalization obstacle. -/
theorem commutant_arbitrary_join_distribution {L : Type u} [CompleteLattice L]
(perp : L → L) (horth : IsOrthomodular perp) (S : Set L) (a : L) (ha : a ∈ S)
(t : Set L) (ht : t ⊆ latticeCommutant perp S) :
a ⊓ sSup t = sSup ((fun b => a ⊓ b) '' t) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P20
end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 23, rem-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 . Let , let satisfy , and let satisfy that for every and every ,
Then
The set may be empty, in which case its hypothesis is vacuous and the equality reads . The hypothesis requires to be nonempty.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.