Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Challenge 10: global unfriendly partitions iff every ordinal clock is winning

Proved
TenChallenges.unfriendly_partition_iff_all_clocks

by kmehltretter82 · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsgraph-theoryinfinite-graphsten-challenges

Let G=(V,E)G=(V,E)G=(V,E) be a countable simple graph. A two-coloring is unfriendly if each vertex has at least as many neighbors of the opposite color as of its own color. Then

G admits a global unfriendly partition⟺∀α∈Ord, Partitioner wins the α-partitioning game on G.G\text{ admits a global unfriendly partition}\quad\Longleftrightarrow\quad\forall\alpha\in\mathrm{Ord},\ \text{Partitioner wins the }\alpha\text{-partitioning game on }G.G admits a global unfriendly partition⟺∀α∈Ord, Partitioner wins the α-partitioning game on G.

In the game, Challenger chooses a vertex and a strictly smaller ordinal clock; Partitioner responds with a finite extension of the current partial coloring that is unfriendly at the queried vertex. This equivalence relates the global existence question to the complete family of scaled games. It does not assert that either condition holds for every countable graph.

Formalization note: if V:Type uV:\mathrm{Type}\,uV:Typeu, the clock quantifier ranges over Ordinal.{u}\mathrm{Ordinal}.\{u\}Ordinal.{u}. The formal coloring has type V→Option(Bool)V\to\mathrm{Option}(\mathrm{Bool})V→Option(Bool); unfriendliness at every vertex requires the coloring to be total.

Preamble
import Definitions.Def_TenChallenges_Challenge_10
universe u
Formal statement
namespace TenChallenges
theorem unfriendly_partition_iff_all_clocks {V : Type u} [Countable V]
    (G : SimpleGraph V) :
    (∃ p : V → Option Bool, ∀ x, UnfriendlyAt G p x) ↔
      ∀ α : Ordinal.{u}, PartitionerWins G (emptyPartition V) α := by sorry
end TenChallenges
Source
Ten Challenges in Combinatorics, Challenge 10; equivalence between the global unfriendly partition assertion and its full family of ordinal-clock games, using canonical definitions. https://tenchallenges.github.io/ten-challenges/

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