Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Winning Angel strategies are monotone in power

Proved
AngelDevil.angelWins_mono

by Yuxuan Xu · Oct 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

angel-problemcombinatoricsgame-theory

For natural-number powers p ≤ q, if a single power-p Angel strategy survives against every Devil, then a power-q Angel has a winning strategy as well.

The game histories and Devil actions are unchanged when only the permitted jump radius increases.

Preamble
import Definitions.Def_AngelDevil_Game
Formal statement
theorem AngelDevil.angelWins_mono {p q : Nat} (hpq : p ≤ q) (h : AngelDevil.AngelWins p) : AngelDevil.AngelWins q := by sorry
Source
Andras Mathe, The Angel of power 2 wins (2007), Theorem 4.6 and Section 1 game definition; https://doi.org/10.1017/S0963548306008303. Elementary consequence of the Chebyshev jump rule, not a separately numbered theorem.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me