We describe the formalization of some of the basics of complex analysis in the HOL Light theorem prover. Besides being a beautiful area of mathematics, this has many potential applications, e.g. in analytic number theory. We have endeavoured to set up the kind of general analytic machinery that would make such applications feasible. 0 Mizar and me: some personal recollections The first time I saw mention of the Mizar project was in a message from Bob Boyer to the QED mailing list in August 1993: Indeed, there have been a good number of QED-like efforts spread over at least the last 27 years, both large scale and small. (I hear rumors that the Polish MIZAR effort may be the largest so far.) At the time, even though Mizar had a large and thriving user community all over the world, I hadn’t heard of it at all, so my curiosity was piqued. The following summer, the second QED Workshop was in Warsaw, and I had the opportunity to meet Andrzej Trybulec in person for the first time. This was a memorable experience in many ways, and immediately after the workshop a few participants travelled to Bia lystok where we had the opportunity to try out Mizar for ourselves with Andrzej’s help. I was impressed that Andrzej was willing to devote so much time to helping out some complete beginners. But I was equally impressed how little his help was needed! After a few hours, I was able to prove in Mizar the formula for the roots of a quadratic equation. To someone with no experience of proof assistants, that might seem an unspectacular accomplishment, but Mizar seemed to be dramatically easier to use than the other systems I’d tried, particularly HOL [3], with which I was most familiar. Over the next few months, back in Cambridge (where I was supposed to be finishing my PhD) and in Turku/Åbo in Finland (where I was doing a postdoc under 1 http://icml.stanford.edu/uribe/mail/qed.messages/105.html ISBN 978-83-7431-128-1 ISSN 0860–150X 151
[1]
J. Kurzweil.
Generalized ordinary differential equations and continuous dependence on a parameter
,
1957
.
[2]
Ralph Henstock,et al.
A Riemann-Type Integral of Lebesgue Power
,
1968,
Canadian Journal of Mathematics.
[3]
S. Lang.
Complex Analysis
,
1977
.
[4]
M. Gordon,et al.
Introduction to HOL: a theorem proving environment for higher order logic
,
1993
.
[5]
John Harrison,et al.
A Mizar Mode for HOL
,
1996,
TPHOLs.
[6]
J. Grundy,et al.
Theorem proving in higher order logics : 9th International Conference, TPHOLsʾ96, Turku, Finland, August 26-30, 1996 : proceedings
,
1996
.
[7]
John Harrison,et al.
Proof Style
,
1996,
TYPES.
[8]
Don Syme.
DECLARE: A Prototype Declarative Proof System for Higher Order Logic
,
1997
.
[9]
MA John Harrison PhD.
Theorem Proving with the Real Numbers
,
1998,
Distinguished Dissertations.
[10]
Markus Wenzel,et al.
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
,
1999,
TPHOLs.
[11]
Yves Bertot,et al.
Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, Nice, France, September 14-17, 1999, Proceedings
,
1999
.
[12]
Vincent Zammit,et al.
On the Implementation of an Extensible Declarative Proof Language
,
1999,
TPHOLs.
[13]
Freek Wiedijk,et al.
Mizar Light for HOL Light
,
2001,
TPHOLs.
[14]
John Harrison.
Complex quantifier elimination in HOL
,
2001
.
[15]
Lawrence Charles Paulson,et al.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
,
2002
.
[16]
Editors
,
2003
.
[17]
John Harrison,et al.
A HOL Theory of Euclidean Space
,
2005,
TPHOLs.
[18]
Jeremy Avigad,et al.
A formally verified proof of the prime number theorem
,
2005,
TOCL.