For f = P(u)/Q(u) in lowest terms, W(λ, f) = span(1, u, ū, f, f/(s + λu)) is visible to the four-dimensional extensions exactly when a degree bound holds
ProvedDiazModulus.rational_pencil_space_visible_to_four_dimensional_extensions_iff_natDegree_leLet , with , and with . Let and call visible to the four-dimensional extensions if some makes carry a configuration (free and free over with all six products in the space). Let be coprime, , and suppose are free over . Then is visible to the four-dimensional extensions if and only if
where is when the condition holds and otherwise. For real these are the conjugation-stable spaces of DiazModulus.conj_stable_real_pencil_space_carries_two_by_three_configuration; the criterion does not need real.
Proof. Put and , so and : the space is , and these five are free. If , with coprime to ; if , and . DiazModulus.rational_degree_one_space_visible_to_four_dimensional_extensions_iff_natDegree_le applied to that fraction gives the bound in both cases.
Novelty. Not found in the sources read; routine. For Laurent it contains the invisibility in DiazModulus.laurent_real_pencil_configuration_invisible_to_four_dimensional_extensions.
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
open Polynomial in
theorem rational_pencil_space_visible_to_four_dimensional_extensions_iff_natDegree_le
(u s : ℂ) (hu : u ∉ Qbar) (hs : s ∈ Qbar) (hss : s * s = u * conj u)
(lam : ℂ) (hlam : lam ∈ Qbar) (hlam1 : lam * conj lam = 1)
(P Q : (↥Qbar)[X]) (hcop : IsCoprime P Q)
(hind : LinearIndependent (↥Qbar) ![1, u, conj u, aeval u P / aeval u Q, aeval u P / aeval u Q / (s + lam * u)]) :
(∃ w ∈ Submodule.span Qbar ({1, u, conj u, aeval u P / aeval u Q, aeval u P / aeval u Q / (s + lam * u)} : Set ℂ), w ∉ Submodule.span Qbar ({1, u, conj u} : Set ℂ) ∧
∃ (x : Fin 2 → ℂ) (y : Fin 3 → ℂ), LinearIndependent (↥Qbar) x ∧ LinearIndependent (↥Qbar) y ∧
∀ i j, x i * y j ∈ Submodule.span Qbar ({1, u, conj u, w} : Set ℂ)) ↔
max P.natDegree (Q.natDegree + 1) ≤
2 + (if Q.coeff 0 = 0 then 1 else 0) + (if aeval (-(s * conj lam)) P = 0 then 1 else 0) := by
sorry
end DiazModulus