Lemma 9 — an Euler rooting determines a connected Veblen hypergraph
ProvedHararySachs.Hyper.lemma_9eulerianp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rootingveblen-hypergraph
Let be a -uniform multi-hypergraph, with , and let be a rooting of its edge multiset. If the rooted multi-digraph is Eulerian, then is connected and Veblen. More precisely, for each covered vertex ,
The edge multiset of is determined by , which accounts for the paper's assertion of precisely one labeled Veblen hypergraph. This fact identifies which rooted operators contribute to the trace.
Preamble
import Mathlib import Definitions.Def_HararySachs_Hyper_Veblen
Formal statement
namespace HararySachs.Hyper
theorem lemma_9 {n k : ℕ} (hk : 2 ≤ k) (S : MultiGraph n)
(hS : IsUniform S k)
(R : Fin S.card → Fin n × Finset (Fin n))
(hR : IsEulerRooting S R) :
IsVeblen S k ∧ IsConnected S ∧
∀ v ∈ covered S,
vertexDegree S v = k *
(Finset.univ.filter (fun i => (R i).1 = v)).card := by sorry
end HararySachs.Hyper
Source
Clark and Cooper, A Harary-Sachs theorem for hypergraphs, arXiv:1812.00468v2, p. 8, Lemma 9 and its displayed degree calculation
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.