Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 3.6

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.boolean_quasipoint_unique_sector

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Every Boolean quasipoint β\betaβ of a complete orthomodular lattice lies in exactly one Boolean sector:

∃! S,S is a Boolean sector and β⊆S.\exists!\,S,\qquad S\text{ is a Boolean sector and }\beta\subseteq S.∃!S,S is a Boolean sector and β⊆S.

Source convention. A sector means a maximal distributive sub-ortholattice, closed under the designated orthocomplement and containing both bounds. This is the proof-intended correction to the printed word “sublattice”.

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

/-- Corollary 3.6; de Groote, Observables I, PDF p./pp. 69.
Source convention: Boolean sectors are maximal distributive sub-ortholattices; generation includes complements and bounds.
-/
theorem boolean_quasipoint_unique_sector {L : Type u} [CompleteLattice L] (perp : L → L) (horth : IsOrthomodular perp)
    (B : Set L) (hB : IsBooleanQuasipoint perp B) :
    ∃! S : Set L, IsBooleanSector perp S ∧ B ⊆ S := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P20

end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 69, Corollary 3.6
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let LLL be a complete lattice, and let a↦a⊥a\mapsto a^\perpa↦a⊥ satisfy a∧a⊥=⊥a\wedge a^\perp=\bota∧a⊥=⊥, a∨a⊥=⊤a\vee a^\perp=\topa∨a⊥=⊤, both De Morgan identities (a∧b)⊥=a⊥∨b⊥(a\wedge b)^\perp=a^\perp\vee b^\perp(a∧b)⊥=a⊥∨b⊥ and (a∨b)⊥=a⊥∧b⊥(a\vee b)^\perp=a^\perp\wedge b^\perp(a∨b)⊥=a⊥∧b⊥, and (a⊥)⊥=a(a^\perp)^\perp=a(a⊥)⊥=a. Assume also that, for all a,b,d∈La,b,d\in La,b,d∈L, b≤ab\leq ab≤a and d≤a⊥d\leq a^\perpd≤a⊥ imply a∧(b∨d)=(a∧b)∨(a∧d)a\wedge(b\vee d)=(a\wedge b)\vee(a\wedge d)a∧(b∨d)=(a∧b)∨(a∧d). Let B⊆LB\subseteq LB⊆L be nonempty, exclude ⊥\bot⊥, have a common lower bound in BBB for every pair of its members, and satisfy a=(a∧b)∨(a∧b⊥)a=(a\wedge b)\vee(a\wedge b^\perp)a=(a∧b)∨(a∧b⊥) for all a,b∈Ba,b\in Ba,b∈B; assume BBB is maximal under inclusion among subsets with these properties. Then there exists exactly one subset S⊆LS\subseteq LS⊆L containing BBB such that SSS contains ⊥\bot⊥ and ⊤\top⊤, is closed under a↦a⊥a\mapsto a^\perpa↦a⊥, binary meets, and binary joins, satisfies

a∧(b∨d)=(a∧b)∨(a∧d),a∨(b∧d)=(a∨b)∧(a∨d)a\wedge(b\vee d)=(a\wedge b)\vee(a\wedge d), \qquad a\vee(b\wedge d)=(a\vee b)\wedge(a\vee d)a∧(b∨d)=(a∧b)∨(a∧d),a∨(b∧d)=(a∨b)∧(a∨d)

for all a,b,d∈Sa,b,d\in Sa,b,d∈S, and is maximal under inclusion among subsets with these closure and distributivity properties.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me