Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Norms from a finite extension of ℚ(ω) to ℚ(ω), with size control

Proved
FourExp.exists_int_norm

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

four-exponentialsnumber-theorytranscendence

Let Q∈Z[X][Y]Q \in \mathbb{Z}[X][Y]Q∈Z[X][Y] be monic in YYY of degree ddd, vanishing at (ω,ω1)(\omega, \omega_1)(ω,ω1​) and minimal there: no non-zero polynomial of YYY-degree less than ddd vanishes at (ω,ω1)(\omega, \omega_1)(ω,ω1​). There is ccc such that for every Pol∈Z[X][Y]\mathrm{Pol} \in \mathbb{Z}[X][Y]Pol∈Z[X][Y] of YYY-degree less than ddd, length at most bbb and XXX-degree at most eee, with Pol(ω,ω1)≠0\mathrm{Pol}(\omega, \omega_1) \neq 0Pol(ω,ω1​)=0, there is P∈Z[X]P \in \mathbb{Z}[X]P∈Z[X], P≠0P \neq 0P=0, with length at most (cb)d(cb)^{d}(cb)d, degree at most d(e+c)d(e + c)d(e+c), and

∣P(ω)∣≤∣Pol(ω,ω1)∣ (c b max⁡(1,∣ω∣)e)d.|P(\omega)| \le |\mathrm{Pol}(\omega, \omega_1)|\,\big(c\,b\,\max(1, |\omega|)^{e}\big)^{d}.∣P(ω)∣≤∣Pol(ω,ω1​)∣(cbmax(1,∣ω∣)e)d.

PPP is the determinant of multiplication by Pol\mathrm{Pol}Pol on Z[X][Y]/(Q)\mathbb{Z}[X][Y]/(Q)Z[X][Y]/(Q) in the basis 1,Y,…,Yd−11, Y, \dots, Y^{d-1}1,Y,…,Yd−1: the norm from Q(ω,ω1)\mathbb{Q}(\omega, \omega_1)Q(ω,ω1​) to Q(ω)\mathbb{Q}(\omega)Q(ω), up to the denominators. No hypothesis on ω\omegaω 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).

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