Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 9.5 — boundary Wronskian conditions

Proved
TeschlQM.SturmLiouville.wronskian_bc_symmetric

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

p2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1sturm-liouvillewronskian

Let (a,b,p,q,r)(a,b,p,q,r)(a,b,p,q,r) be Sturm–Liouville data. Suppose v∈D(τ)v \in \mathfrak{D}(\tau)v∈D(τ) with Wa(v∗,v)=0W_a(v^*, v) = 0Wa​(v∗,v)=0, and suppose there is an f^∈D(τ)\hat f \in \mathfrak{D}(\tau)f^​∈D(τ) with Wa(v∗,f^)≠0W_a(v^*, \hat f) \neq 0Wa​(v∗,f^​)=0. Then for all f,g∈D(τ)f, g \in \mathfrak{D}(\tau)f,g∈D(τ):

  1. Wa(v,f)=0  ⟺  Wa(v,f∗)=0W_a(v, f) = 0 \iff W_a(v, f^*) = 0Wa​(v,f)=0⟺Wa​(v,f∗)=0;
  2. Wa(v,f)=Wa(v,g)=0  ⟹  Wa(g∗,f)=0W_a(v, f) = W_a(v, g) = 0 \implies W_a(g^*, f) = 0Wa​(v,f)=Wa​(v,g)=0⟹Wa​(g∗,f)=0.

The second statement makes the boundary condition Wa(v,⋅)=0W_a(v, \cdot) = 0Wa​(v,⋅)=0 symmetric (the boundary term in the Lagrange identity vanishes), which is the first step to self-adjointness in Theorem 9.6.

Preamble
import Mathlib
import Definitions.Def_TeschlQM_SturmLiouville_maxDomain
import Definitions.Def_TeschlQM_SturmLiouville_wronskian
Formal statement
namespace TeschlQM.SturmLiouville

/-- Teschl, Lemma 9.5, p. 186. Let `v ∈ D(τ)` with `W_a(v*, v) = 0`, and let `f̂ ∈ D(τ)` with
`W_a(v*, f̂) ≠ 0`. Then for `f, g ∈ D(τ)`:
`W_a(v, f) = 0 ⇔ W_a(v, f*) = 0` (9.15) and
`W_a(v, f) = W_a(v, g) = 0 ⇒ W_a(g*, f) = 0` (9.16). -/
theorem wronskian_bc_symmetric (L : SLData) (v fhat : ℝ → ℂ) (hv : InMaxDomain L v)
    (hvv : wronskianLeft L (fun x => starRingEnd ℂ (v x)) v = 0)
    (hfhat : InMaxDomain L fhat)
    (hne : wronskianLeft L (fun x => starRingEnd ℂ (v x)) fhat ≠ 0)
    (f g : ℝ → ℂ) (hf : InMaxDomain L f) (hg : InMaxDomain L g) :
    (wronskianLeft L v f = 0 ↔ wronskianLeft L v (fun x => starRingEnd ℂ (f x)) = 0) ∧
      (wronskianLeft L v f = 0 → wronskianLeft L v g = 0 →
        wronskianLeft L (fun x => starRingEnd ℂ (g x)) f = 0) := by sorry

end TeschlQM.SturmLiouville
Source
Teschl, Mathematical Methods in Quantum Mechanics, AMS GSM 99, 2009, p. 186, Lemma 9.5, Eqs. (9.15)–(9.16)
Read-back

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

Setting. Fix LLL with interval III. The notions used are:

  • D(τ)D(\tau)D(τ): the maximal domain, meaning h∈L2(I,r dx)h \in L^2(I, r\,dx)h∈L2(I,rdx) and τh=k\tau h = kτh=k for some k∈L2(I,r dx)k \in L^2(I, r\,dx)k∈L2(I,rdx). Here τh=k\tau h = kτh=k means hhh has a quasi-derivative h[1]h^{[1]}h[1], qh−rkq h - r kqh−rk is locally integrable on III, and h[1](y)−h[1](x)=∫xy(qh−rk)h^{[1]}(y) - h^{[1]}(x) = \int_x^y (q h - r k)h[1](y)−h[1](x)=∫xy​(qh−rk) on III.
  • Wx(f1,f2)=f1(x)f2[1](x)−f1[1](x)f2(x)W_x(f_1, f_2) = f_1(x) f_2^{[1]}(x) - f_1^{[1]}(x) f_2(x)Wx​(f1​,f2​)=f1​(x)f2[1]​(x)−f1[1]​(x)f2​(x).
  • Wa(f1,f2)W_a(f_1, f_2)Wa​(f1​,f2​): the limit of Wx(f1,f2)W_x(f_1, f_2)Wx​(f1​,f2​) as x→ax \to ax→a inside III, or an unspecified number if that limit does not exist.
  • hˉ\bar hhˉ: the pointwise complex conjugate of hhh.

Hypotheses.

  • v∈D(τ)v \in D(\tau)v∈D(τ) with Wa(vˉ,v)=0W_a(\bar v, v) = 0Wa​(vˉ,v)=0.
  • f^∈D(τ)\hat f \in D(\tau)f^​∈D(τ) with Wa(vˉ,f^)≠0W_a(\bar v, \hat f) \neq 0Wa​(vˉ,f^​)=0. Note that the conjugate vˉ\bar vvˉ, not vvv, appears here.
  • f,g∈D(τ)f, g \in D(\tau)f,g∈D(τ).

Claim. Both of the following hold:

  1. Wa(v,f)=0W_a(v, f) = 0Wa​(v,f)=0 if and only if Wa(v,fˉ)=0W_a(v, \bar f) = 0Wa​(v,fˉ​)=0.
  2. If Wa(v,f)=0W_a(v, f) = 0Wa​(v,f)=0 and Wa(v,g)=0W_a(v, g) = 0Wa​(v,g)=0, then Wa(gˉ,f)=0W_a(\bar g, f) = 0Wa​(gˉ​,f)=0.

Degenerate cases.

  • The statement concerns the left endpoint aaa only. If a=−∞a = -\inftya=−∞, the limits are taken as x→−∞x \to -\inftyx→−∞.
  • f=gf = gf=g, f=vf = vf=v or f^=f\hat f = ff^​=f are allowed.
  • Neither the hypotheses nor the claim assert that the limits defining WaW_aWa​ exist. Each "=0= 0=0" or "≠0\neq 0=0" about a non-existent limit is a statement about the unspecified fallback value.
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me