AFTD Auto-Formalizing Theoretical Domains

is_linear_hypergraph

def

A hypergraph F is linear if any two distinct hyperedges in F intersect in at most one vertex.

Statement

def is_linear_hypergraph {V : Type*} [DecidableEq V] (F : Finset (Finset V)) : Prop
Defined in
arXiv:2610.14829 Section 2
Verified
23 Oct 2026
Axioms
none listed

Read back from the Lean

For a type V with decidable equality and a finite set F of finite subsets of V (hyperedges), is_linear_hypergraph F is defined to hold if and only if for every pair of edges e₁ ∈ F and e₂ ∈ F, if e₁ ≠ e₂, then the cardinality of their intersection e₁ ∩ e₂ is at most 1.

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 is linear if any two distinct hyperedges intersect in at most one vertex. -/
def is_linear_hypergraph {V : Type*} [DecidableEq V] (F : Finset (Finset V)) : Prop :=
  ∀ e₁ ∈ F, ∀ e₂ ∈ F, e₁ ≠ e₂ → (e₁ ∩ e₂).card ≤ 1
See it in the graphDiscuss this resultChallenge it