Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Extending prescribed hub colours to an unfriendly partition (Challenge 10)

Proved
TenChallenges.challenge_10_stableComponentExtension

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 infinite-degree vertices (the hubs), and fix a two-colouring qqq of the hubs. Suppose every component of the subgraph obtained by deleting III is finite. A colouring is unfriendly at a vertex if it has at least as many neighbours of the opposite colour as of its own colour.

Then qqq extends to an unfriendly colouring of all of GGG if and only if each hub xxx satisfies at least one of the following conditions.

  1. Infinitely many hub neighbours of xxx have colour different from q(x)q(x)q(x).
  2. There are infinitely many distinct components CCC for which one can colour CCC so that every vertex of CCC is unfriendly, using the fixed boundary colours, and some neighbour of xxx in CCC has colour different from q(x)q(x)q(x).

The colouring in the second condition may depend on both xxx and CCC. Component sizes and the numbers of hubs on their boundaries may be unbounded.

Preamble
import Definitions.Def_TenChallenges_Challenge_10
import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
universe u
Formal statement
namespace TenChallenges
theorem challenge_10_stableComponentExtension {V : Type u} [Countable V] (G : SimpleGraph V)
    (q : V → Bool) (hfinite : ∀ C : (G.induce {v : V | (G.neighborSet v).Finite}).ConnectedComponent, C.supp.Finite) :
    let I : Set V := {v | (G.neighborSet v).Infinite}
    (∃ c : V → Bool, Set.EqOn c q I ∧ ∀ v, UnfriendlyAt G (fun w => some (c w)) v) ↔
      ∀ x ∈ I, ({y : V | G.Adj x y ∧ q y ≠ q x} ∩ I).Infinite ∨
        {C : (G.induce {v : V | (G.neighborSet v).Finite}).ConnectedComponent |
          ∃ d : V → Bool,
            (Set.EqOn d q I ∧ ∀ y ∈ C.supp, UnfriendlyAt G (fun w => some (d w)) y.val) ∧
            ∃ y ∈ C.supp, G.Adj x y.val ∧ d y.val ≠ q x}.Infinite := by sorry
end TenChallenges
Source
Original component-extension lemma for the unfriendly partition mission in Ten Challenges in Combinatorics, Challenge 10. The local Lean theorem is TenChallenges.Continuation.StableComponents.extension_iff. The canonical challenge is at https://tenchallenges.github.io/ten-challenges/.

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