Multiplication by the displayed Vandermonde matrix maps the coefficient vector of a polynomial of degree at most to its vector of values at the nodes. Part (a) proves that every vector of node values is attained uniquely, so this square linear map is bijective. Therefore is invertible. Equivalently, a kernel vector would define a polynomial of degree at most with distinct roots and would have to vanish.
Multiplying the Vandermonde matrix by a coefficient vector evaluates the polynomial at all nodes. If the result is zero, part (a)'s uniqueness for the zero interpolation data forces every coefficient to be zero. Thus the square matrix has trivial kernel and is invertible. Equivalently the interpolation map is a linear bijection between two spaces of dimension .
Perfect secrecy of Shamir's threshold scheme Created 2026-09-29 Updated 2026-11-05
In Shamir's secret sharing, observing any shares leaves the secret's prior distribution unchanged. In particular, the posterior distribution is uniform if the prior distribution was uniform; uniformity of the secret is not required for perfect secrecy.
To prove this, fix distinct nonzero evaluation points and a candidate secret . The evaluations impose independent linear equations on the random coefficients. The evaluation matrix has rank : its first columns form a Vandermonde matrix multiplied by a nonsingular diagonal matrix of nonzero evaluation points. Every observed share tuple therefore has exactly compatible coefficient tuples. Since the coefficients were independently uniform, its conditional probability isindependent of . Thus the shares and the secret are independent random variables, which proves perfect secrecy.[ref]
How to Share a Secret by Adi Shamir. Pages 612–613: interpolation argument for fewer than the threshold number of shares
Quartic decay sectors for a contour integral 2026-10-31
For a contour integral with factor , the quartic term dominates the linear term on rays at large radius. Writing gives real part for the leading exponent. There are four decay sectors, centered at and each of angular width . On a closed subsector the integrand and all its derivatives decay faster than any exponential in , locally uniformly in . Contours joining two such sectors therefore allow differentiation under the integral sign and have vanishing infinite endpoint terms. Distinct geometric contours still need an independence proof; their initial moments often give a Vandermonde matrix calculation.
Rational interpolation linearization 2026-10-25
For rational interpolation with and a monic denominator , multiplying through gives the linear systemThese equations are equivalent to the fraction conditions only when all are nonzero. If and , the coefficient matrix is the Vandermonde matrix with rows , so distinct interpolation nodes give a unique coefficient solution. More constructively, divide by as , . Then , , since is the unique monic degree- polynomial vanishing at all the interpolation nodes. The quotient may vanish at a node, so unique solvability of this linear system does not prove existence of a rational interpolant.
Zero power sums force a finite complex multiset to vanish Created 2026-10-14 Updated 2026-11-05
Collect the distinct nonzero values among the as with positive multiplicities . The first power sums imply for . The coefficient matrix is an invertible weighted Vandermonde matrix, so all vanish, a contradiction unless . Its invertibility also follows because a polynomial vanishing at zero and all the has distinct roots and degree at most .