Counting Polynomial Roots in Isabelle/HOL: A Formal Proof of the Budan-Fourier Theorem

11/27/2018
by   Wenda Li, et al.
0

Many problems in computer algebra and numerical analysis can be reduced to counting or approximating the real roots of a polynomial within an interval. Existing verified root-counting procedures in major proof assistants are mainly based on the classical Sturm theorem, which only counts distinct roots. In this paper, we have strengthened the root-counting ability in Isabelle/HOL by first formally proving the Budan-Fourier theorem. Subsequently, based on Descartes' rule of signs and Taylor shift, we have provided a verified procedure to efficiently over-approximate the number of real roots within an interval, counting multiplicity. For counting multiple roots exactly, we have extended our previous formalisation of Sturm's theorem. Finally, we combine verified components in the developments above to improve our previous certified complex-root-counting procedures based on Cauchy indices. We believe those verified routines will be crucial for certifying programs and building tactics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/16/2022

Sturm's Theorem with Endpoints

Sturm's Theorem is a fundamental 19th century result relating the number...
research
03/29/2019

Corrigendum to "Counting Database Repairs that Satisfy Conjunctive Queries with Self-Joins"

The helping Lemma 7 in [Maslowski and Wijsen, ICDT, 2014] is false. The ...
research
09/23/2018

A Revised and Verified Proof of the Scalable Commutativity Rule

This paper explains a flaw in the published proof of the Scalable Commut...
research
06/26/2019

Counting Roots of a Polynomial in a Convex Compact Region by Means of Winding Number Calculation via Sampling

In this paper, we propose a novel efficient algorithm for calculating wi...
research
04/11/2018

Evaluating Winding Numbers and Counting Complex Roots through Cauchy Indices in Isabelle/HOL

In complex analysis, the winding number measures the number of times a p...
research
03/05/2018

Natural Deduction and the Isabelle Proof Assistant

We describe our Natural Deduction Assistant (NaDeA) and the interfaces b...
research
06/13/2013

A Convergence Theorem for the Graph Shift-type Algorithms

Graph Shift (GS) algorithms are recently focused as a promising approach...

Please sign up or login with your details

Forgot password? Click here to reset