A formalisation of Gallagher's ergodic theorem

02/01/2023
by   Oliver Nash, et al.
0

Gallagher's ergodic theorem is a result in metric number theory. It states that the approximation of real numbers by rational numbers obeys a striking 'all or nothing' behaviour. We discuss a formalisation of this result in the Lean theorem prover. As well as being notable in its own right, the result is a key preliminary, required for Koukoulopoulos and Maynard's stunning recent proof of the Duffin-Schaeffer conjecture.

READ FULL TEXT

page 5

page 6

page 7

page 8

page 9

page 11

page 13

research
01/25/2022

A simple and constructive proof to a generalization of Lüroth's theorem

A generalization of Lüroth's theorem expresses that every transcendence ...
research
09/07/2023

On Statman's Finite Completeness Theorem

We give a complete self-contained proof of Statman's finite completeness...
research
05/15/2023

Fermat's Last Theorem for regular primes

We formalise the proof of the first case of Fermat's Last Theorem for re...
research
02/08/2020

Majority Voting and the Condorcet's Jury Theorem

There is a striking relationship between a three hundred years old Polit...
research
01/16/2019

The notion of "Unimaginable Numbers" in computational number theory

Literature considers under the name unimaginable numbers any positive in...
research
05/11/2023

On the Eight Levels theorem and applications towards Lucas-Lehmer primality test for Mersenne primes, I

Lucas-Lehmer test is the current standard algorithm used for testing the...
research
05/07/2019

The strong approximation theorem and computing with linear groups

We obtain a computational realization of the strong approximation theore...

Please sign up or login with your details

Forgot password? Click here to reset