Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

abstract-spectral-characterization

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.abstract_spectral_characterization

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

prove2quantum

Let LLL be a complete orthomodular lattice with its designated orthocomplement, and let D(L)D(L)D(L) be its proper dual ideals, with the topology generated by membership. If f:D(L)→Rf:D(L)\to\mathbb Rf:D(L)→R is upper semicontinuous and sends nonempty intersections to real suprema, then there is a unique bounded right-continuous spectral family EEE such that

f(J)=inf⁡{λ∈R:Eλ∈J}(J∈D(L)).f(J)=\inf\{\lambda\in\mathbb R:E_\lambda\in J\}\qquad(J\in D(L)).f(J)=inf{λ∈R:Eλ​∈J}(J∈D(L)).

This is the announced abstract spectral-family characterization; no operator representation 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

/-- abstract-spectral-characterization; de Groote, Observables I, PDF p./pp. 11.
-/
theorem abstract_spectral_characterization {L : Type u} [CompleteLattice L] (perp : L → L)
    (horth : IsOrthomodular perp) (f : DualIdeal L → ℝ) (hf : IsAbstractObservable f) :
    ∃! E : ℝ → L, IsBoundedSpectralFamily E ∧ f = dualSpectralValue E := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P20

end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 11, abstract-spectral-characterization
Read-back

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

Let LLL be any complete lattice and let a↦a⊥a\mapsto a^\perpa↦a⊥ be a function L→LL\to LL→L satisfying, for all relevant elements, 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, together with the additional law 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⊥. A proper dual ideal J⊆LJ\subseteq LJ⊆L means a nonempty set excluding ⊥\bot⊥, upward closed, and closed under binary meets. Give the set D(L)\mathcal D(L)D(L) of proper dual ideals the topology generated by the sets {J:a∈J}\{J:a\in J\}{J:a∈J}, for a∈La\in La∈L. For every function f:D(L)→Rf:\mathcal D(L)\to\mathbb Rf:D(L)→R, assume that fff is upper semicontinuous in this topology and that, for every nonempty family F⊆D(L)\mathcal F\subseteq\mathcal D(L)F⊆D(L) and every J∈D(L)J\in\mathcal D(L)J∈D(L) whose underlying set is ⋂K∈FK\bigcap_{K\in\mathcal F}K⋂K∈F​K, one has f(J)=sup⁡{f(K):K∈F}f(J)=\sup\{f(K):K\in\mathcal F\}f(J)=sup{f(K):K∈F}. This supremum is the total real supremum operation, which returns 000 for a set unbounded above; no boundedness hypothesis is imposed on this family of values. Then there exists exactly one function E:R→LE:\mathbb R\to LE:R→L satisfying all of the following: EEE is monotone; E(t)=inf⁡s>tE(s)E(t)=\inf_{s>t}E(s)E(t)=infs>t​E(s) for every real ttt; inf⁡t∈RE(t)=⊥\inf_{t\in\mathbb R}E(t)=\botinft∈R​E(t)=⊥ and sup⁡t∈RE(t)=⊤\sup_{t\in\mathbb R}E(t)=\topsupt∈R​E(t)=⊤; there exist real numbers a,ba,ba,b such that E(t)=⊥E(t)=\botE(t)=⊥ for every t<at<at<a and E(t)=⊤E(t)=\topE(t)=⊤ for every t>bt>bt>b; and, for every proper dual ideal JJJ,

f(J)=inf⁡{t∈R:E(t)∈J}.f(J)=\inf\{t\in\mathbb R:E(t)\in J\}.f(J)=inf{t∈R:E(t)∈J}.

The uniqueness is among functions satisfying these spectral conditions and this equality; no condition a≤ba\le ba≤b is explicitly required of the two witnesses.

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