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.

Closed ladder domains

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, N={0,1,2,… }, be a complete orthonormal family of H (Orthonormal families, complete orthonormal systems and Hilbert bases), and for x∈H write cn:=⟨x,en⟩, so that x=∑ncnen and ∑n∣cn∣2=∥x∥2. Define

D(a):={x:∑nn∣cn∣2<∞},ax:=∑m≥0m+1 cm+1 em; D(a†):={x:∑n(n+1)∣cn∣2<∞},a†x:=∑m≥1m cm−1 em; D(N):={x:∑nn2∣cn∣2<∞},Nx:=∑nn cn en.

Then:

(a) a,a†,N are well-defined linear operators with the displayed domains; these domains contain the algebraic span D0=span⁡{en} and are dense in H; and ∥ax∥2=∑nn∣cn∣2, ∥a†x∥2=∑n(n+1)∣cn∣2, ∥Nx∥2=∑nn2∣cn∣2;

(b) a and a† are closed, densely defined operators with a∗=a† and (a†)∗=a;

(c) ker⁡a=Ce0 and ker⁡a†={0};

(d) D(aa†)=D(a†a)=D(N); on D(N) one has a†a=N and aa†=N+I, hence [a,a†]x=aa†x−a†ax=x for every x∈D(N); and D(N) is exactly the set of x∈H for which both a(a†x) and a†(ax) are defined;

(e) N is self-adjoint with Nen=nen and spectrum σ(N)=N (Diagonal spectrum), and for x∈D(N) the partial sums xM:=∑n≤Mcnen satisfy xM→x and NxM→Nx;

(f) if H=L2(R,dy) with the Hermite orthonormal family en=gn of Hermite recurrence, then the operators aP,aP†:P→P of that theorem are the restrictions of a,a† to P, and a and a† are exactly the closures of aP and aP†.

Facts & Assumptions

Given: a complex Hilbert space H, a complete orthonormal family (en), and the operators a,a†,N displayed above.

[F1]

⟨ei,ej⟩=δij, x=∑n⟨x,en⟩en with ∑n∣⟨x,en⟩∣2=∥x∥2 for every x∈H, and a series ∑nanen converges in H exactly when ∑n∣an∣2<∞, its sum then satisfying ∥∑nanen∥2=∑n∣an∣2 (Orthonormal families, complete orthonormal systems and Hilbert bases, Parseval equivalences for an orthonormal family).

[F2]

For a densely defined T: y∈D(T∗) exactly when x↦⟨Tx,y⟩ is bounded on (D(T),∥⋅∥), and then T∗y is the unique w with ⟨Tx,y⟩=⟨x,w⟩ for all x∈D(T); T∗ is closed; T is closed exactly when T=(T∗)∗ is an adjoint (Adjoint of a densely defined operator, The adjoint is well defined, closed, and reverses inclusions).

[F3]

∣⟨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).

[F4]

The self-adjoint diagonal operator of Diagonal adjoint and graph-core lemma with λn=n is precisely N on D(N), and its spectrum is the closure of {n:n∈N}=N (Diagonal spectrum).

[F5]

In the concrete case H=L2(R,dy) with en=gn, the operators aP,aP† of Hermite recurrence act on the finite expansions by aPgn=n gn−1 and aP†gn=n+1 gn+1, and P=span⁡{gn} (Hermite recurrence(e),(f)).

Proof

1.1givenF1F3algebra

[Well-definedness and densities] For x∈D(a) the coefficients m+1cm+1 are square summable with ∑m(m+1)∣cm+1∣2=∑n≥1n∣cn∣2<∞, so the series ax=∑mm+1cm+1em converges in H and ∥ax∥2=∑n≥1n∣cn∣2 by [F1]; the same computation gives the formulas for a†x and Nx. Linearity is coefficientwise. Every finite combination of the en lies in all three domains, and D0 is dense in H by [F1], so the three domains are dense.

1.2givenF1F2F3algebra

