Partial groupoid

Last updated December 27, 2023

Group-like structures
	Totality ^α	Associativity	Identity	Divisibility ^β	Commutativity
Partial magma	Unneeded	Unneeded	Unneeded	Unneeded	Unneeded
Semigroupoid	Unneeded	Required	Unneeded	Unneeded	Unneeded
Small category	Unneeded	Required	Required	Unneeded	Unneeded
Groupoid	Unneeded	Required	Required	Required	Unneeded
Magma	Required	Unneeded	Unneeded	Unneeded	Unneeded
Quasigroup	Required	Unneeded	Unneeded	Required	Unneeded
Unital magma	Required	Unneeded	Required	Unneeded	Unneeded
Loop	Required	Unneeded	Required	Required	Unneeded
Semigroup	Required	Required	Unneeded	Unneeded	Unneeded
Associative quasigroup	Required	Required	Unneeded	Required	Unneeded
Monoid	Required	Required	Required	Unneeded	Unneeded
Commutative monoid	Required	Required	Required	Unneeded	Required
Group	Required	Required	Required	Required	Unneeded
Abelian group	Required	Required	Required	Required	Required
^α The closure axiom, used by many sources and defined differently, is equivalent. ^β Here, divisibility refers specifically to the quasigroup axioms.

In abstract algebra, a partial groupoid (also called halfgroupoid, pargoid, or partial magma) is a set endowed with a partial binary operation.^[1]^[2]

Partial semigroup

A partial groupoid $(G,\circ )$ is called a partial semigroup if the following associative law holds:^[3]

For all $x,y,z\in G$ such that $x\circ y\in G$ and $y\circ z\in G$ , the following two statements hold:

$x\circ (y\circ z)\in G$ if and only if $(x\circ y)\circ z\in G$ , and
$x\circ (y\circ z)=(x\circ y)\circ z$ if $x\circ (y\circ z)\in G$ (and, because of 1., also $(x\circ y)\circ z\in G$ ).

Related Research Articles

In mathematics, the associative property is a property of some binary operations, which means that rearranging the parentheses in an expression will not change the result. In propositional logic, associativity is a valid rule of replacement for expressions in logical proofs.

In mathematics, a binary relation associates elements of one set, called the domain, with elements of another set, called the codomain. A binary relation over sets $X$ and $Y$ is a new set of ordered pairs $(x, y)$ consisting of elements $x$ from $X$ and $y$ from $Y$ . It is a generalization of the more widely understood idea of a unary function. It encodes the common concept of relation: an element $x$ is related to an element $y$ , if and only if the pair $(x, y)$ belongs to the set of ordered pairs that defines the binary relation. A binary relation is the most studied special case $n = 2$ of an $n$ -ary relation over sets $X 1, ..., X n$ , which is a subset of the Cartesian product

<span class="mw-page-title-main">Bijection</span> One-to-one correspondence

A bijection, bijective function, or one-to-one correspondence between two mathematical sets is a function such that each element of the second set is mapped to from exactly one element of the first set. Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set.

In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equality. Any number $is equal to itself (reflexive). If, then (symmetric). If and, then (transitive).$

In mathematics, especially in category theory and homotopy theory, a groupoid generalises the notion of group in several equivalent ways. A groupoid can be seen as a:

In algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type. The word homomorphism comes from the Ancient Greek language: ὁμός meaning "same" and μορφή meaning "form" or "shape". However, the word was apparently introduced to mathematics due to a (mis)translation of German ähnlich meaning "similar" to ὁμός meaning "same". The term "homomorphism" appeared as early as 1892, when it was attributed to the German mathematician Felix Klein (1849–1925).

In mathematics, a partial function $f$ from a set $X$ to a set $Y$ is a function from a subset $S$ of $X$ to $Y$ . The subset $S$ , that is, the domain of $f$ viewed as a function, is called the domain of definition or natural domain of $f$ . If $S$ equals $X$ , that is, if $f$ is defined on every element in $X$ , then $f$ is said to be a total function.

In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it.

In mathematics, the concept of an inverse element generalises the concepts of opposite and reciprocal of numbers.

In abstract algebra, a magma, binar, or, rarely, groupoid is a basic kind of algebraic structure. Specifically, a magma consists of a set equipped with a single binary operation that must be closed by definition. No other properties are imposed.

