Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 14 — resultant coefficient as a Schur expression in traces

Proved
HararySachs.Hyper.trace_identity

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

characteristic-polynomialp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1resultanttrace

Let ϕd(H)\phi_d(\mathcal H)ϕd​(H) be the codegree-ddd coefficient of the resultant characteristic polynomial of a simple kkk-graph. For 1≤d≤n(k−1)n−11\le d\le n(k-1)^{n-1}1≤d≤n(k−1)n−1, the identity quoted in the proof of Theorem 14 is

ϕd(H)=Pd ⁣(−Tr⁡1(H)1,…,−Tr⁡d(H)d).\phi_d(\mathcal H)=P_d\!\left(-\frac{\operatorname{Tr}_1(\mathcal H)}1,\ldots,-\frac{\operatorname{Tr}_d(\mathcal H)}d\right).ϕd​(H)=Pd​(−1Tr1​(H)​,…,−dTrd​(H)​).

This connects the resultant definition of ϕ\phiϕ 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 ddd 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
  • 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