Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

rem-1.2

Open
QAlgorithms.Papers.Independent.Intakethird100.P20.regular_spectral_value_at_quasipoint

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

prove2quantum

Let MMM be Hausdorff, σ\sigmaσ a regular spectral family of open sets, and x∈D(σ)x\in D(\sigma)x∈D(σ). If a quasipoint B\mathfrak BB lies over xxx, meaning that the intersection of the closures of its open sets is {x}\{x\}{x}, then its spectral cut is nonempty and bounded below, and

inf⁡{λ:σ(λ)∈B}=fσ(x).\inf\{\lambda:\sigma(\lambda)\in\mathfrak B\}=f_\sigma(x).inf{λ:σ(λ)∈B}=fσ​(x).

The assertion only concerns quasipoints over admissible points, so it requires no globally real-valued cut for an unbounded family.

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

/-- rem-1.2; de Groote, Observables I, PDF p./pp. 14.
-/
theorem regular_spectral_value_at_quasipoint {M : Type u} [TopologicalSpace M] [T2Space M]
    (E : ℝ → Opens M) (hE : IsRegularSpectralFamily E)
    (x : M) (hx : x ∈ admissibleDomain E)
    (B : StoneSpectrum (Opens M)) (hB : LiesOver B x) :
    {t | E t ∈ B.val}.Nonempty ∧ BddBelow {t | E t ∈ B.val} ∧
      sInf {t | E t ∈ B.val} = spectralCutInfimum (fun t => (E t : Set M)) x := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P20

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

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

Let MMM be a Hausdorff topological space and E:R→Opens⁡(M)E:\mathbb R\to\operatorname{Opens}(M)E:R→Opens(M) a family of open sets satisfying: E(t)⊆E(s)E(t)\subseteq E(s)E(t)⊆E(s) for t≤st\le st≤s; 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. Let x∈Mx\in Mx∈M satisfy ∃t, x∉E(t)\exists t,\ x\notin E(t)∃t, x∈/E(t). Let BBB be a nonempty family of open sets excluding ∅\varnothing∅, with a common smaller member for every pair of members, maximal under inclusion among such families, and suppose that ⋂U∈BU‾={x}\bigcap_{U\in B}\overline U=\{x\}⋂U∈B​U={x}. Then the set AB={t∈R:E(t)∈B}A_B=\{t\in\mathbb R:E(t)\in B\}AB​={t∈R:E(t)∈B} is nonempty and bounded below, and

inf⁡AB=inf⁡{t∈R:x∈E(t)}.\inf A_B=\inf\{t\in\mathbb R:x\in E(t)\}.infAB​=inf{t∈R:x∈E(t)}.

Both infima are taken in R\mathbb RR, whose total infimum operation returns 000 on an empty set or a set unbounded below. The spectral conditions involving arbitrary meets are the interior-of-intersection conditions displayed above, rather than assertions that the corresponding intersections themselves are open or 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