Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

For u ∉ Q̄ and real algebraic s with s² = uū, the cyclic space with double poles at ±s is five-dimensional and excludes u², ū², 1/(u − e)

Proved
DiazModulus.cyclic_pair_space_excludes_squares_and_reciprocals

by carlok · Oct 15, 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​ and let s∈Q‾s \in \overline{\mathbb{Q}}s∈Q​ be real with s2=uuˉs^2 = u\bar us2=uuˉ (so uˉ=s2/u\bar u = s^2/uuˉ=s2/u). With v=u/sv = u/sv=u/s, put G1=1/(v−1)+2/(v+1)G_1 = 1/(v - 1) + 2/(v + 1)G1​=1/(v−1)+2/(v+1) and G2=1/(v−1)2+1/(v−1)−2/(v+1)2+2/(v+1)G_2 = 1/(v - 1)^2 + 1/(v - 1) - 2/(v + 1)^2 + 2/(v + 1)G2​=1/(v−1)2+1/(v−1)−2/(v+1)2+2/(v+1), and let WWW be the Q‾\overline{\mathbb{Q}}Q​-span of 1,u,uˉ,G1,G21, u, \bar u, G_1, G_21,u,uˉ,G1​,G2​ (poles at u=±su = \pm su=±s, each a double pole). Then the five numbers are free over Q‾\overline{\mathbb{Q}}Q​, and WWW contains none of u2u^2u2, uˉ2\bar u^2uˉ2 and 1/(u−e)1/(u - e)1/(u−e) for non-zero e∈Q‾e \in \overline{\mathbb{Q}}e∈Q​.

Proof. As u∉Q‾u \notin \overline{\mathbb{Q}}u∈/Q​, u≠±su \neq \pm su=±s; and uˉu=s2\bar u u = s^2uˉu=s2, G1(u2−s2)=s(3u−s)G_1(u^2 - s^2) = s(3u - s)G1​(u2−s2)=s(3u−s), G2(u2−s2)2=su(3u2−2su+3s2)G_2(u^2 - s^2)^2 = su(3u^2 - 2su + 3s^2)G2​(u2−s2)2=su(3u2−2su+3s2). For w=c1+c2u+c3uˉ+c4G1+c5G2w = c_1 + c_2u + c_3\bar u + c_4G_1 + c_5G_2w=c1​+c2​u+c3​uˉ+c4​G1​+c5​G2​ the product u(u2−s2)2wu(u^2 - s^2)^2wu(u2−s2)2w is a polynomial of degree 666 in uuu over Q‾\overline{\mathbb{Q}}Q​, with constant term c3s6c_3s^6c3​s6, linear coefficient (c1+c4)s4(c_1 + c_4)s^4(c1​+c4​)s4, u4u^4u4-coefficient (c3−2c2)s2+3(c4+c5)s(c_3 - 2c_2)s^2 + 3(c_4 + c_5)s(c3​−2c2​)s2+3(c4​+c5​)s and top terms c1u5+c2u6c_1u^5 + c_2u^6c1​u5+c2​u6; as uuu is transcendental, identities between such polynomials hold coefficientwise. Freeness: w=0w = 0w=0 gives c2=c1=0c_2 = c_1 = 0c2​=c1​=0, then c3=c4=0c_3 = c_4 = 0c3​=c4​=0 and 3sc5=03sc_5 = 03sc5​=0. If w=u2w = u^2w=u2, u(u2−s2)2w=u3(u2−s2)2u(u^2 - s^2)^2w = u^3(u^2 - s^2)^2u(u2−s2)2w=u3(u2−s2)2 would have a u7u^7u7 term. If w=uˉ2=s4/u2w = \bar u^2 = s^4/u^2w=uˉ2=s4/u2, then u⋅u(u2−s2)2w=s4(u2−s2)2u \cdot u(u^2 - s^2)^2w = s^4(u^2 - s^2)^2u⋅u(u2−s2)2w=s4(u2−s2)2 would have the constant term s8s^8s8, which uuu times a polynomial cannot have. For (u−e)−1(u - e)^{-1}(u−e)−1, (u−e) u(u2−s2)2w=u(u2−s2)2(u - e)\,u(u^2 - s^2)^2w = u(u^2 - s^2)^2(u−e)u(u2−s2)2w=u(u2−s2)2 evaluated at eee gives e(e2−s2)2=0e(e^2 - s^2)^2 = 0e(e2−s2)2=0, so e=±se = \pm se=±s; then explicit combinations of the coefficient equations give 8s5=08s^5 = 08s5=0, resp. 4s5=04s^5 = 04s5=0. In terms of poles: an element of WWW with a pole at sss has one at −s-s−s, and conversely.

Novelty. Not found in the sources read; routine.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem cyclic_pair_space_excludes_squares_and_reciprocals
    (u s : ℂ) (hu : u ∉ Qbar) (hs : s ∈ Qbar) (hsr : conj s = s) (hss : s * s = u * conj u) :
    LinearIndependent (↥Qbar) ![1, u, conj u, (s / (u - s) + 2 * s / (u + s)), (s * s / (u - s) ^ 2 + s / (u - s) - 2 * (s * s) / (u + s) ^ 2 + 2 * s / (u + s))] ∧
      u ^ 2 ∉ Submodule.span Qbar ({1, u, conj u, (s / (u - s) + 2 * s / (u + s)), (s * s / (u - s) ^ 2 + s / (u - s) - 2 * (s * s) / (u + s) ^ 2 + 2 * s / (u + s))} : Set ℂ) ∧
      conj u ^ 2 ∉ Submodule.span Qbar ({1, u, conj u, (s / (u - s) + 2 * s / (u + s)), (s * s / (u - s) ^ 2 + s / (u - s) - 2 * (s * s) / (u + s) ^ 2 + 2 * s / (u + s))} : Set ℂ) ∧
      ∀ e ∈ Qbar, e ≠ 0 → (u - e)⁻¹ ∉ Submodule.span Qbar ({1, u, conj u, (s / (u - s) + 2 * s / (u + s)), (s * s / (u - s) ^ 2 + s / (u - s) - 2 * (s * s) / (u + s) ^ 2 + 2 * s / (u + s))} : Set ℂ) := by
  sorry

end DiazModulus
Source
Not found in the sources read. R15 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 15 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