Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

For u transcendental over a subfield K of ℂ and integers 4 ≤ k < l, span_K{u^s : s ∈ {0, ±1, ±k, ±l}} carries a 2×3 configuration iff l ∈ {k+1, k+2, 2k−1, 2k, 2k+1, 3k}

Proved
DiazModulus.power_pair_hull_two_by_three_iff

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

combinatoricsdiaz-modulus-leantranscendence

A p×qp \times qp×q configuration over a field KKK in a KKK-subspace V⊆CV \subseteq \mathbb{C}V⊆C is a pair x1,…,xpx_1, \dots, x_px1​,…,xp​ and y1,…,yqy_1, \dots, y_qy1​,…,yq​ of complex numbers, each family linearly independent over KKK, with every product xiyjx_iy_jxi​yj​ in VVV; it is the input of Roy's strong six exponentials theorem when p=2p = 2p=2, q=3q = 3q=3, K=Q‾K = \overline{\mathbb{Q}}K=Q​ and V=L~V = \widetilde{\mathcal{L}}V=L.

Let KKK be a subfield of C\mathbb{C}C, uuu transcendental over KKK, and 4≤k<l4 \le k < l4≤k<l integers. The span of usu^sus, s∈{0,±1,±k,±l}s \in \{0, \pm1, \pm k, \pm l\}s∈{0,±1,±k,±l}, carries a 2×32 \times 32×3 configuration over KKK if and only if l∈{k+1,k+2,2k−1,2k,2k+1,3k}l \in \{k + 1, k + 2, 2k - 1, 2k, 2k + 1, 3k\}l∈{k+1,k+2,2k−1,2k,2k+1,3k}.

So at a candidate, Roy's strong six exponentials theorem applied through this hull excludes exactly these pairs uk,ul∈L~u^k, u^l \in \widetilde{\mathcal{L}}uk,ul∈L (DiazModulus.candidate_power_pair_not_both_mem_logAlgTilde) and says nothing about the others.

Proof. Compose DiazModulus.laurent_hull_config_iff (p=2p = 2p=2, q=3q = 3q=3), DiazModulus.two_sumset_iff_difference_count and DiazModulus.power_pair_difference_count_iff.

Novelty. Not found in the sources read; it is short. The exclusions themselves are Diaz (2007) by substitution; what is added is that the list is complete for this hull.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem power_pair_hull_two_by_three_iff (K : Subfield ℂ) (u : ℂ) (hT : Transcendental K u)
    (k l : ℤ) (hk : 4 ≤ k) (hkl : k < l) :
    (∃ (x : Fin 2 → ℂ) (y : Fin 3 → ℂ), LinearIndependent K x ∧ LinearIndependent K y ∧
      ∀ i j, x i * y j ∈ Submodule.span K
        ((fun s : ℤ => u ^ s) '' ({0, 1, -1, k, -k, l, -l} : Set ℤ))) ↔
    (l = k + 1 ∨ l = k + 2 ∨ l = 2 * k - 1 ∨ l = 2 * k ∨ l = 2 * k + 1 ∨ l = 3 * k) := by
  sorry

end DiazModulus
Source
Not found in the sources read (the exclusions it yields are substitutions in G. Diaz, Produits et quotients de combinaisons linéaires de logarithmes de nombres algébriques : conjectures et résultats partiels, J. Théor. Nombres Bordeaux 19 (2007), 373–391). R6 of the Diaz modulus mission (the polar-degree note). Formal proof: Diaz modulus mission, 8 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