Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unfriendly partitions with overlapping infinite component interfaces (Challenge 10)

Proved
TenChallenges.challenge_10_overlappingComponentInterfaces

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

combinatoricsgraph-theoryinfinite-graphsten-challengesunfriendly-partition

Let GGG be a countable simple graph. Write HHH for its infinite-degree vertices (the hubs) and let C\mathcal CC be the components induced by the finite-degree vertices. For each C∈CC\in\mathcal CC∈C, put

DC={x∈H:x has infinitely many neighbours in C},U=⋃C∈CDC.D_C=\{x\in H : x\text{ has infinitely many neighbours in }C\}, \qquad U=\bigcup_{C\in\mathcal C}D_C.DC​={x∈H:x has infinitely many neighbours in C},U=C∈C⋃​DC​.

Assume each DCD_CDC​ is finite and only finitely many edges join CCC to H∖DCH\setminus D_CH∖DC​. On H∖UH\setminus UH∖U, form a graph RRR by joining distinct hubs when infinitely many C∈CC\in\mathcal CC∈C contain a neighbour of both. Assume RRR is locally finite.

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 sets DCD_CDC​ may overlap, and the finite-degree components may be infinite.

Preamble
import Definitions.Def_TenChallenges_Challenge_10
import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
universe u v
Formal statement
namespace TenChallenges
theorem challenge_10_overlappingComponentInterfaces {V : Type u} [Countable V] (G : SimpleGraph V) :
    let H : Set V := {v | (G.neighborSet v).Infinite}
    let Comp := (G.induce {x : V | (G.neighborSet x).Finite}).ConnectedComponent
    let A (C : Comp) : Set V := Subtype.val '' C.supp
    let demand (C : Comp) : Set V := {x | x ∈ H ∧ (G.neighborSet x ∩ A C).Infinite}
    let U : Set V := ⋃ C, demand C
    ∀ (hDemand : ∀ C : Comp, (demand C).Finite)
      (hEdges : ∀ C : Comp, {e : V × V |
        e.1 ∈ H \ demand C ∧ e.2 ∈ A C ∧ G.Adj e.1 e.2}.Finite)
      (R : SimpleGraph ↑(H \ U))
      (hAdj : ∀ x y, R.Adj x y ↔ x ≠ y ∧
        {C : Comp |
          (∃ 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 finite-interface theorem at https://prove2.me/theorems/3986782a-0f2d-4169-a9e3-7921de1417f8.

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