Semigroupoid

From Wikipedia, the free encyclopedia

In mathematics, a semigroupoid (also called semicategory, naked category or precategory) is a partial algebra that satisfies the axioms for a small[1][2][3] category, except possibly for the requirement that there be an identity at each object. Semigroupoids generalise semigroups in the same way that small categories generalise monoids and groupoids generalise groups. Semigroupoids have applications in the structural theory of semigroups.

More information Total, Associative ...
Group-like structures
Total Associative Identity Divisible Commutative
Partial magma UnneededUnneededUnneededUnneededUnneeded
Semigroupoid UnneededRequiredUnneededUnneededUnneeded
Small category UnneededRequiredRequiredUnneededUnneeded
Groupoid UnneededRequiredRequiredRequiredUnneeded
Commutative groupoid UnneededRequiredRequiredRequiredRequired
Magma RequiredUnneededUnneededUnneededUnneeded
Commutative magma RequiredUnneededUnneededUnneededRequired
Quasigroup RequiredUnneededUnneededRequiredUnneeded
Commutative quasigroup RequiredUnneededUnneededRequiredRequired
Unital magma RequiredUnneededRequiredUnneededUnneeded
Commutative unital magma RequiredUnneededRequiredUnneededRequired
Loop RequiredUnneededRequiredRequiredUnneeded
Commutative loop RequiredUnneededRequiredRequiredRequired
Semigroup RequiredRequiredUnneededUnneededUnneeded
Commutative semigroup RequiredRequiredUnneededUnneededRequired
Associative quasigroup RequiredRequiredUnneededRequiredUnneeded
Commutative-and-associative quasigroup RequiredRequiredUnneededRequiredRequired
Monoid RequiredRequiredRequiredUnneededUnneeded
Commutative monoid RequiredRequiredRequiredUnneededRequired
Group RequiredRequiredRequiredRequiredUnneeded
Abelian group RequiredRequiredRequiredRequiredRequired
Close

Formally, a semigroupoid consists of:

  • a set of things called objects.
  • for every two objects A and B a set Mor(A,B) of things called morphisms from A to B. If f is in Mor(A,B), we write f : AB.
  • for every three objects A, B and C a binary operation Mor(A,B) × Mor(B,C) → Mor(A,C) called composition of morphisms. The composition of f : AB and g : BC is written as gf or gf. (Some authors write it as fg.)

such that the following axiom holds:

  • (associativity) if f : AB, g : BC and h : CD then h ∘ (gf) = (hg) ∘ f.

References

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.