Degree-compatible chosen bases and the commutative D-Wronskian matrix
DefinitionDerivationHitting_Commutative_Supplement_WronskianDataLet F be a field, let f be a commutative polynomial in n variables, and let g₁,…,gᵣ be a family. A degree-compatible basis is linearly independent, spans the published ordinary derivative space of f, is ordered by total degree, and spans each degree-filtration piece using its members of degree at most that level. This makes the basis choice in §3 explicit even when degrees repeat.
For arbitrary rational kernels bᵢ(t), reuse the published operator D=∂ₜ+Σᵢbᵢ(t)∂ₓᵢ and the embedding of F[x] into F(t)[x]. Define the matrix, rather than just its determinant, by
There are no normalizations of nonzero scalar polynomials and no nonvanishing or factorization certificates in this definition. The derivative space, rational differentiation and coefficient embeddings are imported from their published base bundles.
import Definitions.Def_DerivationHitting_Commutative_DifferentialData
namespace DerivationHitting.Commutative.Supplement
noncomputable section
/-- The chosen basis spans each degree-filtration piece, and is ordered by degree.
Unlike mere degree sorting, this implies the earlier-index derivative relations. -/
def DegreeCompatibleBasis {F : Type*} [Field F] {n r : ℕ}
(f : MvPolynomial (Fin n) F) (g : Fin r → MvPolynomial (Fin n) F) : Prop :=
LinearIndependent F g ∧
Submodule.span F (Set.range g) = partialSpace f ∧
(∀ i j, i ≤ j → (g i).totalDegree ≤ (g j).totalDegree) ∧
∀ (d : ℕ) (p : MvPolynomial (Fin n) F),
(p ∈ partialSpace f ∧ p.totalDegree ≤ d) ↔
p ∈ Submodule.span F {q | ∃ j, g j = q ∧ (g j).totalDegree ≤ d}
/-- The matrix itself, rather than the published determinant. -/
def derivationWronskianMatrix {F : Type*} [Field F] {n r : ℕ}
(b : Fin n → RatFunc F) (g : Fin r → MvPolynomial (Fin n) F) :
Matrix (Fin r) (Fin r) (MvPolynomial (Fin n) (RatFunc F)) :=
fun m j => (linearDerivation b)^[m.val] (rationalPolynomial (g j))
end
end DerivationHitting.Commutative.Supplement