Norms from a finite extension of ℚ(ω) to ℚ(ω), with size control
ProvedFourExp.exists_int_normfour-exponentialsnumber-theorytranscendence
Let be monic in of degree , vanishing at and minimal there: no non-zero polynomial of -degree less than vanishes at . There is such that for every of -degree less than , length at most and -degree at most , with , there is , , with length at most , degree at most , and
is the determinant of multiplication by on in the basis : the norm from to , up to the denominators. No hypothesis on is needed.
Preamble
import Mathlib
Formal statement
namespace FourExp
theorem exists_int_norm (ω ω₁ : ℂ) (Q : Polynomial (Polynomial ℤ)) (hQm : Q.Monic)
(hQroot : Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ Q = 0)
(hQmin : ∀ A : Polynomial (Polynomial ℤ), A.natDegree < Q.natDegree →
Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ A = 0 → A = 0) :
∃ c : ℕ, ∀ (Pol : Polynomial (Polynomial ℤ)) (b e : ℕ), Pol.natDegree < Q.natDegree →
∑ k ∈ Pol.support, ∑ i ∈ (Pol.coeff k).support, ((Pol.coeff k).coeff i).natAbs ≤ b →
(∀ k, (Pol.coeff k).natDegree ≤ e) →
Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ Pol ≠ 0 →
∃ P : Polynomial ℤ, P ≠ 0 ∧
∑ i ∈ P.support, (P.coeff i).natAbs ≤ (c * b) ^ Q.natDegree ∧
P.natDegree ≤ Q.natDegree * (e + c) ∧
‖Polynomial.aeval ω P‖ ≤
‖Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ Pol‖ *
(((c * b : ℕ) : ℝ) * max 1 ‖ω‖ ^ e) ^ Q.natDegree := by
sorry
end FourExp
Source
The core of the proof of Lemma 7 of M. Waldschmidt, Solution du huitième problème de Schneider, J. Number Theory 5 (1973), 191–202. Formal proof: Diaz modulus mission, 25 September 2026 (C. Perassi).