Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A 2×3 configuration whose products times u^N are values at u of polynomials in H factors through coprime a₀, a₁ and free b₀, b₁, b₂ with aᵢbⱼ ∈ H

Proved
DiazModulus.config_shifted_coprime_polynomial_factors

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

diaz-modulus-leannumber-theorytranscendence

Let u∈C∖Q‾u \in \mathbb{C} \setminus \overline{\mathbb{Q}}u∈C∖Q​, let H⊆Q‾[X]H \subseteq \overline{\mathbb{Q}}[X]H⊆Q​[X] be a Q‾\overline{\mathbb{Q}}Q​-subspace and N≥0N \geq 0N≥0. Let x0,x1∈Cx_0, x_1 \in \mathbb{C}x0​,x1​∈C be linearly independent over Q‾\overline{\mathbb{Q}}Q​, and y0,y1,y2∈Cy_0, y_1, y_2 \in \mathbb{C}y0​,y1​,y2​∈C too, such that for all i,ji, ji,j there is Qij∈HQ_{ij} \in HQij​∈H with Qij(u)=uNxiyjQ_{ij}(u) = u^Nx_iy_jQij​(u)=uNxi​yj​. Then there are coprime a0,a1∈Q‾[X]a_0, a_1 \in \overline{\mathbb{Q}}[X]a0​,a1​∈Q​[X] and linearly independent b0,b1,b2∈Q‾[X]b_0, b_1, b_2 \in \overline{\mathbb{Q}}[X]b0​,b1​,b2​∈Q​[X] with aibj∈Ha_ib_j \in Hai​bj​∈H for all i,ji, ji,j and x1a0(u)=x0a1(u)x_1a_0(u) = x_0a_1(u)x1​a0​(u)=x0​a1​(u).

Proof. As uuu is transcendental over Q‾\overline{\mathbb{Q}}Q​, evaluation at uuu is injective on Q‾[X]\overline{\mathbb{Q}}[X]Q​[X]. Each QijQ_{ij}Qij​ is non-zero, and the 2×22 \times 22×2 minors QijQi′j′−Qij′Qi′jQ_{ij}Q_{i'j'} - Q_{ij'}Q_{i'j}Qij​Qi′j′​−Qij′​Qi′j​ vanish at uuu, hence vanish; DiazModulus.rank_one_polynomial_matrix_factor gives Qij=aibjQ_{ij} = a_ib_jQij​=ai​bj​ with a0,a1a_0, a_1a0​,a1​ coprime, so aibj∈Ha_ib_j \in Hai​bj​∈H. The bj(u)=(uNx0/a0(u)) yjb_j(u) = (u^Nx_0/a_0(u))\,y_jbj​(u)=(uNx0​/a0​(u))yj​ are a non-zero multiple of the free family yyy, so bbb is free; and x1a0(u)b0(u)=uNx0x1y0=x0a1(u)b0(u)x_1a_0(u)b_0(u) = u^Nx_0x_1y_0 = x_0a_1(u)b_0(u)x1​a0​(u)b0​(u)=uNx0​x1​y0​=x0​a1​(u)b0​(u), where b0(u)≠0b_0(u) \neq 0b0​(u)=0 cancels.

Novelty. Not found in the sources read in this form; routine. It is the normalisation of DiazModulus.config_shifted_polynomial_spans, sharpened by the rank-one factorisation DiazModulus.rank_one_polynomial_matrix_factor.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

open Polynomial in
theorem config_shifted_coprime_polynomial_factors {u : ℂ} (hu : u ∉ Qbar)
    (Hull : Submodule (↥Qbar) (↥Qbar)[X]) (N : ℕ)
    (x : Fin 2 → ℂ) (y : Fin 3 → ℂ) (hx : LinearIndependent (↥Qbar) x)
    (hy : LinearIndependent (↥Qbar) y)
    (hxy : ∀ i j, ∃ Q ∈ Hull, aeval u Q = u ^ N * (x i * y j)) :
    ∃ (a : Fin 2 → (↥Qbar)[X]) (b : Fin 3 → (↥Qbar)[X]), IsCoprime (a 0) (a 1) ∧
      LinearIndependent (↥Qbar) b ∧ (∀ i j, a i * b j ∈ Hull) ∧
      x 1 * aeval u (a 0) = x 0 * aeval u (a 1) := by
  sorry

end DiazModulus
Source
Not found in the sources read in this form; it sharpens the normalisation of DiazModulus.config_shifted_polynomial_spans. Uses DiazModulus.rank_one_polynomial_matrix_factor. R18 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 18 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