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.

Kummer recurrence and termination

Statement

Assume the Axiom of Countable Choice and the Axiom of Choice (The Axiom of Countable Choice (ACω), The Axiom of Choice). Let γ>0, l≥0, k>0, let Al be the radial operator of Transported radial endpoint realization, write j:=γ2k−l−1, and for a=2l+1 and n∈N0 let Ln(a)(x):=∑i=0n(−1)i(n+an−i)xii! be the n-th Laguerre polynomial of order a. Then:

(a) substitution. A C2 function u on (0,∞) satisfies −u′′+(l(l+1)/r2−γ/r)u=−k2u if and only if v(x):=ex/2x−(l+1)u(x/2k) is C2 and satisfies xv′′+(2l+2−x)v′+jv=0 on (0,∞);

(b) regular series. With v0:=1 and vi+1:=(i−j)vi(i+1)(i+2l+2)(i≥0), the power series v(x):=∑i≥0vixi converges for every x∈R and defines a solution of xv′′+(2l+2−x)v′+jv=0 on R;

(c) regular solution and general solution. The function ureg(r):=rl+1e−krv(2kr) is a C∞ solution of the radial equation on (0,∞) with ureg(r)/rl+1→1 as r↓0; it is, up to a nonzero scalar multiple, the only solution with u(r)/rl+1 bounded as r↓0; every solution of the radial equation on (0,∞) is c1ureg+c2u2 with u2 defined near zero by u2(r):=ureg(r)∫r∗rureg(s)−2ds, where 0<r∗<δ and ureg has no zero in (0,δ), and extended uniquely to (0,∞) by the regular initial-value equation, and every solution that is not a multiple of ureg has ∣u(r)∣/r unbounded as r↓0;

(d) termination. v is a polynomial if and only if j∈N0; in that case v is a nonzero constant multiple of Lj(2l+1), and ureg(r)=c rl+1e−krLj(2l+1)(2kr)(c≠0) lies in L2(0,∞;dr);

(e) eigenfunction. If j∈N0 then ureg∈D(Al) and Alureg=−k2ureg; equivalently, for every m the transported function ψ(rΩ):=ureg(r)Ylm(Ω)/r lies in H2(R3)∩D(C) and satisfies Cψ=−k2ψ.

The assertions are statements about the ordinary differential equation and the operators Al,C; no physical interpretation of γ,k or of any spectral level is made.

Facts & Assumptions

Given: The constants, radial operator, angular labels and choice hypotheses of the Statement. Inner products are linear in the first argument. All ordinary solutions considered below are complex-valued C2 functions on (0,∞).

[F1]

The endpoint supplier Transported radial endpoint realization defines Vl as the completion of Cc∞(0,∞) for the norm ∥u∥22+∥u′−u/r∥22+l(l+1)∥u/r∥22, and defines al(u,w)=∫[(u′−u/r)(w′−w/r)‾+l(l+1)uw‾/r2−γuw‾/r]. This is a bounded form on Vl. Its actual domain is D(Al)={u∈Vl:∃f∈L2, al(u,w)=⟨f,w⟩ ∀w∈Vl}, with Alu=f. Its exact block identity transports a single (l,m) entry in D(Al) into D(C)=H2(R3), for every allowed m. These claims currently carry both CC and AC; neither hypothesis is removed here.

[F2]

For continuous coefficients on a compact real interval, the regular IVP supplier Regular interval IVP: existence, a priori bound and entire spectral-parameter dependence gives a unique C2 solution with each specified pair of initial data. Translating [a,b] to [0,b−a] applies its Statement to every [a,b]⊂(0,∞). The supplier assumes Countable Choice.

[F5]

For a continuous scalar integrand on a compact interval, its primitive is continuously differentiable with derivative the integrand, and integration of a continuous derivative gives its endpoint difference (Fundamental theorem of calculus for Banach-valued continuous curves, applied to the Banach space C). This supplier assumes CC. Uniform convergence permits passage through the integral because the integral of the absolute error is bounded by interval length times the supremum error.

Proof

1.1F3givenalgebra

[Substitution without dividing by a solution] Put h(r)=rl+1e−kr and u=hφ. The multiplier h is smooth and nonzero for every r>0, so u↔φ preserves C2. Its derivatives satisfy h′/h=(l+1)/r−k and h′′/h=l(l+1)/r2−2k(l+1)/r+k2. The product rule gives the identity −u′′+[l(l+1)/r2−γ/r+k2]u=−h[φ′′+(2(l+1)/r−2k)φ′+(γ−2k(l+1))φ/r]. Therefore the radial equation is equivalent to rφ′′+(2l+2−2kr)φ′+(γ−2k(l+1))φ=0. Write φ(r)=v~(2kr): then φ′=2kv~′ and φ′′=(2k)2v~′′, and division by the nonzero scalar 2k gives xv~′′+(2l+2−x)v~′+jv~=0. The Statement's v(x)=ex/2x−(l+1)u(x/(2k)) equals (2k)−(l+1)v~(x); multiplication by this constant preserves the homogeneous equation. All transformations are reversible, including at zeros of u, and establish (a).

