Suppose every point of lies on an affine line in a vector space meeting a subset in at least points, with . A smaller would admit a nonzero multivariate polynomial of total degree at most vanishing on it, by the dimension of a bounded-total-degree polynomial space. Each selected line then has more roots of a polynomial than the degree of its restriction, so the polynomial vanishes at every point. The Schwartz-Zippel lemma forbids this because . Thus the displayed bound holds, and is at least . This is a point-covering condition; the finite-field Kakeya set condition instead quantifies over directions.
Ring of integers of Q of square root two Created 2026-09-29 Updated 2026-10-14
Since , the ring of integers of is
with integral basis and field discriminant eight. Multiplication is ordinary polynomial multiplication followed by :
For example, and . The integer coefficients stay integral, as required for a ring.
Under the two field embeddings, the element becomes the point . The integral basis vectors become and , giving a Minkowski embedding of a real quadratic field. Their determinant has absolute value , consistent with the field discriminant.
Figure 1.
The two real embeddings turn the integers adjoined square root two into a lattice
. Left: the integer lattice of coefficients . Right: the Minkowski embedding of a real quadratic field, . The highlighted cells use the same integral basis; their areas are and . Each image point has field norm , so the marked units lie on the hyperbolas . Only a finite portion is shown. Details.
If a nonzero real polynomial has roots in an open real interval, counted with multiplicity of a root, its derivative has at least roots in that interval, also counted with multiplicity, provided . Each root of multiplicity becomes a root of the derivative of multiplicity . The Rolle theorem supplies one further root between each pair of distinct consecutive roots. Thus distinct roots of multiplicities give at least derivative roots.
Rolle theorem Created 2026-09-24 Updated 2026-10-14
Rolle's theorem is the equal-endpoint case of the mean value theorem. Let and let the real-valued function be continuous on the closed interval and differentiable on the open interval . If , there exists with . Geometrically, a tangent line somewhere in the interior is horizontal, like the secant line joining the endpoints. [ref]
For the polynomial on , both endpoint values are zero and the derivative is . Thus , where , and the horizontal tangent line is . The horizontal secant line is : equal endpoint values do not force the interior tangent line to pass through those endpoints.
The absolute value function on exposes the importance of differentiability. It is continuous and , so the secant line has slope zero. However,
and the derivative does not exist at zero because the one-sided derivatives disagree. Every existing derivative in the interior is nonzero. The corner fails a hypothesis of both Rolle's theorem and the mean value theorem, so neither conclusion is guaranteed.
For a short proof, the extreme value theorem supplies a greatest and a least value on . If is a constant function, every interior point works. Otherwise at least one of these values differs from the common endpoint value, so it is attained at an interior extremum. At an interior local maximum or local minimum, differentiability forces the derivative to be zero: the difference quotients from the two sides have opposite weak signs and the same limit.
This turns repeated values into information about derivatives. Two distinct roots of a polynomial force a root of its derivative between them; iterating this idea gives the Rolle root count with multiplicities. More generally, a differentiable function with nonzero derivative throughout a real interval cannot repeat a value there, hence is injective. The beauty is that knowing only two equal values guarantees an exact local feature somewhere between them.
Root bracket 2026-10-14
A root bracket is a closed interval known to contain at least one zero of a function. For a real-valued continuous function on , a strict change of sign between and certifies such an enclosure by the intermediate value theorem. An endpoint with value zero already supplies a zero of a function. For example, is a root bracket for the polynomial , since and . A root bracket need not contain a unique zero of a function.
A root of an irreducible polynomial in an extension field defines a base-field embedding of the polynomial quotient by evaluation. Conversely the image of the residue class of the variable determines the embedding and is a root. This counts embeddings through separable minimal polynomials.
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.
Routh-Hurwitz stability criterion Created 2026-10-06 Updated 2026-10-13
The Routh-Hurwitz criterion tests whether all roots of a real polynomial have negative real part, by sign conditions on determinants formed from its coefficients. Applied to a characteristic polynomial, it gives an algebraic test for strict linear asymptotic stability.
For the unit disk with the nonpositive real radius removed, compact sets , , exhaust the domain. Each has connected complement: its inner and outer complementary regions join through the missing angular sector. The polynomial Runge theorem gives a polynomial within of a given holomorphic function on . Every compact subset lies in some , so these polynomials converge uniformly on compact subsets.
For a fixed polynomial with at least two distinct complex roots, integer solutions with and have an effectively bounded exponent. Factorization over a splitting field and the fixed differences between distinct roots control common ideal divisors. Outside a fixed set of primes, each factor's valuation is divisible by , where is its root multiplicity. The generalized power-equation estimates from linear forms in logarithms of algebraic numbers, including unit and exceptional-prime factors, give the exponent bound. A single-root polynomial and the values cannot be included: , and for , give infinite exponent families.
Schwartz-Zippel lemma 2026-10-07
For a nonzero multivariate polynomial of total degree over a field, and a finite subset of that field, at most points of are zeros. For one variable this is the root bound for a polynomial. If , the bound is already trivial. Otherwise, in the inductive proof write the polynomial as degree in its last variable, with a nonzero leading coefficient of degree at most in the other variables. The leading coefficient vanishes on at most fibers; outside those fibers there are at most roots of a polynomial per fiber. Counting the bad fibers with the trivial bound gives the asserted inequality.
The Haar wavelet provides an explicit one-vanishing moment comparison:
It cancels a constant polynomial, but not a nonconstant affine function. To obtain two vanishing moments by an equally transparent construction, take three adjacent unit intervals with heights proportional to :
The L2 norm normalization follows from . Direct integration gives
Thus has exactly two vanishing moments. In fact its coefficient is a finite difference of adjacent local integrals:
The weights are those of the second-order central difference. The first moment balances the centres of the three intervals; it is not enough merely to balance their signed areas.
Figure 1.
Signed overlaps of the Haar and second-difference analyzing functions with constant, linear, and quadratic test polynomials
. Details.
This is a normalized analyzing function, with no orthonormal basis assertion. Indeed, its unit translate has nonzero L2 inner product:
Hence these translates already fail orthogonality. The Daubechies wavelet construction imposes additional refinement and orthogonality requirements; two vanishing moments and unit L2 norm by themselves do not supply those requirements.
A linear subspace is separating if every nonzero has for some . For finite-dimensional , an evaluation map is injective, so the rank-nullity theorem forces and . For the infinite-dimensional polynomial space, the span of its coefficient functionals is a proper separating linear subspace of the dual space, which contains all sequences of coefficients, not just finitely supported ones.
Sextic even Landau potential Created 2026-10-03 Updated 2026-10-05
For the Landau free energy , positive gives a continuous phase transition at . For negative , phase coexistence between the disordered global minimum and the ordered global minima occurs on , with . Indeed, on that locus the polynomial is , so these three zeros are global minima. For , the disordered and ordered spinodal points are respectively and ; equality of stationary free energies determines phase coexistence, while loss of a local minimum determines a spinodal point.
For on , the Peano kernel is
The Taylor expansion with integral remainder gives , because annihilates polynomials of degree at most two. Since and , the sharp bound is . Equality holds for .
A polynomial may fail the Eisenstein polynomial test while a translate passes it. Translation does not change the generated extension: if , then vanishes at . For , the translate by is Eisenstein at whenever and .