Adamczewski–Bugeaud Theorem 1: complexity of algebraic expansions
OpenBorelNormality.adamczewski_bugeaud_complexityAdamczewski–Bugeaud (2007), Theorem 1. Let be an integer and let be an irrational algebraic real number. The complexity function of the base- expansion of — the number of distinct blocks of digits occurring in it — satisfies
This is the strongest known general result about the digit expansions of irrational algebraic numbers, and the closest approach to Borel's conjecture to date: a number normal in base has , so the theorem is a very weak shadow of the conjectured behaviour. Its proof is a combinatorial transcendence criterion derived from the Schmidt Subspace Theorem. In particular every irrational real number with sub-linear complexity () is transcendental.
Formalization Note. The limit inferior is taken in ENNReal () along Filter.atTop, with value ⊤ (); this is equivalent to . The complexity function is BorelNormality.complexity from the mission's definition file.
import Mathlib import Definitions.Def_Normal_Core import Definitions.Def_BorelNormality_Complexity set_option autoImplicit false
namespace BorelNormality
theorem adamczewski_bugeaud_complexity (x : ℝ) (hx : IsAlgebraic ℚ x) (hi : Irrational x)
(b : ℕ) (hb : 2 ≤ b) :
Filter.liminf (fun n : ℕ => (complexity b x n : ENNReal) / (n : ENNReal)) Filter.atTop = ⊤ := 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 real number , every proof that is algebraic over (a nonzero polynomial over vanishes at ), every proof that is irrational ( is not in the range of the coercion ), every natural number and every proof of : the limit inferior, along the cofinite filter on , of the sequence computed in equals . Here is BorelNormality.complexity b x n, the number of distinct length- words over occurring in the digit sequence . At the denominator is and the quotient is (since ); the limit inferior along atTop is unaffected by this and any finite set of initial terms. The conclusion is equivalent to the whole sequence tending to ; the statement uses , matching the source.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.