Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Identification of the Dirichlet Laplacian with the sine diagonal operator

Statement

Assume the Axiom of Choice and Countable Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω)). Let 0<L<∞, let en(x)=2Lsin⁡ ⁣(nπxL),λn:=(nπL)2(n≥1), let (en)n≥1 be the complete orthonormal family of Completeness of the Dirichlet sine system on an interval, and let AD be the diagonal operator of Diagonal adjoint and graph-core lemma associated with (en) and (λn): ADx=∑n≥1λn⟨x,en⟩en with domain D(AD)={x∈L2(0,L;C):∑n≥1λn2∣⟨x,en⟩∣2<∞}. Let B be the Dirichlet Laplacian Bu:=−D2u,D(B)={u∈H2(0,L):u∗(0)=u∗(L)=0}, with H2 and the trace u∗ of One-dimensional Sobolev spaces on intervals and Integration by parts and the endpoint-vanishing space on intervals clause (b). Then:

(a) D(AD)=D(B) and AD=B; in particular D(AD) is a linear subspace of H2(0,L) whose members have vanishing endpoint traces;

(b) AD is self-adjoint (Symmetric, self-adjoint and essentially self-adjoint operators), positive, and its spectrum is σ(AD)={λn:n≥1}; each λn is an eigenvalue with eigenvector en; the eigenvalues are simple in the sense that ker⁡(AD−λn) contains no nonzero vector orthogonal to en;

(c) for every u∈D(AD), ⟨ADu,u⟩=∥Du∥L2(0,L)2; consequently AD≥λ1=(π/L)2 in the quadratic-form sense on its domain.

Facts & Assumptions

Given: L>0; the complete orthonormal sine family (en) and numbers λn=(nπ/L)2 of Completeness of the Dirichlet sine system on an interval; the diagonal operator AD of Diagonal adjoint and graph-core lemma.

[F1]

(en)n≥1 is an orthonormal family with ⟨x,en⟩ the Fourier coefficients and x=∑n⟨x,en⟩en in L2 for every x∈L2(0,L) (Completeness of the Dirichlet sine system on an interval, Parseval equivalences for an orthonormal family, Orthonormal families, complete orthonormal systems and Hilbert bases). Also en∈H2(0,L), en(0)=en(L)=0, and the weak derivatives satisfy Den(x)=nπL2Lcos⁡(nπxL), D2en=−λnen, with ⟨Den,Dem⟩=λnδnm (Integration by parts and the endpoint-vanishing space on intervals and the product-to-sum computation of Completeness of the Dirichlet sine system on an interval).

[F2]

The diagonal operator lemma Diagonal adjoint and graph-core lemma states: the finite-support diagonal operator is symmetric, AD is self-adjoint with the displayed domain, ADen=λnen, the finite spans are a graph core, and ⟨ADx,x⟩=∑nλn∣⟨x,en⟩∣2. The companion Diagonal spectrum identifies σ(AD) with the closure of the sequence (λn).

[F3]

For u,v∈H1(0,L), ∫0Luv′‾=u∗(L)v∗(L)‾−u∗(0)v∗(0)‾−∫0Lu′v‾ (Integration by parts and the endpoint-vanishing space on intervals clause (a)); for u,v∈H2(0,L) the second-order identity holds; and H01(0,L)={u∈H1(0,L):u∗(0)=u∗(L)=0} (clause (b)).

[F4]

Bessel's inequality for an orthonormal family: for every x∈L2, ∑n∣⟨x,en⟩∣2≤∥x∥2 (Parseval equivalences for an orthonormal family).

Proof

1.1F1F2F4givenalgebra

[Series of derivatives] Let u∈D(AD) and put cn:=⟨u,en⟩, so that ∑nλn2∣cn∣2<∞ by [F2]. By [F4], ∑n∣cn∣2≤∥u∥2, so Cauchy-Schwarz gives ∑nλn∣cn∣2≤(∑nλn2∣cn∣2)1/2(∑n∣cn∣2)1/2<∞, and hence the series w:=∑ncnDen converges in L2 with ∥w∥2=∑nλn∣cn∣2 by [F1].

2.1step 1.1F1F2F3F4algebra

