Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.2 — H₀ + V is self-adjoint on H²(ℝⁿ), bounded below, σ_ess = [0, ∞), C_c^∞ core

Proved
TeschlQM.OneParticle.schroedinger_selfAdjoint

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

essential-spectrumfunctional-analysismathematical-physicsp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1schrodinger-operatorsself-adjoint-operators

Let n≥1n \ge 1n≥1 and let V:Rn→RV : \mathbb R^n \to \mathbb RV:Rn→R satisfy V∈L∞∞(Rn)V \in L^\infty_\infty(\mathbb R^n)V∈L∞∞​(Rn) if n>3n > 3n>3, and V∈L∞∞(Rn)+L2(Rn)V \in L^\infty_\infty(\mathbb R^n) + L^2(\mathbb R^n)V∈L∞∞​(Rn)+L2(Rn) if n≤3n \le 3n≤3, where L∞∞L^\infty_\inftyL∞∞​ are the bounded Borel functions vanishing at infinity. Then the multiplication operator VVV is relatively compact with respect to H0=−ΔH_0 = -\DeltaH0​=−Δ. In particular,

H=H0+V,D(H)=H2(Rn),H = H_0 + V, \qquad \mathfrak D(H) = H^2(\mathbb R^n),H=H0​+V,D(H)=H2(Rn),

is self-adjoint and bounded from below,

σess(H)=[0,∞),\sigma_{ess}(H) = [0, \infty),σess​(H)=[0,∞),

and Cc∞(Rn)C_c^\infty(\mathbb R^n)Cc∞​(Rn) is a core for HHH.

This is the basic existence theorem for one-particle Schrödinger operators with decaying potentials, including the Coulomb potential in three dimensions: the Hamiltonian is a well-defined observable, its energy is bounded below, and all spectrum below zero consists of isolated eigenvalues of finite multiplicity.

Formalization Note. VVV is the maximally defined multiplication operator multOp, and H0+VH_0 + VH0​+V is the LinearPMap sum with domain D(H0)∩D(V)\mathfrak D(H_0) \cap \mathfrak D(V)D(H0​)∩D(V); that this domain equals H2(Rn)H^2(\mathbb R^n)H2(Rn) is a conclusion. "V∈L∞∞+L2V \in L^\infty_\infty + L^2V∈L∞∞​+L2" is V=V1+V2V = V_1 + V_2V=V1​+V2​ pointwise with V1V_1V1​ bounded, Borel and vanishing at infinity and V2∈L2V_2 \in L^2V2​∈L2. The only hypotheses are these function-space conditions: neither D(H0)⊆D(V)\mathfrak D(H_0) \subseteq \mathfrak D(V)D(H0​)⊆D(V) nor a relative bound is assumed. Self-adjointness is Mathlib's IsSelfAdjoint, [0,∞)[0,\infty)[0,∞) is the image of Set.Ici 0 in C\mathbb CC, and "core" is Mathlib's LinearPMap.HasCore (the closure of HHH restricted to Cc∞C_c^\inftyCc∞​ is HHH). The Fourier normalization is Mathlib's; H0H_0H0​ and H2H^2H2 do not depend on it. n≥1n \ge 1n≥1 excludes the zero-dimensional space, where σess\sigma_{ess}σess​ is empty.

Preamble
import Mathlib
import Definitions.Def_TeschlQM_OneParticle_multiplicationOperator
import Definitions.Def_TeschlQM_OneParticle_freeHamiltonian
import Definitions.Def_TeschlQM_Shared_resolventSet
import Definitions.Def_TeschlQM_OneParticle_essentialSpectrum
import Definitions.Def_TeschlQM_Shared_IsRelativelyCompact
import Definitions.Def_TeschlQM_OneParticle_IsBoundedBelow
import Definitions.Def_TeschlQM_OneParticle_testFunctions
import Definitions.Def_TeschlQM_OneParticle_IsBoundedVanishingAtInfinity
Formal statement
namespace TeschlQM.OneParticle

open MeasureTheory

