Theorem Proving with the Real Numbers

This book discusses the use of the real numbers in theorem proving. Typ- ically, theorem provers only support a few discrete datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification of float- ing point hardware and hybrid systems. It also allows the formalization of many more branches of classical mathematics, which is particularly relevant for attempts to inject more rigour into computer algebra systems. Our work is conducted in a version of the HOL theorem prover. We de- scribe the rigorous definitional construction of the real numbers, using a new version of Cantors method, and the formalization of a significant portion of real analysis. We also describe an advanced derived decision procedure for the Tarski subset of real algebra as well as some more modest but practically useful tools for automating explicit calculations and routine linear arithmetic reasoning. Finally, we consider in more detail two interesting application areas. We discuss the desirability of combining the rigour of theorem provers with the power and convenience of computer algebra systems, and explain a method we have used in practice to achieve this. We then move on to the verification of floating point hardware. After a careful discussion of possible correctness specifications, we report on two case studies, one involving a transcendental function.