Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 3.2

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.finite_type_iff_directed_meet_law

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

prove2quantum

A complete orthomodular lattice LLL is of finite type exactly when meet with any fixed element preserves suprema of nonempty directed subsets:

a∧⋁S=⋁b∈S(a∧b).a\wedge\bigvee S=\bigvee_{b\in S}(a\wedge b).a∧⋁S=b∈S⋁​(a∧b).

Here SSS ranges over the directed ranges of arbitrary nonempty increasing nets. Finite type uses the closure of the corresponding union of Stone basic sets.

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.2; de Groote, Observables I, PDF p./pp. 46.
-/
theorem finite_type_iff_directed_meet_law {L : Type u} [CompleteLattice L] (perp : L → L) (horth : IsOrthomodular perp) :
    IsFiniteType L ↔ HasDirectedMeetLaw L := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P20

end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 46, Lemma 3.2
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⊥ be a function L→LL\to LL→L satisfying, for all a,b∈La,b\in La,b∈L, 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, and additionally satisfying a∧(b∨c)=(a∧b)∨(a∧c)a\wedge(b\vee c)=(a\wedge b)\vee(a\wedge c)a∧(b∨c)=(a∧b)∨(a∧c) whenever b≤ab\le ab≤a and c≤a⊥c\le a^\perpc≤a⊥. Define a quasipoint of LLL to be an inclusion-maximal nonempty subset B⊆LB\subseteq LB⊆L that excludes ⊥\bot⊥ and such that any two members have a common lower bound belonging to BBB. Let Q(L)\mathcal Q(L)Q(L) be the set of quasipoints, equipped with the topology generated by Qa={B∈Q(L):a∈B}Q_a=\{B\in\mathcal Q(L):a\in B\}Qa​={B∈Q(L):a∈B}. Then the following are equivalent: for every nonempty upward-directed subset S⊆LS\subseteq LS⊆L, ⋃a∈SQa‾=Qsup⁡S\overline{\bigcup_{a\in S}Q_a}=Q_{\sup S}⋃a∈S​Qa​​=QsupS​; and for every a∈La\in La∈L and every nonempty upward-directed subset S⊆LS\subseteq LS⊆L, a∧sup⁡S=sup⁡{a∧b:b∈S}a\wedge\sup S=\sup\{a\wedge b:b\in S\}a∧supS=sup{a∧b:b∈S}. Here upward-directed means that any two members of SSS have a common upper bound in SSS; neither condition imposes a requirement on the empty subset.

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