Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Square integrability of all solutions near an endpoint is independent of zzz

Proved
TeschlQM.SturmLiouville.sqIntegrable_all_z

by Gabewhigham · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

limit-circlesturm-liouville

Let (a,b,p,q,r)(a,b,p,q,r)(a,b,p,q,r) be Sturm–Liouville data on I=(a,b)I=(a,b)I=(a,b) and τf=1r(−(pf′)′+qf)\tau f = \frac1r(-(pf')'+qf)τf=r1​(−(pf′)′+qf). If for one z0∈Cz_0\in\mathbb Cz0​∈C every solution of (τ−z0)u=0(\tau-z_0)u=0(τ−z0​)u=0 is square integrable near aaa (i.e. u∈L2((a,c),r dx)u\in L^2((a,c),r\,dx)u∈L2((a,c),rdx) for some c∈Ic\in Ic∈I), then for every z∈Cz\in\mathbb Cz∈C every solution of (τ−z)u=0(\tau-z)u=0(τ−z)u=0 is square integrable near aaa. The same holds at the endpoint bbb.

This is the part of the proof of Weyl's alternative (Teschl, Thm. 9.9) showing that the property does not depend on zzz. It is proved by variation of constants: writing (τ−z0)u=(z−z0)u(\tau - z_0)u = (z-z_0)u(τ−z0​)u=(z−z0​)u, the Cauchy–Schwarz inequality on a sufficiently short interval (a,c)(a,c)(a,c) gives an a-priori L2L^2L2 bound.

Preamble
import Mathlib
import Definitions.Def_TeschlQM_SturmLiouville_IsLimitCircle
import Definitions.Def_TeschlQM_SturmLiouville_IsSqIntegrableNear
Formal statement
namespace TeschlQM.SturmLiouville

theorem sqIntegrable_all_z (L : SLData) :
    ((∃ z₀ : ℂ, ∀ u : ℝ → ℂ, IsSolution L z₀ 0 u → IsSqIntegrableNearLeft L u) →
      ∀ z : ℂ, ∀ u : ℝ → ℂ, IsSolution L z 0 u → IsSqIntegrableNearLeft L u) ∧
    ((∃ z₀ : ℂ, ∀ u : ℝ → ℂ, IsSolution L z₀ 0 u → IsSqIntegrableNearRight L u) →
      ∀ z : ℂ, ∀ u : ℝ → ℂ, IsSolution L z 0 u → IsSqIntegrableNearRight L u) := by sorry

end TeschlQM.SturmLiouville
Source
Teschl, Mathematical Methods in Quantum Mechanics, AMS GSM 99, 2009, Section 9.2, proof of Theorem 9.9 (p. 191) and Lemma 9.2

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