Benford probabilities sum to in every base
ProvedBenfordLaw.benfordProb_sum_eq_oneLet be an integer base and . Then the Benford probabilities of the digits form a probability distribution:
This is the normalization that makes the first-digit law a genuine probability law in every base.
import Mathlib import Definitions.Def_BenfordLaw_Defs
namespace BenfordLaw
theorem benfordProb_sum_eq_one (b : ℕ) (hb : 2 ≤ b) :
∑ d ∈ Finset.Icc 1 (b - 1), benfordProb b d = 1 := 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 number with :
where ranges over the naturals in the closed interval (natural-number subtraction; since , and the range is nonempty) and . No other hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.