Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Integer polynomials from small elements in a finite free algebra

Proved
TranscendenceTheory.small_polynomials_of_small_integral_elements

by tomasz · Sep 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebranumber-theorypolynomialstranscendence

Let θ be a complex number transcendental over Z. Let S be a commutative integral domain and a finite free algebra over Z[X], with basis b₀,…,b_d and b₀=1. Let φ:S→C be a ring homomorphism satisfying φ(p·1)=p(θ) for every integer polynomial p. Write qᵢ(x)∈Z[X] for the basis coordinates of x∈S.

Suppose C,c>0 and every sufficiently large integer N admits x_N≠0 such that

deg⁡qi(xN)≤CN,∣[Xk]qi(xN)∣≤eCN,∣φ(xN)∣≤e−cN2log⁡N.\deg q_i(x_N)\le CN,\qquad |[X^k]q_i(x_N)|\le e^{CN},\qquad |\varphi(x_N)|\le e^{-cN^2\log N}.degqi​(xN​)≤CN,∣[Xk]qi​(xN​)∣≤eCN,∣φ(xN​)∣≤e−cN2logN.

Then there are A>0 and N₀ such that every integer N≥N₀ admits p_N∈Z[X] with

deg⁡pN≤AN,∣[Xk]pN∣≤eAN,0<∣pN(θ)∣≤e−10(AN)2.\deg p_N\le AN,\qquad |[X^k]p_N|\le e^{AN},\qquad 0<|p_N(\theta)|\le e^{-10(AN)^2}.degpN​≤AN,∣[Xk]pN​∣≤eAN,0<∣pN​(θ)∣≤e−10(AN)2.

This statement isolates the norm-transfer step used to turn small integral elements into integer polynomials in a transcendental parameter. All bounds are uniform in N; the rank, basis, algebra, and homomorphism are fixed. Rank one is included.

Formalization Note. The input is eventual existence of elements, so no chosen sequence is required. The polynomial action and its compatibility with φ are explicit hypotheses.

Preamble
import Mathlib.RingTheory.Norm.Basic
import Mathlib.RingTheory.Algebraic.Basic
import Mathlib.Analysis.Complex.Polynomial.Basic
import Mathlib.Analysis.SpecialFunctions.Log.Basic

open Polynomial Module Filter
open scoped Polynomial
Formal statement
namespace TranscendenceTheory

theorem small_polynomials_of_small_integral_elements
    {S : Type*} [CommRing S] [IsDomain S] [Algebra ℤ[X] S]
    (θ : ℂ) (hθ : Transcendental ℤ θ)
    (φ : S →+* ℂ)
    (hφ : ∀ p : ℤ[X], φ (algebraMap ℤ[X] S p) = aeval θ p)
    (d : ℕ) (b : Basis (Fin (d + 1)) ℤ[X] S) (hb : b 0 = 1)
    (C c : ℝ) (hC : 0 < C) (hc : 0 < c)
    (hsmall : ∀ᶠ N : ℕ in atTop, ∃ x : S, x ≠ 0 ∧
      (∀ i, ((b.repr x i).natDegree : ℝ) ≤ C * N) ∧
      (∀ i k, |((b.repr x i).coeff k : ℝ)| ≤ Real.exp (C * N)) ∧
      ‖φ x‖ ≤ Real.exp (-c * (N : ℝ) ^ 2 * Real.log N)) :
    ∃ A : ℝ, 0 < A ∧ ∃ N₀ : ℕ, ∀ N : ℕ, N₀ ≤ N →
      ∃ p : ℤ[X], (p.natDegree : ℝ) ≤ A * N ∧
        (∀ k, |(p.coeff k : ℝ)| ≤ Real.exp (A * N)) ∧
        0 < ‖aeval θ p‖ ∧ ‖aeval θ p‖ ≤ Real.exp (-10 * (A * N) ^ 2) := by sorry

end TranscendenceTheory
Source
Determinant formulation of the norm-transfer argument in Senthil Kumar K (2026), Section 5, paragraphs immediately after Lemma 10, from the definition of theta_N through its degree and coefficient estimates; https://doi.org/10.1017/S001309152610145X. The finite free algebra form is a generalization of the fixed integral power-basis setting in Section 3. The degree envelope is relaxed to a linear one.

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