Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

stone-topology-properties

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.stone_topology_properties

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

prove2quantum

For a bounded lattice LLL, the membership sets form a clopen basis for Q(L)Q(L)Q(L) and satisfy

Qa∧b=Qa∩Qb,Q0=∅,Q1=Q(L).Q_{a\wedge b}=Q_a\cap Q_b,\qquad Q_0=\varnothing,\qquad Q_1=Q(L).Qa∧b​=Qa​∩Qb​,Q0​=∅,Q1​=Q(L).

The Stone spectrum is Hausdorff, zero-dimensional and completely regular. No compactness is asserted for an arbitrary 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

/-- stone-topology-properties; de Groote, Observables I, PDF p./pp. 40.
-/
theorem stone_topology_properties {L : Type u} [Lattice L] [BoundedOrder L] :
    (∀ a b : L, stoneBasic (a ⊓ b) = stoneBasic a ∩ stoneBasic b) ∧
    stoneBasic (⊥ : L) = ∅ ∧ stoneBasic (⊤ : L) = Set.univ ∧
    (∀ a : L, IsClopen (stoneBasic a)) ∧
    TopologicalSpace.IsTopologicalBasis (Set.range (stoneBasic : L → Set (StoneSpectrum L))) ∧
    TopologicalSpace.IsTopologicalBasis {s : Set (StoneSpectrum L) | IsClopen s} ∧
    T2Space (StoneSpectrum L) ∧ CompletelyRegularSpace (StoneSpectrum L) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P20

end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 40, stone-topology-properties
Read-back

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

Let LLL be any bounded lattice. Let Q(L)\mathcal Q(L)Q(L) be the set of all inclusion-maximal subsets B⊆LB\subseteq LB⊆L that are nonempty, exclude ⊥\bot⊥, and contain, for each a,b∈Ba,b\in Ba,b∈B, some c≤a,bc\le a,bc≤a,b. For a∈La\in La∈L, put D(a)={B∈Q(L):a∈B}D(a)=\{B\in\mathcal Q(L):a\in B\}D(a)={B∈Q(L):a∈B}, and equip Q(L)\mathcal Q(L)Q(L) with the topology generated by the sets D(a)D(a)D(a). Then D(a∧b)=D(a)∩D(b)D(a\wedge b)=D(a)\cap D(b)D(a∧b)=D(a)∩D(b) for all a,b∈La,b\in La,b∈L, D(⊥)=∅D(\bot)=\varnothingD(⊥)=∅, and D(⊤)=Q(L)D(\top)=\mathcal Q(L)D(⊤)=Q(L); every D(a)D(a)D(a) is both open and closed; the collection {D(a):a∈L}\{D(a):a\in L\}{D(a):a∈L} is a topological basis; the collection of all subsets of Q(L)\mathcal Q(L)Q(L) that are both open and closed is also a topological basis; and Q(L)\mathcal Q(L)Q(L) is Hausdorff and completely regular. No nontriviality assumption on LLL is imposed; when ⊥=⊤\bot=\top⊥=⊤, Q(L)\mathcal Q(L)Q(L) is empty.

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