Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Absolutely normal real numbers

Definition
BorelNormality_AbsolutelyNormal

by LG · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

normal-numbersnumber-theory

A real number xxx is absolutely normal if it is normal in every integer base b≥2b \ge 2b≥2: for each such base, every finite block of kkk base-bbb digits occurs in the base-bbb expansion of xxx with limiting frequency b−kb^{-k}b−k.

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 xxx, in the canonical expansion that does not end in an infinite tail of b−1b-1b−1.

Definition code
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
Source
É. Borel, Sur les chiffres décimaux de √2 et divers problèmes de probabilités en chaîne, C. R. Acad. Sci. Paris 230 (1950), 591–593; V. Becher, Normal numbers and computer science (MPRI chapter), Definition 1, https://www.irif.fr/~carton/Enseignement/MPRI/Dynam-symbol/Documents/chapter.pdf ; https://en.wikipedia.org/wiki/Normal_number
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 xxx: for every natural number bbb with 2≤b2 \le b2≤b, Normal.IsNormalReal b x holds. Unfolding the imported definition, this means that for every finite list www of natural numbers with all entries <b< b<b — including the empty list — the number of positions i<Ni < Ni<N at which www occurs in the digit sequence n↦⌊x⋅bn+1⌋ mod bn \mapsto \lfloor x \cdot b^{n+1} \rfloor \bmod bn↦⌊x⋅bn+1⌋modb (integer floor, nonnegative remainder; n=0n = 0n=0 is the first digit after the point), divided by NNN, tends to (b∣w∣)−1(b^{|w|})^{-1}(b∣w∣)−1 as N→∞N \to \inftyN→∞. Bases 000 and 111 are excluded by the hypothesis 2≤b2 \le b2≤b. No restriction is placed on xxx: it may be negative, rational, or transcendental. The digits are those of the fractional part of xxx, in the canonical expansion with no infinite tail of b−1b-1b−1.

Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me