Group-like structures | |||||
---|---|---|---|---|---|
Totality | Associativity | Identity | Invertibility | Commutativity | |
Semicategory | Unneeded | Required | Unneeded | Unneeded | Unneeded |
Category | Unneeded | Required | Required | Unneeded | Unneeded |
Groupoid | Unneeded | Required | Required | Required | Unneeded |
Magma | Required | Unneeded | Unneeded | Unneeded | Unneeded |
Quasigroup | Required | Unneeded | Unneeded | Required | Unneeded |
Loop | Required | Unneeded | Required | Required | Unneeded |
Semigroup | Required | Required | Unneeded | Unneeded | Unneeded |
Monoid | Required | Required | Required | Unneeded | Unneeded |
Group | Required | Required | Required | Required | Unneeded |
Abelian group | Required | Required | Required | Required | Required |
^α Closure, which is used in many sources, is an equivalent axiom to totality, though defined differently. |
In mathematics, especially in category theory and homotopy theory, a groupoid (less often Brandt groupoid or virtual group) generalises the notion of group in several equivalent ways. A groupoid can be seen as a:
Special cases include:
Groupoids are often used to reason about geometrical objects such as manifolds. Heinrich Brandt (1927) introduced groupoids implicitly via Brandt semigroups.
A groupoid is an algebraic structure (G,) consisting of a non-empty set G and a binary partial function '' defined on G.
A groupoid is a set G with a unary operation and a partial function . Here * is not a binary operation because it is not necessarily defined for all possible pairs of G-elements. The precise conditions under which * is defined are not articulated here and vary by situation.