🧭 The Mirrane Topological Recognition Problem

Is this shape a sphere? In high dimensions, no algorithm can always tell you.

Undecidable Topology Original

The Challenge

Given a finite triangulation of a high-dimensional space:

Is it homeomorphic to a sphere?

In other words: does this shape, described by a finite list of triangles glued together, have the same topology as a sphere?

Why This Is Extraordinary

A sphere seems like the simplest shape. You'd think recognizing it would be trivial.

In dimensions 1, 2, and 3 β€” it is. We have algorithms.

But in dimension 5 and above:

You cannot always recognize shapes algorithmically.

Even "is this a sphere?" can be impossible to decide.

Why

Markov (1958) showed that recognizing manifolds in dimension β‰₯ 4 is undecidable. Novikov extended this, proving that even sphere recognition becomes undecidable in sufficiently high dimensions. The fundamental group of a manifold can encode the word problem for groups β€” which is itself undecidable.

In Plain Language

You hand someone a shape described by triangles. You ask: "is this a sphere?" In low dimensions, they can always answer. In high dimensions, no procedure always gives the correct answer.

Topology β€” the study of shapes β€” hits a wall of uncomputability.

The Dimension Threshold

Dim 1 β€” Decidable (it's always a circle)
Dim 2 β€” Decidable (classification of surfaces)
Dim 3 β€” Decidable (Perelman / Ricci flow, 2003)
Dim 4 β€” Open question
Dim β‰₯ 5 β€” Undecidable (Markov–Novikov)

🧭  Plaque  🧭

NameMirrane Topological Recognition
FieldTopology
TypeUndecidable (dim β‰₯ 5)
QuestionIs this triangulation homeomorphic to a sphere?
StatusNo algorithm decides all cases
RootMarkov–Novikov (1958–1962)
In 2D, we can classify. Click a surface below to see its triangulation and topological invariants. In 2D, the Euler characteristic and orientability completely determine a surface. In dimension β‰₯ 5, no such classification is possible.