Alphabeta Math
TheoremStatement: 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.

Hermite recurrence

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let L2=L2(R,dy) be the complex Lebesgue space with inner product ⟨φ,ψ⟩=∫Rφ(y)ψ(y)‾ dy linear in the first argument (The space Lp(μ) as the quotient by null functions, Complex Lp classes and Euclidean test-function conventions); this pairing makes L2 a complex Hilbert space by L2 with the integral pairing is a Hilbert space. For complex-valued functions, smoothness and derivatives use the componentwise convention of Complex Lp classes and Euclidean test-function conventions. Write g0 for the function g0(y):=π−1/4e−y2/2 and also for its class in L2. Put

P:={p g0: p∈C[y]}⊆L2,

the set of classes of polynomial multiples of g0. Each class in P has a unique representative of the form pg0: if pg0=qg0 almost everywhere, the continuous function (p−q)g0 vanishes almost everywhere and therefore everywhere, and g0(y)>0 for every y, so p=q. Let Y be multiplication by y and ∂y the derivative, acting on this unique smooth representative. Set g−1:=0 for use in the recurrence formulas at n=0. Define

a:=Y+∂y2,a†:=Y−∂y2,gn:=(a†)ng0n!(n∈N).

Then:

(a) g0∈L2 with ∥g0∥=1; more generally ykg0∈L2 for every k∈N, so P is a linear subspace of L2 all of whose members are represented by C∞ functions;

(b) Y,∂y,a,a† map P into P, and ∂y(pg0)=(p′−yp)g0 for every polynomial p;

(c) for all φ,ψ∈P, ⟨a†φ,ψ⟩=⟨φ,aψ⟩ and ⟨aφ,ψ⟩=⟨φ,a†ψ⟩;

(d) a†a−aa†=−I on P, i.e. [a,a†]=aa†−a†a=I on P, and ag0=0;

(e) for every n∈N: agn=n gn−1 (with ag0=0), a†gn=n+1 gn+1, a†agn=ngn and aa†gn=(n+1)gn;

(f) the polynomials

Hn(y):=(−1)ney2dndyne−y2

are polynomials of degree n with leading coefficient 2n, H0=1, H1(y)=2y, Hn(−y)=(−1)nHn(y), and they satisfy

Hn′=2nHn−1,Hn+1=2yHn−2nHn−1(n≥1);

moreover

gn=Hng02nn!;

(g) consequently

2 y gn=n gn−1+n+1 gn+1,2 gn′=n gn−1−n+1 gn+1.

Facts & Assumptions

Given: the space L2(R,dy) with its inner product; the function g0(y)=π−1/4e−y2/2; the space P of polynomial multiples of g0; the operators Y,∂y,a,a† and the vectors gn.

[F1]

L2 is a complex Hilbert space for ⟨f,g⟩=∫fg‾, with ∥f∥22=∫∣f∣2; the pairing is well defined on a.e. classes, positive definite, and satisfies ∣⟨f,g⟩∣≤∫∣fg∣≤∥f∥2∥g∥2 (The space Lp(μ) as the quotient by null functions, Complex Lp classes and Euclidean test-function conventions, L2 with the integral pairing is a Hilbert space, Cauchy-Schwarz inequality for L2).

[F2]

For t>0, the Lebesgue Gaussian transform at dimension n=1, frequency ξ=0 and parameter t/π gives ∫Re−ty2dy=π/t; every polynomial times a positive real Gaussian is absolutely integrable (Euclidean Gaussian transform with the 2π normalization). In particular ∫e−y2dy=π and ∫e−y2/2dy=2π.

[F3]

For t≥0 and k∈N one has tk≤2kk! et/2: by The complex exponential by its power series and The complex exponential series converges absolutely for every complex argument the exponential is the sum of the absolutely convergent series ∑j(t/2)j/j! with nonnegative terms, so et/2≥(t/2)k/k!.

[F5]

For every real x, ex>0 and e−x=1/ex (The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x)); the real exponential is strictly increasing (The exponential function is strictly increasing). The complex exponential extends the real one and satisfies ez+w=ezew for all z,w∈C (exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential).

[F6]

If F:[a,b]→R is differentiable at every point of [a,b] and F′ is integrable there, then ∫abF′=F(b)−F(a) (The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)); complex integration by parts on R is valid when both derivative products are in L1 and the product vanishes at both ends (Complex integration by parts on intervals and decaying lines). For φ,ψ∈P one has φ(y)ψ(y)‾→0 as ∣y∣→∞, because its modulus is bounded by C(1+y2k)e−y2 for some C>0 and k∈N; [F3] bounds this by C(1+2kk!)e−y2/2, which tends to zero since ey2/2≥1+y2/2 by the same nonnegative series and [F5].

Proof

1.1givenF1F2F3F5algebra

[The Gaussian moments and polynomial classes] If pg0=qg0 as L2 classes, (p−q)g0 is a continuous function that vanishes almost everywhere, hence vanishes everywhere; since g0>0, p=q. Thus the representative used to define Y and ∂y is unique, so these operators are well defined on P. By [F2], ∥g0∥2=π−1/2∫e−y2dλ=π−1/2π=1, so g0∈L2 and ∥g0∥=1. For k∈N and y∈R, ∣ykg0(y)∣2=π−1/2y2ke−y2≤π−1/22kk! e−y2/2 by [F3]; hence ∥ykg0∥2≤π−1/22kk!2π<∞ by [F2], so ykg0∈L2. Every pg0 with deg⁡p=m is a finite linear combination of y0g0,…,ymg0, so pg0∈L2: P⊆L2 is a linear subspace.

1.2givenF4F5algebra

