AFTD Auto-Formalizing Theoretical Domains

HasCopWinStrategy

def

The cop player has a winning strategy with c cops on G if there exists an initial placement of cops from which the cops can capture the robber against any initial placement of the robber.

Statement

def HasCopWinStrategy {V : Type*} (G : SimpleGraph V) (c : ℕ) : Prop
Defined in
arXiv:2610.20129 Sec. 1
Verified
25 Oct 2026
Axioms
none listed
Built on 1
  • CopsCanWinFromCops can force capture from cop positions C and robber position R in the cops and robber game with c cops on G if the robber is already…
Used by 2

Read back from the Lean

For a simple graph G on vertex type V and a natural number c (representing the number of cops), HasCopWinStrategy G c asserts that there exists an initial placement of the c cops C₀ : Fin c → V such that for every initial robber position R₀ : V, the cops have a winning strategy from (C₀, R₀) (as formalized by the inductive predicate CopsCanWinFrom G c C₀ R₀).

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 cop player has a winning strategy with c cops on G. -/
def HasCopWinStrategy {V : Type*} (G : SimpleGraph V) (c : ℕ) : Prop := ∃ C₀ : Fin c → V, ∀ R₀ : V, CopsCanWinFrom G c C₀ R₀
See it in the graphDiscuss this resultChallenge it