AFTD Auto-Formalizing Theoretical Domains

is_loose_triangle

def

Three edges e₁, e₂, e₃ in a hypergraph form a loose triangle if they are pairwise distinct, each pair intersects in exactly one vertex, and their intersection e₁ ∩ e₂ ∩ e₃ is empty.

Statement

def is_loose_triangle {V : Type*} [DecidableEq V] (e₁ e₂ e₃ : Finset V) : Prop
Defined in
arXiv:2611.05261, Section 1
Verified
05 Nov 2026
Axioms
none listed

Read back from the Lean

For a type V with decidable equality and three finite subsets e₁, e₂, e₃ : Finset V, is_loose_triangle e₁ e₂ e₃ asserts that: 1. e₁ ≠ e₂, e₂ ≠ e₃, and e₁ ≠ e₃ (the three sets are pairwise distinct), 2. (e₁ ∩ e₂).card = 1, (e₂ ∩ e₃).card = 1, and (e₃ ∩ e₁).card = 1 (each pair of sets intersects in exactly one element), and 3. Disjoint (e₁ ∩ e₂) e₃ (the intersection of e₁ and e₂ is disjoint from e₃, meaning their triple intersection is empty).

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

/-- Three edges in a hypergraph form a loose triangle if they are pairwise distinct, each pair intersects in exactly one vertex, and the three edges have empty intersection. -/
def is_loose_triangle {V : Type*} [DecidableEq V] (e₁ e₂ e₃ : Finset V) : Prop := e₁ ≠ e₂ ∧ e₂ ≠ e₃ ∧ e₁ ≠ e₃ ∧ (e₁ ∩ e₂).card = 1 ∧ (e₂ ∩ e₃).card = 1 ∧ (e₃ ∩ e₁).card = 1 ∧ Disjoint (e₁ ∩ e₂) e₃
See it in the graphDiscuss this resultChallenge it