Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Wall: nonzero rational multiples preserve normality

Open
BorelNormality.isNormalReal_mul_rat

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

normal-numbersnumber-theory

Wall's invariance theorem (1949). Let b≥2b \ge 2b≥2 be an integer and xxx a real number normal in base bbb. If aaa is a nonzero rational number, then x⋅ax \cdot ax⋅a is again normal in base bbb:

IsNormalReal(b,x)  ∧  a∈Q∖{0}  ⟹  IsNormalReal(b,xa).\mathrm{IsNormalReal}(b, x) \;\wedge\; a \in \mathbb{Q}\setminus\{0\} \;\Longrightarrow\; \mathrm{IsNormalReal}(b, x a).IsNormalReal(b,x)∧a∈Q∖{0}⟹IsNormalReal(b,xa).

Normality in a fixed base is thus invariant under nonzero rational scaling (and, applying the theorem to 1/a1/a1/a, the converse holds as well). This lets reductions renormalise a number — for instance scale it into (0,1)(0,1)(0,1) — without losing normality, and is a basic structural lemma of the theory.

Formalization Note. The base bbb and the number xxx are implicit binders; aaa is coerced from Q\mathbb{Q}Q to R\mathbb{R}R. The predicate is Normal.IsNormalReal from Normal_Core.

Preamble
import Mathlib
import Definitions.Def_Normal_Core

set_option autoImplicit false
Formal statement
namespace BorelNormality

theorem isNormalReal_mul_rat {b : ℕ} (hb : 2 ≤ b) {x : ℝ}
    (hx : Normal.IsNormalReal b x) (a : ℚ) (ha : a ≠ 0) :
    Normal.IsNormalReal b (x * (a : ℝ)) := by sorry

end BorelNormality
Source
D. D. Wall, Normal Numbers, Ph.D. thesis, University of California, Berkeley, 1949. As stated in https://en.wikipedia.org/wiki/Normal_number, section 'Properties': 'If x is normal in base b, and a ≠ 0 is a rational number, then x·a is also normal in base b.'
Read-back

What the Lean code literally says, in plain math · GLM (Z.ai), same-agent blind pass — not an independent sub-agent

For every natural number bbb with 2≤b2 \le b2≤b, every real number xxx, and every rational number aaa: if Normal.IsNormalReal b x holds and a≠0a \ne 0a=0, then Normal.IsNormalReal b (x \cdot a) holds, where aaa is coerced to a real. Unfolding the predicate on both sides: if every word over {0,…,b−1}\{0, \dots, b-1\}{0,…,b−1} occurs in the digits n↦⌊xbn+1⌋ mod bn \mapsto \lfloor x b^{n+1}\rfloor \bmod bn↦⌊xbn+1⌋modb with limiting frequency (b∣w∣)−1(b^{|w|})^{-1}(b∣w∣)−1, then the same holds for the digits of xax axa. The binders bbb and xxx are implicit; hb:2≤bhb : 2 \le bhb:2≤b and ha:a≠0ha : a \ne 0ha:a=0 are explicit hypotheses. No sign or size restriction is placed on xxx or aaa beyond a≠0a \ne 0a=0; digits are fractional-part digits in the canonical expansion.

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