/-- Teschl, Theorem 10.2, p. 222. Let `V` be real-valued and `V ∈ L^∞_∞(ℝⁿ)` if `n > 3` and
`V ∈ L^∞_∞(ℝⁿ) + L²(ℝⁿ)` if `n ≤ 3`. Then `V` is relatively compact with respect to `H₀`. In
particular, `H = H₀ + V`, `𝔇(H) = H²(ℝⁿ)` (10.3), is self-adjoint, bounded from below and
`σ_ess(H) = [0, ∞)` (10.4). Moreover, `C_c^∞(ℝⁿ)` is a core for `H`.

`V` is the maximally defined multiplication operator (2.21) and `H₀ + V` is the operator sum on
`𝔇(H₀) ∩ 𝔇(V)`; that this intersection is `H²(ℝⁿ)` is part of the conclusion. `n ≥ 1` (the book's
`ℝⁿ` is at least one-dimensional; on `ℝ⁰` the essential spectrum is empty). -/
theorem schroedinger_selfAdjoint (n : ℕ) (hn : 1 ≤ n) (V : EuclideanSpace ℝ (Fin n) → ℝ)
    (hV_large : 3 < n → IsBoundedVanishingAtInfinity V)
    (hV_small : n ≤ 3 → ∃ V₁ V₂ : EuclideanSpace ℝ (Fin n) → ℝ,
      IsBoundedVanishingAtInfinity V₁ ∧ MemLp V₂ 2 volume ∧ V = V₁ + V₂) :
    TeschlQM.Shared.IsRelativelyCompact (multOp (fun x => (V x : ℂ))) (freeHamiltonian n) ∧
      (freeHamiltonian n + multOp (fun x => (V x : ℂ))).domain = sobolevH2 n ∧
      IsSelfAdjoint (freeHamiltonian n + multOp (fun x => (V x : ℂ))) ∧
      IsBoundedBelow (freeHamiltonian n + multOp (fun x => (V x : ℂ))) ∧
      essentialSpectrum (freeHamiltonian n + multOp (fun x => (V x : ℂ))) =
        (fun t : ℝ => (t : ℂ)) '' Set.Ici 0 ∧
      (freeHamiltonian n + multOp (fun x => (V x : ℂ))).HasCore (testFunctions n) := by sorry

end TeschlQM.OneParticle
Source
Teschl, Mathematical Methods in Quantum Mechanics, AMS GSM 99, 2009, p. 222, Theorem 10.2
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Fix a natural number nnn with n≥1n \ge 1n≥1. Write Rn\mathbb{R}^nRn for nnn-dimensional Euclidean space, with Lebesgue measure. Let V:Rn→RV : \mathbb{R}^n \to \mathbb{R}V:Rn→R be an arbitrary real-valued function. The statement assumes nothing else about VVV, not even measurability, beyond the following two hypotheses.

  • (Large dimension.) If n>3n > 3n>3, then VVV satisfies the imported predicate IsBoundedVanishingAtInfinity. Its body is not shown here. By its name, it says that VVV is bounded and tends to 000 at infinity; whether that is pointwise or essential (almost-everywhere) is fixed by the imported definition.
  • (Small dimension.) If n≤3n \le 3n≤3, then there exist functions V1,V2:Rn→RV_1, V_2 : \mathbb{R}^n \to \mathbb{R}V1​,V2​:Rn→R such that:
    • V1V_1V1​ satisfies the same predicate IsBoundedVanishingAtInfinity;
    • V2V_2V2​ is in L2(Rn)L^2(\mathbb{R}^n)L2(Rn) for Lebesgue measure. This means V2V_2V2​ is almost-everywhere strongly measurable and ∫∣V2∣2 dx<∞\int |V_2|^2 \, dx < \infty∫∣V2​∣2dx<∞;
    • V=V1+V2V = V_1 + V_2V=V1​+V2​ holds at every point of Rn\mathbb{R}^nRn, not just almost everywhere.

