Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

boolean-filter-upward-extension

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.boolean_quasipoint_upward_extension

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

prove2quantum

Let β\betaβ be a Boolean quasipoint in an orthomodular lattice. If ccc commutes with every member of β\betaβ and lies above some member, then

c∈β.c\in\beta.c∈β.

The commutation requirement is retained; ordinary upward closure is not asserted for a Boolean quasipoint in the whole ambient lattice.

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

/-- boolean-filter-upward-extension; de Groote, Observables I, PDF p./pp. 69.
-/
theorem boolean_quasipoint_upward_extension {L : Type u} [Lattice L] [BoundedOrder L] (perp : L → L)
    (horth : IsOrthomodular perp) (B : Set L) (hB : IsBooleanQuasipoint perp B)
    (c : L) (hcomm : ∀ a ∈ B, LatticeCommutes perp a c)
    (habove : ∃ b ∈ B, b ≤ c) : c ∈ B := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P20

end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 69, boolean-filter-upward-extension
Read-back

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

Let LLL be a bounded lattice, and let a↦a⊥a\mapsto a^\perpa↦a⊥ be a function on LLL satisfying a∧a⊥=⊥a\wedge a^\perp=\bota∧a⊥=⊥, a∨a⊥=⊤a\vee a^\perp=\topa∨a⊥=⊤, (a∧b)⊥=a⊥∨b⊥(a\wedge b)^\perp=a^\perp\vee b^\perp(a∧b)⊥=a⊥∨b⊥, (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 for all a,b∈La,b\in La,b∈L, as well as

b≤a,d≤a⊥⟹a∧(b∨d)=(a∧b)∨(a∧d)b\leq a,\quad d\leq a^\perp \quad\Longrightarrow\quad a\wedge(b\vee d)=(a\wedge b)\vee(a\wedge d)b≤a,d≤a⊥⟹a∧(b∨d)=(a∧b)∨(a∧d)

for all a,b,d∈La,b,d\in La,b,d∈L. Let B⊆LB\subseteq LB⊆L be nonempty, exclude ⊥\bot⊥, have for every a,b∈Ba,b\in Ba,b∈B some d∈Bd\in Bd∈B with d≤ad\leq ad≤a and d≤bd\leq bd≤b, and satisfy a=(a∧b)∨(a∧b⊥)a=(a\wedge b)\vee(a\wedge b^\perp)a=(a∧b)∨(a∧b⊥) for every a,b∈Ba,b\in Ba,b∈B. Assume BBB is maximal under inclusion among subsets with all these properties. If c∈Lc\in Lc∈L satisfies a=(a∧c)∨(a∧c⊥)a=(a\wedge c)\vee(a\wedge c^\perp)a=(a∧c)∨(a∧c⊥) for every a∈Ba\in Ba∈B, and there exists b∈Bb\in Bb∈B with b≤cb\leq cb≤c, then c∈Bc\in Bc∈B.

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