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

The Fundamental Groupoid of a Space

Research Depth 83 in the knowledge graph I know this Set as goal
392prerequisites beneath it
See this on the map →
Groupoids and Weak Inverses
fundamental-group paths homotopy topological-invariant

Core Idea

The fundamental groupoid of a topological space has points as objects and homotopy classes of paths as morphisms, with composition given by path concatenation. Unlike the fundamental group (which depends on a basepoint choice), the fundamental groupoid is base-point-free and captures the full homotopy-theoretic information of the space. It provides a more natural and categorical framework for studying connectivity.

How It's Best Learned

Compute the fundamental groupoid of familiar spaces: the circle, the plane, a figure-eight. Verify that morphisms are invertible and explore how groupoid structure reflects topological properties. Understand the relationship between the fundamental groupoid and fundamental groups at various basepoints.

Common Misconceptions

The fundamental groupoid is not the same as the fundamental group; it encodes information at all points simultaneously. The automorphism group at a point is the fundamental group at that basepoint, but the groupoid structure includes much more.

Explainer

You know that a groupoid is a category in which every morphism is invertible. Objects can be many, not just one, so a groupoid generalizes both groups (one object, all morphisms invertible) and sets (many objects, only identity morphisms). The fundamental groupoid Π₁(X) of a topological space X is the canonical example of a groupoid arising in nature. Its objects are the points of X; its morphisms from point x to point y are homotopy classes of paths from x to y — continuous curves γ: [0,1] → X with γ(0) = x and γ(1) = y, where two paths are identified if one can be continuously deformed into the other while keeping the endpoints fixed.

Composition of morphisms is path concatenation: given a path from x to y and a path from y to z, you travel first along one, then the other, reparametrized to the unit interval. The identity morphism at x is the constant path that stays at x. The inverse of a path γ is the reversed path γ⁻¹(t) = γ(1−t), which traces the same route backwards. Checking the groupoid axioms reduces to standard facts in homotopy theory: concatenation is associative up to homotopy, the constant path is a homotopy identity, and reversing a path gives a homotopy inverse. Every morphism is invertible — that is the groupoid property — because you can always walk backwards.

The fundamental group π₁(X, x₀) based at a chosen point x₀ is the automorphism group Aut_{Π₁(X)}(x₀) in the fundamental groupoid — the collection of all homotopy classes of *loops* at x₀ (paths where γ(0) = γ(1) = x₀). The groupoid sees all basepoints simultaneously. When X is path-connected, all the automorphism groups Aut(x) are isomorphic to each other (conjugate via any path between them), so choosing a basepoint loses no information up to group isomorphism. But when X is disconnected — say, X = {a} ∪ {b}, two separate points — the fundamental groupoid has two objects and only identity morphisms, cleanly encoding the disconnection. No basepoint-based fundamental group can capture this: you'd need to pick a component.

The fundamental groupoid is not merely a notational convenience — it is categorically more natural. Any continuous map f: X → Y induces a functor Π₁(f): Π₁(X) → Π₁(Y), sending points to their images and homotopy classes of paths to their images. This makes Π₁ a functor from topological spaces to groupoids, and the functoriality packages the induced homomorphism on fundamental groups (at any basepoint) into a single, basepoint-free statement. The van Kampen theorem, which computes π₁ of a union of spaces, has a cleaner and more general statement at the groupoid level: Π₁(X ∪ Y) is the pushout of Π₁(X) and Π₁(Y) over Π₁(X ∩ Y) in the category of groupoids.

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 RelationsInjective, Surjective, and Bijective FunctionsCategories and MorphismsFunctorsCommutative Diagrams in Category TheoryCommutative Diagrams and CompositionNatural Transformations2-Categories and Weak FunctorsNatural Isomorphisms Between FunctorsIsomorphisms in CategoriesGroupoids and Weak InversesThe Fundamental Groupoid of a Space

Longest path: 84 steps · 392 total prerequisite topics

Prerequisites (1)

Leads To (0)

No topics depend on this one yet.