Flagship declarations

Start with the mathematical results

Pinned project revision
Project-declaredLean 4.32.0

Lambda pnt

lambda_pnt

Project documentation

The summatory Liouville function has sublinear growth. Writing Ω(n)\Omega(n) for the number of prime factors of nn, counted with multiplicity, the theorem states n<x(1)Ω(n)=o(x)\sum_{n<\lfloor x\rfloor}(-1)^{\Omega(n)}=o(x) as xx\to\infty.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Dirichlet thm

dirichlet_thm

Project documentation

Dirichlet's theorem on primes in arithmetic progressions. If q1q\ge 1, a<qa<q, and gcd(a,q)=1\gcd(a,q)=1, then infinitely many primes satisfy pa(modq)p\equiv a\pmod q.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Mu pnt

mu_pnt

Project documentation

The summatory Möbius function has sublinear growth: as xx\to\infty, n<xμ(n)=o(x).\sum_{n<\lfloor x\rfloor}\mu(n)=o(x). This is the Möbius-function form of the prime number theorem.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Prime between

prime_between

Plain-language statement

For every ε>0\varepsilon>0, every sufficiently large real number xx has a prime pp in the short multiplicative interval x<p<(1+ε)xx<p<(1+\varepsilon)x.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record

Project index

More declarations

Search within this project

Showing 8 of 53 additional declarations. Use project search for the complete index.

Project-declaredLean 4.32.0

Admissible bound mono

admissible_bound.mono

Plain-language statement

For positive parameters A,B,C,RA,B,C,R, the classical error-bound function A(logxR)Bexp ⁣(ClogxR)A\left(\frac{\log x}{R}\right)^B\exp\!\left(-C\sqrt{\frac{\log x}{R}}\right) is nonincreasing once xexp ⁣(R(2B/C)2)x\ge \exp\!\left(R(2B/C)^2\right).

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Analytic On div Removable zero

AnalyticOn_divRemovable_zero

Plain-language statement

Let ff be analytic on an open set ss containing 00, and suppose f(0)=0f(0)=0. Define g(z)=f(z)/zg(z)=f(z)/z for z0z\ne0 and g(0)=f(0)g(0)=f'(0). Then the apparent singularity at 00 is removable and gg is analytic throughout ss.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Analytic On div Removable zero closed Ball

AnalyticOn_divRemovable_zero_closedBall

Plain-language statement

Suppose R>0R>0 and ff is analytic on the closed disc zR|z|\le R with f(0)=0f(0)=0. Define g(z)=f(z)/zg(z)=f(z)/z for z0z\ne0 and g(0)=f(0)g(0)=f'(0). Then gg is analytic on the entire closed disc, including at the removed singularity.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Sum moebius pmul eq prod one sub

ArithmeticFunction.sum_moebius_pmul_eq_prod_one_sub

Plain-language statement

If g is a multiplicative arithmetic function, then for any n0n \neq 0, dnμ(d)g(d)=pn(1g(p))\sum_{d | n} \mu(d) \cdot g(d) = \prod_{p | n} (1 - g(p)).

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Zeta zero re mem of im pos

Backlund.zeta_zero_re_mem_of_im_pos

Plain-language statement

Every zero ss of the Riemann zeta function in the upper half-plane lies in the critical strip: if ζ(s)=0\zeta(s)=0 and Ims>0\operatorname{Im}s>0, then 0Res1.0\le\operatorname{Re}s\le1.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Zeta Counting crude majorant

Backlund.zetaCounting_crude_majorant

Plain-language statement

The Riemann zeta zero-counting function has a crude polynomial bound: there is a constant A>0A>0 such that, for every T2T\ge2, Nζ(T)AT3/2.|N_\zeta(T)|\le A T^{3/2}.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record