Theorem 9.6 — self-adjoint realizations with separated boundary conditions
ProvedTeschlQM.SturmLiouville.selfAdjoint_bcLet be Sturm–Liouville data. If is l.c. at , let with and for some ; similarly, if is l.c. at , let be an analogous function at . Then the operator
is self-adjoint. Moreover the set of (9.21) is a core for : the closure of the restriction of to is .
This produces the self-adjoint Sturm–Liouville operators whose resolvents and spectra are studied in the rest of the chapter.
Formalization Note. The conclusion asserts that there is a LinearPMap on whose graph is (so is well defined), that is self-adjoint (Mathlib's IsSelfAdjoint), and that the operator with graph exists and has closure . When is l.p. at an endpoint the hypothesis on (resp. ) is vacuous and no condition is imposed there.
import Mathlib import Definitions.Def_TeschlQM_SturmLiouville_operatorGraph
namespace TeschlQM.SturmLiouville
open MeasureTheory
/-- Teschl, Theorem 9.6, p. 187. If `τ` is l.c. at `a`, let `v ∈ D(τ)` with `W_a(v*, v) = 0` and
`W_a(v, f) ≠ 0` for some `f ∈ D(τ)`; similarly `w` at `b` if `τ` is l.c. at `b`. Then
`f ↦ τ f` on `𝔇(A)` (9.20) is a (well-defined) self-adjoint operator `A` in `L²(I, r dx)`, and
`D₁` (9.21) is a core for `A`: the closure of `A` restricted to `D₁` is `A`. -/
theorem selfAdjoint_bc (L : SLData) (v w : ℝ → ℂ)
(hv : IsLimitCircleLeft L → InMaxDomain L v ∧
wronskianLeft L (fun x => starRingEnd ℂ (v x)) v = 0 ∧
∃ f : ℝ → ℂ, InMaxDomain L f ∧ wronskianLeft L v f ≠ 0)
(hw : IsLimitCircleRight L → InMaxDomain L w ∧
wronskianRight L (fun x => starRingEnd ℂ (w x)) w = 0 ∧
∃ f : ℝ → ℂ, InMaxDomain L f ∧ wronskianRight L w f ≠ 0) :
∃ A : Lp ℂ 2 L.measure →ₗ.[ℂ] Lp ℂ 2 L.measure,
(A.graph : Set (Lp ℂ 2 L.measure × Lp ℂ 2 L.measure)) =
operatorGraph L (bcDomain L v w) ∧
IsSelfAdjoint A ∧
∃ A₁ : Lp ℂ 2 L.measure →ₗ.[ℂ] Lp ℂ 2 L.measure,
(A₁.graph : Set (Lp ℂ 2 L.measure × Lp ℂ 2 L.measure)) =
operatorGraph L (coreDomain L v w) ∧
A₁.closure = A := by sorry
end TeschlQM.SturmLiouville
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Fix with interval , on , and (a complex Hilbert space of a.e.-classes). The notions used are:
- : the maximal domain.
- , , : the pointwise Wronskian and its boundary limits (an unspecified value when the limit does not exist).
- "l.c. at ": there is with and for some . "l.c. at " is analogous.
Hypotheses. Functions such that:
- If is l.c. at : , , and for some .
- If is l.c. at : , , and for some .
Claim. There exists a linear operator on , defined on a subspace, with the following properties:
- Its graph equals the set of pairs with and , where satisfies:
- ;
- if l.c. at ;
- if l.c. at .
- is self-adjoint: equals its adjoint . (Mathlib's adjoint of an operator whose domain is not dense is the zero map on the adjoint domain.)
- There exists a further linear operator on with the following two properties.
- Its graph equals the set of pairs with and , where and, in addition:
- if l.c. at , there is with for all with ;
- if l.c. at , there is with for all with .
- The closure of equals . Mathlib's closure of a non-closable operator is the operator itself, so in that case the requirement reads .
- Its graph equals the set of pairs with and , where and, in addition:
Degenerate cases.
- If is l.c. at neither endpoint, the hypotheses are vacuous and are arbitrary. The domain conditions then reduce to , and both graphs are those of on .
- Part of the claim is that these sets of pairs are graphs of linear operators at all.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.