Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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 Vandermonde determinant for real moment-curve vectors

Statement

Let d≥1 be an integer, let t1,…,td be commuting indeterminates over R, and let Vd be the d×d matrix with (i,j) entry tji−1. Then det⁡Vd=∏1≤p<q≤d(tq−tp). Consequently, for any distinct real numbers s1,…,sd, the d vectors (1,sj,sj2,…,sjd−1)T,1≤j≤d, are linearly independent.

Facts & Assumptions

Given: d≥1, the polynomial ring P=R[t1,…,td], and the matrix Vd in the statement.

[F1]

R is a field, recursively adjoining one polynomial indeterminate to an integral domain again gives an integral domain, and the new indeterminate is the coefficient sequence supported in degree 1 (The reals form a field, Polynomial rings in finitely many commuting indeterminates by iteration, The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution, A polynomial ring over an integral domain is an integral domain). Iterating the domain fact gives that every coefficient ring R[t1,…,tn] is an integral domain.

[F3]

For a commutative coefficient ring C, a polynomial f(T)∈C[T] vanishes at a∈C exactly when T−a divides f (Factor theorem over a commutative ring); recursively applying the polynomial-ring universal property gives the ring homomorphism that evaluates all variables at real nodes (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism, Polynomial rings in finitely many commuting indeterminates by iteration).

[F4]

For every d×d real matrix, determinant nonzero is equivalent to invertibility, and invertibility is equivalent to trivial kernel of its matrix map (A finite square real matrix is invertible if and only if its determinant is nonzero, Invertible matrix theorem: invertibility, full pivot rank, RREF I, trivial nullspace and unique solvability are equivalent).

[F6]

Induction applies to natural-number-indexed constructions, including the recursive polynomial-ring construction and the finite sequence of root factors (The natural numbers N (von Neumann), The principle of mathematical induction).

Proof

Given: The assumptions and notation above.

1.1F1F6algebra

By induction on n, every iterated ring R[t1,…,tn] is an integral domain: the base R is a field, hence a domain, and the successor step is exactly [F1]. In each iteration the new indeterminate has coefficient 1 in degree 1, whereas every preceding indeterminate is embedded as a constant polynomial; since 1≠0 in R, all the tj are pairwise distinct.

1.2F1F6algebra

For d=1, Vd=[1] and the empty product is 1, so the formula holds. For the inductive step let d≥2 and suppose the formula holds in size d−1. Put C=R[t1,…,td−1] and T=td, so the recursive construction identifies R[t1,…,td]=C[T]. Regard Dd:=det⁡Vd as a polynomial f(T)∈C[T].

1.3F2F3algebra

The Leibniz expansion in [F2] shows that only powers T0,…,Td−1 occur in f, and that the coefficient of Td−1 is Dd−1:=det⁡Vd−1: precisely the terms with exponent d−1 in the last column are those permutations fixing the last row, and their remaining signed sum is the Leibniz determinant of Vd−1. For each j<d, substituting T=tj makes the last column equal column j, so alternation in [F2] gives f(tj)=0.

2.1F1F3F6step 1.1

The elements t1,…,td−1 are distinct in the domain C by step 1.1. Starting with f, apply [F3] successively at t1,…,td−1. At stage k, if f=(∏j<k(T−tj))gk, evaluation at tk gives 0=f(tk)=(∏j<k(tk−tj))gk(tk). Every factor tk−tj is nonzero, so their product is nonzero in the domain C; hence gk(tk)=0, and [F3] gives T−tk∣gk. Induction over these finitely many stages yields f(T)=g(T)∏j<d(T−tj) for some g(T)∈C[T].

3.1F1F6step 1.1step 1.2step 1.3step 2.1algebra

By the induction hypothesis, Dd−1=∏1≤p<q<d(tq−tp), which is nonzero because each difference is nonzero in the domain C. Thus the coefficient of Td−1 in f is nonzero. The product ∏j<d(T−tj) is monic of degree d−1. If g had any nonzero coefficient at a positive power, its highest such power times this monic product would give a nonzero coefficient of f above degree d−1, contradicting step 1.3. Therefore g is constant, and comparison of the Td−1 coefficients gives g=Dd−1. This proves Dd=Dd−1∏j<d(td−tj)=∏1≤p<q≤d(tq−tp). By induction the determinant formula holds for every d≥1.

4.1F3F4F5step 3.1algebra∎

For distinct real nodes s1,…,sd, the evaluation homomorphism in [F3] substitutes them into the formula and gives det⁡Vd(s1,…,sd)=∏p<q(sq−sp)≠0. By [F4], the square matrix with these moment-curve vectors as columns is invertible, hence has trivial coefficient kernel and linearly independent columns by [F5].

Depends on

Used by

Dependency tree · two levels

62 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