Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adapted
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 radial composite x↦u(∣x∣) on an annulus: Ck regularity and ∇(u∘∣⋅∣)(x)=u′(∣x∣) x/∣x∣

Statement

Let J0⊆(0,∞) be an open interval (Intervals of R: the nine order-convex forms, nondegeneracy, and length), let u:J0→R be of class Ck for some k≥1 (Ck Euclidean maps and diffeomorphisms), and put A:={ x∈R3:∣x∣∈J0 },∣x∣:=∥x∥2=⟨x,x⟩, the Euclidean norm of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn. Then:

  1. A is open in R3 and 0∉A;
  2. the function N:A→(0,∞), N(x):=∣x∣, is of class C∞ on A; it is totally differentiable at every x∈A (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder) with DN(x)h=⟨x,h⟩∣x∣(h∈R3),so∇N(x)=x∣x∣ (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case);
  3. the radial composite U:=u∘N:A→R, U(x)=u(∣x∣), is of class Ck on A and totally differentiable at every x∈A with DU(x)h=u′(∣x∣) ⟨x,h⟩∣x∣=⟨u′(∣x∣)x∣x∣, h⟩(h∈R3), that is, ∇U(x)=u′(∣x∣) x/∣x∣.

Facts & Assumptions

Given: The open interval J0⊆(0,∞), the Ck function u:J0→R with k≥1, the domain A={x∈R3:∣x∣∈J0}, and the maps N, U of the statement.

[L1]

The Euclidean norm: ∣x∣2=⟨x,x⟩; it vanishes only at x=0, is nonnegative everywhere, satisfies the triangle inequality ∣x+y∣≤∣x∣+∣y∣, and ∣λx∣=∣λ∣ ∣x∣ (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, The induced length is a norm).

[L2]

Reverse triangle inequality: ∣∣x∣−∣y∣∣≤∣x−y∣ (The reverse triangle inequality in a normed space).

[L4]

Chain rule and total derivatives: a composite of totally differentiable maps is totally differentiable with the composed derivative (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)); the total derivative of a scalar-valued map at a point is the row (Dejf(a))j of directional derivatives, so on R it is multiplication by the ordinary derivative (A total derivative computes every directional derivative, and its matrix is the Jacobian, Directional derivatives and partial derivatives of a map U⊆Rm→Rn, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case); a map whose first partial derivatives exist near a point and are continuous there is totally differentiable there (If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative); and for a totally differentiable scalar field Dvf(a)=⟨∇f(a),v⟩ (For a differentiable scalar field, Dvf(a)=⟨∇f(a),v⟩ and the unit direction of steepest ascent is the normalized gradient).

[L5]

Ck closure: finite componentwise sums, products and scalar multiples of Ck Euclidean maps are Ck, and a composite of composable Ck Euclidean maps is Ck; a map is C∞ when it is Ck for every k (Ck Euclidean maps are closed under componentwise algebra and composition, Ck Euclidean maps and diffeomorphisms, Ck maps and multi-index derivative notation in Euclidean space).

[L6]

Real powers: x↦xα is continuous and differentiable on (0,∞) with derivative αxα−1 (Continuity and derivatives of positive-base real powers, Real powers for positive bases, with the zero-base positive-exponent convention).

[L7]

Induction principle for the statement "for every natural m" (The principle of mathematical induction).

Proof

technique · direct
1.1givenL1L2algebra

The norm is continuous on R3 by the reverse triangle inequality [L2], so A, the preimage of the open set J0 under N, is open; and N(0)=0∉J0 gives 0∉A. This is clause 1.

1.2givenL1algebra

Fix x∈A and h∈R3 with x+h∈A. By bilinearity, symmetry and [L1], ∣x+h∣2−∣x∣2=2⟨x,h⟩+∣h∣2, and therefore ∣x+h∣−∣x∣=(2⟨x,h⟩+∣h∣2)/(∣x+h∣+∣x∣), the denominator being at least ∣x∣>0.

