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.
Exact Sturm bisection isolates every distinct real root of a nonzero rational polynomial
Statement
For every nonzero , the algorithm Exact dyadic Sturm isolation of all real roots of a nonzero rational polynomial terminates with status "complete". Each output singleton is an exact real root with its correct multiplicity; each output open dyadic interval contains exactly one distinct real root of in its interior and is labelled with that root's multiplicity. Every distinct real root occurs in exactly one output record. For the algorithm returns "identically zero", not a finite isolation list.
Facts & Assumptions
Given: A nonzero rational polynomial, exact rational arithmetic, and the procedure in Exact dyadic Sturm isolation of all real roots of a nonzero rational polynomial.
The gcd decomposition gives pairwise coprime squarefree factors whose roots are exactly the roots of multiplicity (Exact gcd squarefree decomposition preserves roots and multiplicities).
Sturm variation gives the exact number of distinct roots in an open interval with nonroot endpoints (Sturm sign variation counts distinct real polynomial roots).
Distinct roots of the initial squarefree primitive integer polynomial are separated by at least its positive rational bound (An explicit root-separation bound for squarefree integer polynomials).
The algorithm's normalization, queue, bisection, endpoint-root removal, and output rules are those stated in its Definition (Exact dyadic Sturm isolation of all real roots of a nonzero rational polynomial).
Proof
Clearing denominators and dividing by the nonzero integer content preserves every root and its multiplicity. By [F1], the active squarefree product has exactly the distinct roots of , and its factors assign each such root its unique multiplicity label.
If the initial squarefree polynomial has degree at least two, the coefficient-height bound in [F3] places every root strictly inside because . In degree one, write with nonzero integer . Its unique root is , whose absolute value is at most since . Thus the initial endpoints are nonroots in either case. Bisection endpoints are midpoints tested exactly: a root midpoint is recorded and removed before its open halves are queued, while a nonroot midpoint leaves both endpoints nonroots for the active product.
In each queued interval with nonroot endpoints, [F2] makes the computed variation difference exactly its number of active roots. A zero count safely discards the interval. A count of one gives an isolating interval; the Sturm counts of the pairwise coprime identify exactly one factor and hence the multiplicity label. If a midpoint is a root, exact division by removes it from that factor and the singleton record carries its multiplicity; otherwise the two open halves partition the parent interval. If removal leaves a nonzero constant active product, it has no remaining roots; the immediate complete-return branch safely clears the root-free queue without requesting another Sturm sequence.
Whenever an interval has at least two distinct active roots, their separation [F3] forces its width to be at least . At bisection depth the width is . Since by [F4], some finite depth has width below ; such an interval cannot still contain two roots, so each branch stops with count zero or one. The branching factor is at most two and the depth is bounded, so the entire queue tree is finite. For degree one, the initial Sturm count is already zero or one. An earlier constant-active-product branch terminates immediately and cannot prolong the queue tree.
At each split, the roots in the parent are partitioned between the open children and, when the midpoint is a root, its exact singleton; a nonroot midpoint contributes no root. Every discarded interval is root-free, and every one-root interval is emitted once. The finite tree therefore accounts for every real root exactly once with the correct multiplicity.
Depends on
- Exact dyadic Sturm isolation of all real roots of a nonzero rational polynomial
- Exact gcd squarefree decomposition preserves roots and multiplicities
- Sturm sign variation counts distinct real polynomial roots
- An explicit root-separation bound for squarefree integer polynomials
- For $|r| < 1$ the sequence $r^k$ is null, and for $|r| > 1$ the sequence $|r|^k$ diverges to $+\infty$
Used by
Cited to discharge well-definedness by Exact dyadic Sturm isolation of all real roots of a nonzero rational polynomial.
Dependency tree · two levels
46 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
- Marc Moreno Maza, Tutorial on real root isolation of polynomial systems, Root estimation and Sturm root counting (standard reference, not scraped)
- Colm Ó Dúnlaing, Mathematics 1263: Introduction to Numerical Analysis, §2 (standard reference, not scraped)