Lemma 3.1
OpenQAlgorithms.Papers.Independent.Intakethird100.P20.orthomodular_basic_sets_injectiveprove2quantum
In an orthomodular lattice with its designated orthocomplement, basic Stone sets distinguish lattice elements:
No distributivity or completeness assumption is added; the one-element lattice is allowed.
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
/-- Lemma 3.1; de Groote, Observables I, PDF p./pp. 43.
-/
theorem orthomodular_basic_sets_injective {L : Type u} [Lattice L] [BoundedOrder L] (perp : L → L)
(horth : IsOrthomodular perp) {a b : L} :
stoneBasic a = stoneBasic b → a = b := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P20
end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 43, Lemma 3.1
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a bounded lattice and let be a function satisfying the following identities: for every , , , and ; for every , and ; and for every with and , . Let consist of the inclusion-maximal nonempty subsets excluding such that any two members have a common lower bound in , and set . For any , if , then .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.