Lemma 4 — differential trace and Euler tours
ProvedHararySachs.Hyper.lemma_4differential-operatoreulerianp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1trace
Let be a directed multigraph with arcs, counted with multiplicity, and let differentiate once for each arc with respect to . Then
When is Eulerian, this constant equals the number of Euler tours with distinguishable parallel arcs and a specified first position, namely times the number of Euler circuits. This is the operator-to-digraph bridge for the trace calculation.
Formalization Note The statement allows every monomial differential operator of total degree ; the paper applies it to addends of the trace operator. Tours replace the equivalent product .
Preamble
import Mathlib import Definitions.Def_HararySachs_Hyper_Operators
Formal statement
namespace HararySachs.Hyper
theorem lemma_4 {n L : ℕ} (hL : 0 < L) (m : ArcMult n)
(hm : (∑ u : Fin n, ∑ v : Fin n, m u v) = L) :
(MvPolynomial.coeff 0 (diffMonomial m (trPow n L)) ≠ 0 ↔ IsEulerian m) ∧
(IsEulerian m →
MvPolynomial.coeff 0 (diffMonomial m (trPow n L)) =
(numTours m hL : ℚ)) := by sorry
end HararySachs.Hyper
Source
Clark and Cooper, A Harary-Sachs theorem for hypergraphs, arXiv:1812.00468v2, p. 6, Lemma 4 and Equation (3)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.