Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Diagonal adjoint and graph-core lemma

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space (Hilbert space) with inner product linear in the first argument, let (en)n∈N, where N={0,1,2,… }, be a complete orthonormal family of H (Orthonormal families, complete orthonormal systems and Hilbert bases), and let (λn)n∈N⊆R. Put

D0:={∑n∈Fcnen: F⊆N finite, cn∈C},S(∑n∈Fcnen):=∑n∈Fλncnen,

and

D(A):={x∈H:∑n∈Nλn2 ∣⟨x,en⟩∣2<∞},Ax:=∑n∈Nλn⟨x,en⟩ en.

Then:

(a) S is a well-defined, densely defined linear operator with domain D0 (Unbounded linear operators: domain, graph and extension), and it is symmetric (Symmetric, self-adjoint and essentially self-adjoint operators);

(b) the series defining Ax converges in H for every x∈D(A), with ∥Ax∥2=∑nλn2∣⟨x,en⟩∣2, so A is a linear operator with domain D(A) and S⊆A;

(c) S∗=A (Adjoint of a densely defined operator), hence A is closed and A∗=A: A is self-adjoint and S‾=A, so S is essentially self-adjoint and A is its unique self-adjoint extension;

(d) D0 is a core for A (Densely defined, closed and closable operators, and cores): the finite truncations xN:=∑n=0N⟨x,en⟩en∈D0 of x∈D(A) satisfy xN→x and AxN→Ax in H as N→∞;

(e) ⟨Ax,x⟩=∑nλn∣⟨x,en⟩∣2 for x∈D(A), so ⟨Ax,x⟩ is real and ⟨Ax,x⟩≥c∥x∥2 whenever λn≥c for all n; and Aen=λnen for every n, so each λn is an eigenvalue of A with eigenvector en.

No assertion is made about a differential or multiplication realisation of A: the lemma concerns only a specified complete orthonormal family and real eigenvalue sequence.

Facts & Assumptions

Given: a complex Hilbert space H; a complete orthonormal family (en)n∈N; real numbers λn; the linear span D0; the operators S and A displayed above.

[F1]

⟨ei,ej⟩=δij; every finite subfamily of (en) is linearly independent, so coefficients in a finite expansion in D0 are unique; and for every x∈H the finite-subset net of partial sums ∑n∈F⟨x,en⟩en converges to x in H, with ∑n∣⟨x,en⟩∣2=∥x∥2 (Orthonormal families, complete orthonormal systems and Hilbert bases, Parseval equivalences for an orthonormal family, clauses 3 and 4).

[F2]

For a densely defined T, a vector y∈H lies in D(T∗) exactly when x↦⟨Tx,y⟩ is bounded on (D(T),∥⋅∥); then T∗y is the unique w∈H with ⟨Tx,y⟩=⟨x,w⟩ for all x∈D(T). The adjoint T∗ is closed, and T⊆T∗ holds exactly when ⟨Tx,y⟩=⟨x,Ty⟩ for all x,y∈D(T); a symmetric operator is closable with symmetric closure, and a self-adjoint operator has no proper symmetric extension and is closed (Adjoint of a densely defined operator, Symmetric, self-adjoint and essentially self-adjoint operators, The adjoint is well defined, closed, and reverses inclusions).

[F3]

T‾=T∗∗ and T∗=T‾ ∗ for a densely defined closable T (Closability is equivalent to density of the adjoint domain).

[F4]

