Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unfriendly partitions for locally finite recurrent sharing between hubs (Challenge 10)

Proved
TenChallenges.challenge_10_locallyFiniteSharing

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

combinatoricsgraph-theoryinfinite-graphsten-challengesunfriendly-partition

Let GGG be a countable simple graph and call its infinite-degree vertices hubs. Suppose every component of the subgraph induced by the finite-degree vertices is finite. Form a graph RRR on the hubs by joining two distinct hubs when infinitely many of those components contain a neighbour of each hub. Assume that each vertex of RRR has finite degree.

Then GGG has an unfriendly partition, a two-colouring in which each vertex has at least as many opposite-coloured neighbours as same-coloured neighbours. The Partitioner also wins the Challenge 10 game from the empty partition for every ordinal clock.

The sharing graph RRR can have infinite connected components, triangles and vertices of unbounded finite degree.

Preamble
import Definitions.Def_TenChallenges_Challenge_10
import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
universe u v
Formal statement
namespace TenChallenges
theorem challenge_10_locallyFiniteSharing {V : Type u} [Countable V] (G : SimpleGraph V)
    (hfinite : ∀ C : (G.induce {x : V | (G.neighborSet x).Finite}).ConnectedComponent, C.supp.Finite)
    (R : SimpleGraph {x : V | (G.neighborSet x).Infinite})
    (hAdj : ∀ x y, R.Adj x y ↔ x ≠ y ∧
      {C : (G.induce {x : V | (G.neighborSet x).Finite}).ConnectedComponent |
        (∃ a ∈ C.supp, G.Adj x.val a.val) ∧ (∃ b ∈ C.supp, G.Adj y.val b.val)}.Infinite)
    (hloc : ∀ x, (R.neighborSet x).Finite) :
    (∃ f : V → Option Bool, ∀ x : V, UnfriendlyAt G f 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/). This extends the triangle-free sharing result at https://prove2.me/theorems/6773d63f-134d-43c3-a87e-61f739d19f6c.

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