AFTD Auto-Formalizing Theoretical Domains

simple_graph_is_k_star_forming_mono

theoremverified

Every superset of a k-star-forming set is k-star-forming.

Statement

theorem simple_graph_is_k_star_forming_mono {V : Type*} (G : SimpleGraph V)
    (k : ℕ) {S T : Finset V} (hST : S ⊆ T) (hS : simple_graph_is_k_star_forming G k S) :
    simple_graph_is_k_star_forming G k T
Source
Monotonicity used implicitly in arXiv:2610.03785 (Upper k-star-forming sets, k-independence, and upper domination) (Lemma 2.2 and the minimality arguments).
Verified
14 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • simple_graph_is_k_star_formingA vertex set S is k-star-forming when, for every vertex v outside S, the induced graph G[S ∪ {v}] contains a copy of the star K_{1,k} that…
Used by 2

The proof, explained

To show that any superset T of a k-star-forming set S is also k-star-forming, take any vertex v ∉ T. Because S ⊆ T, v also lies outside S, so by hypothesis there is a k-star containing v whose center and leaves lie in {v} ∪ S. Since S ⊆ T, these vertices also lie in {v} ∪ T, fulfilling the definition for T.

  1. Fix an arbitrary vertex v ∉ T

    To show that T is k-star-forming, let v be any vertex not in T.

    line 4

      intro v hv
  2. There exist a center c and a leaf set L forming a k-star at v with vertices in {v} ∪ S

    Since S ⊆ T and v ∉ T, we have v ∉ S. Applying the k-star-forming property of S to v yields a center c and a leaf set L of size k such that all vertices belong to {v} ∪ S, each leaf is adjacent to c, and v is either c or one of the leaves.

    line 5

      obtain ⟨c, L, hc, hL, hcard, hadj, hvc⟩ := hS v (fun h => hv (hST h))
  3. The pair (c, L) satisfies the k-star-forming conditions for T

    Since S ⊆ T, any vertex in {v} ∪ S is also in {v} ∪ T. Using Or.imp_right on the memberships hc and hL shows c ∈ {v} ∪ T and L ⊆ {v} ∪ T, while the cardinality, adjacency, and incidence conditions remain identical.

    lines 6–7

    uses Or.imp_right

      exact ⟨c, L, hc.imp_right (fun h => hST h), fun x hx => (hL x hx).imp_right (fun h => hST h),
        hcard, hadj, hvc⟩
Or.imp_right
if b implies c, then a ∨ b implies a ∨ c

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_is_k_star_forming_mono {V : Type*} (G : SimpleGraph V)    (k : ℕ) {S T : Finset V} (hST : S ⊆ T) (hS : simple_graph_is_k_star_forming G k S) :    simple_graph_is_k_star_forming G k T := by  intro v hv  obtain ⟨c, L, hc, hL, hcard, hadj, hvc⟩ := hS v (fun h => hv (hST h))  exact ⟨c, L, hc.imp_right (fun h => hST h), fun x hx => (hL x hx).imp_right (fun h => hST h),    hcard, hadj, hvc⟩
See it in the graphDiscuss this resultChallenge it