A scale-invariant first-digit distribution is Benford
ProvedBenfordLaw.benford_of_scale_invariantLet be a random variable on a probability space with almost surely. Suppose the distribution of its first decimal digit does not depend on the unit of measurement, i.e. for every and every digit ,
Then the first digit follows Benford's law: for ,
This turns the informal "units do not matter" argument of the source into a theorem.
import Mathlib import Definitions.Def_BenfordLaw_Defs
namespace BenfordLaw
theorem benford_of_scale_invariant {Ω : Type*} [MeasurableSpace Ω]
(P : MeasureTheory.Measure Ω) [MeasureTheory.IsProbabilityMeasure P]
(X : Ω → ℝ) (hXm : Measurable X) (hXpos : ∀ᵐ ω ∂P, 0 < X ω)
(hinv : ∀ c : ℝ, 0 < c → ∀ d : ℕ,
P {ω | leadingDigit 10 (c * X ω) = d} = P {ω | leadingDigit 10 (X ω) = d})
(d : ℕ) (hd1 : 1 ≤ d) (hd9 : d ≤ 9) :
(P {ω | leadingDigit 10 (X ω) = d}).toReal = benfordProb 10 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 carry a -algebra and a probability measure , and let be measurable with -a.e. Assume: for every real and every natural (any , including and ),
(equality in ). Then for every natural with , , as a real number, equals .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.