AFTD Auto-Formalizing Theoretical Domains

is_hypergraph_hom

def

For types V and W with decidable equality on W, finite hyperedge sets F : Finset (Finset V) and G : Finset (Finset W), and a map f : V → W, is_hypergraph_hom F G f asserts that for every hyperedge e ∈ F, the image finset e.image f belongs to G.

Statement

def is_hypergraph_hom {V W : Type*} [DecidableEq W]
    (F : Finset (Finset V)) (G : Finset (Finset W)) (f : V → W) : Prop
Defined in
arXiv:2611.16654 Section 2
Verified
14 Nov 2026
Axioms
none listed
Used by 2
  • zycle_hom_implies_closed_walkIf f : ZMod ℓ × Fin 2 → α is a hypergraph homomorphism is_hypergraph_hom from the zycle Z_ℓ to a 3-uniform hypergraph G : Finset (Finset…
  • zycle_not_div_three_no_hom_tripartite_turanLet ℓ ≥ 2 be an integer with 3 ∤ ℓ. For any family of pairwise disjoint finite sets V : ZMod 3 → Finset α, there is no function f : ZMod ℓ…

Read back from the Lean

For types $V$ and $W$ with decidable equality on $W$, given a finite set of finite sets $F$ on $V$ (hyperedges of $V$), a finite set of finite sets $G$ on $W$ (hyperedges of $W$), and a function $f : V → W$, is_hypergraph_hom F G f asserts that for every edge $e \in F$, the image of $e$ under $f$ (the finset $\{f(x) \mid x \in e\}$) is an edge in $G$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A map between vertex sets is a hypergraph homomorphism if it maps every hyperedge to a hyperedge. -/
def is_hypergraph_hom {V W : Type*} [DecidableEq W]
    (F : Finset (Finset V)) (G : Finset (Finset W)) (f : V → W) : Prop := ∀ e ∈ F, e.image f ∈ G
See it in the graphDiscuss this resultChallenge it