Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A topological minor is a minor

Proved
TenChallenges.minor_of_topologicalMinor

by Davide · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-minorsten-challengestopological-minor

If a graph GGG contains a subdivision of a graph HHH, then HHH is a minor of GGG:

H⪯topG⟹H⪯G.H\preceq_{\mathrm{top}} G\quad\Longrightarrow\quad H\preceq G.H⪯top​G⟹H⪯G.

Each branch vertex together with suitable interior vertices of its incident subdivided edges forms a connected branch set; contracting these recovers HHH. This is the easy comparison between the two containment relations, used to pass from Kuratowski's theorem (excluded subdivisions) to Wagner's theorem (excluded minors).

Formalization Note Subdivisions are SimpleGraph.TopologicalMinor and minors are SimpleGraph.Minor (branch-set model), for arbitrary vertex types.

Preamble
import Definitions.Def_TenChallenges_Minor
import Definitions.Def_TenChallenges_TopologicalMinor
Formal statement
namespace TenChallenges
theorem minor_of_topologicalMinor {W V : Type} {H : SimpleGraph W} {G : SimpleGraph V}
    (T : SimpleGraph.TopologicalMinor H G) : Nonempty (SimpleGraph.Minor H G) := by sorry
end TenChallenges
Source
Standard; see e.g. Diestel, Graph Theory, Sect. 1.7 (every topological minor is a minor). Used in deriving Wagner's theorem (Math. Ann. 114 (1937)) from Kuratowski's theorem (Fund. Math. 15 (1930)).

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