AFTD Auto-Formalizing Theoretical Domains

graph_edge_boundary

def

The edge boundary ∂_H S of a subset S ⊆ U in the induced subgraph H = G[U] is the finset of edges of G with one endpoint in S and one endpoint in U \ S.

Statement

open scoped Classical in
noncomputable def graph_edge_boundary {V : Type*} [Fintype V] (G : SimpleGraph V) (U S : Finset V) : Finset (Sym2 V)
Defined in
arXiv:2611.05034 Lemma 4.1
Verified
04 Nov 2026
Axioms
none listed

Read back from the Lean

Given a finite type V, a simple graph G on V, and two finsets of vertices U, S : Finset V, graph_edge_boundary G U S is defined as the finset of all edges e in G.edgeFinset such that there exist u ∈ S and v ∈ U \ S satisfying e = s(u, v) (that is, the finset of edges of G connecting a vertex in S to a vertex in U \ S).

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

open scoped Classical in
/-- The edge boundary of a subset S ⊆ U in the induced subgraph G[U], consisting of edges with one endpoint in S and one in U \ S. -/
noncomputable def graph_edge_boundary {V : Type*} [Fintype V] (G : SimpleGraph V) (U S : Finset V) : Finset (Sym2 V) := G.edgeFinset.filter fun e => ∃ u ∈ S, ∃ v ∈ U \ S, e = s(u, v)
See it in the graphDiscuss this resultChallenge it