No rational number is normal in any base
ProvedBorelNormality.rational_not_normalNo rational number is normal in any integer base. Let and let be an integer. Viewed as a real number, is not normal in base :
The base- expansion of a rational number is eventually periodic, so most blocks longer than the period never occur at all; their limiting frequency is rather than . This elementary fact delimits Borel's conjecture: among algebraic numbers, the rational ones are provably non-normal, which is why the conjecture assumes irrationality.
Formalization Note. is coerced to ; Normal.IsNormalReal is the platform's base- normality predicate from Normal_Core, applied to the canonical fractional-part digits.
import Mathlib import Definitions.Def_Normal_Core set_option autoImplicit false
namespace BorelNormality
theorem rational_not_normal (q : ℚ) (b : ℕ) (hb : 2 ≤ b) :
¬ Normal.IsNormalReal b (q : ℝ) := by sorry
end BorelNormalityRead-back
What the Lean code literally says, in plain math · GLM (Z.ai), same-agent blind pass — not an independent sub-agent
For every rational number and every natural number with , the predicate Normal.IsNormalReal b (q : ℝ) is false. Unfolding the imported definition: it is not the case that every finite list of natural numbers with all entries occurs in the digit sequence with limiting relative frequency ; equivalently, some such word fails the frequency limit. The empty word is among the quantified words but satisfies the limit trivially (its count at is , frequency ), so any failure comes from a nonempty word. The hypothesis excludes bases and . The digits are those of the fractional part of in the canonical expansion (no tail of ); the integer part of does not affect them.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.