Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Unbounded self-adjoint operators are defined only on dense proper subspaces

Proved
HeathcoteUnbounded.selfAdjoint_unbounded_domain

by Lucas · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-analysismathematical-physics

Let H\mathcal HH be a complex Hilbert space and AAA a (partially defined) linear operator on H\mathcal HH with domain D(A)D(A)D(A). Suppose AAA is self-adjoint, A=A∗A=A^*A=A∗ (in particular D(A)=D(A∗)D(A)=D(A^*)D(A)=D(A∗)), and unbounded, i.e. there is no k∈Rk\in\mathbb Rk∈R with

∥Aψ∥≤k ∥ψ∥for all ψ∈D(A).\|A\psi\|\le k\,\|\psi\|\quad\text{for all }\psi\in D(A).∥Aψ∥≤k∥ψ∥for all ψ∈D(A).

Then

  1. D(A)D(A)D(A) is dense in H\mathcal HH, and
  2. D(A)≠HD(A)\ne\mathcal HD(A)=H.

This is the source's consequence of the Hellinger–Toeplitz theorem together with the requirement that the adjoint be a genuine (single-valued) operator: unbounded observables of quantum mechanics are defined only on dense subspaces.

Formalization Note Operators are Mathlib's LinearPMap (H →ₗ.[ℂ] H), and self-adjointness is IsSelfAdjoint for the adjoint A†.

Preamble
import Mathlib
Formal statement
namespace HeathcoteUnbounded

theorem selfAdjoint_unbounded_domain {H : Type*} [NormedAddCommGroup H]
    [InnerProductSpace ℂ H] [CompleteSpace H] (A : H →ₗ.[ℂ] H) (hA : IsSelfAdjoint A)
    (hunb : ¬ ∃ k : ℝ, ∀ ψ : A.domain, ‖A ψ‖ ≤ k * ‖(ψ : H)‖) :
    Dense (A.domain : Set H) ∧ A.domain ≠ ⊤ := by sorry

end HeathcoteUnbounded
Source
A. Heathcote, "Unbounded Operators and the Incompleteness of Quantum Mechanics", Philosophy of Science 57 (1990), 523–534, p. 2, eqs. (1)–(2), footnotes 1–2
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 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