The Fundamental Theorem of Algebra in ACL2

10/10/2018
by   Ruben Gamboa, et al.
0

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that continuous functions from the complex to the real numbers achieve a minimum value over a closed square region. An important case of continuous real-valued, complex functions results from taking the traditional complex norm of a continuous complex function. We think of these continuous functions as having only one (complex) argument, but in ACL2(r) they appear as functions of two arguments. The extra argument is a "context", which is uninterpreted. For example, it could be other arguments that are held fixed, as in an exponential function which has a base and an exponent, either of which could be held fixed. Second, it is shown that complex polynomials are continuous, so the norm of a complex polynomial is a continuous real-valued function and it achieves its minimum over an arbitrary square region centered at the origin. This part of the proof benefits from the introduction of the "context" argument, and it illustrates an innovation that simplifies the proofs of classical properties with unbound parameters. Third, we derive lower and upper bounds on the norm of non-constant polynomials for inputs that are sufficiently far away from the origin. This means that a sufficiently large square can be found to guarantee that it contains the global minimum of the norm of the polynomial. Fourth, it is shown that if a given number is not a root of a non-constant polynomial, then it cannot be the global minimum. Finally, these results are combined to show that the global minimum must be a root of the polynomial. This result is part of a larger effort in the formalization of complex polynomials in ACL2(r).

READ FULL TEXT
research
11/29/2021

An iterative method for estimation the roots of real-valued functions

In this paper we study the recursive sequence x_n+1=x_n+f(x_n)/2 for eac...
research
09/06/2022

Extending the Universal Approximation Theorem for a Broad Class of Hypercomplex-Valued Neural Networks

The universal approximation theorem asserts that a single hidden layer n...
research
04/23/2017

Efficiently Computing Real Roots of Sparse Polynomials

We propose an efficient algorithm to compute the real roots of a sparse ...
research
09/03/2014

Tunably Rugged Landscapes with Known Maximum and Minimum

We propose NM landscapes as a new class of tunably rugged benchmark prob...
research
10/04/2020

All-Pass Filters for Mirroring Pairs of Complex-Conjugated Roots of Rational Matrix Functions

In this note, we construct real-valued all-pass filters for mirroring pa...
research
06/09/2022

A general approximation lower bound in L^p norm, with applications to feed-forward neural networks

We study the fundamental limits to the expressive power of neural networ...
research
05/11/2020

A Logical Characterization of Constant-Depth Circuits over the Reals

In this paper we give an Immerman's Theorem for real-valued computation....

Please sign up or login with your details

Forgot password? Click here to reset