Proposition 2.1
OpenQAlgorithms.Papers.Independent.Intakethird100.P20.commutation_symmetric_iff_orthomodularprove2quantum
For a bounded lattice with the designated orthocomplement, the relation is symmetric if and only if the lattice is orthomodular. Completeness is not assumed.
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.1; de Groote, Observables I, PDF pp. 21.
Restored in moderation: source background status is not a formalization obstacle. -/
theorem commutation_symmetric_iff_orthomodular {L : Type u} [Lattice L] [BoundedOrder L]
(perp : L → L) (hperp : IsOrthocomplement perp) :
(∀ a b : L, LatticeCommutes perp a b → LatticeCommutes perp b a) ↔
IsOrthomodular perp := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P20
end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 21, Proposition 2.1
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any bounded lattice and let satisfy, for every ,
Then the assertion that, for every ,
is equivalent to the conjunction of the five displayed identities with the following additional condition: for every such that and ,
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.