Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Borel 1950: the decimal expansion of 2\sqrt{2}2​ is normal

Open
BorelNormality.sqrt_two_normal_base_ten

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

normal-numbersnumber-theory

The headline open special case of Borel's conjecture: the real number 2\sqrt{2}2​ is normal in base ten. Every finite block of kkk decimal digits occurs in the decimal expansion of 2\sqrt{2}2​ with limiting frequency 10−k10^{-k}10−k:

IsNormalReal(10,2).\mathrm{IsNormalReal}(10, \sqrt{2}).IsNormalReal(10,2​).

Borel's 1950 note was specifically about the decimal digits of 2\sqrt{2}2​. The statement is open: it is not even known whether the digit 777 occurs infinitely often in the decimal expansion of 2\sqrt{2}2​ (Adamczewski–Bugeaud 2007, Introduction). It follows from the mission's goal, since 2\sqrt{2}2​ is irrational and algebraic, and is the simplest concrete target on the way there.

Formalization Note. Real.sqrt 2 is the nonnegative real square root of 222; the predicate is Normal.IsNormalReal from Normal_Core at the fixed base 101010.

Preamble
import Mathlib
import Definitions.Def_Normal_Core

set_option autoImplicit false
Formal statement
namespace BorelNormality

theorem sqrt_two_normal_base_ten : Normal.IsNormalReal 10 (Real.sqrt 2) := by sorry

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; https://en.wikipedia.org/wiki/Normal_number, section 'Borel's normality conjecture'; B. Adamczewski, Y. Bugeaud, Ann. of Math. (2) 165 (2007), 547–565, Introduction (p. 547): 'we even do not know whether the digit 7 occurs infinitely often in the decimal expansion of √2.'
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 asserts, with no hypotheses, that Normal.IsNormalReal 10 (Real.sqrt 2) holds: every finite list www of natural numbers with all entries <10< 10<10 (including the empty list) occurs in the digit sequence n↦⌊2⋅10n+1⌋ mod 10n \mapsto \lfloor \sqrt{2} \cdot 10^{n+1} \rfloor \bmod 10n↦⌊2​⋅10n+1⌋mod10 with limiting relative frequency (10∣w∣)−1(10^{|w|})^{-1}(10∣w∣)−1, where 2\sqrt{2}2​ is the nonnegative real square root of 222 and n=0n = 0n=0 indexes the first digit after the decimal point. Digits are taken in the canonical expansion (no infinite tail of 999). The base is fixed to 101010; no other base is claimed.

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