Id: palomar/PALOMAR-2026-11-20-000016 Url: https://github.com/HeRunming/erdos-kac-lean/tree/60a2004452b6610ea69302b31bf66bd8365ff60e Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-20-000016-v1.json Repo: https://github.com/HeRunming/erdos-kac-lean Tags: math.NT, math.PR, msc:11K65, msc:60F05 Score: 0 Title: Erdős–Kac theorem Trust: high Domain: math.NT Source: palomar Authors: Runming He Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-20 Formalized: true Formalizes: title=The Gaussian law of errors in the theory of additive number theoretic functions identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-20-000016 A complete formalisation, in Lean 4 with Mathlib, of the Erdős–Kac theorem: the number of distinct prime factors ω(n), centred by log log N and scaled by sqrt(log log N), satisfies a central limit theorem on {1, …, N}. The proof goes through Mertens' second theorem and a truncated sieve whose moments are compared with an independent-prime model. Moment comparison is carried over to characteristic functions by a Taylor truncation of exp(iτs), whose remainder is controlled by a uniform even-moment bound; the model characteristic function converges to the Gaussian, and Lévy's continuity theorem…