Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Challenge 10: every ordinal clock when finite-degree components touch at most three hubs

Proved
TenChallenges.challenge_10_threeBoundary

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

combinatoricsgraph-theoryinfinite-graphsten-challengesunfriendly-partition

Let G=(V,E)G=(V,E)G=(V,E) be a countable simple graph, let F={x∈V:deg⁡G(x)<∞}F=\{x\in V : \deg_G(x)<\infty\}F={x∈V:degG​(x)<∞} be the set of finite-degree vertices, let I=V∖FI=V\setminus FI=V∖F be the set of infinite-degree vertices (hubs), and let C\mathcal{C}C denote the set of connected components of the induced subgraph G[F]G[F]G[F]. For each component C∈CC\in\mathcal{C}C∈C, write ∂IC={x∈I:NG(x)∩C≠∅}\partial_I C = \{x\in I : N_G(x)\cap C\neq\varnothing\}∂I​C={x∈I:NG​(x)∩C=∅} for the set of hubs adjacent to at least one vertex of CCC. Assume that:

  1. Every connected component C∈CC\in\mathcal{C}C∈C is finite, with no uniform upper bound on ∣C∣|C|∣C∣.
  2. Every connected component C∈CC\in\mathcal{C}C∈C is adjacent to at most three infinite-degree vertices:
∀C∈C,∣∂IC∣≤3.\forall C\in\mathcal{C},\quad |\partial_I C| \le 3.∀C∈C,∣∂I​C∣≤3.

Then Partitioner wins the unfriendly partitioning game on GGG starting from the empty partial coloring for every ordinal clock:

∀α∈Ord,PartitionerWins⁡(G,∅,α).\forall \alpha\in\mathrm{Ord},\quad \operatorname{PartitionerWins}(G,\varnothing,\alpha).∀α∈Ord,PartitionerWins(G,∅,α).

In each round, Challenger selects a vertex v∈Vv\in Vv∈V and a strictly smaller ordinal β<α\beta<\alphaβ<α, and Partitioner supplies a finite extension of the current partial 222-coloring under which vvv is colored and has at least as many opposite-colored neighbors as same-colored neighbors.

This settles all ordinal game clocks of Challenge 10 when every component of G[F]G[F]G[F] is finite and meets at most three hubs, complementing the finite-co-occurrence regime by allowing pairs and triples of hubs to share infinitely many components.

Formalization Note. For each connected component C of G.induce {x : V | (G.neighborSet x).Finite}, the hub-boundary bound ∣∂IC∣≤3|\partial_I C|\le 3∣∂I​C∣≤3 is formalized via Set.ncard ≤ 3. The vertex universe u and ordinal clock universe v are independent, targeting PartitionerWins G (emptyPartition V) r from Definitions.Def_TenChallenges_Challenge_10; the unrestricted countable case remains open.

Preamble
import Definitions.Def_TenChallenges_Challenge_10
import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
import Mathlib.Data.Set.Card
universe u v
Formal statement
namespace TenChallenges
theorem challenge_10_threeBoundary {V : Type u} [Countable V] (G : SimpleGraph V)
    (hfinite : ∀ C : (G.induce {x : V | (G.neighborSet x).Finite}).ConnectedComponent, C.supp.Finite)
    (hboundary : ∀ C : (G.induce {x : V | (G.neighborSet x).Finite}).ConnectedComponent,
      {x : V | (G.neighborSet x).Infinite ∧ ∃ a ∈ C.supp, G.Adj x a.val}.ncard ≤ 3)
    (r : Ordinal.{v}) : PartitionerWins G (emptyPartition V) r := by sorry
end TenChallenges
Source
Ten Challenges in Combinatorics, Challenge 10 (Unfriendly Partitioning Game), https://tenchallenges.github.io/ten-challenges/ ; background on countable unfriendly partitions and hub-component reductions in R. Aharoni, E. C. Milner, and K. Prikry, Unfriendly partitions of a graph, J. Combin. Theory Ser. B 50 (1990), 1-10, https://doi.org/10.1016/0095-8956(90)90092-E, and L. Aurichi and L. Real, Remarks on the countable case of the Unfriendly Partition Problem, https://arxiv.org/abs/2412.14151.

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