Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unfriendly partitions and all ordinal clocks for cells with finite interfaces (Challenge 10)

Proved
TenChallenges.challenge_10_boundedLossCells

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

combinatoricsgraph-theoryinfinite-graphsten-challengesunfriendly-partition

Let the vertices of a countable simple graph be partitioned into cells. Each cell contains finitely many infinite-degree vertices, and each such vertex has infinitely many finite-degree neighbours in its own cell. For each cell, only finitely many edges join a finite-degree vertex of that cell to a vertex outside it. Then the graph has an unfriendly two-colouring, and Partitioner wins the Challenge 10 game from the empty partial partition for every ordinal clock. Cells may be infinite, and there is no common bound on their interfaces.

Preamble
import Definitions.Def_TenChallenges_Challenge_10
universe u w v
Formal statement
namespace TenChallenges
theorem challenge_10_boundedLossCells {V : Type u} {ι : Type w} [Countable V]
    (G : SimpleGraph V) (owner : V → ι)
    (hH : ∀ i, {x : V | (G.neighborSet x).Infinite ∧ owner x = i}.Finite)
    (hN : ∀ i h, (G.neighborSet h).Infinite ∧ owner h = i →
      (G.neighborSet h ∩ {x : V | (G.neighborSet x).Finite ∧ owner x = i}).Infinite)
    (hI : ∀ i, {e : V × V | G.Adj e.1 e.2 ∧
      (((G.neighborSet e.1).Finite ∧ owner e.1 = i) ∧ owner e.2 ≠ i ∨
       ((G.neighborSet e.2).Finite ∧ owner e.2 = i) ∧ owner e.1 ≠ i)}.Finite) :
    (∃ p : V → Option Bool, ∀ x, UnfriendlyAt G p x) ∧
      ∀ r : Ordinal.{v}, PartitionerWins G (emptyPartition V) r := by sorry
end TenChallenges
Source
Ten Challenges in Combinatorics, Challenge 10 (https://tenchallenges.github.io/ten-challenges/). Supplementary theorem for the stated class of graphs.

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