Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 1.3

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.continuous_regular_spectral_correspondence

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

prove2quantum

Let MMM be Hausdorff. Every continuous f:M→Rf:M\to\mathbb Rf:M→R induces the regular spectral family

σf(λ)=int⁡(f−1((−∞,λ])).\sigma_f(\lambda)=\operatorname{int}\bigl(f^{-1}(({-\infty},\lambda])\bigr).σf​(λ)=int(f−1((−∞,λ])).

Its admissible domain is all of MMM, and its induced function is fff. Conversely, for every regular spectral family σ\sigmaσ, the domain D(σ)D(\sigma)D(σ) is open and dense, all pointwise cuts there are finite, and fσ:D(σ)→Rf_\sigma:D(\sigma)\to\mathbb Rfσ​:D(σ)→R is continuous. The family induced by this function in the subspace topology is σ(λ)∩D(σ)\sigma(\lambda)\cap D(\sigma)σ(λ)∩D(σ) for every real λ\lambdaλ. This correspondence imposes neither compactness nor boundedness.

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

/-- Theorem 1.3; de Groote, Observables I, PDF p./pp. 14.
-/
theorem continuous_regular_spectral_correspondence {M : Type u} [TopologicalSpace M] [T2Space M] :
    (∀ f : M → ℝ, Continuous f → IsRegularSpectralFamily (openSublevels f) ∧
      admissibleDomain (openSublevels f) = Set.univ ∧
      spectralCutInfimum (fun t => (openSublevels f t : Set M)) = f) ∧
    (∀ E : ℝ → Opens M, IsRegularSpectralFamily E →
      IsOpen (admissibleDomain E) ∧ Dense (admissibleDomain E) ∧
      Continuous (fun x : admissibleDomain E => spectralCutInfimum (fun t => (E t : Set M)) x.val) ∧
      (∀ x ∈ admissibleDomain E, {t | x ∈ (E t : Set M)}.Nonempty ∧
        BddBelow {t | x ∈ (E t : Set M)}) ∧
      ∀ t : ℝ,
        (openSublevels (fun x : admissibleDomain E =>
          spectralCutInfimum (fun s => (E s : Set M)) x.val) t : Set (admissibleDomain E)) =
        {x | x.val ∈ (E t : Set M)}) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P20

end
Source
Observables I: Stone Spectra, arXiv:math-ph/0509020v1, PDF p. 14, Theorem 1.3
Read-back

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

For every Hausdorff topological space MMM, define Of(t)=int⁡M{x:f(x)≤t}O_f(t)=\operatorname{int}_M\{x:f(x)\le t\}Of​(t)=intM​{x:f(x)≤t} for a function f:M→Rf:M\to\mathbb Rf:M→R, and define cE(x)=inf⁡{t:x∈E(t)}c_E(x)=\inf\{t:x\in E(t)\}cE​(x)=inf{t:x∈E(t)} for a family EEE of open sets, using the total real infimum, which returns 000 on an empty set or a set unbounded below. Here a regular spectral family E:R→Opens⁡(M)E:\mathbb R\to\operatorname{Opens}(M)E:R→Opens(M) means that EEE is increasing, E(t)=int⁡M(⋂s>tE(s))E(t)=\operatorname{int}_M(\bigcap_{s>t}E(s))E(t)=intM​(⋂s>t​E(s)) for every ttt, int⁡M(⋂tE(t))=∅\operatorname{int}_M(\bigcap_t E(t))=\varnothingintM​(⋂t​E(t))=∅, ⋃tE(t)=M\bigcup_t E(t)=M⋃t​E(t)=M, and E(t)‾⊆E(s)\overline{E(t)}\subseteq E(s)E(t)​⊆E(s) whenever t<st<st<s; set DE={x∈M:∃t, x∉E(t)}D_E=\{x\in M:\exists t,\ x\notin E(t)\}DE​={x∈M:∃t, x∈/E(t)}. The theorem asserts both that every continuous f:M→Rf:M\to\mathbb Rf:M→R has OfO_fOf​ a regular spectral family, DOf=MD_{O_f}=MDOf​​=M, and cOf=fc_{O_f}=fcOf​​=f, and that every regular spectral family EEE has DED_EDE​ open and dense in MMM, has the function g:DE→Rg:D_E\to\mathbb Rg:DE​→R given by g(x)=cE(x)g(x)=c_E(x)g(x)=cE​(x) continuous in the subspace topology, has {t:x∈E(t)}\{t:x\in E(t)\}{t:x∈E(t)} nonempty and bounded below for every x∈DEx\in D_Ex∈DE​, and satisfies, for every t∈Rt\in\mathbb Rt∈R,

int⁡DE{x∈DE:g(x)≤t}={x∈DE:x∈E(t)}.\operatorname{int}_{D_E}\{x\in D_E:g(x)\le t\}=\{x\in D_E:x\in E(t)\}.intDE​​{x∈DE​:g(x)≤t}={x∈DE​:x∈E(t)}.

The interior in this last equality is relative to DED_EDE​; the space MMM is allowed to be empty, and no boundedness assumption on fff or EEE is imposed.

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