Skip to content

Fundamental Groupoid

The groupoid whose objects are points of a space and whose arrows are fixed-endpoint homotopy classes of paths, retaining path components and all basepoint fundamental groups in one functorial invariant.

Version
v4 · 2026-09-19 · History
Domain-specific #
1901
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Algebraic Topology → Mathematics
Aliases
Poincaré groupoid, First fundamental groupoid, Path-homotopy groupoid

Core Idea

For a topological space (X), the fundamental groupoid \(\Pi_1(X)\) is the category whose objects are the points of (X) and whose morphisms \(x\to y\) are homotopy classes, relative to endpoints, of continuous paths from (x) to (y). Composition is induced by path concatenation, identity arrows by constant paths, and inverses by reversing paths. Because every arrow is invertible, the category is a groupoid.

At an object (x), the automorphism group

\[ \operatorname{Aut}_{\Pi_1(X)}(x)=\Pi_1(X)(x,x) \]

How would you explain it like I'm…

All the Wiggly Paths

Imagine all the spots in a park, and all the walking paths from one spot to another. If you can wiggle one path into another without lifting your feet off the start and end spots, they count as the same path. You can join paths end to end, or walk any path backward. The Fundamental groupoid is the list of all these spots and paths.

Map of Bendable Paths

Take any shape or space. Its points are the spots, and a path is a way to travel from one spot to another. If you can smoothly bend one path into another while keeping both ends pinned down, the two count as the same path. The Fundamental Groupoid keeps track of all spots and all these 'same-or-different' paths. You can join a path ending at a spot with one starting there, stay still, or walk a path backward. It shows which spots can be reached from which, and how the loops around holes look from each spot.

Path-Class Groupoid of a Space

For a space X, the Fundamental Groupoid Π₁(X) has the points of X as objects. Its arrows from x to y are paths from x to y, where two paths count as equal if one can be continuously deformed into the other with the endpoints held fixed (homotopy). Gluing paths end to end composes arrows, and constant paths act as identities. Reversing a path gives an inverse, so every arrow is invertible, which is what 'groupoid' means. The loops at one point form the usual fundamental group π₁(X, x). Unlike that single group, the groupoid also records paths between different points, which tell you how to change basepoint. Its separate pieces are exactly the path components of X.

 

The Fundamental Groupoid Π₁(X) of a topological space X is a category. Its objects are the points of X, and its morphisms x → y are homotopy classes, relative to endpoints, of continuous paths from x to y. Composition comes from concatenation, identities from constant paths, and inverses from path reversal, so every morphism is invertible and Π₁(X) is a groupoid. The automorphism group at x, Π₁(X)(x, x), is the fundamental group π₁(X, x). Morphisms between different points encode basepoint-change isomorphisms. The connected components of the groupoid are exactly the path components of X. So one object packages π₀, all the based π₁'s, and the transport between them. The construction is functorial: a continuous map f: X → Y gives a functor sending x to f(x) and [γ] to [f∘γ]. Homotopies between maps give natural transformations between these functors.

Scope of Application

The fundamental groupoid is used in covering-space theory, local systems, monodromy, calculation of fundamental groups, one-dimensional homotopy types, and categorical formulations of algebraic topology. A local system can be represented as a functor from \(\Pi_1(X)\) into sets, groups, vector spaces, or another target category; path classes determine transport isomorphisms.

Its major calculational advantage appears in the groupoid van Kampen theorem. Working with a set of basepoints meeting relevant path components removes connectedness restrictions that complicate the group version and preserves more symmetry during gluing. The fundamental groupoid of a union can be obtained by an appropriate pushout of groupoids under the theorem’s hypotheses.

Clarity

Path homotopy must keep endpoints fixed throughout the deformation. Free homotopy of loops is coarser and corresponds to conjugacy phenomena rather than equality of arrows at a fixed object. Composition order should be stated, because path-concatenation notation varies between authors.

Associativity holds for homotopy classes even though literal concatenation of parametrized paths is associative only up to reparametrization.

Manages Complexity

The groupoid removes repeated basepoint bookkeeping. Instead of selecting one basepoint, transporting every loop to it, and quotienting by conjugation ambiguities, one retains all relevant points and lets paths themselves implement transport. Symmetries that move basepoints remain visible as functors or automorphisms rather than being broken by an arbitrary choice.

Abstract Reasoning

To compute or use \(\Pi_1(X)\):

  1. Determine the path components and choose an object set appropriate to the question.
  2. Represent generating paths and endpoint-fixed homotopy relations.
  3. Form composites by concatenation and simplify by homotopy.
  4. Extract vertex groups for loop information at selected points.
  5. Use connecting arrows to transport between vertex groups; different connecting paths differ by conjugation.
  6. For a cover, construct the subspace and overlap groupoids and apply the groupoid van Kampen pushout.

Knowledge Transfer

The construction transfers literally from topological spaces to related settings with paths and homotopies, including suitable manifolds, complexes, orbifold refinements, and directed or étale variants once their arrow notions are declared. The groupoid principle also transfers to equivalence relations and reversible processes: multiple objects with only invertible arrows generalize a group without collapsing all states to one object.

Relationships to Other Abstractions

Local relationship map for Fundamental GroupoidParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Fundamental GroupoidDOMAINPrime abstraction: Category — is a kind ofCategoryPRIME

Current abstraction Fundamental Groupoid Domain-specific

Parents (1) — outgoing typed relations

  • Fundamental Groupoid is a kind of Category Prime

    Category is the broader abstraction this entry instantiates: \(\Pi_1(X)\) has objects, morphisms, identities, and associative composition, with the additional condition that every morphism is invertible.

Hierarchy paths (3) — routes to 3 parentless roots

Neighborhood in Abstraction Space

Fundamental Groupoid sits in a sparse region of the domain-specific corpus (78th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25