If P₁P₂ = P₀² with deg P₁, deg P₂ ≤ 3 and P₀, P₁ independent, then P₀ = gQ₀Q₁, P₁ = gQ₁², P₂ = gQ₀² with Q₀, Q₁ independent of degree at most 1 and g = aQ₀ + bQ₁
ProvedDiazModulus.cubic_product_eq_square_normal_formLet be a field and with , , , and linearly independent over . Then there are of degree at most , linearly independent over , and such that, with ,
In particular is a Möbius transformation. For binary cubic forms this reads: if , then , and with linear forms ; the degree bounds account for the factors at infinity. It is the step of DiazModulus.circle_hull_progression_contains_square_or_reciprocal that makes a Möbius function of the ratio .
Proof. Divide out a common factor: and with coprime. From we get , and is coprime to , so divides , say ; then , and . Degrees add, so and . Since , a relation between and would give one between and ; so are independent. Writing , independence makes . Hence one of has degree , which gives , and by Cramer's rule every polynomial of degree at most , included, is a combination .
Novelty. Not asserted; elementary algebra.
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
theorem cubic_product_eq_square_normal_form {K : Type*} [Field K] (P₀ P₁ P₂ : Polynomial K)
(h₁ : P₁.natDegree ≤ 3) (h₂ : P₂.natDegree ≤ 3)
(hli : LinearIndependent K ![P₀, P₁]) (hrel : P₁ * P₂ = P₀ ^ 2) :
∃ Q₀ Q₁ : Polynomial K, Q₀.natDegree ≤ 1 ∧ Q₁.natDegree ≤ 1 ∧
LinearIndependent K ![Q₀, Q₁] ∧ ∃ a b : K,
P₀ = (Polynomial.C a * Q₀ + Polynomial.C b * Q₁) * Q₀ * Q₁ ∧
P₁ = (Polynomial.C a * Q₀ + Polynomial.C b * Q₁) * Q₁ ^ 2 ∧
P₂ = (Polynomial.C a * Q₀ + Polynomial.C b * Q₁) * Q₀ ^ 2 := by
sorry
end DiazModulus