Resultant Created 2026-09-24 Updated 2026-10-18
The resultant turns a shared-root of a polynomial question into a calculation using only coefficients. For nonconstant univariate polynomials over a field , with their actual polynomial degrees , define
where is the Sylvester matrix. Then
Here is an algebraic closure. The common root need not lie in : two real polynomials may share a nonreal complex root. The subscript identifies which variable is eliminated.[ref]
The useful surprise is that a determinant detects a shared root of a polynomial without first finding either list of roots of a polynomial. If the coefficients depend on a parameter, the resultant itself is a polynomial in that parameter. Its zeros pick out possible exceptional parameter values. Elimination theory uses this to reduce a pair of polynomial equations in two variables to a single necessary equation in one variable; eliminating a variable with a resultant gives an exact example below.
A nonzero resultant also supplies a certificate that and are coprime polynomials. The Sylvester matrix then solves for polynomials satisfying , a Bézout's identity for polynomials. Evaluating such an identity at a hypothetical common root would give .
Exact reconstruction does not promise that small errors in power sums produce proportionally small errors in individual polynomial roots. For two roots, let and . Newton's identities give and , so the monic polynomial is . Its polynomial roots are . A zero value of gives a multiple root; positive splits it into two real roots, and negative splits it into a complex-conjugate pair.
With , the second power sum changes by while each polynomial root moves by . The ratio grows without bound as tends to zero. Thus coefficients can stay close while individual root locations are more sensitive. This is a reason to distinguish recovering coefficients by Newton's identities from subsequently approximating the polynomial roots.
The rounded Bernstein polynomial replaces each coefficient in the unnormalized basis by its floor function. It therefore has integer coefficients in the ordinary monomial basis. If , only interior rounding errors remain and
To prove this, bound each interior rounding error by one. On , sum the resulting powers as a geometric series of ratio at most and maximize ; reflect for . On the middle interval each degree- product is at most . integer endpoints are necessary for this convergence: a noninteger endpoint produces a fixed nonzero rounding error there.
Serre spectral sequence Created 2026-09-24 Updated 2026-11-05
For a Serre fibration over a path-connected CW complex, the cohomological Serre spectral sequence starts with
The fibre cohomology groups form a local coefficient system through the fundamental group action. For a simply connected base, it is constant. The stable terms are successive quotients of a finite filtration of each ; reconstructing the cohomology groups can require solving group extensions. With commutative ring coefficients, the cup product makes the construction multiplicative.[ref]
For the Hopf fibration with integer coefficients, the only nonzero positions on are , each a copy of . Since , the map must be an isomorphism. The survivors at and give the cohomology in degrees zero and three. This example shows how twisting changes the answer from the cohomology of a Cartesian product.
For finite real numbers , a Givens rotation that annihilates is defined mathematically by
Here hypot means an evaluation of the Euclidean norm of designed to avoid unnecessary range failures in floating-point arithmetic. The zero case selects the identity matrix, avoiding division by zero. If , then ; if , then . Thus the retained component is nonnegative, including when . In exact arithmetic, and .
Computing the square root of a*a + b*b directly can fail even when the final norm is representable. In binary64 floating-point arithmetic, makes the squares overflow, whereas is finite. With the squares round to zero, although is representable. A range-safe hypot avoids these intermediate failures.
The simple divisions still need care when is a subnormal number: rounding can cause large relative errors. For the smallest positive binary64 subnormal number , taking rounds to ; dividing by that rounded value gives , which is not an orthogonal matrix. For nonzero finite inputs, compute the coefficients before rescaling the norm:
At least one scaled component has absolute value one, and . This construction keeps the coefficients meaningful even when rounding is severe. It cannot make an unrepresentably large finite, preserve an arbitrarily tiny against underflow, or repair inputs already rounded to zero. The row updates themselves can also overflow if their exact results exceed the available range.
LAPACK's DLARTG uses scaling for numerical stability but a different sign convention: for it chooses and ; for it returns . Its block still has the lower-left minus sign. Do not combine its returned coefficients with an assumed nonnegative .[ref]
Sylvester matrix Created 2026-10-14 Updated 2026-10-18
For polynomials of polynomial degrees , the Sylvester matrix has shifted coefficient rows of followed by shifted rows of , using descending-power order. It is a square matrix of size . Its transpose represents the linear map with , ; its determinant is the resultant.
For an original parameter example, choose and . Then
The two lists of coefficients become three rows because is multiplied by both and . Thus the common-root parameter values are and . At , the resultant is , so the two polynomials have no common root.
Figure 1.
A Sylvester matrix tests when a moving root of a polynomial coincides with a fixed one
. Original example , . Left: the vertical dashed line marks the root of a polynomial of ; it does not make zero. Right: the same test for all parameters is the function graph of the resultant . A crossing between two arbitrary function curves would not suffice: both values must be zero. Details.
One can verify the certificate without any determinant expansion:
For , division by gives a Bézout's identity for polynomials. At , the identity instead becomes a nontrivial cancellation between multiples of two polynomials sharing the polynomial factor .
The general proof needs only a short linear algebra outline. A common polynomial factor gives a nonzero cancelling pair within the degree bounds, making the Sylvester matrix singular. Conversely, if are coprime polynomials and , then divides ; the bound forces and then . Thus the linear map has zero kernel of a linear map exactly in the coprime case. Over an algebraic closure, a nonconstant common polynomial factor is equivalent to a common root.
In 1840, James Joseph Sylvester described forming the shifted coefficient rows and taking a signed sum of products selected by permutations. In modern notation, this is the Sylvester matrix and its determinant. The construction turns the nonlinear common-root of a polynomial question into linear algebra. His paper's word derivatives concerns elimination, rather than the formal derivative used below.[ref]
A divided difference depends on the chosen interpolation nodes and their data, but is unchanged by any permutation of those same interpolation nodes. The explicit sum in divided difference makes this visible: a permutation merely rearranges its summands.[ref]
There is also a short explanation using Lagrange cardinal polynomials. The coefficient of in the th Lagrange cardinal polynomial is . Taking that coefficient in their weighted sum gives exactly the explicit divided difference formula. Since polynomial interpolation has a unique answer for a fixed set of distinct interpolation nodes, this coefficient cannot depend on their ordering. If the interpolation polynomial has polynomial degree below , the coefficient is zero.
For the four-point example in divided difference table, every ordering gives third divided difference . This does not make every Newton polynomial coefficient invariant: whereas , because these use different pairs of interpolation nodes. Even at second order, and use different triples. The node order in Newton interpolation determines which subsets occur along the top row.
System of linear equations Created 2026-10-03 Updated 2026-10-18
A system of linear equations imposes several linear equations on the same unknowns. In the compact form , the matrix contains their coefficients, the vector contains the unknowns, and the vector contains the required outputs. Over the real numbers, the following examples exhibit the three possible outcomes: one solution, infinitely many solutions, or no solution.
For and , adding the two linear equations gives , hence and . Each linear equation describes a line in the plane; the two lines meet only at . Substitution checks both requirements: and . The two measurements together determine both unknowns.
Keeping only leaves a whole line of solutions:
For instance, gives . The direction belongs to the kernel of the linear map : its two contributions cancel. Moving in that direction changes the unknowns without changing their measured sum. The solution line is an affine space, translated away from the origin.
For and , the second linear equation instead demands . The parallel lines never meet. In the augmented matrix, subtracting twice the first row from the second is an elementary row operation that exposes the contradiction:
The last row says . A zero row of coefficients is harmless only when its appended entry is also zero.
Figure 1.
Three linear systems: a unique intersection, a solution line, and incompatible parallel lines
. Details.
The column viewpoint unifies these pictures. If are the columns of , then : a linear combination of those columns. A linear system is consistent precisely when lies in the column space, the image of a linear map represented by . Once one solution is known, every solution is with , since . Conversely, subtracting any two solutions gives an element of the kernel. Thus the kernel measures freedom, while the image of a linear map decides existence. A consistent linear system has a unique solution exactly when its kernel is .[ref]
Counting linear equations alone does not tell us how much information is present. If the second requirement were , it would repeat , so the two linear equations would still leave the same solution line. The matrix rank counts independent requirements. For a consistent linear system with unknowns and matrix rank , the rank-nullity theorem gives as the dimension of the kernel. This is the number of independent directions in which a solution can move. In the single-measurement example, one measured combination leaves one direction of freedom; in the sum-and-difference example, neither unknown can change without changing an output.
Transcendental number Created 2026-09-24 Updated 2026-11-05
A transcendental number is a complex number that is not an algebraic number. No nonzero polynomial with coefficients in the integers vanishes at it. Familiar examples are and ; proving their transcendence requires substantially more than proving their irrationality.
There are only countably many integer-coefficient polynomials, and each nonzero one has finitely many roots. Consequently the algebraic numbers are countable, while the real numbers are uncountable; transcendental real numbers therefore exist in abundance. This counting proof establishes existence without identifying a particular example. Every real transcendental number is an irrational number, but shows that the converse fails.
Triangular wave Created 2026-10-06 Updated 2026-11-05
A triangular wave is a continuous piecewise-linear periodic function with successive rising and falling segments. For , the even -periodic extension of from is
It has troughs of height zero at , peaks of height at , and slopes and between the corners. The function is continuous at the corners but lacks a derivative there.
Its Fourier cosine series contains a constant term and odd modes with coefficients proportional to the inverse square of the mode number. The Fourier cosine series of a triangular wave computes this for another normalization. Even periodic extensions also encode reflection in problems with Neumann boundary conditions.
Trigonometric series 2026-10-25
A series whose terms are multiples of sines and cosines of integer multiples of a variable. A Fourier series is the special case with coefficients extracted from a specified function by integration.
Over the complex numbers, if , then
Here the generalized binomial coefficient is , with . This is an exact finite identity, even when an infinite binomial series would not converge.
One can construct the required polynomial without any infinite series. At polynomial degree , the coefficient of is plus terms involving only earlier coefficients. Recursively choose it to agree with through polynomial degree ; the first coefficients are . The stated generalized binomial coefficients solve this recursion: near , the binomial series for cubes to , and truncating it changes no coefficient below polynomial degree . Thus is divisible by as a polynomial identity. Substituting the nilpotent matrix kills the remaining terms, all divisible by . For a Jordan block with , replace by and multiply by a scalar cube root of .
Uniqueness of linear combination coefficients Created 2026-10-14 Updated 2026-10-25
A family is linearly independent if and only if every vector in its linear span has unique coefficients as a linear combination of that family. For a short proof, subtract two representations to get ; linear independence forces each difference to vanish. Conversely, uniqueness applied to the zero vector forces every linear relation to use only zero coefficients. This explains the practical role of linear independence: a coordinate vector relative to an ordered basis is unambiguous.
Univariate polynomial 2026-10-18
A polynomial in one indeterminate; its coefficients lie in a specified ring. For example, is univariate, whereas involves two indeterminates.
Vector space Created 2026-09-24 Updated 2026-10-14
A vector space over a field is a set equipped with vector addition and scalar multiplication satisfying the vector space axioms. Its vectors can represent directed displacements, lists of measurements, polynomials, or entire functions. The common structure is that adding two elements and multiplying an element by a scalar remain meaningful operations inside the same space.
For example, uses coordinatewise addition and scaling. With
we have . Moving twice along and once along reaches the same vector as five horizontal and four vertical steps. The two descriptions refer to different bases of the same space. A basis makes such descriptions unique; a spanning set makes them possible.
Figure 1.
The same vector has coordinates 5,4 in the Cartesian basis and 2,1 in an oblique basis
. Details.
The space of real polynomials of degree at most two has basis : the polynomial is the linear combination with coordinates . The zero vector here is the zero polynomial, and addition combines coefficients. A derivative is a linear map on this space; its matrix records how it acts on the three basis vectors. The same coordinate machinery therefore handles both geometric motion and operations on functions.
The choice of field matters. The complex numbers form a one-dimensional vector space over with basis , but a two-dimensional vector space over with basis . The question "how many independent directions?" has an answer only after the allowed scalars are specified. Likewise, polynomials of degree exactly two do not form a vector space: subtraction can remove the leading term, and the zero polynomial is absent.
The usefulness of the abstraction is that a linear map is determined by its values on a basis. Once those images are known, linear combinations give its action on every vector. The rank-nullity theorem relates the number of attainable outputs to the number of invisible input directions, while change of basis lets us choose coordinates suited to the problem. Eigenvectors, for example, choose directions on which repeated application of a linear operator becomes scalar multiplication.
A historical source is Hermann Grassmann's Die lineale Ausdehnungslehre (1844). Its full title advertises applications to other branches of mathematics, statics, mechanics, magnetism and crystallography; the original edition is digitized by ETH-Bibliothek. This gives an early setting for treating geometric quantities algebraically across different applications, rather than attributing the modern axiom list to that title alone.[ref]
Every vector space over a field has a basis, assuming the axiom of choice. More generally, any linearly independent subset extends to a basis. This is an algebraic Hamel basis: each representation uses a finite linear combination, even when the basis is infinite.[ref]
Use the poset of linearly independent subsets containing :
It is a set, being a subset of the power set of , and is nonempty because .
A short proof outline supplies both essential steps:
Taking proves existence, including , whose basis is the empty set. The chain in a partial order need not be indexed by the natural numbers: only the finitely many members needed for a particular linear relation are compared. An arbitrary union of linearly independent sets can fail: and for a nonzero vector over the real numbers are each linearly independent, but their union is linearly dependent. The nesting of a chain in a partial order is what prevents this failure.
Write the quadratic polynomial as
Its function graph is a parabola with vertex of a parabola . Equal offsets from give equal values, since . If , the minimum is ; if , the maximum is . In both cases it is attained only at .
For the nonmonic quadratic polynomial
the negative leading coefficient reverses the inequality: . Its maximum is at . Its coefficients are different from those of the positive example, but the same form exposes the shape of both function graphs.
Figure 1.
Completed squares reveal a quadratic's vertex, extremum and real roots
. Original function graphs of the two stipulated quadratic polynomials. On the left, stays above zero. On the right, opens downward and has roots of a polynomial ; the green labels round these values to three decimal places. The dashed lines pass through the vertices of parabolas. Details.
Completing the square also simplifies an integral containing the exponential function:
The substitution removes the linear term and leaves the standard Gaussian integral. The same shift that locates the minimum makes this integral recognizable.
Take the stipulated polynomial roots . Their first three elementary symmetric polynomials are
Their monic polynomial is therefore
The constant coefficient is , while the product of the three roots of a polynomial is : for a cubic polynomial, these have opposite signs. Expanding the factors directly verifies the same polynomial identity.
Figure 1.
The roots determine the signed coefficients of a cubic
. An original exact calculation: the graph shows the stipulated polynomial, and the ledger groups choices of one, two or three root positions into elementary symmetric polynomials. The alternating factors convert these values into monic polynomial coefficients. Details.
For the nonmonic polynomial , the same ratios give sum , pairwise-product sum , and product . It is times the monic polynomial above, so its roots of a polynomial are the same. Checking only the sum and product would leave the middle elementary symmetric polynomial unchecked; all three are needed to recover a monic polynomial of polynomial degree three.
Vieta's formulas Created 2026-10-18 Updated 2026-10-20
Vieta's formulas connect two descriptions of a polynomial: its coefficients and its roots of a polynomial. They let us read the sum and product of the roots of a polynomial without finding the individual roots of a polynomial, and turn a proposed factorization of polynomials into checkable coefficient identities. The key is that coefficients encode elementary symmetric polynomials, which are unchanged by a permutation of the roots of a polynomial.
For a polynomial of polynomial degree , with nonzero leading coefficient , write its factorization of polynomials in a splitting field as
List every root of a polynomial according to its multiplicity of a root. Then
In particular, and . With coefficients in the real numbers or complex numbers, the fundamental theorem of algebra ensures that a list of roots of a polynomial in the complex numbers exists when multiplicity of a root is counted.[ref]
For a monic polynomial, this is the familiar convention
where is the th elementary symmetric polynomial in the roots of a polynomial; in particular, . The ratio by in the general statement matters: multiplying every coefficient by the same nonzero scalar preserves both the roots of a polynomial and these ratios.
A short derivation explains every alternating sign. In the product , a term of polynomial degree arises by choosing from distinct factor positions and from the others. Summing the resulting products gives . Values at different positions may coincide: the selection is of positions, not distinct root values. Matching coefficients gives the formula. This is the distributive property organized by the number of chosen root factors.
Weierstrass approximation theorem Created 2026-09-24 Updated 2026-10-14
Every continuous real-valued function on a compact interval can be approximated by polynomials with arbitrarily small error everywhere on the interval. More precisely, if and is continuous, then for every there is a polynomial with
The error is measured in the supremum norm, so one approximation works at every point. The degenerate interval needs only a constant function. A change of variable reduces the nondegenerate case to .[ref]
This is useful because a polynomial is described by finitely many coefficients and can be evaluated with addition and multiplication. Its surprise is that the target need not be differentiable: the sharp corner of an absolute value function can be approximated by smooth polynomials. The Bernstein approximation of a corner below makes this visible. Approximating values, however, does not by itself approximate derivatives; Weierstrass approximation does not preserve derivatives gives a counterexample.