Exponential growth or decay obeys Benford's law in time average
ProvedBenfordLaw.exponential_growth_benfordLet with and growth rate (growth if , decay if ). For every digit , the fraction of the time interval during which has leading digit tends to the Benford probability:
where is Lebesgue measure on .
This is the continuous-time analogue of the sequence results.
import Mathlib import Definitions.Def_BenfordLaw_Defs
namespace BenfordLaw
theorem exponential_growth_benford (C r : ℝ) (hC : 0 < C) (hr : r ≠ 0)
(d : ℕ) (hd1 : 1 ≤ d) (hd9 : d ≤ 9) :
Filter.Tendsto
(fun T : ℝ =>
(MeasureTheory.volume
{t : ℝ | t ∈ Set.Icc 0 T ∧ leadingDigit 10 (C * Real.exp (r * t)) = d}).toReal / T)
Filter.atTop (nhds (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.
For all reals with and , and every natural with : as the real number ,
where is Lebesgue measure, converted from to (the set is bounded, so the measure is finite). For the set is empty; only large matter.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.