Formalizing an Analytic Proof of the Prime Number Theorem

@article{Harrison2009FormalizingAA,
  title={Formalizing an Analytic Proof of the Prime Number Theorem},
  author={John Harrison},
  journal={Journal of Automated Reasoning},
  year={2009},
  volume={43},
  pages={243-261}
}
  • J. Harrison
  • Published 2009
  • Computer Science
  • Journal of Automated Reasoning
We describe the computer formalization of a complex-analytic proof of the Prime Number Theorem (PNT), a classic result from number theory characterizing the asymptotic density of the primes. The formalization, conducted using the HOL Light theorem prover, proceeds from the most basic axioms for mathematics yet builds from that foundation to develop the necessary analytic machinery including Cauchy’s integral formula, so that we are able to formalize a direct, modern and elegant proof instead of… Expand
A formalized proof of Dirichlet's theorem on primes in arithmetic progression
TLDR
A simple and efficient proof of the Dirichlet's theorem informally, which is otherwise difficult to find in one self-contained place at an elementary level, is described. Expand
A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
TLDR
The formal verification of an irrationality proof of ζ(3), the evaluation of the Riemann zeta function, using the Coq proof assistant is described, complete up to a weak corollary of the Prime Number Theorem. Expand
A Formally Verified Proof of the Central Limit Theorem
TLDR
The proof of the Central Limit Theorem uses characteristic functions, which are a kind of Fourier transform, to demonstrate that, under suitable hypotheses, sums of random variables converge weakly to the standard normal distribution. Expand
About the Formalization of Some Results by Chebyshev in Number Theory
We discuss the formalization, in the Matita Interactive Theorem Prover, of a famous result by Chebyshev concerning the distribution of prime numbers, essentially subsuming, as a corollary, Bertrand'sExpand
A Formal Proof of the Irrationality of ζ(3)
TLDR
This paper presents a complete formal verification of a proof that the evaluation of the Riemann zeta function at 3 is irrational, using the Coq proof assistant, and establishes that some sequences satisfy a common recurrence. Expand
A formal proof of Hensel's lemma over the p-adic integers
  • R. Lewis
  • Mathematics, Computer Science
  • CPP
  • 2019
TLDR
Hensel’s lemma, described by Gouvêa as the “most important algebraic property of the p-adic numbers,” shows the existence of roots of polynomials over ℚp provided an initial seed point, and the theorem can be proved for thep-adics with significantly weaker hypotheses than for general rings. Expand
A proof of Bertrand's postulate
We discuss the formalization, in the Matita Interactive Theorem Prover, of some results by Chebyshev concerning the distribution of prime numbers, subsuming, as a corollary, Bertrand's postulate. Expand
Nine Chapters of Analytic Number Theory in Isabelle/HOL
TLDR
A formalisation of a large portion of Apostol’s Introduction to Analytic Number Theory in Isabelle/HOL is presented, including results on the Riemann and Hurwitz ζ functions and the Dirichlet L functions. Expand
Formalization of the prime number theorem and Dirichlet's theorem
TLDR
The formalization of Dirichlet's theorem on the infinitude of primes in arithmetic progressions is presented, and Selberg's elementary proof of the prime number theorem is presented within the proof system Metamath. Expand
The Prime Number Theorem
TLDR
This article attempts to provide a short and clear formalisation of all components of that proof using the full range of mathematical machinery available in Isabelle, staying as close as possible to Newman’s simple paper proof. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
A formally verified proof of the prime number theorem
TLDR
A formally verified version of Selberg's proof is described, obtained using the Isabelle proof assistant, that asserts that the density of primes in the positive integers is asymptotic to 1/ln x. Expand
Newman's short proof of the prime number theorem
The prime number theorem, that the number of primes < x is asymptotic to x/log x, was proved (independently) by Hadamard and de la Vallee Poussin in 1896. Their proof had two elements: showing thatExpand
Complex quantifier elimination in HOL
Building on a simple construction of the complex numbers and a proof of the Fundamental Theorem of Algebra, we implement, as a HOL derived inference rule, a decision method for the first orderExpand
Analytic Number Theory
In this chapter we draw on real and complex analysis to present four beautiful theorems. The first is P. Dirichlet’s theorem that there are infinitely many primes in any arithmetic progression $$Expand
A HOL Theory of Euclidean Space
TLDR
A formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover, using the HOL type system to encode the dimension N in a simple and useful way, even though HOL does not permit dependent types. Expand
Formalizing Basic Complex Analysis
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. inExpand
Constructing the Real Numbers
True to the foundational approach we take, the real numbers are constructed rather than merely axiomatized. In this chapter we survey existing approaches and remark on their strengths and weaknessesExpand
Theorem Proving with the Real Numbers
ions are not often seen in informal mathematics, but they have at least two merits. First, they allow one to write anonymous function-valued expressions without naming them (occasionally one sees xExpand
Constructing the real numbers in HOL
  • J. Harrison
  • Computer Science
  • Formal Methods Syst. Des.
  • 1994
This paper describes a construction of the real numbers in the HOL theorem-prover by strictly definitional means using a version of Dedekind's method. It also outlines the theory of mathematicalExpand
The Prime Number Theorem
Preface 1. Foundations 2. Some important Dirichlet series and arithmetic functions 3. The basic theorems 4. Prime numbers in residue classes: Dirichlet's theorem 5. Error estimates and the RiemannExpand
...
1
2
3
4
5
...