rem-3.1
OpenQAlgorithms.Papers.Independent.Intakethird100.P20.distributive_basic_unionsprove2quantum
For a bounded distributive lattice,
For any bounded lattice satisfying this union identity, the further identity holds for every . This latter consequence does not by itself imply distributivity without order reflection.
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-3.1; de Groote, Observables I, PDF p./pp. 43.
-/
theorem distributive_basic_unions {L : Type u} [Lattice L] [BoundedOrder L] :
(IsDistributive (L := L) → ∀ a b : L, stoneBasic a ∪ stoneBasic b = stoneBasic (a ⊔ b)) ∧
((∀ a b : L, stoneBasic a ∪ stoneBasic b = stoneBasic (a ⊔ b)) →
∀ a b c : L, stoneBasic ((a ⊓ b) ⊔ (a ⊓ c)) = stoneBasic (a ⊓ (b ⊔ c))) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P20
end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 43, rem-3.1
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any bounded lattice. Let consist of the inclusion-maximal nonempty subsets excluding such that for every some satisfies , and put . The theorem asserts both of the following implications. If satisfies both distributive identities and for every , then for every . Conversely, if for every , then for every .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.