In base every nonzero number has leading digit
ProvedBenfordLaw.leadingDigit_two_eq_oneFor every real number , the leading binary digit of is :
Consequently Benford's law in base is true but trivial: .
Formalization Note. Negative are read through (Lean's Real.logb convention).
import Mathlib import Definitions.Def_BenfordLaw_Defs
namespace BenfordLaw
theorem leadingDigit_two_eq_one (x : ℝ) (hx : x ≠ 0) :
leadingDigit 2 x = 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 real with : , where and the floor is taken into . (The hypothesis is not needed for the value — by the junk convention — but it is part of the statement.)
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.