Powers satisfy Benford's law when is irrational
ProvedBenfordLaw.pow_isBenfordSeq_of_irrational_logbLet be a natural number such that is irrational (equivalently, is not a power of ). Then the sequence satisfies Benford's law in base : for every ,
This is the goal theorem of the mission; the powers of are the case .
Formalization Note. Encoded as IsBenfordSeq 10 (fun n => (k : ℝ) ^ (n + 1)). The case is excluded automatically because in Lean, which is rational.
import Mathlib import Definitions.Def_BenfordLaw_Defs
namespace BenfordLaw
theorem pow_isBenfordSeq_of_irrational_logb (k : ℕ) (hk : Irrational (Real.logb 10 k)) :
IsBenfordSeq 10 (fun n => (k : ℝ) ^ (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 every natural such that the real number is irrational (this excludes , since Lean sets , and ): for (). Unfolded: for every natural , the proportion of with tends to as .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.