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

Groupoids and Weak Inverses

Graduate Depth 82 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
391prerequisites beneath it
See this on the map →
Categories and MorphismsIsomorphisms in Categories→→The Fundamental Groupoid of a Space
groupoids invertible-morphisms automorphisms

Core Idea

A groupoid is a category in which every morphism is an isomorphism, generalizing both groups and equivalence relations. Groupoids provide a framework for studying 'partial' algebraic structures where not all pairs of elements can be composed, and arise naturally in topology, combinatorics, and analysis. The theory of groupoids captures aspects of both group theory and category theory.

How It's Best Learned

Study the fundamental groupoid of a topological space, the groupoid of a group action, and abstract groupoids given by presentations. Verify that morphisms are invertible and explore the automorphism groups at each object. Compute groupoid homology and cohomology.

Common Misconceptions

A groupoid is not just a group with extra structure; it has multiple objects. The identity morphisms at different objects are distinct, and composition is only defined when target and source match appropriately.

Explainer

From your prerequisite on categories and morphisms, you know that a category has objects and arrows between them, with composition satisfying associativity and unit laws. From isomorphisms in categories, you know that a morphism f: A → B is an isomorphism when there exists g: B → A such that g ∘ f = id_A and f ∘ g = id_B. A groupoid is simply a category in which *every* morphism is an isomorphism — all arrows are invertible. This single requirement transforms the algebraic structure dramatically.

To see why, consider the two extreme cases. A category with a single object and all morphisms invertible is exactly a group: composition is the group operation, the identity morphism is the identity element, and inverses are the morphism inverses. A groupoid generalizes this by allowing many objects, so you can have "partial group structure" — some pairs of elements compose, others do not, depending on whether source and target match. An equivalence relation on a set gives another extreme: objects are elements of the set, and there is exactly one morphism from x to y whenever x ~ y (and none otherwise). Invertibility corresponds to symmetry of the relation. So groupoids unify groups and equivalence relations in a single framework.

The richest example is the fundamental groupoid Π₁(X) of a topological space X. Objects are points of X, and a morphism from x to y is a homotopy class of paths from x to y. Composition is concatenation of paths; the identity at x is the constant path at x; and the inverse of a path is the same path traversed backwards. This is automatically a groupoid because every path can be reversed. When X is path-connected and you restrict to a single basepoint x₀, you recover the familiar fundamental group π₁(X, x₀) as the automorphism group at the object x₀. The fundamental groupoid is strictly more informative: it captures all basepoints and all paths between them simultaneously, without privileging any one basepoint.

The structure of a groupoid is thus richer than a group in one key respect: it has multiple objects, so the automorphism groups at different objects (the "local groups" Aut(x) = Hom(x, x)) may differ. In the fundamental groupoid of a space with multiple path components, the automorphism groups at points in different components are unrelated. In a groupoid arising from a group action — where objects are elements acted upon and a morphism from x to y exists for each group element g with g·x = y — the automorphism group at each object is the stabilizer of that object under the action. Groupoids make the relationship between global symmetry and local stabilizers transparent.

Weak inverses in the title refer to the morphism-level inverses in a groupoid, to distinguish them from strict inverses in a group. In a group, the inverse of g is unique and satisfies g⁻¹g = e = gg⁻¹ exactly. In higher categorical contexts (bicategories, 2-groupoids), one weakens the notion of invertibility to require only that the composites are *isomorphic* to the identity, rather than equal — this is the "weak" part. Ordinary groupoids are the 1-dimensional version of this tower. Your next topic, the fundamental groupoid, will develop the topological interpretation further and show how groupoids serve as the natural language for describing paths, loops, and homotopies across a space simultaneously.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Categories and Morphisms → Functors → Commutative Diagrams in Category Theory → Commutative Diagrams and Composition → Natural Transformations → 2-Categories and Weak Functors → Natural Isomorphisms Between Functors → Isomorphisms in Categories → Groupoids and Weak Inverses

Longest path: 83 steps · 391 total prerequisite topics

Prerequisites (2)

Leads To (1)