An eigenvalue and associated eigenvector satisfy . The characteristic polynomial has degree equal to the positive matrix size. The fundamental theorem of algebra gives a complex root, at which is singular and therefore has a nontrivial kernel. Hence every nonempty square complex matrix has an eigenvector.
A nondiagonalizable example is the Jordan block : its only eigenvalue is zero, and its eigenspace is one-dimensional. A Hermitian matrix satisfies and has an orthonormal eigenbasis by the spectral theorem. One proof finds an eigenvector, notes that its orthogonal complement is invariant, and repeats. Its eigenvalues are real becausewhere .
With all eigenvalues negative, is invertible. Its same complete eigenbasis givesSome powered eigenvalues can coincide, but the original eigenvectors remain a complete basis. Writing , the convergent matrix exponential series givesThus the matrix inverse from a decaying matrix exponential isThe identity printed in the original PDF is missing a minus sign. Already for the one-by-one matrix its integral is , whereas its inverse is . Equivalently, integrating gives , confirming the correction without diagonalization.
Put and choose . For , the triangle inequality givesThe reverse triangle inequality therefore yieldsIf had no root, the function would be an entire function. The bound just proved makes as . On the remaining closed disk, continuity and the extreme value theorem make bounded. Thus is a bounded entire function, so Liouville's theorem makes it constant. Its limit at infinity forces that constant to be zero, impossible for a reciprocal.
Consequently has a root in . This proves the existence part of the fundamental theorem of algebra. The invoked Liouville theorem follows from the Cauchy integral formula: the Cauchy estimate on arbitrarily large circles gives when is bounded by .
The fundamental theorem of algebra factors into linear factors over ; homogenizing supplies factors of if the degree is less than three. Thus every nonzero homogeneous cubic is for linear forms , with absorbed into one factor.
For pairwise nonproportional factors, part (c) assigns three distinct tangent lines to . Their pairwise intersections are , , and . There cannot be a common point of all three: a nonzero quadratic cannot be divisible by three pairwise nonproportional linear factors, by unique factorization. Hence the three lines form a triangle circumscribed about .
Assume that a nonconstant polynomial has no zero. Then is entire. The leading polynomial term makes as , so there. On any remaining compact disk, continuity and absence of zeros bound . Consequently is bounded on the entire plane.
Part (c)(i) makes a bounded local martingale, hence a true bounded martingale. The martingale convergence theorem says it converges almost surely as .
The harmonic function cannot be constant. Otherwise the Cauchy-Riemann equations would make both derivatives of zero, so and then would be constant. Choose points with . Continuity supplies two disjoint disks on which the ranges of are separated by a positive gap. By part (b), the Brownian path visits these disks alternately at times tending to infinity. The corresponding subsequences of then remain separated, contradicting its almost sure convergence.
The zero-free assumption is impossible. Hence
Every nonconstant complex polynomial has a complex root.
This proves the fundamental theorem of algebra using recurrence and martingale convergence, without invoking Liouville's theorem as a prior algebraic shortcut.
Every nonconstant complex polynomial has a complex root.
This proves the fundamental theorem of algebra using recurrence and martingale convergence, without invoking Liouville's theorem as a prior algebraic shortcut.
Quintic equation 2026-11-05
A quintic equation is a one-variable polynomial equationOver the complex numbers, it has five roots of a polynomial counted with multiplicity of a root, by the fundamental theorem of algebra. Over the real numbers, at least one root is real because the leading odd-degree term makes the polynomial take opposite signs far enough in the two directions.
Some quintics are easy to solve: has roots . The Abel-Ruffini theorem says that a formula by radicals cannot solve the general quintic equation; it does not rule out special factorizations, other special-function descriptions, or numerical root finding. Thus failure of a universal radical formula does not prevent exact or approximate solutions of particular equations.
Root of a polynomial Created 2026-09-24 Updated 2026-10-14
A root of a polynomial is a scalar satisfying in the chosen field or ring. For over the real numbers, the distinct roots of a polynomial are and . The second has multiplicity of a root two, so there are three roots when counted with multiplicity.
The domain matters. has no real polynomial root, but has the two complex number roots . The fundamental theorem of algebra guarantees a polynomial root in the complex numbers for every nonconstant complex polynomial, and complete factorization counts its degree of a polynomial many roots with multiplicity of a root. It does not promise that those roots are real or that they have a simple expression.
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 asList every root of a polynomial according to its multiplicity of a root. ThenIn 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 conventionwhere 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.
Winding-number proof of the fundamental theorem of algebra Created 2026-09-24 Updated 2026-09-24
For a polynomial of positive degree, on a sufficiently large circle its leading term dominates the remaining terms. The dominated-perturbation lemma therefore gives winding number to the loop . If had no zero, radial contraction of the input circle would map under to a homotopy with a constant loop in , which has winding number zero. This contradiction proves the Fundamental theorem of algebra.