Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rescaling φH(λ)=λNΦ(1/λ)\varphi_H(\lambda)=\lambda^{N}\Phi(1/\lambda)φH​(λ)=λNΦ(1/λ): codegree coefficients as coefficients of Φ\PhiΦ

Proved
HararySachs.Hyper.codegCoeff_eq_phiPoly

by milia · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

hypergraphsresultantsspectral-graph-theory

Let n≥1n \ge 1n≥1 and k≥2k \ge 2k≥2, and let EEE be a family of subsets of {1,…,n}\{1,\dots,n\}{1,…,n} with adjacency tensor A\mathcal{A}A, where ai1⋯ik=1/(k−1)!a_{i_1\cdots i_k} = 1/(k-1)!ai1​⋯ik​​=1/(k−1)! if {i1,…,ik}∈E\{i_1,\dots,i_k\} \in E{i1​,…,ik​}∈E and 000 otherwise. Let Res⁡\operatorname{Res}Res be the resultant of nnn forms of degree k−1k-1k−1 in nnn variables, normalized by Res⁡(x1k−1,…,xnk−1)=1\operatorname{Res}(x_1^{k-1},\dots,x_n^{k-1}) = 1Res(x1k−1​,…,xnk−1​)=1. Put N=n(k−1)n−1N = n(k-1)^{n-1}N=n(k−1)n−1 and consider

φH(λ)=Res⁡(λx[k−1]−Axk−1),Φ(z)=Res⁡(x[k−1]−z Axk−1).\varphi_H(\lambda) = \operatorname{Res}\bigl(\lambda x^{[k-1]} - \mathcal{A}x^{k-1}\bigr), \qquad \Phi(z) = \operatorname{Res}\bigl(x^{[k-1]} - z\,\mathcal{A}x^{k-1}\bigr).φH​(λ)=Res(λx[k−1]−Axk−1),Φ(z)=Res(x[k−1]−zAxk−1).

Then for every 0≤d≤N0 \le d \le N0≤d≤N,

[λN−d] φH(λ)=[zd] Φ(z).[\lambda^{N-d}]\,\varphi_H(\lambda) = [z^{d}]\,\Phi(z).[λN−d]φH​(λ)=[zd]Φ(z).

In other words φH(λ)=λN Φ(1/λ)\varphi_H(\lambda) = \lambda^{N}\,\Phi(1/\lambda)φH​(λ)=λNΦ(1/λ), because the resultant is homogeneous of total degree NNN in the coefficients. This moves the codegree coefficients of the characteristic polynomial to the low-order coefficients of a polynomial with constant term 111, where logarithms and Newton identities are taken.

Formalization Note The left side is codegCoeff E res d. The right side is the ddd-th coefficient of phiPoly applied to the tensor (i,t)↦(i,t) \mapsto(i,t)↦ adjEntry E (Fin.cons i t).

Preamble
import Mathlib
import Definitions.Def_HararySachs_Hyper_CharPoly
import Definitions.Def_HararySachs_Hyper_TensorPhi
Formal statement
namespace HararySachs.Hyper

theorem codegCoeff_eq_phiPoly (n k : ℕ) (hk : 2 ≤ k) (hn : 1 ≤ n)
    (E : Finset (Finset (Fin n)))
    (res : MvPolynomial (ResVar n (fun _ => k - 1)) ℤ)
    (hres : IsResultant n (fun _ => k - 1) res)
    (d : ℕ) (hd : d ≤ n * (k - 1) ^ (n - 1)) :
    codegCoeff (k := k) E res d =
      (phiPoly (R := ℚ) (k := k) (fun i t => adjEntry E (Fin.cons i t)) res).coeff d := by sorry

end HararySachs.Hyper
Source
Clark and Cooper, A Harary-Sachs theorem for hypergraphs, arXiv:1812.00468v2, p. 3, Theorem 3 and Definition 1 (the characteristic polynomial as a resultant); Morozov and Shakirov, Analogue of the identity Log Det = Trace Log for resultants, arXiv:0804.4632v3, Section 4 (the normalization Res⁡(I−f)\operatorname{Res}(I - f)Res(I−f)).

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