Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 — differential trace and Euler tours

Proved
HararySachs.Hyper.lemma_4

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

differential-operatoreulerianp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1trace

Let DDD be a directed multigraph with L>0L>0L>0 arcs, counted with multiplicity, and let ∂D\partial^D∂D differentiate once for each arc u→vu\to vu→v with respect to AuvA_{uv}Auv​. Then

[A0]∂Dtr⁡(AL)≠0⟺D is Eulerian.[A^0]\partial^D\operatorname{tr}(A^L)\ne0\quad\Longleftrightarrow\quad D\text{ is Eulerian}.[A0]∂Dtr(AL)=0⟺D is Eulerian.

When DDD is Eulerian, this constant equals the number of Euler tours with distinguishable parallel arcs and a specified first position, namely LLL 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 LLL; the paper applies it to addends of the trace operator. Tours replace the equivalent product ∣E(D)∣ ∣E(D)∣|E(D)|\,|\mathfrak E(D)|∣E(D)∣∣E(D)∣.

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
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me