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.

The iterated radial-derivative identity behind the odd-dimensional reduction

Statement

Let k≥1 and let Dr:=r−1∂r be the radial derivative on (0,∞). For every f∈Ck+1((0,∞)), ∂2∂r2Drk−1(r2k−1f(r))=Drk−1[r2k−11r2k∂∂r(r2k∂rf(r))] on (0,∞). Both sides are finite combinations of derivatives of f computed by the product and quotient rules; no integral and no differential equation for f is used.

Facts & Assumptions

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

[F1]

Sums, products, quotients of differentiable functions are differentiable, with the usual sum, product, quotient rules; nonnegative integer powers are differentiated by repeated product rules, and reciprocals by the quotient rule on nonzero domains (Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0).

Proof

1.1F1given

Put g:=r2k−1f, so that g∈Ck+1((0,∞)) and f=r1−2kg. The left-hand side is ∂r2Drk−1g, and for the right-hand side the product rule gives r2k∂rf=(1−2k)g+rg′, hence r−1∂r(r2k∂rf)=g′′+(2−2k)r−1g′; since r2k−1r−2k=r−1, the right-hand side is Drk−1(g′′+(2−2k)r−1g′). It therefore suffices to prove ∂r2Drk−1g=Drk−1(g′′+(2−2k)r−1g′) for every g∈Ck+1((0,∞)), which is what the following steps do.

1.2F1algebra

On (0,∞) the operators satisfy ∂r=rDr, hence ∂r2=∂r(rDr)=Dr+r2Dr2; and for every j≥1 and every v∈Cj((0,∞)) one has Drj(r2v)=r2Drjv+2j Drj−1v. The last identity is proved by induction on j: for j=1, Dr(r2v)=r−1(2rv+r2v′)=2v+r2Drv; and if it holds for j, then Drj+1(r2v)=Dr(r2Drjv+2j Drj−1v)=r2Drj+1v+2Drjv+2j Drjv=r2Drj+1v+2(j+1)Drjv.

1.3F1algebra

Fix g∈Ck+1((0,∞)). If k=1, then Drk−1(r2Dr2g)=r2Dr2g=r2Drk+1g+2(k−1)Drkg directly; if k≥2, the second identity of the previous step with j=k−1 and v=Dr2g gives the same equality. Also g′′=∂r2g=Drg+r2Dr2g by the first identity of the previous step, so Drk−1g′′=Drkg+Drk−1(r2Dr2g)=r2Drk+1g+(2k−1)Drkg. Moreover r−1g′=Drg, so Drk−1((2−2k)r−1g′)=(2−2k)Drkg.

2.1F1algebra∎

Adding the two pieces of the previous step gives Drk−1(g′′+(2−2k)r−1g′)=r2Drk+1g+(2k−1+2−2k)Drkg=r2Drk+1g+Drkg, and by the first identity of the second step this last quantity is ∂r2Drk−1g. This proves the equivalent identity for g and hence, by the substitution of the first step, the identity of the statement.

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