{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-20","reactions":{},"formalized":true,"formalizes":[{"title":"The Gaussian law of errors in the theory of additive number theoretic functions","identifier":"","relationship":"formalizes"}]}