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.

Centre of mass, the identity ∑imiρi=0, and the splitting of the kinetic sum ∑imi∥xi′∥22 into centre-of-mass and relative parts (with the two-body reduced-mass case)

Statement

Let N∈N, N≥1, let I⊆R be an interval with at least two points (Intervals of R: the nine order-convex forms, nondegeneracy, and length), let m1,…,mN>0 and let xi:I→R3 be differentiable at every point of I (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral). All sums over i range over 1,…,N: for a real family a1,…,aN, define ∑iai:=∑k<Nbk, where b:N→R has bk=ak+1 for k<N and bk=0 for k≥N, using the finite sums of Laws of finite sums and finite products; vector sums are defined coordinatewise, and sums of curves pointwise. Put M:=∑imi>0, X:=M−1∑imixi and ρi:=xi−X. The symbols ⟨⋅,⋅⟩ and ∥⋅∥2 denote the Euclidean inner product and norm on R3 (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn). Then:

  1. X and every ρi are differentiable on I, with X′=M−1∑imixi′ and ρi′=xi′−X′, and the identities ∑imiρi=0 and ∑imiρi′=0 hold on I;
  2. for every t∈I, ∑imi∥xi′(t)∥22=M∥X′(t)∥22+∑imi∥ρi′(t)∥22;
  3. if N=2, then with r:=x1−x2 and μ:=m1m2/M one has ∑imi∥ρi′(t)∥22=μ∥r′(t)∥22 and hence ∑imi∥xi′(t)∥22=M∥X′(t)∥22+μ∥r′(t)∥22 for every t∈I.

Facts & Assumptions

Given: A natural N≥1, an interval I⊆R with at least two points, positive reals m1,…,mN and curves xi:I→R3 differentiable at every point of I.

[L1]

If f,g:I→Rm are differentiable at t and μ∈R, then f+g and μf are differentiable at t with (f+g)′(t)=f′(t)+g′(t) and (μf)′(t)=μf′(t); a vector-valued function is differentiable exactly when all its components are (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral).

[L2]

The Euclidean inner product is bilinear and symmetric, ⟨u,w⟩=∑k<3ukwk, and ∥u∥22=⟨u,u⟩ (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[L3]

Under the statement's shifted indexing convention, additivity and scaling in Laws of finite sums and finite products clauses 1–2 give ∑i(αai+βbi)=α∑iai+β∑ibi for real families and, by applying those scalar laws to each coordinate, vector families. Clause 4 also gives ∑iai≥aj for every 1≤j≤N when all ai≥0.

Proof

technique · direct
1.1givenL1L3

Since N≥1 and all masses are positive, [L3] gives M≥m1>0, so M−1 is defined. Each xi is differentiable on I, so repeated application of [L1] makes the finite sum ∑imixi and its scalar multiple X=M−1∑imixi differentiable on I with X′=M−1∑imixi′, and then every ρi=xi−X is differentiable on I with ρi′=xi′−X′.

2.1step 1.1L1L3algebra

Using the definition of X and [L3], ∑imiρi=∑imixi−MX=∑imixi−∑imixi=0 on I; differentiating this identity through the sum formula of step 1.1 gives ∑imiρi′=0 on I.

3.1step 2.1L2L3algebra

For every t∈I, substituting xi′=X′+ρi′ and expanding with bilinearity and symmetry [L2], ∑imi∥xi′∥22=∑imi(∥X′∥22+2⟨X′,ρi′⟩+∥ρi′∥22)=M∥X′∥22+2⟨X′,∑imiρi′⟩+∑imi∥ρi′∥22, and the middle term vanishes by step 2.1; this is clause 2.

4.1step 3.1L1L2L3algebra∎

Let N=2. From the definitions, X=m1x1+m2x2M and r=x1−x2, so ρ1=x1−X=Mx1−m1x1−m2x2M=m2Mr and ρ2=x2−X=Mx2−m1x1−m2x2M=−m1Mr; differentiating by [L1] and expanding squared norms by [L2] gives ∑imi∥ρi′∥22=(m1m22+m2m12M2)∥r′∥22=m1m2(m1+m2)M2∥r′∥22=μ∥r′∥22, because M=m1+m2. Substitution into clause 2 gives clause 3.

Depends on

Dependency tree · 2 levels

Sources