Skip to content

math-inc/Erdos1196

Repository files navigation

Primitive Sets Above x in Lean

This repository formalizes a solution to Erdős Problem #1196, which asks whether every primitive set supported on [x, ∞) satisfies

$$\sum_{a \in A} \frac{1}{a \log a} \le 1 + o(1) \qquad (x \to \infty).$$

The formalized result proves the quantitative estimate

$$\sum_{a \in A} \frac{1}{a \log a} \le 1 + O\!\left(\frac{1}{\log x}\right) \qquad (x \to \infty),$$

for every primitive set A ⊆ ℕ ∩ [x, ∞). The argument follows the explicit sub-Markov-chain construction in source.tex, where the visiting probabilities are proportional to 1 / (n log n).

Highlights

Repository Structure

Key Links

Useful Commands

Compile the Lean development:

lake exe cache get && lake build

Build the blueprint PDF:

uvx leanblueprint pdf

Build and serve the blueprint website:

uvx leanblueprint web && uvx leanblueprint serve

Build the TeX writeup PDF:

latexmk -pdf source.tex

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages