Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Radial-derivative expansion of the Euler–Poisson–Darboux transform and its zero-radius limit

Statement

Let k≥1 and let Dr=r−1∂r on (0,∞). For every f∈Ck−1((0,∞)) there are real constants αk,j, 0≤j≤k−1, such that Drk−1(r2k−1f(r))=∑j=0k−1αk,j rj+1f(j)(r),αk,0=(2k−1)!!. Consequently, if the finite limit f(0):=lim⁡r↓0f(r) exists and each derivative f(j) with 1≤j≤k−1 is bounded on (0,1] (an empty condition when k=1) — in particular if f extends to a Ck−1 function on [0,∞) — then r−1Drk−1(r2k−1f)(r)⟶(2k−1)!! f(0)(r↓0). Every coefficient αk,0=(2k−1)!! is nonzero, so the transformed average recovers the value at r=0 with the exact dimensional constant. The limit assumption is needed even for k=1, when f(r)=sin⁡(1/r) is bounded but has no limit. Boundedness of the higher derivatives is also substantive: for k=2 the function f(r)=rsin⁡(r−2), which is continuous at 0, has rf′(r)=rsin⁡(r−2)−2r−1cos⁡(r−2) unbounded, and then r−1Dr(r3f) does not tend to 3f(0).

Facts & Assumptions

Given: an integer k≥1, a function f∈Ck−1((0,∞)), and the operator Dr=r−1∂r on (0,∞).

Proof

1.1F1given

Base case. For k=1 and f∈C0((0,∞)) one has Dr0(r2k−1f)=rf=α1,0 r1f(0) with α1,0=1=(2⋅1−1)!!; under the limit hypothesis, r−1Dr0(rf)=f(r)→f(0) as r↓0.

1.2given

Induction hypothesis. Fix k≥1 and assume that for every h∈Ck−1((0,∞)) there are real constants αk,0,…,αk,k−1 such that Drk−1(r2k−1h)=∑j=0k−1αk,jrj+1h(j) and αk,0=(2k−1)!!.

1.3F1algebra

Shape of the (k+1)-st transform. Let f∈Ck((0,∞)) and put h:=r2f, so that h∈Ck((0,∞))⊆Ck−1((0,∞)) and r2k+1f=r2k−1h. The induction hypothesis gives Drk−1(r2k+1f)=∑j=0k−1αk,jrj+1h(j), and the product rule gives h(j)=r2f(j)+2jrf(j−1)+j(j−1)f(j−2) for 0≤j≤k−1, where the last two terms are read as 0 for j=0 and j=1.

1.4F1algebra

Applying Dr once to the finitely many resulting terms, and using Dr(rmv)=mrm−2v+rm−1v′, produces a finite sum ∑i=0kβiri+1f(i) with constants βi independent of f: the term αk,jrj+1⋅r2f(j) contributes (j+3)αk,jrj+1f(j) and αk,jrj+2f(j+1); the term 2jαk,jrj+2f(j−1) contributes 2j(j+2)αk,jrjf(j−1) and 2jαk,jrj+1f(j); and the term j(j−1)αk,jrj+1f(j−2) contributes j(j−1)(j+1)αk,jrj−1f(j−2) and j(j−1)αk,jrjf(j−1). Every displayed monomial rmf(i) has m=i+1 with 0≤i≤k, and negative powers do not occur because the terms with j=0,1 have one or both of the last two summands read as zero.

1.5F1algebra

Leading coefficient. Evaluating the identity of the previous step at the constant function f≡1, which lies in Ck, gives β0r=Drk(r2k+1)=[(2k+1)(2k−1)⋯3]r=(2k+1)!! r: indeed Dr(r2k+1)=(2k+1)r2k−1, each further application of Dr lowers the exponent by 2 and multiplies the coefficient by the previous exponent, and k applications leave the exponent 1. Hence β0=(2k+1)!!, and setting αk+1,i:=βi for 0≤i≤k extends the conclusion of the induction hypothesis from k to k+1.

2.1givenalgebra∎

Conclusion. By the base case and the induction step, the expansion Drk−1(r2k−1f)=∑j=0k−1αk,jrj+1f(j) with αk,0=(2k−1)!! holds for every k≥1 and every f∈Ck−1((0,∞)). If f(0):=lim⁡r↓0f(r) is finite and each f(j) with 1≤j≤k−1 is bounded on (0,1], then dividing by r gives r−1Drk−1(r2k−1f)(r)=∑j=0k−1αk,jrjf(j)(r)→αk,0f(0)=(2k−1)!!f(0) as r↓0: the j=0 term converges by the assumed limit, and each term with j≥1 is bounded by ∣αk,j∣rjsup⁡(0,1]∣f(j)∣→0.

Depends on

Used by

Dependency tree · two levels

11 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources