Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

rem-2.2

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.commutant_finite_join_distribution

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

prove2quantum

Every element aaa of SSS distributes over the join of a finite family in SCS^CSC: a∧⋁b=⋁(a∧b)a\wedge\bigvee b=\bigvee(a\wedge b)a∧⋁b=⋁(a∧b). The empty family gives a∧0=0a\wedge0=0a∧0=0. Arbitrary families in a complete lattice are covered by the supporting statement.

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-2.2; de Groote, Observables I, PDF pp. 23.
Restored in moderation: source background status is not a formalization obstacle. -/
theorem commutant_finite_join_distribution {L : Type u} [Lattice L] [BoundedOrder L]
    (perp : L → L) (horth : IsOrthomodular perp) (S : Set L) (a : L) (ha : a ∈ S)
    {n : ℕ} (b : Fin n → L) (hb : ∀ i, b i ∈ latticeCommutant perp S) :
    a ⊓ Finset.univ.sup b = Finset.univ.sup (fun i => a ⊓ b i) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P20

end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 23, rem-2.2
Read-back

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

Let LLL be any bounded lattice and let ⊥:L→L\perp:L\to L⊥:L→L satisfy, for every x,y∈Lx,y\in Lx,y∈L,

x∧⊥x=⊥,x∨⊥x=⊤,⊥(x∧y)=⊥x∨⊥y,⊥(x∨y)=⊥x∧⊥y,⊥(⊥x)=x,x\wedge\perp x=\bot,\qquad x\vee\perp x=\top,\qquad \perp(x\wedge y)=\perp x\vee\perp y,\qquad \perp(x\vee y)=\perp x\wedge\perp y,\qquad \perp(\perp x)=x,x∧⊥x=⊥,x∨⊥x=⊤,⊥(x∧y)=⊥x∨⊥y,⊥(x∨y)=⊥x∧⊥y,⊥(⊥x)=x,

and suppose that x∧(y∨z)=(x∧y)∨(x∧z)x\wedge(y\vee z)=(x\wedge y)\vee(x\wedge z)x∧(y∨z)=(x∧y)∨(x∧z) whenever y≤xy\le xy≤x and z≤⊥xz\le\perp xz≤⊥x. Let S⊆LS\subseteq LS⊆L, let a∈La\in La∈L satisfy a∈Sa\in Sa∈S, let nnn be any natural number, and let (bi)i=0n−1(b_i)_{i=0}^{n-1}(bi​)i=0n−1​ be any family in LLL such that, for every index iii and every s∈Ss\in Ss∈S,

s=(s∧bi)∨(s∧⊥bi).s=(s\wedge b_i)\vee(s\wedge\perp b_i).s=(s∧bi​)∨(s∧⊥bi​).

Then

a∧⋁i=0n−1bi=⋁i=0n−1(a∧bi).a\wedge\bigvee_{i=0}^{n-1}b_i =\bigvee_{i=0}^{n-1}(a\wedge b_i).a∧i=0⋁n−1​bi​=i=0⋁n−1​(a∧bi​).

The value n=0n=0n=0 is included: the condition on the family is then vacuous, both joins are ⊥\bot⊥, and the equality reads a∧⊥=⊥a\wedge\bot=\bota∧⊥=⊥. The hypothesis a∈Sa\in Sa∈S requires SSS to be nonempty.

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