1.2F3F4F5givenalgebra

[Convergence with every differentiated series] Let b=2l+2 and B=max⁡{1,∣j∣/b}. The recurrence gives ∣vi+1∣≤B∣vi∣/(i+1) because i+∣j∣≤B(i+b). Induction from v0=1 yields ∣vi∣≤Bi/i!. For any derivative order q≥0 and R>0, the q-th formal derivative on ∣x∣≤R has absolute sum bounded by ∑i≥qBiRi−q/(i−q)!=BqeBR. Every differentiated series therefore converges uniformly on that compact interval. To justify differentiation explicitly, integrate the uniformly convergent first derivative series from 0 to x; the integral of its finite partial sums is the corresponding original partial sum minus its value at zero, and uniform convergence allows passage to the limit. The fundamental theorem for a continuous integrand proves the derivative identity. Repeating this for successive derivative series proves v∈C∞(R) with all asserted derivatives.

2.1step 1.2F4givenalgebra

[Coefficient equation] By step 1.2, substitution and collection of coefficients are legitimate. The coefficient of xi in xv′′+bv′−xv′+jv is (i+1)(i+b)vi+1+(j−i)vi for each i≥0, including i=0 because the xv′′ contribution then vanishes. The recurrence makes every coefficient zero; the equation thus holds for all real x. Conversely this same coefficient comparison shows that an analytic solution with constant coefficient 1 must have exactly this recurrence. This proves (b).

3.1step 1.2step 2.1F4givenalgebra

[Exact termination and polynomial normalization] If j∉N0, every factor i−j is nonzero, so all vi are nonzero. Such a series cannot be a polynomial: its i-th derivative at zero is i!vi by step 1.2. If j=n∈N0, the coefficients through vn are nonzero, vn+1=0, and the recurrence forces all later coefficients to vanish. For the stated Laguerre polynomial, ci=(−1)i(n+an−i)/i! has c0≠0 and ci+1/ci=(i−n)/[(i+1)(a+i+1)] for 0≤i<n, by the factorial identities in [F4]. Since a+i+1=i+2l+2, it has precisely the same recurrence and v=Ln(2l+1)/(n+2l+1n). Its leading coefficient is nonzero. Thus the polynomial and nonzero normalization claims in (d) follow.

3.2step 1.1step 1.2step 2.1F3givenalgebra

[The regular branch and a zero-free initial interval] The function u1=ureg=rl+1e−krv(2kr) is smooth on (0,∞) and solves the radial equation by steps 1.1 and 2.1. Since v(0)=1 and v is smooth, u1=rl+1(1+O(r)) as r↓0. It is real valued because the recurrence has real coefficients. Choose δ>0 so that u1(r)/rl+1>1/2 throughout (0,δ). Hence u1 has no zero there and has the required normalized endpoint limit.

4.1step 3.2F3F5givenconstructalgebra

[Local second solution and its exact leading asymptotic] Fix r∗∈(0,δ), put I(r)=∫r∗ru1(s)−2ds, and define u2=u1I only on (0,δ). Here I′=u1−2, so u2′=u1′I+u1−1, u2′′=u1′′I, and W(u1,u2):=u1u2′−u1′u2=1. Thus u2 solves the same equation and is independent of u1. Set p=2l+1>0. Since u1(s)−2/s−p−1→1, comparison between (1−η)s−p−1 and (1+η)s−p−1 below any sufficiently small fixed endpoint shows rp∫rr∗u1(s)−2ds→1/p: the integral above that endpoint is finite and disappears after multiplication by rp, while rp∫rts−p−1ds=(1−(r/t)p)/p. Letting η↓0 gives I(r)∼−r−p/p, hence u2(r)∼−r−l/(2l+1). In particular ∣u2∣/r→∞ and ∣u2∣/rl+1→∞, also when l=0.

4.2step 3.1step 3.2F1F3givenconstructalgebra

