ccz_induced_edges
deforiginal
For a simple graph G on a finite type V and a vertex subset S, ccz_induced_edges G S is the set of edges of G both of whose endpoints lie in S.
Statement
def ccz_induced_edges {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (S : Finset V) : Finset (Sym2 V)
- Related work
- folklore
- Verified
- 09 Nov 2026
- Axioms
- none listed
- Used by 1
- ccz_edge_distributionFor a simple graph G on a finite type V with decidable equality and decidable adjacency, and an edge subset F, ccz_edge_distribution G F…
Read back from the Lean
Given a finite type $V$ with decidable equality, a simple graph $G$ on $V$ with decidable adjacency, and a finite subset $S \subseteq V$, ccz_induced_edges G S is defined as the finite set of edges $e \in G.\mathrm{edgeFinset}$ (elements of $\mathrm{Sym}^2(V)$) such that every vertex $v \in e$ belongs to $S$ (that is, both endpoints of $e$ are in $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
/-- The set of edges in G induced by a vertex subset S. -/ def ccz_induced_edges {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (S : Finset V) : Finset (Sym2 V) := G.edgeFinset.filter (fun e => ∀ v ∈ e, v ∈ S)