AFTD Auto-Formalizing Theoretical Domains

is_hypergraph_free

def

A hypergraph H on vertex set Fin n is F-free if there does not exist an embedding f : W ↪ Fin n such that every hyperedge e in F maps under f to an edge in H.

Statement

def is_hypergraph_free {W : Type*} {n : ℕ} (H : Finset (Finset (Fin n))) (F : Finset (Finset W)) : Prop
Defined in
arXiv:2611.12582 Section 1
Verified
13 Nov 2026
Axioms
none listed
Used by 2
  • extremal_numberFor a natural number n and a hypergraph F on vertex type W, the extremal number extremal_number n F is the maximum cardinality of an…
  • codegree_extremal_numberFor a natural number n and a hypergraph F on vertex type W, the real-valued codegree extremal number codegree_extremal_number n F is the…

Read back from the Lean

Given a type W, a natural number n, a family of finsets H : Finset (Finset (Fin n)), and a family of finsets F : Finset (Finset W), is_hypergraph_free H F is defined as the proposition that there does not exist an embedding (injective map) f : W ↪ Fin n such that for every finset e ∈ F, the mapped finset e.map f belongs to H.

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 hypergraph H on Fin n is F-free if there is no injective embedding of the vertices of F into Fin n mapping every edge of F into H. -/
def is_hypergraph_free {W : Type*} {n : ℕ} (H : Finset (Finset (Fin n))) (F : Finset (Finset W)) : Prop := ¬ ∃ f : W ↪ Fin n, ∀ e ∈ F, e.map f ∈ H
See it in the graphDiscuss this resultChallenge it