Expansion of into rooted operators
ProvedHararySachs.Hyper.operator_expansionThis is the expansion of a product of the paper's differential operators into rooted operators. It states precisely the observation of Definitions 6–7 (pp. 7–8) that every addend of is the operator of a rooting .
Let and let be a simple -graph. Let be an matrix of independent variables, and for a vertex let
where is the normalized adjacency hypermatrix, equal to on orderings of edges. Fix an arrangement of into nonnegative parts. Then, for every polynomial in the variables ,
Here runs over the multisets of edges of , and runs over the rootings of in which exactly edges are rooted at for each vertex . A rooting is a sequence with , nondecreasing roots, and edge multiset . The operator differentiates once for every arc of the rooted digraph , where is the number of with and .
This identity converts the differential trace of Equation (1) into a sum over rootings, which is the first step of the proof of Lemma 13.
Formalization Note The left-hand side is the mission's applyAll, which applies first. The operators commute, so the order is immaterial. Arrangements are functions Fin n → Fin (d+1) with sum . The rootings are the sequences R : Fin S.card → Fin n × Finset (Fin n) satisfying IsRooting S R together with the root-count condition, and is diffMonomial (rootedArcs R). The identity is stated as an identity of polynomials, valid for every .
import Mathlib import Definitions.Def_HararySachs_Hyper_Operators import Definitions.Def_HararySachs_Hyper_Veblen
namespace HararySachs.Hyper
open Classical
theorem operator_expansion {n k d : ℕ} (hk : 2 ≤ k)
(E : Finset (Finset (Fin n))) (hE : ∀ e ∈ E, e.card = k)
(a : Fin n → Fin (d + 1)) (ha : (∑ i, (a i).val) = d) (P : AuxPoly n) :
applyAll (k := k) E a P =
∑ S ∈ allMultisets E d,
∑ R : Fin S.card → Fin n × Finset (Fin n),
if IsRooting S R ∧
∀ v, (Finset.univ.filter (fun i => (R i).1 = v)).card = (a v).val
then diffMonomial (rootedArcs R) P else 0 := by sorry
end HararySachs.Hyper