In mathematics, function composition is an operation $\circ$ that takes two functions $f$ and $g$ , and produces a function $h = g \circ f$ such that $h (x) = g (f (x))$ . In this operation, the function $g$ is applied to the result of applying the function $f$ to $x$ . That is, the functions $f : X \to Y$ and $g : Y \to Z$ are composed to yield a function that maps $x$ in domain $X$ to $g (f (x))$ in codomain $Z$ . Intuitively, if $z$ is a function of $y$ , and $y$ is a function of $x$ , then $z$ is a function of $x$ . The resulting composite function is denoted $g \circ f : X \to Z$ , defined by $(g \circ f)(x) = g (f (x))$ for all $x$ in $X$ .

In mathematics, particularly in combinatorics, given a family of sets, here called a collection C, a transversal (also called a cross-section) is a set containing exactly one element from each member of the collection. When the sets of the collection are mutually disjoint, each element of the transversal corresponds to exactly one member of C (the set it is a member of). If the original sets are not disjoint, there are two possibilities for the definition of a transversal:

In group theory, an inverse semigroupS is a semigroup in which every element x in S has a unique inversey in S in the sense that x = xyx and y = yxy, i.e. a regular semigroup in which every element has a unique inverse. Inverse semigroups appear in a range of contexts; for example, they can be employed in the study of partial symmetries.

Fibred categories are abstract entities in mathematics used to provide a general framework for descent theory. They formalise the various situations in geometry and algebra in which inverse images of objects such as vector bundles can be defined. As an example, for each topological space there is the category of vector bundles on the space, and for every continuous map from a topological space X to another topological space Y is associated the pullback functor taking bundles on Y to bundles on X. Fibred categories formalise the system consisting of these categories and inverse image functors. Similar setups appear in various guises in mathematics, in particular in algebraic geometry, which is the context in which fibred categories originally appeared. Fibered categories are used to define stacks, which are fibered categories with "descent". Fibrations also play an important role in categorical semantics of type theory, and in particular that of dependent type theories.

In mathematics, an operad is a structure that consists of abstract operations, each one having a fixed finite number of inputs (arguments) and one output, as well as a specification of how to compose these operations. Given an operad $, one defines an algebra over to be a set together with concrete operations on this set which behave just like the abstract operations of . For instance, there is a Lie operad such that the algebras over are precisely the Lie algebras; in a sense abstractly encodes the operations that are common to all Lie algebras. An operad is to its algebras as a group is to its group representations.$

In mathematics, the converse of a binary relation is the relation that occurs when the order of the elements is switched in the relation. For example, the converse of the relation 'child of' is the relation 'parent of'. In formal terms, if $and are sets and is a relation from to then is the relation defined so that if and only if In set-builder notation,$

In abstract algebra, a semiheap is an algebraic structure consisting of a non-empty set H with a ternary operation denoted $that satisfies a modified associativity property:$

In mathematics, particularly in abstract algebra, a semigroup with involution or a *-semigroup is a semigroup equipped with an involutive anti-automorphism, which—roughly speaking—brings it closer to a group because this involution, considered as unary operator, exhibits certain fundamental properties of the operation of taking the inverse in a group: uniqueness, double application "cancelling itself out", and the same interaction law with the binary operation as in the case of the group inverse. It is thus not a surprise that any group is a semigroup with involution. However, there are significant natural examples of semigroups with involution that are not groups.

In mathematics, R-algebroids are constructed starting from groupoids. These are more abstract concepts than the Lie algebroids that play a similar role in the theory of Lie groupoids to that of Lie algebras in the theory of Lie groups..

In mathematics, homotopy theory is a systematic study of situations in which maps can come with homotopies between them. It originated as a topic in algebraic topology but nowadays is learned as an independent discipline. Besides algebraic topology, the theory has also been used in other areas of mathematics such as algebraic geometry (e.g., A¹ homotopy theory) and category theory (specifically the study of higher categories).

References

↑ Evseev, A. E. (1988). "A survey of partial groupoids". In Ben Silver (ed.). Nineteen Papers on Algebraic Semigroups. American Mathematical Soc. ISBN 0-8218-3115-1.
↑ Folkert Müller-Hoissen; Jean Marcel Pallo; Jim Stasheff, eds. (2012). Associahedra, Tamari Lattices and Related Structures: Tamari Memorial Festschrift . Springer Science & Business Media. pp. 11 and 82. ISBN 978-3-0348-0405-9.
↑ Schelp, R. H. (1972). "A partial semigroup approach to partially ordered sets". Proceedings of the London Mathematical Society. 3 (1): 46–58. doi:10.1112/plms/s3-24.1.46 . Retrieved 1 April 2023.

Partial groupoid

Contents

Partial semigroup

Related Research Articles

References

Further reading