For a coprime pencil of degree 2 in characteristic zero, q, p and the Wronskian p′q − pq′ span the polynomials of degree at most 2
ProvedDiazModulus.quadratic_pencil_wronskian_spanLet be a field of characteristic zero, let be coprime with , and let be their Wronskian. Then every of degree at most is for some .
Characteristic zero is needed: in characteristic , and give .
Proof. Write for the coefficients of and . By DiazModulus.quadratic_pencil_wronskian_identities, , so the matrix whose rows are the coefficient vectors of , and in the basis has determinant , with . By DiazModulus.quadratic_pencil_resultant_ne_zero, , and in characteristic zero, so is invertible. If is the coefficient vector of , the vector satisfies , which says, coefficient by coefficient, that ; the coefficients of degree at least vanish on both sides.
Novelty. Classical (the Bezoutian and the Wronskian of a pencil of binary quadratics); routine.
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
open Polynomial in
theorem quadratic_pencil_wronskian_span {K : Type*} [Field K] [CharZero K] (p q : K[X])
(hcop : IsCoprime p q) (hdeg : max p.natDegree q.natDegree = 2) (R : K[X]) (hR : R.natDegree ≤ 2) :
∃ a b c : K, R = C a * q + C b * p + C c * (derivative p * q - p * derivative q) := by
sorry
end DiazModulus