Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 3.26

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.orthonormal_basis_unique_boolean_sector

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

prove2quantum

Let (ek)k∈K(e_k)_{k\in K}(ek​)k∈K​ be an orthonormal basis of an arbitrary complex Hilbert space. There is a unique Boolean sector containing all basis lines, and it is the actual subset

S={U∈L(H):∀k, ek∈U or ek∈U⊥}.S=\{U\in L(H):\forall k,\ e_k\in U\text{ or }e_k\in U^\perp\}.S={U∈L(H):∀k, ek​∈U or ek​∈U⊥}.

Every line Cek\mathbb C e_kCek​ belongs to this sector. Sectors are maximal distributive sub-ortholattices. The zero-space, empty-basis case is retained.

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

/-- Proposition 3.26; de Groote, Observables I, PDF p./pp. 72.
Source convention: Boolean sectors are maximal distributive sub-ortholattices; generation includes complements and bounds.
-/
theorem orthonormal_basis_unique_boolean_sector {H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
    {K : Type v} (e : HilbertBasis K ℂ H) :
    let S : Set (ClosedSubmodule ℂ H) := {U | ∀ k, e k ∈ U ∨ e k ∈ U.orthogonal}
    IsBooleanSector (fun U : ClosedSubmodule ℂ H => U.orthogonal) S ∧
    (∀ k, closedLine (e k) ∈ S) ∧
    ∀ T : Set (ClosedSubmodule ℂ H),
      IsBooleanSector (fun U : ClosedSubmodule ℂ H => U.orthogonal) T →
      (∀ k, closedLine (e k) ∈ T) → T = S := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P20

end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 72, Proposition 3.26
Read-back

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

Let HHH be a complete complex inner product space, let KKK be any index type, and let (ek)k∈K(e_k)_{k\in K}(ek​)k∈K​ be a Hilbert basis of HHH, meaning an orthonormal family with dense linear span. Define the family of closed complex linear subspaces

S={U⊆H:U is a closed complex linear subspace and, for every k∈K, ek∈U or ek∈U⊥}.S=\{U\subseteq H:U\text{ is a closed complex linear subspace and, for every }k\in K,\ e_k\in U\text{ or }e_k\in U^\perp\}.S={U⊆H:U is a closed complex linear subspace and, for every k∈K, ek​∈U or ek​∈U⊥}.

For families of closed subspaces, consider the following properties: containing {0}\{0\}{0} and HHH; closure under orthogonal complements, binary intersections, and binary joins, where U∨V=U+V‾U\vee V=\overline{U+V}U∨V=U+V​; and satisfaction, for every three members U,V,WU,V,WU,V,W, of both identities

U∩(V∨W)=(U∩V)∨(U∩W),U∨(V∩W)=(U∨V)∩(U∨W).U\cap(V\vee W)=(U\cap V)\vee(U\cap W),\qquad U\vee(V\cap W)=(U\vee V)\cap(U\vee W).U∩(V∨W)=(U∩V)∨(U∩W),U∨(V∩W)=(U∨V)∩(U∨W).

Then SSS has all these properties and is maximal under inclusion among families having them. Moreover, for every k∈Kk\in Kk∈K, SSS contains the closed subspace

ℓk=⋂{U:U is a closed complex linear subspace of H, ek∈U},\ell_k=\bigcap\{U:U\text{ is a closed complex linear subspace of }H,\ e_k\in U\},ℓk​=⋂{U:U is a closed complex linear subspace of H, ek​∈U},

and every family TTT of closed complex linear subspaces that has the stated properties, is maximal among families having them, and contains every ℓk\ell_kℓk​, equals SSS. No finiteness or countability condition is imposed on KKK; the empty index type is included, in which case the Hilbert basis assumption forces H={0}H=\{0\}H={0}, and all conditions quantified over kkk are vacuous.

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