[Invariance of P and ag0=0] For a complex polynomial p=p1+ip2 with real polynomials p1,p2, the real product and chain rules [F4] applied to p1g0 and p2g0 give ∂y(pg0)=(p′−yp)g0; Y(pg0)=(yp)g0 has polynomial factor yp. Thus both Y and ∂y, hence a=(Y+∂y)/2 and a†=(Y−∂y)/2, map P into P. Since g0′=−yg0 by [F4], (Y+∂y)g0=yg0+g0′=0, i.e. ag0=0. All members of P are represented by componentwise C∞ functions by [F4].

1.3givenF1F2F4F5F6algebra

[Adjoint pairing] Let φ,ψ∈P. They are componentwise C∞ by [F4], and φ′ψ‾ and φψ′‾ are polynomial multiples of e−y2, hence absolutely integrable by [F2]. Their product φψ‾ tends to zero at both ends by [F6]. Apply the whole-line complex integration-by-parts identity in [F6] to u=φ and v=ψ‾ to obtain ∫Rφ′ψ‾=−∫Rφψ′‾. Therefore ⟨a†φ,ψ⟩=2−1/2∫(yφ−φ′)ψ‾=2−1/2∫φyψ+ψ′‾=⟨φ,aψ⟩, since y is real and ψ′‾ is the derivative of ψ‾; the second identity follows by exchanging φ and ψ and conjugating.

1.4givenF4F5algebra

[Rodrigues polynomials] Define Hn(y):=(−1)ney2dndyne−y2; each Hn is a polynomial because differentiating e−y2 produces e−y2 times a polynomial, and H0=1, H1=2y. Put Fn:=ey2dndyne−y2, so Hn=(−1)nFn. By the product rule, Fn+1=ey2ddy(e−y2Fn)=−2yFn+Fn′, hence Hn+1=2yHn−Hn′. We prove Hn′=2nHn−1 for all n≥1 by strong induction: for n=1 this is H1′=2=2H0, and H2=4y2−2 gives H2′=8y=4H1. For n≥2, if it holds for all 1≤j≤n, then differentiating the displayed relation at n gives Hn+1′=2Hn+2yHn′−Hn′′, while the induction hypothesis gives Hn′=2nHn−1 and Hn′′=2nHn−1′=4n(n−1)Hn−2, and the same relation at n−1 reads Hn=2yHn−1−Hn−1′, so 2yHn−1=Hn+2(n−1)Hn−2; substituting, Hn+1′=2Hn+2n(Hn+2(n−1)Hn−2)−4n(n−1)Hn−2=2(n+1)Hn, which is the claim for n+1. Hence Hn′=2nHn−1 for all n≥1, and the displayed relation becomes the three-term recurrence Hn+1=2yHn−2nHn−1 for n≥1. Induction on this recurrence gives that Hn has degree n with leading coefficient 2n (the term 2yHn contributes 2⋅2n=2n+1 to yn+1 and −2nHn−1 only degree n−1) and that Hn(−y)=(−1)nHn(y), true for n=0,1 and inherited.

2.1step 1.2F4algebra

[Commutator] On any C∞ function φ, 2(aa†−a†a)=(Y+∂y)(Y−∂y)−(Y−∂y)(Y+∂y), and expanding with the product rule [F4] gives (Y+∂y)(Y−∂y)=Y2−Y∂y+∂yY−∂y2 and (Y−∂y)(Y+∂y)=Y2+Y∂y−∂yY−∂y2; subtracting gives 2(∂yY−Y∂y)=2I because ∂y(Yφ)−Y(∂yφ)=φ. Hence [a,a†]=I on P by step 1.2.

2.2step 1.2step 1.4F4algebra

[Identification of gn] We prove gn=Hng0/2nn! by induction on n. For n=0 this is g0=H0g0. Assume it holds for n; by step 1.2 and [F4], (Y−∂y)(Hng0)=(2yHn−Hn′)g0=Hn+1g0 by step 1.4, so gn+1=a†gn/n+1=(Y−∂y)Hng0/(2n+12nn!)=Hn+1g0/2n+1(n+1)!, which completes the induction.

3.1step 2.1step 1.2algebra

[Ladder relations] From [a,a†]=I on P we prove [a,(a†)n]=n(a†)n−1 on P for every n≥1: for n=1 this is step 2.1, and if it holds for n then [a,(a†)n+1]=[a,(a†)n]a†+(a†)n[a,a†]=n(a†)n−1a†+(a†)n=(n+1)(a†)n, all evaluated on P, which (a†)n and a preserve by step 1.2. Since ag0=0, for n≥1 we get agn=[a,(a†)n]g0/n!=n(a†)n−1g0/n!=n gn−1, while ag0=0; by definition a†gn=(a†)n+1g0/n!=n+1 gn+1 for every n, hence a†agn=n a†gn−1=ngn and, using aa†=a†a+I from step 2.1, aa†gn=(n+1)gn.

4.1step 3.1step 1.4step 2.2∎

[The y and ∂y actions] In the formulas containing gn−1 at n=0, set g−1:=0; this is the zero vector, so both formulas at n=0 are exactly the two ladder identities with ag0=0. Since Y=(a+a†)/2 and ∂y=(a−a†)/2 on P by the definitions, applying step 3.1 gives 2 ygn=agn+a†gn=n gn−1+n+1 gn+1 and 2 gn′=agn−a†gn=n gn−1−n+1 gn+1. All identities are in L2, where equalities mean equality of classes, and the underlying functions agree pointwise because both sides are represented by continuous functions; the polynomial identities of step 1.4 are pointwise identities of polynomials.

Depends on

Dependency tree · 2 levels

Sources