∣⟨x,y⟩∣≤∥x∥ ∥y∥ and ∣∑n∈Fanbn‾∣≤(∑n∈F∣an∣2)1/2(∑n∈F∣bn∣2)1/2 for finite F (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

Proof

1.1givenF1

[Well-definedness and density] D0 is the linear span of the family and is a linear subspace; by [F1] the coefficients in a finite expansion are unique, so S is well defined, and it is linear and maps D0 into H. By [F1] the finite partial sums of the expansion of any x∈H converge to x, so the span D0 is dense in H.

1.2givenF1F4algebra

[Symmetry and the series for A] Let x=∑n∈Fcnen and y=∑m∈Gdmem lie in D0, with cn=⟨x,en⟩ and dm=⟨y,em⟩ by [F1]. Then ⟨Sx,y⟩=∑n∈Fλncndn‾=∑n∈Fcnλndn‾=⟨x,Sy⟩ because λn is real: S is symmetric. For x∈D(A) the sequence (λn⟨x,en⟩)n is square summable with ∑nλn2∣⟨x,en⟩∣2<∞, so its finite partial sums are Cauchy: ∥∑m≤M<Nλm⟨x,em⟩em∥2=∑M<m≤Nλm2∣⟨x,em⟩∣2→0 by [F1]; by completeness of H the series ∑nλn⟨x,en⟩en converges, its sum Ax satisfies ∥Ax∥2=∑nλn2∣⟨x,en⟩∣2 (the finite-subset net of squared norms has the same supremum), and A is linear because coefficient extraction is linear. If moreover x∈D0, then ⟨x,en⟩=0 for all but finitely many n and Ax=Sx; hence S⊆A.

1.3givenF1F2F4algebra

[S∗=A] Let y∈D(S∗) and w:=S∗y. For each n, λn⟨y,en⟩‾=⟨Sen,y⟩=⟨en,w⟩=⟨w,en⟩‾, so λn⟨y,en⟩=⟨w,en⟩. By [F1] applied to w, ∑nλn2∣⟨y,en⟩∣2=∑n∣⟨w,en⟩∣2=∥w∥2<∞, so y∈D(A); and ∑nλn⟨y,en⟩en=∑n⟨w,en⟩en=w by [F1], so S∗y=Ay. Hence S∗⊆A. Conversely let y∈D(A) and x=∑n∈Fcnen∈D0; then ⟨Sx,y⟩=∑n∈Fλncn⟨y,en⟩‾=⟨x,Ay⟩, so x↦⟨Sx,y⟩ is the restriction to the dense subspace D0 of the bounded functional ⟨ ⋅ ,Ay⟩ and is therefore bounded on (D0,∥⋅∥); by [F2] y∈D(S∗) and S∗y=Ay. Thus S∗=A.

2.1step 1.3F1F2F4algebra

[A is self-adjoint] Let z∈D(A∗) and v:=A∗z. For y∈D(A) the pairing ⟨Ay,z⟩=∑nλn⟨y,en⟩⟨z,en⟩‾ is absolutely convergent by [F4] and ∥Ay∥ ∥z∥. Testing y=em gives λm⟨em,z⟩=⟨Aem,z⟩=⟨em,v⟩, that is λm⟨z,em⟩=⟨v,em⟩. By [F1], ∑mλm2∣⟨z,em⟩∣2=∑m∣⟨v,em⟩∣2=∥v∥2<∞, so z∈D(A); and then Az=∑mλm⟨z,em⟩em=∑m⟨v,em⟩em=v=A∗z by [F1]. Hence D(A∗)⊆D(A); the reverse inclusion was proved in step 1.3 as A⊆S∗ with S∗=A, and directly: for z∈D(A) and y∈D(A), ⟨Ay,z⟩=∑nλn⟨y,en⟩⟨z,en⟩‾=⟨y,Az⟩ by absolute convergence and realness of λn, so z∈D(A∗) with A∗z=Az. Therefore A∗=A.

2.2step 1.2F1

[Graph core] Let x∈D(A) and xN:=∑n=0N⟨x,en⟩en∈D0⊆D(A). By [F1], ∥x−xN∥2=∑n>N∣⟨x,en⟩∣2→0, and by step 1.2, ∥Ax−AxN∥2=∑n>Nλn2∣⟨x,en⟩∣2→0 because the series converges. Thus (xN,AxN)→(x,Ax) in H⊕H; since x∈D(A) was arbitrary, D0 is dense in (D(A),∥⋅∥A), that is, D0 is a core for A.

3.1step 1.2step 1.3step 2.1F2F3

[Closure, essential self-adjointness and uniqueness] Since S is symmetric, [F2] makes S closable with symmetric closure S‾, and [F3] gives S‾=S∗∗. Since A=S∗ is the adjoint of a densely defined operator, A is closed by [F2]; as S⊆A, the least closed extension satisfies S‾⊆A. Conversely, for x∈D(A) step 1.2 supplies xN∈D0 with xN→x and SxN=AxN→Ax, so (x,Ax)∈Γ(S)‾=Γ(S‾) and A⊆S‾. Hence S‾=A, and S is essentially self-adjoint because S‾=A is self-adjoint. If T is any self-adjoint extension of S, then T is closed and contains S‾=A; since A is self-adjoint and A⊆T with T symmetric, [F2] forces T=A. So A is the unique self-adjoint extension of S.

4.1step 1.2F1F4∎

[Positivity and eigenvalues] For x∈D(A) the series ∑nλn∣⟨x,en⟩∣2 is absolutely convergent by [F4] and step 1.2: ∑n∣λn∣∣⟨x,en⟩∣2≤(∑nλn2∣⟨x,en⟩∣2)1/2(∑n∣⟨x,en⟩∣2)1/2<∞, and ⟨Ax,x⟩=∑nλn∣⟨x,en⟩∣2 by continuity of the inner product in the first argument applied to the convergent series of step 1.2. Since the λn are real the value is real, and λn≥c for all n gives ⟨Ax,x⟩≥c∥x∥2 by [F1]. Finally Aen=λnen directly from the definition of A and [F1], so each λn is an eigenvalue of A with eigenvector en≠0.

Depends on

Dependency tree · 2 levels

Sources