[u∈D(B) and ADu=−D2u] We first show Du=w for u∈D(AD). Let φ∈Cc∞(0,L) and put uN:=∑n≤Ncnen. Since uN→u in L2, ∫uNφ′‾→∫uφ′‾. For each n, [F3] clause (a) applied to en and φ (both in H1(0,L), and φ compactly supported in the interior) gives ∫enφ′‾=en∗(L)φ(L)‾−en∗(0)φ(0)‾−∫en′φ‾=−∫en′φ‾, because φ vanishes near the endpoints and en(0)=en(L)=0. Summing over n≤N and passing to the limit (justified by absolute convergence: ∑n∣cn∣ ∣⟨en′,φ⟩∣≤(∑nλn∣cn∣2)1/2(∑nλn−1∣⟨en,φ′⟩∣2)1/2≤(∑nλn∣cn∣2)1/2λ1−1/2∥φ′∥, using [F4] for φ′ and λn≥λ1) gives ∫uφ′‾=−∫wφ‾ for every test φ; hence Du=w∈L2 and u∈H1(0,L).

3.1step 1.1step 2.1F1F2F3

[Endpoint traces and second derivative] With u∈D(AD), Du=w, and the partial sums uN of step 2.1, the trace bound of Endpoint trace bound and decay of H1 functions clause (a) gives ∣uN∗(x)−u∗(x)∣≤L−1/2∥uN−u∥+L1/2∥DuN−Du∥(x∈[0,L]), and the right side tends to 0 because uN→u and DuN→Du in L2 by [F1] and step 1.1; hence uN∗→u∗ uniformly and, since uN∗(0)=uN∗(L)=0, also u∗(0)=u∗(L)=0. To identify the weak derivative of w, put wN:=∑n≤NcnDen and vN:=∑n≤NcnD2en=−∑n≤Nλncnen. By step 1.1, wN→w in L2; by [F2] and ∑nλn2∣cn∣2<∞, vN→−ADu in L2. For each φ∈Cc∞(0,L), integration by parts [F3] applied to Den and φ gives ∫0LwNφ′‾=−∫0LvNφ‾. Passing to the two L2 limits proves Dw=−ADu. Hence Du=w∈H1(0,L), D2u=−ADu, and u∈D(B) with Bu=−D2u=ADu.

4.1step 3.1F1F3F4algebra

[Reverse inclusion] Let u∈D(B); then u∈H2(0,L) and D2u∈L2, and u∗(0)=u∗(L)=0. Put cn:=⟨u,en⟩. For each n, apply the second-order identity [F3] to u and en: all boundary terms vanish because u and en vanish at 0 and L, so ⟨−D2u,en⟩=∫0L(−D2u)en‾=−∫0LuD2en‾=λn⟨u,en⟩=λncn, using D2en=−λnen from [F1]. By Bessel [F4] applied to −D2u∈L2, ∑nλn2∣cn∣2=∑n∣⟨−D2u,en⟩∣2≤∥D2u∥2<∞, so u∈D(AD). Moreover ADu=∑nλncnen=∑n⟨−D2u,en⟩en=−D2u by the expansion [F1]. Hence D(B)⊆D(AD) and ADu=Bu.

5.1step 3.1step 4.1

[Conclusion of (a)] Steps 3.1 and 4.1 give D(AD)=D(B) and AD=B.

6.1step 5.1F2

[Self-adjointness, spectrum, positivity] By [F2], AD is self-adjoint with spectrum the closure of {λn}; since λn=(nπ/L)2→∞ and the map n↦λn is injective, the set {λn:n≥1} has no finite accumulation point and is closed in R, so σ(AD)={λn:n≥1}, and [F2] gives ADen=λnen. If x=∑mcmem∈D(AD) lies in ker⁡(AD−λn), then 0=(AD−λn)x=∑m(λm−λn)cmem, and uniqueness of coefficients in the orthonormal expansion [F1] gives (λm−λn)cm=0 for every m, so cm=0 unless m=n and ker⁡(AD−λn)=Cen; this is the simplicity assertion of (b). Finally, for u∈D(AD) and u≠0, [F2] gives ⟨ADu,u⟩=∑nλn∣cn∣2≥λ1∑n∣cn∣2=λ1∥u∥2>0, since λ1>0; so AD is positive and AD≥λ1 in the quadratic-form sense.

7.1step 5.1F3algebra∎

[Form identity] Let u∈D(AD)=D(B). Since u∗(0)=u∗(L)=0 and ADu=−D2u, the first-order identity [F3] applied to the pair (Du,u) gives ⟨ADu,u⟩=∫0L(−D2u)u‾=∫0L∣Du∣2−[Du∗u∗‾]0L=∥Du∥L22, because the boundary terms contain the factor u∗(0)=u∗(L)=0. This is (c).

Depends on

Dependency tree · 2 levels

Sources