Theorem 14, labeled form — the hypergraph Harary–Sachs coefficient formula
ProvedHararySachs.Hyper.theorem_14Let be a simple -graph on , with and . For each , sum over ordered -tuples of labeled connected Veblen infragraphs of whose total number of edges is . Then
This labeled identity is the class-weighted Harary–Sachs formula of Theorem 14 before collecting isomorphic components. It expresses a coefficient of the resultant characteristic polynomial using finite rooted-hypergraph counts.
Formalization Note The chosen form is the alternative explicitly permitted by the chunk brief. Its equivalence to the printed class-weighted sum uses Definition 11 and Lemma 12, which are not formalized here. The resultant is supplied with Theorem 3's three properties; and the codegree range are stated explicitly.
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly import Definitions.Def_HararySachs_Hyper_Veblen
namespace HararySachs.Hyper
open Classical
theorem theorem_14 (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 =
∑ m ∈ Finset.Icc 1 d,
(-((k : ℚ) - 1) ^ n) ^ m / (Nat.factorial m : ℚ) *
∑ T ∈ (tuples E d m).filter (fun T =>
(∑ i, (T i).card) = d ∧
∀ i, IsVeblen (T i) k ∧ IsConnected (T i)),
∏ i, assocCoeff (T i) := by sorry
end HararySachs.Hyper
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.