go-v.orgcodex
Menu
Page tools

codex · Philosophy

Central groupoid

In abstract algebra, a central groupoid is an algebraic structure defined by a binary operation ⋅ on a set of elements that satisfies the equation (a⋅b)⋅(b⋅c)=b. These structures have bijections to the central digraphs, directed graphs that have exactly one two-edge path between every two vertices, and (for finite central groupoids) to the (0,1)-matrices whose squares are the all-ones matrices. As an example, the operation ⋅ on points in the Euclidean plane, defined by recombining their Cartesian coordinates as (x1,y1)⋅(x2,y2)=(y1,x2) is a central groupoid.

The same type of recombination defines a central groupoid over the ordered pairs of elements from any set, called a natural central groupoid. As an algebraic structure with a single binary operation, a central groupoid is a special kind of magma or groupoid. Because central groupoids are defined by an equational identity, they form a variety of algebras in which the free objects are called free central groupoids. Free central groupoids are infinite, and have no idempotent elements. Finite central groupoids, including the natural central groupoids over finite sets, always have a square number of elements, whose square root is the number of idempotent elements.

Wikipedia contributors, "Central groupoid", Wikipedia, revision 1329893989, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex