For p, q of degree at most 2, the Wronskian J = p′q − pq′ in coefficients, and J² = d₂p² + d₁pq + d₀q² with d the discriminant of p − Xq
ProvedDiazModulus.quadratic_pencil_wronskian_identitiesdiaz-modulus-leannumber-theorytranscendence
Let be a commutative ring and of degree at most ; write for their coefficients of and for the Wronskian. Then:
- ;
- with , and .
Here is the discriminant, in , of . With the identity for reads .
Proof. A polynomial of degree at most is , with its coefficients, so it suffices to prove both identities for two explicit quadratics whose six coefficients are arbitrary elements of . There the derivatives are computed term by term, and both identities are polynomial identities in the six coefficients, closed by ring normalisation. Only the commutativity of is used.
Novelty. Classical (the Bezoutian and the Wronskian of a pencil of binary quadratics); routine.
Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate
namespace DiazModulus
open Polynomial in
theorem quadratic_pencil_wronskian_identities {K : Type*} [CommRing K] (p q : K[X])
(hp : p.natDegree ≤ 2) (hq : q.natDegree ≤ 2) :
derivative p * q - p * derivative q =
C (p.coeff 2 * q.coeff 1 - p.coeff 1 * q.coeff 2) * X ^ 2
+ C (2 * (p.coeff 2 * q.coeff 0 - p.coeff 0 * q.coeff 2)) * X
+ C (p.coeff 1 * q.coeff 0 - p.coeff 0 * q.coeff 1) ∧
(derivative p * q - p * derivative q) ^ 2 =
C (q.coeff 1 ^ 2 - 4 * q.coeff 2 * q.coeff 0) * p ^ 2
+ C (4 * (p.coeff 2 * q.coeff 0 + p.coeff 0 * q.coeff 2) - 2 * p.coeff 1 * q.coeff 1) * (p * q)
+ C (p.coeff 1 ^ 2 - 4 * p.coeff 2 * p.coeff 0) * q ^ 2 := by
sorry
end DiazModulus
Source
Classical: the Wronskian of a pencil of binary quadratics, whose square is the discriminant of the pencil written as a quadratic form in the two members. R20 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 23 October 2026 (C. Perassi).