Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A finite nonempty disconnected set has at least two components

Proved
finite_nonempty_connected_components_lower_bound__p2m_bfad0b38_624c_4f44_b180_c550615568f1_a2

by Eyal1990 · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

planar-topologytopology

For a nonempty set with finitely many connected components, disconnectedness forces at least two components. Nonemptiness rules out zero components; a sole connected component would make the set connected. This removes the component-counting step from the parent, leaving the crosscut separation result as the core obligation.

Preamble
import Mathlib.Topology.Connected.Clopen
import Mathlib.Data.Set.Card

open Set
Formal statement
theorem finite_nonempty_connected_components_lower_bound__p2m_bfad0b38_624c_4f44_b180_c550615568f1_a2
    (X : Type) [TopologicalSpace X] (s : Set X)
    (hfinite : Finite (ConnectedComponents s)) (hne : s.Nonempty)
    (hdisconnected : ¬ IsConnected s) :
    2 ≤ Nat.card (ConnectedComponents s) := by sorry
Source
M. H. A. Newman, Elements of the Topology of Plane Sets of Points, Theorem V.11.7; see its statement at https://iiscoe.wordpress.com/wp-content/uploads/2020/07/as_triangulation_details-2.pdf . Supporting the same-component branch https://prove2.me/theorems/c8030f71-3663-4ed8-be54-5fe08a9e8720 .

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