Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Scaled powers of an algebraic number are integer combinations of a fixed basis, with geometrically growing coefficients

Proved
Transcendence.exists_int_pow_repr

by carlok · Sep 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Let KKK be a field of characteristic zero and α∈K\alpha \in Kα∈K algebraic over Q\mathbb{Q}Q. There are ℓ,A∈N\ell, A \in \mathbb{N}ℓ,A∈N and an integer L≠0L \neq 0L=0 such that for every nnn,

Lnαn=∑l<ℓrl αlL^{n}\alpha^{n} = \sum_{l < \ell} r_l\, \alpha^{l}Lnαn=l<ℓ∑​rl​αl

for some integers rlr_lrl​ with ∣rl∣≤An|r_l| \le A^{n}∣rl​∣≤An.

Take for LLL the leading coefficient of an integer polynomial vanishing at α\alphaα: then LαL\alphaLα is an algebraic integer, and reducing its powers modulo a monic integer polynomial keeps the coefficients geometrically bounded.

Preamble
import Mathlib
Formal statement
namespace Transcendence

/-- Integral representations of the powers of an algebraic number, with controlled coefficients.

Let `α` be algebraic over `ℚ` in a field of characteristic zero, and let `m ∈ ℤ[X]` be a
non-constant integer polynomial vanishing at `α`, of degree `ℓ` and leading coefficient `L`.
Reducing `(L X)ⁿ` modulo `m` expresses `Lⁿ αⁿ` in the basis `1, α, …, α^(ℓ-1)` with integer
coordinates, and each reduction step multiplies the size of the coordinates by at most
`|L| + (sum of the absolute values of the coefficients of m)`. So the coordinates of `Lⁿ αⁿ`
are at most `Aⁿ` in absolute value, for a constant `A` depending only on `α`. -/
theorem exists_int_pow_repr {K : Type*} [Field K] [CharZero K] {α : K} (hα : IsAlgebraic ℚ α) :
    ∃ (ℓ A : ℕ) (L : ℤ), L ≠ 0 ∧ ∀ n : ℕ, ∃ r : ℕ → ℤ,
      (L : K) ^ n * α ^ n = ∑ l ∈ Finset.range ℓ, (r l : K) * α ^ l ∧
        ∀ l, (r l).natAbs ≤ A ^ n := by
  sorry

end Transcendence
Source
Standard. Formal proof: Diaz modulus mission, 25 September 2026 (C. Perassi).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me