For u ∉ Q̄ and a Möbius function h of u: if Q̄ + Q̄u + Q̄u⁻¹ + Σ Q̄ c hᵏ (k ≤ 3) is five-dimensional, it contains u², u⁻² or some 1/(u − b), b ≠ 0
ProvedDiazModulus.mobius_progression_space_contains_square_or_reciprocalLet , let with , put , and let be non-zero. If the -span of and has dimension , then contains , or for some non-zero .
This is the index-one half of the classification of the progression spaces (Case I): when the ratio of the progression generates , the space contains one of the elements of Theorem B (DiazModulus.circle_point_extension_two_by_three_configuration_iff), so when is algebraic Theorem B sees it. With R9's involution spaces (the index-two half) it accounts for every five-dimensional space containing a -term progression; that the index is or is proved in the research notes and is not formalised.
Proof. Put , and , so . From and () every , , lies in . The spaces and have dimensions and , and has dimension at most , so : there are non-zero polynomials , of degrees at most and with , . Induction on : if is constant, is a polynomial in and ; otherwise has a root , and either and cancels, or . Dividing by gives , () or , hence , in . Only the dimension bound is used, not the equality.
Novelty. Not found in the sources read; it is short.
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
theorem mobius_progression_space_contains_square_or_reciprocal
(u : ℂ) (hu : u ∉ Qbar) (α β γ δ c : ℂ) (hα : α ∈ Qbar) (hβ : β ∈ Qbar) (hγ : γ ∈ Qbar)
(hδ : δ ∈ Qbar) (hdet : α * δ - β * γ ≠ 0) (hc : c ≠ 0)
(hdim : Module.finrank (↥Qbar) (Submodule.span Qbar (({1, u, u⁻¹} : Set ℂ) ∪
Set.range (fun k : Fin 4 => c * ((α * u + β) / (γ * u + δ)) ^ (k : ℕ)))) = 5) :
u ^ 2 ∈ Submodule.span Qbar (({1, u, u⁻¹} : Set ℂ) ∪
Set.range (fun k : Fin 4 => c * ((α * u + β) / (γ * u + δ)) ^ (k : ℕ))) ∨
(u ^ 2)⁻¹ ∈ Submodule.span Qbar (({1, u, u⁻¹} : Set ℂ) ∪
Set.range (fun k : Fin 4 => c * ((α * u + β) / (γ * u + δ)) ^ (k : ℕ))) ∨
∃ b ∈ Qbar, b ≠ 0 ∧ (u - b)⁻¹ ∈ Submodule.span Qbar (({1, u, u⁻¹} : Set ℂ) ∪
Set.range (fun k : Fin 4 => c * ((α * u + β) / (γ * u + δ)) ^ (k : ℕ))) := by
sorry
end DiazModulus