The -th digit becomes uniform as
ProvedBenfordLaw.nth_digit_prob_tendsto_uniformFor every digit ,
By the previous milestone, the left side is the Benford probability that is the -th significant digit; so the distribution of the -th digit approaches the uniform distribution on .
import Mathlib import Definitions.Def_BenfordLaw_Defs
namespace BenfordLaw
theorem nth_digit_prob_tendsto_uniform (d : ℕ) (hd : d ≤ 9) :
Filter.Tendsto
(fun n : ℕ => ∑ k ∈ Finset.Ico (10 ^ (n - 2) : ℕ) (10 ^ (n - 1)),
Real.logb 10 (1 + 1 / (10 * (k : ℝ) + d)))
Filter.atTop (nhds (1 / 10)) := by sorry
end BenfordLawRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) - non-blind, same agent as the drafter
Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement, with full knowledge of the source article and of the intended meaning. It is not a blind audit by an independent reader, and no reviewer should treat it as one. Please compare it against the Lean code yourself.
For every natural : as (naturals), , the sum over naturals with (truncated natural subtraction in the exponents; for both bounds equal and the sum is empty, which does not affect the limit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.