Absolutely normal real numbers
DefinitionBorelNormality_AbsolutelyNormalA real number is absolutely normal if it is normal in every integer base : for each such base, every finite block of base- digits occurs in the base- expansion of with limiting frequency .
This is the notion of normality appearing in Borel's conjecture on irrational algebraic numbers, and the standard notion of a normal number in the literature (Borel 1950; Becher, Normal numbers and computer science, Definition 1). It is reusable by any mission on normality.
Formalization Note. The definition wraps Normal.IsNormalReal from the platform definition file Normal_Core; digits are those of the fractional part of , in the canonical expansion that does not end in an infinite tail of .
import Mathlib import Definitions.Def_Normal_Core set_option autoImplicit false namespace BorelNormality /-- A real number is **absolutely normal** if it is normal in every integer base `b ≥ 2`. -/ def AbsolutelyNormal (x : ℝ) : Prop := ∀ b : ℕ, 2 ≤ b → Normal.IsNormalReal b x end BorelNormality
Read-back
What the Lean code literally says, in plain math · GLM (Z.ai), same-agent blind pass — not an independent sub-agent
The declaration defines a predicate on a real number : for every natural number with , Normal.IsNormalReal b x holds. Unfolding the imported definition, this means that for every finite list of natural numbers with all entries — including the empty list — the number of positions at which occurs in the digit sequence (integer floor, nonnegative remainder; is the first digit after the point), divided by , tends to as . Bases and are excluded by the hypothesis . No restriction is placed on : it may be negative, rational, or transcendental. The digits are those of the fractional part of , in the canonical expansion with no infinite tail of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.