Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 mass metric is symmetric, positive semidefinite, and positive definite exactly when the configuration differential is injective

Statement

Let N≥1, let Q be a smooth manifold, let X:Q→R3N be smooth, let m1,…,mN>0 and let Gq be the mass metric of Constrained configurations, the mass matrix and the mass metric.

  1. For every q∈Q the map Gq is a symmetric bilinear form on TqQ.
  2. Gq(u,u)=∑i=1Nmi∥dXq(u)i∥22≥0 for every u∈TqQ, so Gq is positive semidefinite.
  3. Gq is positive definite (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form) if and only if dXq is injective. In particular, if X is an immersion (Immersions, submersions, and constant-rank maps) then Gq is positive definite for every q.
  4. If b1,…,bn is an ordered basis of TqQ and A is the matrix whose j-th column is the coordinate vector of dXq(bj) in the standard basis of R3N, then the matrix of the bilinear form Gq in this basis is ATMA, with M the mass matrix.

Facts & Assumptions

Given: The data (Q,X,m1,…,mN) of Constrained configurations, the mass matrix and the mass metric, a point q∈Q, and an ordered basis b1,…,bn of TqQ for clause 4.

[L1]

The mass metric is Gq(u,v)=⟨dXq(u),MdXq(v)⟩3N, the differential is linear, and M(x1,…,xN)=(m1x1,…,mNxN) with mi>0 (Constrained configurations, the mass matrix and the mass metric).

[L2]

The Euclidean inner product satisfies ⟨x,x⟩=∥x∥22≥0, with equality only for x=0, and is bilinear (Real and complex inner product spaces, with the inner product linear in the first argument, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[L3]

Positive definiteness of a symmetric bilinear form means B(u,u)>0 for every u≠0 (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form).

Proof

technique · direct
1.1L1L2algebra

Bilinearity of Gq follows from linearity of dXq and of M together with bilinearity of the inner product [L1, L2]: for reals α,β and u,u′,v∈TqQ, Gq(αu+βu′,v)=αGq(u,v)+βGq(u′,v) and similarly in the second argument. Symmetry follows from symmetry of M: since M acts by x↦(m1x1,…,mNxN), ⟨a,Mb⟩3N=∑imi⟨ai,bi⟩2=⟨Ma,b⟩3N, so Gq(u,v)=Gq(v,u). This proves clause 1.

1.2L1L2algebra

For u∈TqQ write dXq(u)=(w1,…,wN) with wi∈R3; then [L1] and [L2] give Gq(u,u)=⟨dXq(u),MdXq(u)⟩3N=∑i=1Nmi⟨wi,wi⟩2=∑i=1Nmi∥wi∥22≥0. This proves clause 2.

2.1step 1.2L3algebra

Suppose dXq is injective and u≠0; then dXq(u)≠0, so some wi≠0, so ∥wi∥22>0 by [L2], and since mi>0 the sum in step 1.2 is strictly positive. Hence Gq(u,u)>0 for every u≠0. Conversely, if dXq is not injective, choose u≠0 with dXq(u)=0; then every wi=0, the sum in step 1.2 vanishes, and Gq is not positive definite by [L3]. This proves clause 3 for the injectivity criterion; if X is an immersion, dXq is injective at every q by definition, so Gq is positive definite.

3.1step 1.1L1L2algebra∎

In the basis b1,…,bn the matrix of Gq has entries Gq(bj,bk)=⟨dXq(bj),MdXq(bk)⟩3N. If A is the matrix whose j-th column is the coordinate vector of dXq(bj), then M(dXq(bk)) has coordinate vector MAek, and the inner product of coordinate vectors is the Euclidean product, so Gq(bj,bk)=(ATMA)jk. This proves clause 4.

Depends on

Dependency tree · 2 levels

Sources