[Integrability and actual form-domain approximation] Suppose j∈N0. By step 3.1, u=u1 is a polynomial times rl+1e−kr. Near zero u=O(rl+1), u′=O(rl), u/r=O(rl); at infinity each is bounded by an exponential times a polynomial. Their squared integrals are finite: on (0,1) compare with r2l, while at infinity a polynomial times e−2kr is integrable, as follows by bounding each power using the exponential series or repeated integration by parts. Thus u,u′,u/r∈L2, and u has zero trace at zero. To show membership in the actual completion Vl, take smooth cutoffs ηε vanishing below ε, equal to one above 2ε, with ∣ηε′∣≤K/ε, and χR equal to one below R, vanishing above 2R, with ∣χR′∣≤K/R. The products uε,R=ηεχRu lie in Cc∞(0,∞). The omitted L2, derivative and u/r tails tend to zero; the added derivative at zero obeys ∥ηε′u∥22≤4K2∫02ε∣u/r∣2dr→0, and the added derivative at infinity obeys ∥χR′u∥22≤K2R−2∫R2R∣u∣2dr→0. Hence uε,R→u in Vl, for instance along ε=1/n, R=n. This proves (d)'s L2 claim and establishes u∈Vl.

5.1step 4.1F2givenconstructalgebra

[Global continuation across every node] Put q(r)=l(l+1)/r2−γ/r+k2, continuous on (0,∞). For n≥1 let Jn=[r∗/(n+1),(n+1)r∗]. Apply [F2] on each Jn to u′′=qu with initial data u2(r∗)=0, u2′(r∗)=u1(r∗)−1. The unique solutions agree on nested overlaps and with step 4.1 wherever the latter is defined, so their union is a C2 solution on ⋃nJn=(0,∞). No blowup at a finite positive node is possible because every such node lies inside one regular compact IVP interval. Differentiating the Wronskian gives W′=u1u2′′−u1′′u2=0, and its value at r∗ is 1, so W=1 globally. If u1(t)=0, then −u1′(t)u2(t)=1; this also shows that every such node is simple and the continued u2 is finite and nonzero there. The reciprocal integral of step 4.1 is never used across a node.

5.2step 3.2step 4.2F1F4givenalgebra

[Form eigenidentity and the full operator domain] For w∈Cc∞(0,∞) expand the kinetic integrand: (u′−u/r)(w′−w/r)‾=u′w′‾−u′w‾/r−uw′‾/r+uw‾/r2. The last three terms are −(uw‾/r)′ and have zero integral because w is compactly supported away from the endpoints. Therefore al(u,w)=∫[u′w′‾+l(l+1)uw‾/r2−γuw‾/r]=∫[−u′′+(l(l+1)/r2−γ/r)u]w‾=−k2⟨u,w⟩. Compact tests are dense in Vl by its definition, al is bounded by [F1], and w↦⟨u,w⟩ is continuous in its norm. The identity extends to every w∈Vl. The defining condition in [F1] gives u∈D(Al) and Alu=−k2u. For every allowed m, the family with sole nonzero (l,m) entry u has finite graph norm; the exact block identity gives ψ=uYlm/r∈D(C)=H2(R3) and Cψ=−k2ψ. Conversely that single-block domain identity gives the stated equivalence. This establishes (e).

6.1step 3.2step 4.1step 5.1F2givenalgebra

[Arbitrary solutions and endpoint uniqueness] At r∗ the initial-data matrix with columns (u1,u1′) and (u2,u2′) has determinant 1 by step 5.1. For any solution u, solve the invertible two-by-two linear system for c1,c2∈C matching (u(r∗),u′(r∗)). The IVP uniqueness of [F2] on the nested Jn gives u=c1u1+c2u2 everywhere. If c2≠0, the asymptotics in steps 3.2 and 4.1 give u(r)∼−c2r−l/(2l+1), since u1/u2→0. Hence ∣u∣/r→∞ and ∣u∣/rl+1→∞. If c2=0, the latter ratio is bounded, and every nonzero such solution is a nonzero scalar multiple of u1. This proves all of (c); the zero solution is included in the general linear representation.

7.1step 1.1step 1.2step 2.1step 3.1step 3.2step 4.1step 5.1step 6.1step 4.2step 5.2F1F2∎

[Conclusion and foundational use] Step 1.1 proves (a); steps 1.2 and 2.1 prove (b); steps 3.2, 4.1, 5.1 and 6.1 prove (c); steps 3.1 and 4.2 prove (d); and step 5.2 proves (e). CC is used through the regular IVP supplier in [F2]; the compact-interval extensions in step 5.1 themselves are uniquely determined, and the cutoff approximants in step 4.2 are explicit. The actual Coulomb operator premise in [F1] carries AC in its contract; that inherited assumption is retained, without relabeling it as CC-only.

Depends on

Dependency tree · 2 levels

Sources