Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 3.1

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.boolean_finite_type_iff_frame_law

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

prove2quantum

For a complete Boolean algebra LLL, the source's complete-distributivity property is equivalent to finite type:

[∀a,S, a∧⋁S=⋁b∈S(a∧b)]⟺[∀S≠∅ directed, ⋃a∈SQa‾=Q⋁S].\bigl[\forall a,S,\ a\wedge\bigvee S=\bigvee_{b\in S}(a\wedge b)\bigr] \quad\Longleftrightarrow\quad \bigl[\forall S\ne\varnothing\text{ directed},\ \overline{\bigcup_{a\in S}Q_a}=Q_{\bigvee S}\bigr].[∀a,S, a∧⋁S=b∈S⋁​(a∧b)]⟺[∀S=∅ directed, a∈S⋃​Qa​​=Q⋁S​].

The finite-type condition ranges over directed nets, not only sequences.

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.1; de Groote, Observables I, PDF p./pp. 46.
-/
theorem boolean_finite_type_iff_frame_law {L : Type u} [CompleteBooleanAlgebra L] : HasFrameLaw L ↔ IsFiniteType L := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P20

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

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

Let LLL be any complete Boolean algebra. Let Q(L)\mathcal Q(L)Q(L) consist of the inclusion-maximal nonempty subsets B⊆LB\subseteq LB⊆L excluding ⊥\bot⊥ such that any two members have a common lower bound in BBB, and equip Q(L)\mathcal Q(L)Q(L) with the topology generated by D(a)={B∈Q(L):a∈B}D(a)=\{B\in\mathcal Q(L):a\in B\}D(a)={B∈Q(L):a∈B}. Then the following two conditions are equivalent: for every a∈La\in La∈L and every 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}; and for every nonempty subset s⊆Ls\subseteq Ls⊆L that is directed upward within itself, meaning that each a,b∈sa,b\in sa,b∈s have some c∈sc\in sc∈s with a≤ca\le ca≤c and b≤cb\le cb≤c, one has ⋃a∈sD(a)‾=D(sup⁡s)\overline{\bigcup_{a\in s}D(a)}=D(\sup s)⋃a∈s​D(a)​=D(sups). The first condition quantifies over all subsets, including the empty subset, whereas the second quantifies only over nonempty directed subsets.

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