[a∗=a†] First let y∈D(a∗) and w:=a∗y. Testing the defining identity ⟨ax,y⟩=⟨x,w⟩ on x=em (m≥1) gives m ⟨y,em−1⟩‾=⟨w,em⟩‾, that is m⟨y,em−1⟩=⟨w,em⟩; hence ∑m≥1m∣⟨y,em−1⟩∣2=∑m≥1∣⟨w,em⟩∣2≤∥w∥2<∞; testing x=e0 gives ⟨e0,w⟩=0, hence ⟨w,e0⟩=0. Therefore y∈D(a†) and a†y=∑m≥1m⟨y,em−1⟩em=∑m≥1⟨w,em⟩em=w by [F1]. Thus a∗⊆a†. Conversely let y∈D(a†) and x∈D(a); then ⟨ax,y⟩=∑m≥0m+1cm+1dm‾ with dm=⟨y,em⟩, absolutely convergent by [F3] since ∑m(m+1)∣cm+1∣2=∥ax∥2<∞ and ∑m∣dm∣2=∥y∥2, and the same series equals ∑n≥1cnn dn−1‾=⟨x,a†y⟩; hence ∣⟨ax,y⟩∣=∣⟨x,a†y⟩∣≤∥x∥∥a†y∥, so the functional is bounded on (D(a),∥⋅∥), so y∈D(a∗) and a∗y=a†y. Therefore a∗=a†.

1.3givenF1F2F3algebra

[(a†)∗=a and closedness] Let y∈D((a†)∗) and w:=(a†)∗y; testing against x=em with m≥0 gives m+1⟨y,em+1⟩=⟨w,em⟩, so ∑m≥0(m+1)∣⟨y,em+1⟩∣2=∑m∣⟨w,em⟩∣2<∞, that is ∑n≥1n∣⟨y,en⟩∣2<∞; thus y∈D(a) and ay=∑n≥1n⟨y,en⟩en−1=∑m≥0⟨w,em⟩em=w. Conversely for y∈D(a) and x∈D(a†) the same two absolutely convergent series show ⟨a†x,y⟩=⟨x,ay⟩, so y∈D((a†)∗) with (a†)∗y=ay. Hence (a†)∗=a. Since a=(a†)∗ and a†=a∗ are adjoints of densely defined operators, [F2] makes both closed.

1.4givenF1algebra

[Kernels] If ax=0 then m+1cm+1=0 for all m, so cn=0 for n≥1 and x=c0e0; conversely ae0=0. If a†x=0 then m cm−1=0 for all m≥1, so cn=0 for all n and x=0.

1.5givenF1algebra

[Products, commutator and exact domain] For x=∑ncnen, membership in D(aa†) means ∑n(n+1)∣cn∣2<∞ and ∑m≥1m∣m cm−1∣2=∑n(n+1)2∣cn∣2<∞. The second condition implies the first, and, for x∈H, is equivalent to ∑nn2∣cn∣2<∞ since n2≤(n+1)2≤2n2+2. On this domain the coefficient of en in aa†x is (n+1)cn. Likewise x∈D(a†a) means ∑nn∣cn∣2<∞ and ∑m≥0(m+1)∣m+1cm+1∣2=∑n≥1n2∣cn∣2<∞; the latter implies the former, and the coefficient of en in a†ax is ncn, including zero at n=0. Hence both product domains equal D(N), a†a=N, aa†=N+I there, and [a,a†]x=x. Their common domain is exactly D(N).

2.1step 1.1F4

[(e) self-adjointness and spectrum] By [F4] the operator with domain D(N) and action Nen=nen is self-adjoint with spectrum N, and step 1.1 identifies it with the diagonal operator of [F4]. The partial-sum statement is the graph-core clause of Diagonal adjoint and graph-core lemma with λn=n.

3.1step 1.1step 1.3F5∎

[(f) closure of the concrete ladder] In the concrete case H=L2(R,dy), en=gn and P=span⁡{gn} by [F5]; on the finite expansion φ=∑n≤Mcngn the operator a of this lemma acts by aφ=∑m≤M−1m+1cm+1gm=aPφ, and similarly a†φ=aP†φ; hence aP⊆a and aP†⊆a†. Since a is closed by step 1.3 and aP⊆a, the closure satisfies aP‾⊆a. Conversely, for x∈D(a) the partial sums xM=∑n≤Mcngn∈P satisfy xM→x and aPxM=axM→ax by step 1.1, so (x,ax)∈Γ(aP)‾ and a⊆aP‾; hence a=aP‾, and the argument for a† is identical.

Depends on

Dependency tree · 2 levels

Sources