Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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 P∈Q[x] be nonconstant with gcd⁡(P,P′)=1. Define P0=P, P1=P′, and recursively

Pj+1=−rem⁡(Pj−1,Pj)

until the final nonzero term Ps, which is constant. For a real t that is not a root of P, let V(t) be the number of sign changes in P0(t),…,Ps(t) after zero entries are deleted. If a<b and P(a)P(b)≠0, then the number of distinct real roots of P in (a,b) is

V(a)−V(b).

Facts & Assumptions

Given: A nonconstant squarefree P∈Q[x], its Sturm sequence, and real endpoints a<b with P(a)P(b)≠0.

[F1]

Polynomial division over a field gives the Euclidean remainder with smaller degree (Division algorithm for polynomials over a field).

[F2]

Formal differentiation obeys the product rule and the degree bound (Linearity, power rule, Leibniz rule and the degree bound for the formal derivative).

[F5]

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).

[F6]

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

1.1givenF1F2F6algebraconstruct

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 1 make the last nonzero remainder a nonzero constant c. Backward substitution in the division equations gives A,B∈Q[x] with AP0+BP1=c; dividing by c gives a Bezout identity with right side 1.

1.2F3F4F5

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 V changes when a real point crosses a zero of one or more sequence terms.

2.1step 1.1F1algebra

No two consecutive terms can vanish at the same real c. By step 1.1 there are A,B∈Q[x] with AP0+BP1=1; evaluating at c rules out a common zero of P0,P1 even over C. For 1≤j<s, the recurrence Pj−1=QjPj−Pj+1 propagates simultaneous zeros of Pj,Pj+1 backward to P0,P1.

3.1step 2.1F1algebra

Suppose Pj(c)=0 for an internal index 1≤j<s. The no-adjacent-zero property in [step 2.1] makes Pj−1(c) and Pj+1(c) nonzero, and the recurrence gives Pj−1(c)=−Pj+1(c). They have opposite signs. On either side of c, 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 c, 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 V.

4.1step 2.1step 3.1F2F3F5

If P0(c)=0, then squarefreeness gives P1(c)=P0′(c)≠0. Factor P0(x)=(x−c)u(x) by [F5]; the product rule gives u(c)=P1(c), so near c the sign of P0(x)P1(x) is the sign of x−c. 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 V decreases by exactly one as c is crossed from left to right.

5.1givenstep 1.2step 3.1step 4.1∎

The endpoints are not roots of P by hypothesis. As one moves from a to b, V 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 P lowers it by one. Therefore V(a)−V(b) is exactly the number of distinct roots in (a,b).

Depends on

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