AFTD Auto-Formalizing Theoretical Domains

is_fix_v0

def

A vertex v of a finite simple graph G belongs to V_fix^0(G) if v is in V^0(G) and v belongs to every minimum vertex-edge dominating set S of G.

Statement

def is_fix_v0 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (v : V) : Prop
Defined in
arXiv:2610.26912 Section 1
Verified
21 Oct 2026
Axioms
none listed
Built on 3
  • is_ve_dominatingA subset S of vertices in a simple graph G is a vertex-edge dominating set if for all vertices x and y with G.Adj x y, there exists u in S…
  • gamma_veThe vertex-edge domination number gamma_ve(G) of a finite simple graph G is the minimum cardinality of a finite subset S of V that is a…
  • is_v0A vertex v of a finite simple graph G belongs to V^0(G) if removing v preserves the vertex-edge domination number, that is, gamma_ve(G -…
Used by 1
  • not_is_fix_v0_of_isolatedAn isolated vertex v in a finite simple graph G (with empty neighborhood) does not belong to V_fix^0(G).

Read back from the Lean

For a finite type V with decidable equality, a simple graph G on V, and a vertex v : V, is_fix_v0 G v asserts that both of the following hold: 1. is_v0 G v: The vertex-edge domination number gamma_ve of the subgraph of G induced on {v}ᶜ (the vertex set V \ {v}) is equal to gamma_ve G. 2. For every finite subset S of V, if S is a vertex-edge dominating set of G (is_ve_dominating G (S : Set V)) and the cardinality of S equals gamma_ve G, then v ∈ S (that is, v belongs to every minimum vertex-edge dominating set of G).

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 vertex belongs to V_fix^0(G) if removing it preserves gamma_ve and it belongs to every minimum ve-dominating set. -/
def is_fix_v0 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (v : V) : Prop := is_v0 G v ∧ ∀ S : Finset V, is_ve_dominating G (S : Set V) ∧ S.card = gamma_ve G → v ∈ S
See it in the graphDiscuss this resultChallenge it