How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Sturm sign variation counts distinct real polynomial roots
Statement
Let be nonconstant with . Define , , and recursively
until the final nonzero term , which is constant. For a real that is not a root of , let be the number of sign changes in after zero entries are deleted. If and , then the number of distinct real roots of in is
Facts & Assumptions
Given: A nonconstant squarefree , its Sturm sequence, and real endpoints with .
Polynomial division over a field gives the Euclidean remainder with smaller degree (Division algorithm for polynomials over a field).
Formal differentiation obeys the product rule and the degree bound (Linearity, power rule, Leibniz rule and the degree bound for the formal derivative).
A continuous function on takes every value between its endpoint values (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
A nonzero polynomial has at most its degree many distinct roots, by the factor theorem and degree additivity (Factor theorem over a commutative ring, Over an integral domain, degrees add under multiplication of nonzero polynomials).
For two polynomials over a field that are not both zero, the last nonzero Euclidean remainder is a nonzero scalar multiple of their monic gcd, and the gcd is a polynomial linear combination of the two inputs. The monic greatest common divisor of two polynomials over a field, Bézout identity and the Euclidean algorithm for polynomials over a field
Proof
The degrees of nonzero Euclidean remainders strictly decrease by [F1], so the sequence terminates. Changing each Euclidean remainder by a minus sign changes neither common divisors nor termination. Thus [F6] and the stated gcd make the last nonzero remainder a nonzero constant . Backward substitution in the division equations gives with ; dividing by gives a Bezout identity with right side .
Between zeros of the sequence, every polynomial keeps its sign: a sign change would give a zero by [F3] and [F4]. Each term has finitely many zeros by [F5], so it suffices to compute how changes when a real point crosses a zero of one or more sequence terms.
No two consecutive terms can vanish at the same real . By step 1.1 there are with ; evaluating at rules out a common zero of even over . For , the recurrence propagates simultaneous zeros of backward to .
Suppose for an internal index . The no-adjacent-zero property in [step 2.1] makes and nonzero, and the recurrence gives . They have opposite signs. On either side of , the signs of these neighbors are fixed; after zero entries are deleted, the adjacent nonzero neighbors of each internal zero contribute exactly one sign change. If several internal terms vanish at , their indices are nonconsecutive, so these adjacent-pair contributions may share an endpoint but remain distinct terms in the total variation. Thus internal zeros do not change .
If , then squarefreeness gives . Factor by [F5]; the product rule gives , so near the sign of is the sign of . Thus the initial pair contributes one sign change just to the left and none just to the right. Any simultaneous internal zeros contribute no net change by [step 3.1], so decreases by exactly one as is crossed from left to right.
The endpoints are not roots of by hypothesis. As one moves from to , is constant except at the finitely many roots of sequence terms; by [step 3.1] internal zeros do not change it and by [step 4.1] each distinct root of lowers it by one. Therefore is exactly the number of distinct roots in .
Depends on
- The monic greatest common divisor of two polynomials over a field
- Bézout identity and the Euclidean algorithm for polynomials over a field
- The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution
- The formal derivative of a polynomial
- Division algorithm for polynomials over a field
- Over an integral domain, degrees add under multiplication of nonzero polynomials
- Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function
- Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on $[a,b]$ takes every value between $f(a)$ and $f(b)$
- The real numbers
- The reals form a field
- The reals form a totally ordered field
- Factor theorem over a commutative ring
- Linearity, power rule, Leibniz rule and the degree bound for the formal derivative
Used by
Dependency tree · two levels
55 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Colm Ó Dúnlaing, Mathematics 1263: Introduction to Numerical Analysis, §2 (standard reference, not scraped)
- Marc Moreno Maza, Tutorial on real root isolation of polynomial systems, §§12–14 (standard reference, not scraped)