For , the three point evaluation functionals at form a basis of the dual space of real polynomials of degree at most two. The displayed recovery formulas express the coordinate functionals, hence the dual basis to , as linear combinations of these evaluations. More generally distinct-node polynomial interpolation identifies values with coefficient data through an invertible Vandermonde matrix.
Cubic cardinal B-spline 2026-10-31
This degree-three Cardinal B-spline has support , is twice continuously differentiable, and has values at the consecutive integer knots. Their sum is one. Its truncated power function representation has coefficients whose first four moments vanish, making it zero after its final knot. Four knot intervals are the minimum possible compact support for a nonzero cubic spline: with fewer intervals the four moment constraints form a full-column-rank Vandermonde matrix. Translating and rescaling this function gives a local basis for cubic spline interpolation on a uniform mesh.
Take to be the kernel of a -row Vandermonde matrix on distinct coordinates. For each -set , intersects its coordinate subspace in dimension . Wedge a basis of that intersection: its coefficient on every -subset of is nonzero, because projection onto that subset is an isomorphism by independence of the complementary columns. Modulo the exterior power of , this gives a dependence involving every clique edge with nonzero coefficient. Strong saturation expresses every missing-edge vector in the span of present ones. Since all coordinate-edge vectors span the quotient, edge count is at least its dimension.
Fixed-degree polynomial limit Created 2026-10-14 Updated 2026-11-05
If polynomials of degree at most converge at distinct points, their coefficients converge, by invertibility of the Vandermonde matrix. Their limit is a polynomial of degree at most , and convergence is uniform on every compact subset of . Under convergence on compact sets, Rouché's theorem further locates a unique nearby zero for each simple root of the limit, for all sufficiently large indices. Finite initial polynomials need not have any root.
Generalized Vandermonde matrix Created 2026-10-25 Updated 2026-11-05
A generalized Vandermonde matrix evaluates a chosen list of functions at interpolation nodes . For a basis of polynomials of polynomial degree at most and distinct nodes, it is an invertible matrix by uniqueness of polynomial interpolation. Choosing monomials recovers the ordinary Vandermonde matrix.
Krylov dimension from spectral components Created 2026-10-14 Updated 2026-10-25
For a diagonalizable finite-dimensional operator, write with nonzero in distinct eigenspaces of eigenvalues . Then . The Vandermonde matrix of the first powers is invertible for distinct eigenvalues, so these powers span exactly the independent components . Thus the stabilized Krylov subspace dimension is . It counts distinct spectral components, not the number of nonzero coefficients in an arbitrary eigenbasis: , has Krylov dimension one. Equivalently it is the minimum number of eigenvectors needed when those vectors may be chosen freely.
Past exam of the applied complex variables course of the University of Oxford 2011 3 a Solution 2026-10-31
In the Laplace integral method for a differential equation, differentiate the integral three times with respect to , and replace by . Integration by parts givesThus the weight equation for this construction and its boundary condition arewhich giveThese are the conditions obtained by eliminating the transformed interior term and the endpoint term separately. As usual for this method, differentiation and integration by parts need convergence assumptions; the contours constructed next make every such step valid locally uniformly for all complex . A literal necessity claim for arbitrary weights and contours would additionally require uniqueness of the chosen representation by a Laplace integral; a null weight in a contour Laplace representation can otherwise be added without changing the solution.
LetThe quartic decay sectors for a contour integral contain the four rays . Along each ray, the quartic term is . For , choose to travel from infinity on ray to zero, and then from zero to infinity on ray . Set and defineOn any compact set of values, the integrand and each of its derivatives are bounded by a constant times for some . These bounds are integrable at infinity, so differentiation under the integral sign is justified and the functions are entire. The endpoint term vanishes at both infinite ends. There is no extra term at zero because the two pieces join with the same integrand value and opposite endpoint orientations. Therefore all three functions solve the differential equation.
Three independent Laplace integral contours joining rays in quartic decay sectors
. Details. To prove independence, evaluate their first three initial data. For ,If , these initial data give for . Define . ThenThe coefficient matrix is a Vandermonde matrix at four distinct fourth roots of , and hence is invertible. All vanish. There is also a concrete reason for the earlier qualification about necessity. Deform the incoming ray of to angle and its outgoing ray to angle , within their respective quartic decay sectors. The quartic integral is unchanged and remains nonzero. On this deformed contour, the extra entire weight contributes zero for every : throughout the closing wedge, , so the large closing arc tends to zero and the Cauchy integral theorem gives a zero integral. Thus represents the same entire solution and has vanishing endpoint terms, although it does not satisfy . The canonical weight equation is the standard sufficient construction, rather than an unconditional uniqueness assertion about contour representations.
Thus the three contours give linearly independent nonzero solutions, and they form a fundamental system of solutions for this third-order linear equation. This proves independence directly instead of inferring it merely from the presence of three different contours.
A piecewise cubic supported on has the truncated-power representation with indices . Vanishing for imposesafter expanding its cubic exterior polynomial; powers of cancel. For , the Vandermonde matrix columns are independent, forcing every coefficient to be zero. For , coefficients proportional to satisfy these conditions because a fourth finite difference annihilates cubics.
Normalize to get the Cardinal cubic B-splineAt its five support knots its values are , so their sum is one. Thus four intervals are necessary and sufficient.
For , the five translates active in the interior of are indexed . Write . Nodal interpolation givesAt the left endpoint the first derivatives of the three active functions are , and their second derivatives are . The two remaining equations areTogether these five equations form the requested system; insert if numerical coefficients are desired. The first, fourth and fifth determine the first three coefficients, and the other two then determine , so the system is nonsingular.
The source only assumes , which need not have either endpoint derivative. The Hermite conditions require those derivatives to exist, or to be supplied as separate interpolation data. The nodal conditions alone remain meaningful for every continuous .
A cubic spline that vanishes for and is twice continuously differentiable can be written using truncated power functions as . Vanishing for imposes the four moment equations for . Their Vandermonde matrix has rank , so a nonzero coefficient vector first exists at .
A normalized compact cubic cardinal B-spline isIt has nodal values at , so their sum is one. The alternating binomial coefficients meet the four moment equations, and the factor fixes the requested normalization.
For interpolation on , centre the translates as , with . Their restrictions form a basis for the cubic spline space on these knots. Write . The interpolation equations areThe recurrence determines all remaining coefficients after choosing , giving exactly two free parameters. The two natural cubic spline conditions becomebecause .
For uniqueness, take the difference of two candidates. It vanishes at every knot and has . Integrating by parts twice on each cubic piece gives : terms involving vanish at the knots, and those involving cancel at internal knots and vanish at the endpoints. Thus ; the remaining affine function vanishes at both endpoints and is zero. The square linear system for the coefficients is therefore nonsingular, giving existence as well as uniqueness of the natural cubic spline interpolant.
Past exam of the mathematics course of the University of Cambridge 2003 ib Paper 2 6E Solution Created 2026-09-24 Updated 2026-10-14
Associate to the polynomial . The th component of is exactly . If , this polynomial of degree at most has distinct roots. Repeated use of the factor theorem would make divide any nonzero such polynomial, contradicting its degree. Hence is the zero polynomial and all . The converse is immediate, proving .
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 13 3 b Solution Created 2026-10-03 Updated 2026-10-14
Let be the -uniform hypergraph and use strong saturation of a uniform hypergraph in its immediate-completion sense: each missing edge lies in an -set whose other -subsets are already edges of . The argument allows existing hypergraph cliques. Take , the usual parameter range; if , strong saturation forces every possible edge to be present, and the inequality is immediate whenever its binomial terms are defined. The case has the trivial lower bound zero.
For , choose distinct real numbers and form the Vandermonde matrix whose th column is . Every columns are linearly independent by the Vandermonde determinant. Set , so , and work in the quotient vector spaceHere the inclusion of is injective: extend a basis of to a basis of and use the resulting wedge bases of the exterior powers. Write for the image in of the coordinate wedge indexed by an -set . All these images span .
For any -set , let be its coordinate subspace. The restriction of has rank , so has dimension . Wedge a basis of this intersection to obtain a nonzero elementEvery coefficient is nonzero. Indeed, projection of onto the coordinates is an isomorphism: a vector in its kernel is supported on , whose columns of are independent. The coefficient is the determinant of that projection in the chosen bases. Passing to therefore gives a linear dependence
If is missing from , take its strong-saturation witness . The dependence expresses in the span of the for the other edges , all of which are present. Thus the vectors indexed by the present edges span all of . The exterior-power quotient bound for strong hypergraph saturation follows:The bound is sharp: include precisely the -sets meeting one fixed -set . A missing edge is disjoint from , and every other -subset of meets , so adding immediately completes a hypergraph clique of order . The number of included edges is exactly the displayed bound.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 70 2 iii Solution Created 2026-10-03 Updated 2026-10-14
Scale the equal intervals to unit length. A nonzero compactly supported cubic B-spline with maximum continuity is , so its fourth derivative is a sum of impulses at the knots. Equivalently it is a combination of truncated cubes,To vanish to the right of its support, the polynomial tail must be identically zero. Expanding that tail requires for . Four or fewer distinct knots give a full-rank Vandermonde matrix and only the zero solution. Hence a nonzero function requires at least five knots, or four intervals. At knots , the one-dimensional nullspace has coefficients proportional to . The unscaled combination integrates to six on , so unit-integral cardinal normalization gives:This is the Cardinal cubic B-spline, nonnegative with support . To obtain its cubic B-spline Bézier extraction, use local parameter on interval . The four power-form numerators, with a common divisor six, areFor , the cubic Bernstein basis coefficients are , , , . Applying this conversion givesEach scalar row describes a cubic Bézier curve graph piece with abscissa controls . The truncated-cube construction proves value, first- and second-derivative agreement at all joins, including the zero exterior. Minimum support and maximum continuity determine the basis up to a scalar; the displayed normalization fixes that remaining freedom.
Past exam of the mathematics course of the University of Cambridge 2005 ii Paper 2 38A Solution Created 2026-09-24 Updated 2026-10-14
For a finite-dimensional linear operator , the Krylov subspace isThese spaces are nested, so their dimensions are nondecreasing and can rise by at most one at each step. If , let be the first index for which is a linear combination of . The preceding vectors are independent. Multiplying that dependence by and repeatedly substituting shows every higher power also lies in their span. ThusSuch an index exists because the ambient space is finite-dimensional. If , the separate answer is for every , with .
For Krylov dimension from spectral components, when is diagonalizable, group the eigenvector expansion by distinct eigenvalues:where each is its nonzero component in a distinct eigenspace. Then . The vectors are independent, and the Vandermonde matrix is invertible because the eigenvalues are distinct. Hence the first powers span exactly , proving the stabilized dimension equals the number of distinct eigenspaces with nonzero component in . These themselves are eigenvectors, so this is also the minimum number of eigenvectors needed to represent when the eigenvectors may be chosen freely.
If the printed phrase instead means the count of nonzero coefficients in an arbitrary fixed eigenbasis, it is false with repeated eigenvalues. For example and use two vectors of that basis but have ; the vector itself is an eigenvector. For a simple spectrum there is no distinction. This qualification resolves the claim without assuming an unstated simple spectrum.
Past exam of the mathematics course of the University of Cambridge 2008 ib Paper 3 14E Solution Created 2026-09-24 Updated 2026-10-14
Rouché's theorem states that if are holomorphic on a neighborhood of a closed disc with boundary and on , then and have the same number of zeros in the disc, counted with multiplicity. More generally the conclusion holds for a simple closed contour whose interior lies in their domain. To prove it, set for . The strict boundary inequality ensures on . By the argument principle,is the integer number of zeros inside. The integrand is continuous in uniformly on , since its denominator is bounded away from zero on the compact product . Thus is continuous and integer-valued, so constant. This proves the theorem.
On , the term dominates the remaining terms because . Thus the polynomial has six zeros inside the unit circle. On , dominates because its modulus is , whereas the sum of the other bounds is . There are therefore nine zeros inside radius two. The strict inequalities exclude boundary zeros, so
For the fixed-degree polynomial limit, choose distinct complex nodes . Write , inserting zero coefficients if necessary. The vector of values at the nodes equals the fixed Vandermonde matrix times the coefficient vector. Its determinant is . Convergence of the values therefore implies coefficient convergence, say . For and a compact set with ,This proves that the given limit is a polynomial of degree at most without invoking any theorem about uniform limits of holomorphic functions.
When the limit has distinct roots, choose pairwise disjoint small closed discs around them, with no limit root on their boundaries. On each boundary has a positive minimum. Uniform convergence makes there for all sufficiently large , so Rouché's theorem puts exactly one root of in each disc. For every smaller disc about the same argument applies eventually. The unique root in the original disc must then lie in the smaller one, provingThe literal demand for a root at every initial index needs this finite-index qualification: , for satisfies the hypotheses with limit , but has no root. If every initial polynomial has a root, arbitrary choices at the finitely many exceptional indices extend the convergent sequences; otherwise the sequences necessarily start at an eventual index.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 69 4 b Solution Created 2026-10-03 Updated 2026-10-14
For a real continuous function , the Chebyshev alternation theorem asserts that a polynomial is a best uniform approximation exactly when either it is exact or its residual has ordered alternating extrema:Here means degree at most , as required for a linear subspace.
For sufficiency, if a polynomial perturbation violated the Kolmogorov criterion for uniform approximation, then at every displayed point. Thus would alternate signs, forcing a distinct zero in each of the intervals by the intermediate value theorem. A nonzero polynomial of degree at most cannot have that many zeros; the zero polynomial does not violate the criterion either.
For necessity, assume and no such alternating sequence exists. The two compact sets and are disjoint and, when both are nonempty, have positive separation. Hence the extremal set has finitely many successive sign runs: infinitely many alternations would contradict that separation on the bounded interval. If there are changes of sign between those runs, then selecting one point from each run gives an alternating sequence of length , so . Choose a point in the gap between each pair of consecutive opposite-sign runs, and setChoose the sign of so that agrees with on the first run. The roots lie outside the extremal set and each changes the sign, so at every extremal point. Since , this contradicts the Kolmogorov criterion for uniform approximation. Therefore a best polynomial must have the required alternation.
Existence also holds: a minimizing sequence has bounded supremum norms, hence bounded coefficients by evaluating at fixed distinct points and inverting the resulting Vandermonde matrix. A convergent subsequence of coefficients yields a minimizer. Finally, if and are both best, their average is best; at its alternating extrema both individual residuals must equal the same extremal value. Consequently has at least zeros and is identically zero. The best polynomial exists, is unique, and is characterized by alternation.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 1 i Solution Created 2026-10-03 Updated 2026-10-07
Let . It is an alternating polynomial: exchanging two variables exchanges two rows of the Vandermonde matrix and reverses its determinant. Hence vanishes whenever , so each factor divides it. The distinct linear factors are pairwise coprime polynomials, and their product therefore divides . Both have total degree , soThe coefficient of in the determinant is , by expansion along its last row. The same coefficient in the product is . Thus , and . Consequently the Vandermonde determinant identity isThis is a polynomial identity, including repeated coordinates; no division by a possibly zero numerical Vandermonde product is needed.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 69 4 c Solution Created 2026-10-03 Updated 2026-10-06
Fix the degree bound . Existence can be proved without a general uniqueness theorem: a minimizing sequence in is uniformly bounded because its distances from are bounded. Values at any fixed distinct points determine its coefficients through an invertible Vandermonde matrix, so those coefficients are bounded. A convergent subsequence supplies a polynomial attaining the minimum.
For uniqueness of best uniform polynomial approximation, suppose and attain the same minimum , and let . The triangle inequality makes another minimizer. If , both polynomials equal , so assume . Put and . At each , the two real errors and lie in and their average equals an endpoint. Hence they are equal there, and .
The set must contain at least points. Otherwise interpolate the values on its at most points by a polynomial . Then on . Continuity gives this positivity on a neighbourhood of , while the error has a strict gap below on the compact complement. A sufficiently small positive multiple of decreases the maximum error, contradicting optimality of . This is an elementary perturbation argument, not an appeal to Haar's theorem.
Thus has at least distinct zeros. A polynomial of degree at most with that many zeros is identically zero. The best uniform polynomial is unique for every fixed degree bound: .
Past exam of the mathematics course of the University of Cambridge 2015 ii Paper 4 37E a ii Solution Created 2026-09-24 Updated 2026-10-06
Let the distinct eigenvalues be . Distinct-eigenvalue eigenvectors are independent. A relation becomes , with . Since every , it requires for every . No nonzero polynomial of degree below has that many distinct roots. Thus the first powers are independent, while gives the next dependence. Hence . Equivalently the coefficients of these powers form a full-rank Vandermonde matrix through this index.
The coefficient matrix is a Vandermonde matrix, with determinantTherefore a nonzero solution exists exactly whenFor example if , the first two columns are equal and is a solution. If exactly two parameters agree, the distinct remaining column is independent of the repeated one, so the kernel has dimension one. If all three agree, only remains, giving a two-dimensional kernel.
Clearing the denominators in the rational interpolation conditions givesThese are linear equations for unknowns. The th row of the coefficient matrix, in the order , isThis rational interpolation linearization is equivalent to the original fraction conditions only if at every interpolation node. If , the cleared equation merely forces , leaving the fraction undefined.
For , the coefficient row becomesThis is the Vandermonde matrix, whose determinant is . Equivalently, a vector in its null space would define a degree-at-most- polynomial vanishing at all distinct interpolation nodes, which is zero by the preceding uniqueness proof. Thus the cleared linear system has exactly one solution.
There is also a constructive description of that solution. Define the monic polynomialThe polynomial is monic of degree and vanishes at every interpolation node. It must therefore equal . By polynomial division, write uniquelyThe quotient is monic of degree , andis the unique coefficient solution. This does not assert that is nonzero at every interpolation node.
For a counterexample with , , choose and the specified data , so . The cleared equations reduce togiving the unique solution , . But at the quotient is . Indeed, any genuine rational interpolant of this prescribed form would need ; then forces the constant numerator to be zero. At a nonzero denominator its value at would also be zero, never one. Cancelling the common factor in the cleared candidate would merely give the identically zero rational function, which still fails the data. Hence
