Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

No first-order arithmetic differential operator for the exponential system of a candidate, unconditionally

Proved
DiazModulus.no_first_order_arithmetic_operator_unconditional

by carlok · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Let uuu be a candidate: u≠0u \neq 0u=0 with ∣u∣|u|∣u∣ and eue^{u}eu algebraic. Let F(z,w)=exp⁡(uz+uˉw)F(z, w) = \exp(uz + \bar u w)F(z,w)=exp(uz+uˉw), and let X=a ∂z+b ∂wX = a\,\partial_z + b\,\partial_wX=a∂z​+b∂w​ have polynomial coefficients a,ba, ba,b with algebraic coefficients. If (XF)(m,n)(XF)(m, n)(XF)(m,n) is algebraic at every lattice point (m,n)∈Z2(m, n) \in \mathbb{Z}^2(m,n)∈Z2, then a=b=0a = b = 0a=b=0.

This is DiazModulus.no_first_order_arithmetic_operator with its hypothesis, the linear independence of 1,u,uˉ1, u, \bar u1,u,uˉ over Q‾\overline{\mathbb{Q}}Q​, discharged by DiazModulus.candidate_qbar_independent_one_u_conj.

Proof. DiazModulus.no_first_order_arithmetic_operator u hu (DiazModulus.candidate_qbar_independent_one_u_conj u hu) a b ha hb hvalues.

Novelty. Nothing beyond the parent node; its page gives the argument and the attribution.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open ComplexConjugate

namespace DiazModulus

theorem no_first_order_arithmetic_operator_unconditional
    (u : ℂ) (hu : IsCandidate u)
    (a b : MvPolynomial (Fin 2) ℂ)
    (ha : ∀ d, IsAlgebraic ℚ (MvPolynomial.coeff d a))
    (hb : ∀ d, IsAlgebraic ℚ (MvPolynomial.coeff d b))
    (hvalues : ∀ m n : ℤ,
        IsAlgebraic ℚ
          ((MvPolynomial.eval (fun i : Fin 2 => if i = 0 then (m : ℂ) else (n : ℂ)) a * u
              + MvPolynomial.eval (fun i : Fin 2 => if i = 0 then (m : ℂ) else (n : ℂ)) b * conj u)
            * Complex.exp (u * m + conj u * n))) :
    a = 0 ∧ b = 0 := by
  sorry

end DiazModulus
Source
The statement and argument of `DiazModulus.no_first_order_arithmetic_operator` (Proposition 5.9 of the companion note, version 1.9), with its Baker hypothesis proved as `DiazModulus.candidate_qbar_independent_one_u_conj`. Formal proof: Diaz modulus mission, 2 October 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