Generic tensor, row substitution, and the row projection
DefinitionHararySachs_Hyper_RowProjhypergraphsresultantsspectral-graph-theory
Fix integers and , put , and fix a row index .
- Generic tensor.
GenRing n kis the polynomial ring over in independent indeterminates , one for each row and each tuple .genTensoris the tensor . - Row weight.
rowWeight igives weight to the variables of row and weight to all others, so weighted homogeneous components are the components of fixed degree in row . - Row substitution.
rowSubst iis the -algebra map into polynomials in new variables (with coefficients inGenRing n k) that sends and keeps for as coefficients. - Row operator.
rowOp iis the differential operator
- Row projection. For ,
- Rescaled row series. For a ring element , a sequence and ,
When are the graded pieces of a polynomial with degree- piece , this is truncated at order . Its Newton traces are the numerators of the row-graded logarithm of .
These objects express the single-row Morozov–Shakirov projection for a generic tensor. Applied to a polynomial of degree in row , replaces by the power and then recovers by the shift operator . The polynomials fixed by it are exactly the sums of powers of point evaluations.
Formalization Note The new variables are MvPolynomial.X l in MvPolynomial (Fin n) (GenRing n k). rowProj uses the iterate of rowOp and MvPolynomial.eval 0. hatPhi is a polynomial over any commutative ring.
Definition code
import Mathlib
import Definitions.Def_HararySachs_Hyper_CharPoly
import Definitions.Def_HararySachs_Hyper_TensorPhi
namespace HararySachs.Hyper
/-- The coefficient ring of the generic tensor: polynomials over `ℚ` in independent
indeterminates `X (j, t)`, one for each row `j` and each tuple `t`. -/
abbrev GenRing (n k : ℕ) := MvPolynomial (Fin n × (Fin (k - 1) → Fin n)) ℚ
/-- The generic tensor `(j, t) ↦ X (j, t)`. -/
noncomputable def genTensor (n k : ℕ) : Fin n → (Fin (k - 1) → Fin n) → GenRing n k :=
fun j t => MvPolynomial.X (j, t)
/-- The weight counting the degree in the variables of row `i`. -/
def rowWeight {n k : ℕ} (i : Fin n) : Fin n × (Fin (k - 1) → Fin n) → ℕ :=
fun v => if v.1 = i then 1 else 0
/-- Replace each variable `X (i, t)` of row `i` by the monomial `v_{t 0} ⋯ v_{t (k-2)}` in new
variables `v`, keeping the other variables as coefficients. -/
noncomputable def rowSubst {n k : ℕ} (i : Fin n) :
GenRing n k →ₐ[ℚ] MvPolynomial (Fin n) (GenRing n k) :=
MvPolynomial.aeval (fun v : Fin n × (Fin (k - 1) → Fin n) =>
if v.1 = i then ∏ s, MvPolynomial.X (v.2 s) else MvPolynomial.C (MvPolynomial.X v))
/-- The operator `f_i(∂_v) = Σ_t X (i, t) ∂_{v_{t 0}} ⋯ ∂_{v_{t (k-2)}}`. -/
noncomputable def rowOp {n k : ℕ} (i : Fin n) (p : MvPolynomial (Fin n) (GenRing n k)) :
MvPolynomial (Fin n) (GenRing n k) :=
∑ t : Fin (k - 1) → Fin n, (MvPolynomial.X (i, t) : GenRing n k) •
(List.ofFn t).foldr (fun j q => MvPolynomial.pderiv j q) p
/-- The row-`i` projection of order `m`:
`Q ↦ (1 / (m (k-1))!) · [f_i(∂_v)^m Q(row i := v-powers)]_{v = 0}`. -/
noncomputable def rowProj {n k : ℕ} (i : Fin n) (m : ℕ) (Q : GenRing n k) : GenRing n k :=
(1 / (Nat.factorial (m * (k - 1)) : ℚ)) •
MvPolynomial.eval 0 ((rowOp i)^[m] (rowSubst i Q))
/-- `1 + Σ_{j=1}^{M} C^{j-1} q_j s^j`; for `q_j` the graded pieces of a polynomial with
degree-`0` piece `C`, this is `Q(C s)/C` truncated at order `M`. -/
noncomputable def hatPhi {R : Type*} [CommRing R] (C : R) (q : ℕ → R) (M : ℕ) : Polynomial R :=
1 + ∑ j ∈ Finset.Icc 1 M, Polynomial.monomial j (C ^ (j - 1) * q j)
end HararySachs.Hyper
Source
Morozov and Shakirov, Analogue of the identity Log Det = Trace Log for resultants, arXiv:0804.4632v3, Section 3, Proposition I and the shift identity (15), in the degree-preserving variant of mission strategy comment 2173f2a9-fd2e-4d5e-afb5-27607d970161.