Proof of Theorem 14 — resultant coefficient as a Schur expression in traces
ProvedHararySachs.Hyper.trace_identitycharacteristic-polynomialp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1resultanttrace
Let be the codegree- coefficient of the resultant characteristic polynomial of a simple -graph. For , the identity quoted in the proof of Theorem 14 is
This connects the resultant definition of to the combinatorial trace calculation. The identity is cited by Clark and Cooper from earlier work rather than proved in their paper.
Formalization Note A resultant satisfying the common-root criterion, normalization, and irreducibility is supplied. The bound on keeps the codegree within the paper's characteristic-polynomial expansion.
Preamble
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly import Definitions.Def_HararySachs_Hyper_Operators
Formal statement
namespace HararySachs.Hyper
theorem trace_identity (n k d : ℕ) (hk : 2 ≤ k) (hn : 1 ≤ n)
(E : Finset (Finset (Fin n))) (hE : ∀ e ∈ E, e.card = k)
(hd1 : 1 ≤ d) (hdt : d ≤ n * (k - 1) ^ (n - 1))
(res : MvPolynomial (ResVar n (fun _ => k - 1)) ℤ)
(hres : IsResultant n (fun _ => k - 1) res) :
codegCoeff (k := k) E res d =
schurP d (fun j => -(Tr (k := k) E j) / (j : ℚ)) := by sorry
end HararySachs.Hyper
Source
Clark and Cooper, A Harary-Sachs theorem for hypergraphs, arXiv:1812.00468v2, p. 12, proof of Theorem 14, first display; citing Cooper and Dutle [4]
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.