The statement uses these operators, all from imported definitions whose bodies are not shown:

  • MVM_VMV​: the multiplication operator multOp applied to the complex-valued function x↦V(x)+0ix \mapsto V(x) + 0ix↦V(x)+0i. By name, this is multiplication by VVV on its (maximal) domain in L2(Rn;C)L^2(\mathbb{R}^n; \mathbb{C})L2(Rn;C).
  • H0H_0H0​: the operator freeHamiltonian n. By name, this is the free Hamiltonian (the Laplacian with a sign convention) on Rn\mathbb{R}^nRn.
  • HHH: the operator H=H0+MVH = H_0 + M_VH=H0​+MV​. The sum is formed with the addition of the operator type. For partially defined operators, that addition is defined on the intersection of the two domains, D(H0)∩D(MV)\mathfrak{D}(H_0) \cap \mathfrak{D}(M_V)D(H0​)∩D(MV​).
  • H2(Rn)H^2(\mathbb{R}^n)H2(Rn): the set sobolevH2 n. By name, this is the Sobolev space of order 2.
  • Cc∞(Rn)C_c^\infty(\mathbb{R}^n)Cc∞​(Rn): the set testFunctions n. By name, this is the space of smooth compactly supported test functions.

Under these hypotheses, the theorem asserts that all six of the following hold at once:

  1. MVM_VMV​ is relatively compact with respect to H0H_0H0​, in the sense of the imported predicate TeschlQM.Shared.IsRelativelyCompact.
  2. The domain of HHH equals the set H2(Rn)H^2(\mathbb{R}^n)H2(Rn):
D(H0+MV)=H2(Rn).\mathfrak{D}(H_0 + M_V) = H^2(\mathbb{R}^n).D(H0​+MV​)=H2(Rn).
  1. HHH is self-adjoint. Here this means HHH equals its own adjoint under the star (adjoint) operation of the operator type: same domain, and the same values on that domain.
  2. HHH is bounded below, in the sense of the imported predicate IsBoundedBelow.
  3. The essential spectrum of HHH, in the sense of the imported essentialSpectrum, is a subset of C\mathbb{C}C. It is exactly the non-negative real half-line embedded in C\mathbb{C}C:
σess(H)={ t+0i:t∈R, t≥0 }.\sigma_{\mathrm{ess}}(H) = \{\, t + 0i : t \in \mathbb{R},\ t \ge 0 \,\}.σess​(H)={t+0i:t∈R, t≥0}.
  1. Cc∞(Rn)C_c^\infty(\mathbb{R}^n)Cc∞​(Rn) is a core for HHH. This means it is contained in D(H)\mathfrak{D}(H)D(H), and the closure of the restriction of HHH to it equals the closure of HHH.

Degenerate cases.

  • Dimension zero: the hypothesis n≥1n \ge 1n≥1 excludes n=0n = 0n=0, so the zero-dimensional space is never covered.
  • Which hypothesis is active:
    • For n=1,2,3n = 1, 2, 3n=1,2,3, the large-dimension hypothesis is an implication with a false premise, so it is automatically satisfied and imposes nothing. Only the decomposition V=V1+V2V = V_1 + V_2V=V1​+V2​ is required.
    • For n≥4n \ge 4n≥4, the small-dimension hypothesis is automatically satisfied and imposes nothing. Only the predicate on VVV itself is required.
  • Freedom on null sets: when n≤3n \le 3n≤3, V2V_2V2​ only needs to be in L2L^2L2. So VVV may be any function that differs from "(function satisfying the predicate) + (an L2L^2L2 function)" on a set of measure zero. When n≥4n \ge 4n≥4, VVV has no such slack unless the imported predicate is itself stated almost everywhere.
  • The zero potential: V≡0V \equiv 0V≡0 is allowed exactly when the zero function satisfies IsBoundedVanishingAtInfinity. For n≤3n \le 3n≤3 one can take V1=V2=0V_1 = V_2 = 0V1​=V2​=0 under the same condition. The conclusions then concern H0+M0H_0 + M_0H0​+M0​ itself.
  • What depends on the imported definitions: these are not visible here, so every conclusion should be read with them in mind:
    • how multOp treats functions that are not measurable;
    • which domain the operator sum carries;
    • how the adjoint is defined when the domain is not dense. In Mathlib the adjoint of a non-densely-defined operator is a default junk value, not a true adjoint.
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me