Metraipolis › archive › dc_b6496cd9b72b

Groupoid — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Groupoid
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T18:21:03.713Z
SHA-256 of the archived text
5f64770cebc01f78ed403ea6917a896105f7842ceda237889e65ba8736309dc1
Stable URL of this page
https://metraipolis.com/documento/dc_b6496cd9b72b

How to cite

Groupoid — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Groupoid (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_b6496cd9b72b (Metraipolis archive dc_b6496cd9b72b, sha256 5f64770cebc01f78ed403ea6917a896105f7842ceda237889e65ba8736309dc1)
BibTeX
@misc{dcb6496cd9b72b,
  title = {Groupoid — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Groupoid},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_b6496cd9b72b; sha256 5f64770cebc01f78ed403ea6917a896105f7842ceda237889e65ba8736309dc1},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Groupoid. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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: Group with a partial function replacing the binary operation; Category in which every morphism is invertible. A category of this sort can be viewed as augmented with a unary operation on the morphisms, called inverse by analogy with group theory. A groupoid where there is only one object is a usual group. In the presence of dependent typing, a category in general can be viewed as a typed monoid, and similarly, a groupoid can be viewed as simply a typed group. The morphisms take one from one object to another, and form a dependent family of types, thus morphisms might be typed g : A → B {\displaystyle g:A\rightarrow B} , h : B → C {\displaystyle h:B\rightarrow C} , say. Composition is then a total function: ∘ : ( B → C ) → ( A → B ) → ( A → C ) {\displaystyle \circ :(B\rightarrow C)\rightarrow (A\rightarrow B)\rightarrow (A\rightarrow C)} , so that h ∘ g : A → C {\displaystyle h\circ g:A\rightarrow C} . Special cases include: Setoid: a set that comes with an equivalence relation, G-set: a set equipped with an action of a group G {\displaystyle G} . Groupoids are often used to reason about geometrical objects such as manifolds. Heinrich Brandt (1927) introduced groupoids implicitly via Brandt semigroups.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «category theory»).
Fonte: Wikipedia in inglese, voce «Groupoid» — https://en.wikipedia.org/wiki/Groupoid
Wikidata Q1196038 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1196038
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Groupoid?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1377919483, consultata il 2026-10-06T16:46:22.329Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: c2fd51167484c252aa7283e1e77d7b162f14079cfb5cf239a44c204ba25b450a