2.1step 1.2L1L2L3algebra

Remainder estimate at x: subtracting ⟨x,h⟩/∣x∣ from step 1.2 and putting over the common denominator ∣x∣(∣x+h∣+∣x∣) gives ∣∣x+h∣−∣x∣−⟨x,h⟩∣x∣∣≤∣x∣ ∣h∣2+∣⟨x,h⟩∣ ∣∣x∣−∣x+h∣∣∣x∣ (∣x+h∣+∣x∣)≤2∣h∣2∣x∣, where [L3] bounds the first numerator term by ∣x∣∣h∣2, [L2] bounds the second by ∣x∣∣h∣⋅∣h∣, and the denominator is at least ∣x∣2. Hence the normalized remainder tends to 0 as h→0: N is totally differentiable at x with DN(x)h=⟨x,h⟩/∣x∣.

3.1step 2.1L4L5algebra

The representing vector: for every v, [L4] gives DvN(x)=DN(x)v=⟨x,v⟩/∣x∣=⟨x/∣x∣,v⟩; comparing with DvN(x)=⟨∇N(x),v⟩ and taking v over the standard basis shows ∇N(x)=x/∣x∣. In particular every first partial derivative of N agrees on A with a component of x/∣x∣ and is continuous, so N is C1 by Ck Euclidean maps and diffeomorphisms.

3.2step 2.1L4algebra

Chain rule for the composite U=u∘N: u is Ck hence totally differentiable, N is totally differentiable at every point of A by step 2.1, and the domains compose, so [L4] gives DU(x)=Du(N(x))∘DN(x); and DU(x)h=u′(∣x∣)⋅DN(x)h=u′(∣x∣)⟨x,h⟩/∣x∣ because the total derivative of the real function u at t is multiplication by u′(t) by [L4]. This is the displayed formula for DU.

4.1step 3.1L5L6L7algebra

The induction on smoothness: the base case m=1 is step 3.1. Assume m≥1 and N∈Cm(A). The map t↦t−1 is C∞ on (0,∞) by [L6] with α=−1 iterated, so x↦1/∣x∣ is Cm on A as the composite t↦t−1 after N. The coordinate maps x↦xj are the components of the identity, whose partial derivatives are the constants δjk; they are therefore C∞, hence Cm, by Ck Euclidean maps and diffeomorphisms and Directional derivatives and partial derivatives of a map U⊆Rm→Rn. So ∇N(x)=x/∣x∣, a finite product of Cm maps, is Cm; since a map is Cm+1 exactly when its first partial derivatives are Cm (Ck maps and multi-index derivative notation in Euclidean space), N is Cm+1. By induction [L7], N∈Cm(A) for every m, that is N∈C∞(A). This completes clause 2.

5.1step 3.1step 3.2L4L5algebra∎

The gradient and the regularity: the display of step 3.2 writes DU(x) as the linear map h↦⟨u′(∣x∣)x/∣x∣,h⟩, so ∇U(x)=u′(∣x∣)x/∣x∣ by the same uniqueness argument as step 3.1; and U, a composite of the Ck maps u and N (Ck Euclidean maps and diffeomorphisms), is Ck on A by [L5]. This is clause 3 and completes the proof.

Remarks

  • Why the annulus. The proof uses ∣x∣≥c>0 only through the open interval J0⊆(0,∞); on a domain meeting the origin the norm is not differentiable there and the radial composite need not be. The collision-excluded configuration domains of the two-body model are exactly annuli of this shape.

  • The inverse-square instance. For u(ρ)=−κ/ρ with κ>0 on J0=(0,∞), clause 3 gives ∇U(x)=κx/∣x∣3, so the potential U(x)=−κ/∣x∣ presents the attractive inverse-square force −kx/∣x∣3 with k=κ, the form used by the gravitational model of this batch.

Depends on

Dependency tree · 2 levels

Sources