AFTD Auto-Formalizing Theoretical Domains

cycle_five_has_well_covered_powers

theoremverified

The 5-cycle graph C_5 has the well-covered powers property.

Statement

theorem cycle_five_has_well_covered_powers :
    simple_graph_has_well_covered_powers (SimpleGraph.cycleGraph 5)
Source
arXiv:2611.03956 Theorem 4.1
Verified
05 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2

Read back from the Lean

The 5-cycle graph SimpleGraph.cycleGraph 5 has well-covered powers: for every natural number $d \ge 1$, the $d$-th power of the 5-cycle graph is well-covered (that is, every maximal independent set of vertices has the same cardinality).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

A graph has the well-covered powers property if each of its powers G^d (for d ≥ 1) is a well-covered graph. The claim follows directly from the definition and the previously established result `cycle_five_all_powers_well_covered`, which shows that every power of the 5-cycle C_5 is well-covered.

  1. The 5-cycle graph C_5 has the well-covered powers property.

    By definition, a graph G has the well-covered powers property if for all d ≥ 1, the graph power G^d is well-covered. This is exactly what `cycle_five_all_powers_well_covered` establishes for G = C_5, so the theorem holds immediately.

    line 3

    uses cycle_five_all_powers_well_covered

        simple_graph_has_well_covered_powers (SimpleGraph.cycleGraph 5) := cycle_five_all_powers_well_covered
cycle_five_all_powers_well_covered
For every natural number d ≥ 1, the d-th power of the 5-cycle graph C_5 is well-covered.

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The 5-cycle graph C_5 has the well-covered powers property. -/theorem cycle_five_has_well_covered_powers :    simple_graph_has_well_covered_powers (SimpleGraph.cycleGraph 5) := cycle_five_all_powers_well_covered
See it in the graphDiscuss this resultChallenge it