A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Fundamental Group of the Circle

Graduate Depth 82 in the knowledge graph I know this Set as goal
405prerequisites beneath it
See this on the map →
The Fundamental Group
circle fundamental-group winding-number

Core Idea

The fundamental group π₁(S¹) is isomorphic to ℤ, the integers under addition. The isomorphism assigns to each loop its winding number—the net number of times it wraps around the circle, with counterclockwise positive and clockwise negative. A loop that winds twice composes with one that winds three times to give a loop winding five times, mirroring addition in ℤ. The proof uses the covering space ℝ → S¹ given by the exponential map t ↦ e2πit, lifting loops to paths in ℝ and reading off the winding number as the endpoint. This computation is the foundational example in algebraic topology, demonstrating how topological features (the "hole" in S¹) are captured by algebraic invariants.

How It's Best Learned

Draw loops on S¹ with different winding numbers and verify that composition corresponds to addition. Then study the covering space ℝ → S¹ to see how lifting makes the winding number rigorous, turning a geometric intuition into an algebraic proof.

Common Misconceptions

The winding number is not about the shape of the loop but only about its net winding. A complicated loop that winds forward and backward may have winding number zero. Students also sometimes confuse π₁(S¹) ≅ ℤ with π₁(S²) ≅ 0—the sphere is simply connected because loops can be contracted over the surface.

Explainer

The fundamental group of the circle, π₁(S¹), is isomorphic to the integers ℤ under addition. This is the first nontrivial computation in algebraic topology and serves as the prototype for all subsequent fundamental group calculations. The isomorphism assigns to each homotopy class of loops its winding number — the net number of times the loop wraps around the circle, counted positive for counterclockwise and negative for clockwise. A loop that winds twice counterclockwise represents the integer 2; a loop that winds once clockwise represents −1. Concatenation of loops corresponds to addition of winding numbers: a loop of class 2 followed by a loop of class 3 gives a loop of class 5.

The winding number depends only on the net wrapping, not on the geometric complexity of the loop. A loop that winds 50 times counterclockwise and then 50 times clockwise has winding number 0 — it is homotopic to the constant loop, regardless of how elaborate its trajectory appears. This is a fundamental principle in algebraic topology: the homotopy class captures what cannot be continuously undone, not the visual complexity of the path. Two loops are homotopic if and only if they have the same winding number, so the homotopy classes are in exact bijection with the integers.

The rigorous proof that π₁(S¹) ≅ ℤ uses the covering space ℝ → S¹ given by the exponential map p(t) = e2πit. This map wraps the real line around the circle: every integer maps to the basepoint 1 ∈ S¹, and the intervals [n, n+1] each map onto exactly one full traversal of the circle. Given a loop γ in S¹ based at 1, the unique path lifting property of covering spaces produces a path γ̃ in ℝ starting at 0. Since γ is a loop (it returns to 1), the lifted path γ̃ must end at some integer n. This integer is the winding number. Crucially, homotopic loops in S¹ lift to paths with the same endpoint in ℝ — the lifting is homotopy-invariant — so the map [γ] ↦ n is a well-defined group homomorphism, and one can verify it is a bijection.

This computation has far-reaching consequences. It proves that the circle is not simply connected (π₁(S¹) is nontrivial), which distinguishes S¹ from contractible spaces like the disk. It provides the topological foundation for the argument that every polynomial has a root (a winding-number argument). It also explains why π₁(S²) is trivial: on the 2-sphere, any loop can slide over the surface and shrink to a point — there is no hole for a loop to wrap around. The contrast between π₁(S¹) ≅ ℤ and π₁(S²) = 0 illustrates how the fundamental group detects one-dimensional holes: the circle has one, the sphere does not.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementCartesian Products and RelationsPartial OrdersBinary RelationsEquivalence RelationsTopological Spaces: Definition and ExamplesOpen Sets in Topological SpacesNeighborhoods and Neighborhood BasesContinuity in Topological SpacesHomotopy of Continuous MapsHomotopy of PathsPath ConnectednessHomotopy of PathsThe Fundamental GroupFundamental Group of the Circle

Longest path: 83 steps · 405 total prerequisite topics

Prerequisites (1)

Leads To (0)

No topics depend on this one yet.