Skip to content
Tutorials Center
My learning

Topics

Lesson 4 of 36 ยท Getting Started

Topological Equivalence: Stretching Without Tearing

Learn what 'same shape' means in topology using graphs: subdividing edges, counting loops, and sorting the capital letters by an invariant you can compute.

In What Is Topology? we said two shapes are the same when one can be deformed into the other without tearing or gluing. That is easy to say and hard to apply to a blob in your hand. In this lesson we make it concrete with the simplest shapes that still show every important idea: graphs, meaning dots joined by lines.

Graphs as shapes

A graph here is a finite set of vertices (dots) and edges (curves joining two vertices). Think of it as a drawing made of string. Stretching or bending the string does not matter. What matters is which vertices are joined.

Two basic moves never change the topological shape of a graph:

  1. Bending and stretching an edge. We ignore edge lengths and curvature entirely.
  2. Subdividing an edge: put a new vertex in the middle of an edge, turning one edge into two. The string is untouched; we only added a dot to the drawing. The reverse, merging two edges at a vertex of degree 2, is also allowed.

A vertex's degree is the number of edge ends meeting there. Vertices of degree 2 are invisible topologically: they are just a point on a long string. Vertices of degree 1 (ends) and degree 3 or more (branch points) are the ones that carry real information.

An invariant: independent loops

For a graph with V vertices, E edges and C connected pieces, define the cycle rank

Text
rank = E โˆ’ V + C

This counts the independent loops: the number of times you could cut an edge and still keep each piece in one piece. A single path has rank 0, a circle has rank 1, a figure eight has rank 2.

Why is it an invariant? Subdividing adds one vertex and one edge, so E โˆ’ V is unchanged, and C is unchanged. The code verifies this and also counts pieces with a union-find structure, a standard tool that merges groups of vertices.

Python Subdividing edges does not change the cycle rank

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

The rank stays at 1 however many dots we add, because the shape of the string is the same triangle-with-a-tail.

Sorting letters by topology

Capital letters drawn as thin strokes are graphs, so we can ask which are topologically alike. The answer depends a little on the font (some fonts draw a Q with a tail that crosses the loop, others with a short stroke), so the code below uses a simple skeleton of each letter, written by us. Treat it as a model of the idea, not a statement about every typeface.

Python Capital letters sorted by loops and branch points

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Letters in the same group share both invariants. Letters in different groups are certainly not equivalent. Whether two letters in the same group really can be deformed into each other needs more work (it does in this skeleton model, because graphs with the same loops and branch structure can be matched, but proving that in general is a graph theory exercise).

Not the same as "looks the same"

Equivalence ignores size, angle and straightness, but it does not ignore how a shape sits in space. A knotted loop of rope and an ordinary loop are the same topological space (both circles), yet you cannot untangle one into the other without cutting. Topologists handle this by separating two questions: whether two spaces are equivalent as abstract spaces, and whether two embeddings in 3D space can be deformed into each other. This track focuses on the first.

Check your understanding

Quick check ยท 4 questions

of 4 answered You scored / 4 ยท perfect!

  1. 1. A graph has 7 vertices, 8 edges and 1 connected piece. What is its cycle rank E - V + C?

    8 - 7 + 1 = 2, so the graph has two independent loops.
  2. 2. What does subdividing an edge do to the cycle rank?

    Subdividing adds one vertex and one edge, so E - V is unchanged, and the number of pieces does not change either.
  3. 3. Which pair of capital-letter skeletons used in this lesson have different numbers of loops?

    B has two loops while A has one. O and D each have one loop, and so do P and R.
  4. 4. Why can a vertex of degree 2 be ignored topologically?

    Two edges meeting at a degree-2 vertex form one continuous string, which is exactly an undivided edge.

Summary

  • Graphs model shapes made of string; stretching and bending edges never changes the topology.
  • Subdividing an edge, or removing a degree-2 vertex, keeps the shape the same.
  • The cycle rank E โˆ’ V + C counts independent loops and is a topological invariant of graphs.
  • Counting loops and branch points sorts shapes into groups; different values prove two shapes differ.
  • Equivalence as abstract spaces ignores how a shape is placed in 3D, so a knot is still a circle.

Next: Metric Spaces: Distance Made Abstract