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

The Fundamental Group of the Circle

Graduate Depth 82 in the knowledge graph I know this Set as goal
2topics build on this
405prerequisites beneath it
See this on the map →
The Fundamental Groupvan Kampen's Theorem
fundamental-group circle

Core Idea

π₁(S¹) ≅ ℤ, where an integer n corresponds to the homotopy class of loops that wind around the circle n times. This is computed using the universal covering map ℝ → S¹.

Explainer

You already know that the fundamental group π₁(X, x₀) consists of homotopy classes of loops based at x₀ — loops that can be continuously deformed into each other are considered the same element. The circle S¹ is the first nontrivial example: a loop on the circle can wind around it any integer number of times, and two loops are homotopic if and only if they wind the same number of times. This yields the isomorphism π₁(S¹) ≅ ℤ, where the integer is the winding number.

The winding number has an intuitive picture: stand at the center of the circle and watch a point trace a loop. Count how many full counterclockwise revolutions it completes (clockwise counts as negative). A loop that goes around once counterclockwise has winding number +1; one that doubles back once clockwise has winding number −1; a contractible loop (one that never truly goes around) has winding number 0. The group operation in π₁ corresponds to concatenating loops, which adds winding numbers — exactly the group operation in ℤ.

The proof uses the universal covering map p: ℝ → S¹ defined by p(t) = e2πit (wrapping the real line around the circle). The key property is that every loop γ in S¹ starting at 1 lifts uniquely to a path γ̃ in ℝ starting at 0. The endpoint γ̃(1) is an integer because p(γ̃(1)) = γ(1) = 1, meaning γ̃(1) must be an integer. This endpoint is the winding number. Homotopic loops lift to paths with the same endpoint, so the map [γ] ↦ γ̃(1) is well-defined on homotopy classes; it is straightforward to check it is a group isomorphism.

This computation has consequences far beyond its apparent simplicity. Since π₁(S¹) ≅ ℤ ≠ 0, the circle is not simply connected — loops around it cannot all be contracted to a point. This distinguishes S¹ from the disk D² (which is simply connected). The result also underpins the Brouwer fixed-point theorem, the fundamental theorem of algebra, and the theory of covering spaces you will study next: every covering of S¹ corresponds to a subgroup of ℤ, which are exactly the subgroups nℤ for n ≥ 0.

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 GroupThe Fundamental Group of the Circle

Longest path: 83 steps · 405 total prerequisite topics

Prerequisites (1)

Leads To (1)