AFTD Auto-Formalizing Theoretical Domains

simple_graph_k_independent_is_k_independent_one_iff

theoremverified

A vertex set is 1-independent exactly when it is independent: no two of its vertices are adjacent.

Statement

theorem simple_graph_k_independent_is_k_independent_one_iff {V : Type*} (G : SimpleGraph V)
    (I : Finset V) :
    simple_graph_is_k_independent G 1 I ↔ ∀ u ∈ I, ∀ v ∈ I, ¬ G.Adj u v
Source
Sanity lemma: β_1 = α, as noted in arXiv:2610.03785 (Upper k-star-forming sets, k-independence, and upper domination), Sec. 2 (1).
Verified
14 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • simple_graph_is_k_independentA vertex set I of a graph G is k-independent when the induced subgraph G[I] has maximum degree less than k: every vertex of I has fewer…

The proof, explained

A set of vertices I is defined to be 1-independent if every vertex in I has strictly fewer than 1 neighbor in I. Because cardinality is a natural number and the neighbor set is finite, having fewer than 1 neighbor is equivalent to the neighbor set being empty. The proof splits the equivalence into two directions: if I is 1-independent, any adjacent pair in I would produce an element in an empty set; conversely, if no two vertices in I are adjacent, the neighbor set of any vertex is empty and thus has cardinality zero.

  1. For every vertex u, the set of its neighbors in I is finite.

    Unfolding the definition of 1-independence, the condition requires that each vertex in I has fewer than 1 neighbor in I. For each vertex u, the set {w ∈ I | G.Adj u w} of its neighbors in I is a subset of the finite set I, and is therefore finite.

    lines 4–6

      unfold simple_graph_is_k_independent
      have hfin : ∀ u, ({w | w ∈ I ∧ G.Adj u w} : Set V).Finite :=
        fun u => I.finite_toSet.subset (fun w hw => hw.1)
  2. If I is 1-independent, then no two vertices in I are adjacent.

    We split the if-and-only-if into two implications. For the forward direction, assume I is 1-independent, and suppose for contradiction that some u, v ∈ I are adjacent. By 1-independence, the number of neighbors of u in I is strictly less than 1. By Nat.lt_one_iff and Set.ncard_eq_zero, this cardinality being less than 1 means it is 0, so the neighbor set of u in I is empty. However, v is in I and adjacent to u, which places v in this neighbor set, contradicting the fact that it is empty.

    lines 7–13

    uses Nat.lt_one_iff, Set.ncard_eq_zero

      constructor
      · intro h u hu v hv huv
        have := h u hu
        rw [Nat.lt_one_iff, Set.ncard_eq_zero (hfin u)] at this
        have hmem : v ∈ ({w | w ∈ I ∧ G.Adj u w} : Set V) := ⟨hv, huv⟩
        rw [this] at hmem
        exact hmem
  3. If no two vertices in I are adjacent, then I is 1-independent.

    For the reverse direction, assume no two vertices in I are adjacent. Given any vertex u ∈ I, we must show that its neighbor set in I has cardinality strictly less than 1. Rewriting with Nat.lt_one_iff, Set.ncard_eq_zero, and Set.eq_empty_iff_forall_notMem, this is equivalent to showing that no vertex belongs to this neighbor set. If some v belonged to it, then v would be in I and adjacent to u, which directly contradicts our assumption.

    lines 14–16

    uses Nat.lt_one_iff, Set.ncard_eq_zero, Set.eq_empty_iff_forall_notMem

      · intro h u hu
        rw [Nat.lt_one_iff, Set.ncard_eq_zero (hfin u), Set.eq_empty_iff_forall_notMem]
        exact fun v hv => h u hu v hv.1 hv.2
Nat.lt_one_iff
A natural number is strictly less than 1 if and only if it equals 0.
Set.ncard_eq_zero
A finite set has cardinality 0 if and only if it is the empty set.
Set.eq_empty_iff_forall_notMem
A set is empty if and only if no element belongs to it.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem simple_graph_k_independent_is_k_independent_one_iff {V : Type*} (G : SimpleGraph V)    (I : Finset V) :    simple_graph_is_k_independent G 1 I ↔ ∀ u ∈ I, ∀ v ∈ I, ¬ G.Adj u v := by  unfold simple_graph_is_k_independent  have hfin : ∀ u, ({w | w ∈ I ∧ G.Adj u w} : Set V).Finite :=    fun u => I.finite_toSet.subset (fun w hw => hw.1)  constructor  · intro h u hu v hv huv    have := h u hu    rw [Nat.lt_one_iff, Set.ncard_eq_zero (hfin u)] at this    have hmem : v ∈ ({w | w ∈ I ∧ G.Adj u w} : Set V) := ⟨hv, huv⟩    rw [this] at hmem    exact hmem  · intro h u hu    rw [Nat.lt_one_iff, Set.ncard_eq_zero (hfin u), Set.eq_empty_iff_forall_notMem]    exact fun v hv => h u hu v hv.1 hv.2
See it in the graphDiscuss this resultChallenge it