Uniform implies the first-digit law
ProvedBenfordLaw.benford_of_uniform_log_mantissaLet and let be a random variable on a probability space such that almost surely and the fractional part is uniformly distributed on . Then for every digit ,
This is the derivation of Benford's law from its strong form stated in the source.
Formalization Note. The hypothesis is HasUniformLogMantissa b P X; it includes measurability of and forces to be a probability measure. The probability is stated as (P {ω | leadingDigit b (X ω) = d}).toReal.
import Mathlib import Definitions.Def_BenfordLaw_Defs
namespace BenfordLaw
theorem benford_of_uniform_log_mantissa {Ω : Type*} [MeasurableSpace Ω]
(b : ℕ) (hb : 2 ≤ b) (P : MeasureTheory.Measure Ω) (X : Ω → ℝ)
(hX : HasUniformLogMantissa b P X) (d : ℕ) (hd1 : 1 ≤ d) (hdb : d < b) :
(P {ω | leadingDigit b (X ω) = d}).toReal = benfordProb b d := 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.
Let be any type with a -algebra, any measure on it, , and a natural number with . Assume : is measurable, -a.e., and the pushforward of under is Lebesgue measure on . Then for every natural with ,
The conversion maps to , but the measure here is at most .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.