A binary quadratic form coprime to F that divides F·L divides L; read in formal degrees, so a zero at infinity counts
ProvedDiazModulus.binary_quadratic_dvd_of_coprime_mul_eqLet be a field, let and . Suppose that and are coprime, , or , , , and . Then for some with or . Here is the natural degree, with .
Read , , , as binary forms of degrees , , and . The hypothesis “ or ” says that and do not both vanish at , so with coprimality it makes and coprime as binary forms; the conclusion is that divides as binary forms. For it says .
Proof. If , then is a unit, being coprime to , and gives . Otherwise divides and is coprime to , so ; cancelling gives . If , then . If and , then .
Novelty. None claimed: Euclid's lemma for binary forms (a quadratic form coprime to that divides divides ), stated with formal degrees, so that a zero at counts. Routine formalisation. It is the divisibility step of the nodes on invisible degree-two spaces.
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
open Polynomial in
theorem binary_quadratic_dvd_of_coprime_mul_eq {K : Type*} [Field K] (P F L B : K[X]) (d e : ℕ)
(hPF : IsCoprime P F) (hF0 : F ≠ 0) (hdeg : P.natDegree = 2 ∨ F.natDegree = d)
(hL : L.natDegree ≤ e) (hB : B.natDegree + 2 ≤ d + e) (hFL : F * L = P * B) :
∃ L₀ : K[X], L = P * L₀ ∧ (L₀ = 0 ∨ L₀.natDegree + 2 ≤ e) := by
sorry
end DiazModulus