AFTD Auto-Formalizing Theoretical Domains

is_fano_free

def

A hypergraph H (a Finset of finite subsets of V) is Fano-free if there does not exist an embedding f : Fin 7 ↪ V such that for every hyperedge e ∈ fano_plane, the mapped finset e.map f belongs to H.

Statement

def is_fano_free {V : Type*} (H : Finset (Finset V)) : Prop
Defined in
arXiv:2610.01084 Section 3
Verified
04 Nov 2026
Axioms
none listed
Built on 1
  • fano_planeThe Fano plane PG(2,2) is the 3-uniform hypergraph on Fin 7 whose hyperedges are the seven triples {0, 1, 2}, {0, 3, 4}, {0, 5, 6}, {1, 3,…
Used by 1
  • fano_free_local_forbiddenIn any 3-uniform Fano-free hypergraph H : Finset (Finset V), if {x, y, z} is an edge of H, then for all vertices a, b, c, d in V, the six…

Read back from the Lean

For a type V and a family of finite subsets H : Finset (Finset V), is_fano_free H asserts that there does not exist an injective function f : Fin 7 ↪ V such that for every edge e in fano_plane, the image e.map f is an element of H. That is, H contains no subhypergraph isomorphic to the Fano plane.

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 : Finset (Finset V) is Fano-free if it contains no embedded copy of the Fano plane fano_plane. -/
def is_fano_free {V : Type*} (H : Finset (Finset V)) : Prop :=
  ¬ ∃ f : Fin 7 ↪ V, ∀ e ∈ fano_plane, e.map f ∈ H
See it in the graphDiscuss this resultChallenge it