No first-order arithmetic differential operator for the exponential system of a candidate, unconditionally
ProvedDiazModulus.no_first_order_arithmetic_operator_unconditionaldiaz-modulus-leannumber-theorytranscendence
Let be a candidate: with and algebraic. Let , and let have polynomial coefficients with algebraic coefficients. If is algebraic at every lattice point , then .
This is DiazModulus.no_first_order_arithmetic_operator with its hypothesis, the linear independence of over , 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).