AFTD Auto-Formalizing Theoretical Domains

support_graph

def

Given a type V, a natural number r, an edge-labeling function ϕ : (⊤ : SimpleGraph V).edgeSet → Finset (Fin r) assigning a finite subset Finset (Fin r) to each edge of the complete graph on V, and a target finite subset T : Finset (Fin r), support_graph ϕ T is the SimpleGraph on V whose edges are those edges e of the complete graph on V for which T ⊆ ϕ e.

Statement

def support_graph {V : Type*} {r : ℕ} (ϕ : (⊤ : SimpleGraph V).edgeSet → Finset (Fin r))
    (T : Finset (Fin r)) : SimpleGraph V
Defined in
scout/2611-15376-set-coloring-ramsey-numbers-with-multiple-intersections.md:510
Verified
13 Nov 2026
Axioms
none listed
Used by 8

Read back from the Lean

Given a type V, a natural number r, a function ϕ assigning to each edge of the complete simple graph on V a subset of Fin r (i.e. ϕ : (⊤ : SimpleGraph V).edgeSet → Finset (Fin r)), and a subset T : Finset (Fin r), support_graph ϕ T is the SimpleGraph V obtained via SimpleGraph.fromEdgeSet from the set of edges e ∈ (⊤ : SimpleGraph V).edgeSet satisfying T ⊆ ϕ e. In other words, it is the subgraph of the complete graph on V containing precisely those edges whose label under ϕ contains T.

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

/-- The support graph H_T of an edge set-coloring ϕ with respect to a subset T of colors. -/
def support_graph {V : Type*} {r : ℕ} (ϕ : (⊤ : SimpleGraph V).edgeSet → Finset (Fin r))
    (T : Finset (Fin r)) : SimpleGraph V :=
  SimpleGraph.fromEdgeSet {e | ∃ h : e ∈ (⊤ : SimpleGraph V).edgeSet, T ⊆ ϕ ⟨e, h⟩}
See it in the graphDiscuss this resultChallenge it