The powers of satisfy Benford's law
ProvedBenfordLaw.pow_two_isBenfordSeqThe sequence of powers of two, , satisfies Benford's law in base : for every ,
This is the special case of the mission goal, listed separately in the source.
Formalization Note. Encoded as IsBenfordSeq 10 (fun n => (2 : ℝ) ^ (n + 1)), with starting at .
import Mathlib import Definitions.Def_BenfordLaw_Defs
namespace BenfordLaw
theorem pow_two_isBenfordSeq :
IsBenfordSeq 10 (fun n => (2 : ℝ) ^ (n + 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 (, real powers of the real number ). Unfolded: for every natural with ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.