Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unfriendly partitions when a finite set meets every pair of hubs sharing infinitely many components (Challenge 10)

Proved
TenChallenges.challenge_10_finiteKernelCooccurrence

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

combinatoricsgraph-theoryinfinite-graphsten-challengesunfriendly-partition

Let GGG be a countable simple graph, let III be its set of infinite-degree vertices (the hubs), and let C\mathcal CC be the components of the subgraph induced by the finite-degree vertices. Let ∂C\partial C∂C consist of the hubs with a neighbour in CCC. Suppose each C∈CC\in\mathcal CC∈C is finite and there is a finite set KKK of vertices such that

∣{C∈C:x,y∈∂C}∣<ℵ0for distinct x,y∈I∖K.\bigl|\{C\in\mathcal C : x,y\in\partial C\}\bigr|<\aleph_0 \qquad\text{for distinct }x,y\in I\setminus K.​{C∈C:x,y∈∂C}​<ℵ0​for distinct x,y∈I∖K.

Then GGG has an unfriendly partition. In this two-colouring, each vertex has at least as many neighbours of the opposite colour as of its own colour. The Partitioner also wins the Challenge 10 game from the empty partition for every ordinal clock.

For example, KKK can consist of two hubs. Either of them can share infinitely many components with the other and with any number of further hubs. The hypotheses allow unbounded component sizes and unbounded numbers of hubs on their boundaries.

Preamble
import Definitions.Def_TenChallenges_Challenge_10
import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
universe u v
Formal statement
namespace TenChallenges
theorem challenge_10_finiteKernelCooccurrence {V : Type u} [Countable V] (G : SimpleGraph V)
    (K : Set V) (hK : K.Finite)
    (hfinite : ∀ C : (G.induce {v : V | (G.neighborSet v).Finite}).ConnectedComponent, C.supp.Finite)
    (hshare : ∀ x y : V, x ∉ K → y ∉ K → (G.neighborSet x).Infinite →
      (G.neighborSet y).Infinite → x ≠ y →
        {C : (G.induce {v : V | (G.neighborSet v).Finite}).ConnectedComponent |
          (∃ a ∈ C.supp, G.Adj x a.val) ∧ (∃ b ∈ C.supp, G.Adj y b.val)}.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/). The empty exceptional set gives the previously verified finite co-occurrence theorem (https://prove2.me/theorems/d46ffd21-6325-43b6-9328-8dbab61536ae).

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