A five-dimensional Laurent hull span(1, v, v̄, z, z̄) without v² P(v) in it carries a 2×3 configuration only in the involution or real pencil normal form
ProvedDiazModulus.laurent_conj_hull_without_polynomial_part_configuration_classesLet with . Let , let for all , and put and . Suppose , contains no with non-zero, and carries a configuration (free and free over with all six products in the space). Then is in one of the two classes
- (Q) for some with , and ;
- (R) with , for some with and some with and .
Proof. The shifted polynomial model (DiazModulus.laurent_conj_hull_shifted_polynomial_model) writes as the image of under , with two-sided. A configuration in factors (DiazModulus.config_shifted_coprime_polynomial_factors) through coprime and free with and ; as is free the ratio is not constant, DiazModulus.two_by_three_configuration_ratio_degree_le_two bounds its degree by two, DiazModulus.coprime_pencil_of_degree_le_two_normal_form leaves four pencils, and DiazModulus.laurent_window_quadratic_pencils_carry_no_three_factors rules out and . For , DiazModulus.laurent_window_degree_one_pencil_factor_space gives with ; conjugation-stability of and the factor-space property give , and DiazModulus.laurent_degree_one_conj_stable_space_real_pencil_normal_form gives class (R), as excludes . For , DiazModulus.laurent_window_involution_pencil_normal_form puts in the involution normal form, carries it to , and DiazModulus.laurent_involution_space_conj_stable_constraints gives the constraints of class (Q).
Novelty. Not found in the sources read. It is most of the "only if" half of Theorem E (DiazModulus.laurent_conj_hull_two_by_three_configuration_iff); given its children, routine.
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
theorem laurent_conj_hull_without_polynomial_part_configuration_classes
(v : ℂ) (hv : v ∉ Qbar) (hv1 : v * conj v = 1) (k : ℕ) (c : ℤ → ℂ) (hc : ∀ j, c j ∈ Qbar)
(h5 : Module.finrank (↥Qbar) (Submodule.span Qbar ({1, v, conj v, (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * v ^ j), conj (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * v ^ j)} : Set ℂ)) = 5)
(hB : ∀ P : Polynomial ↥Qbar, v ^ 2 * Polynomial.aeval v P ∈ Submodule.span Qbar ({1, v, conj v, (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * v ^ j), conj (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * v ^ j)} : Set ℂ) → P = 0)
(hconf : ∃ (x : Fin 2 → ℂ) (y : Fin 3 → ℂ), LinearIndependent (↥Qbar) x ∧ LinearIndependent (↥Qbar) y ∧
∀ i j, x i * y j ∈ Submodule.span Qbar ({1, v, conj v, (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * v ^ j), conj (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * v ^ j)} : Set ℂ)) :
(∃ e β ζ : ℂ, e ∈ Qbar ∧ β ∈ Qbar ∧ ζ ∈ Qbar ∧ e * conj e = 1 ∧ β * conj β = 1 ∧
ζ = -(β * e ^ 2 * conj ζ) ∧
Submodule.span Qbar ({1, v, conj v, (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * v ^ j), conj (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * v ^ j)} : Set ℂ) =
Submodule.span Qbar ({1, v, conj v, conj v ^ 2 + e * v ^ 2, β * conj v ^ 3 + ζ * v ^ 2 + e * v ^ 3} : Set ℂ)) ∨
(∃ κ : ℂ, κ ∈ Qbar ∧ κ * conj κ = 1 ∧ ∃ G : Polynomial ↥Qbar, G.coeff 0 = 0 ∧ 2 ≤ G.natDegree ∧
Submodule.span Qbar ({1, v, conj v, (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * v ^ j), conj (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * v ^ j)} : Set ℂ) =
Submodule.span Qbar ({1, v, conj v, Polynomial.aeval v G + κ * conj (v * Polynomial.aeval v G), conj (Polynomial.aeval v G + κ * conj (v * Polynomial.aeval v G))} : Set ℂ)) := by
sorry
end DiazModulus