Quasigroup

Uses your system voice; voice and rate in settings.

Snapshot

≈ 7 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure that resembles a group in the sense that "division" is always possible. Quasigroups differ from groups mainly in that the associative and identity element properties are optional. In fact, a nonempty associative quasigroup is a group. A quasigroup that has an identity element is called a loop.

In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure that resembles a group in the sense that "division" is always possible. Quasigroups differ from groups mainly in that the associative and identity element properties are optional. In fact, a nonempty associative quasigroup is a group. A quasigroup that has an identity element is called a loop. a \ast x = b y \ast a = b hold.

(In other words: Each element of the set occurs exactly once in each row and exactly once in each column of the quasigroup's multiplication table, or Cayley table. This property ensures that the Cayley table of a finite quasigroup, and, in particular, a finite group, is a Latin square.) The requirement that and be unique can be replaced by the requirement that the magma be cancellative. The unique solutions to these equations are written and . The operations ' ' and ' ' are called, respectively, left division and right division.

With regard to the Cayley table, the first equation (left division) means that the entry in the row is in the column while the second equation (right division) means that the entry in the column is in the row. The empty set equipped with the empty binary operation satisfies this definition of a quasigroup.

Impact

Some authors accept the empty quasigroup, but others explicitly exclude it. y = (y / x) \ast x y = (y \ast x) / x A left-quasigroup is a type algebra that satisfies the identities: y = x \ast (x \backslash y) y = x \backslash (x \ast y) A quasigroup is a type algebra (i.e., equipped with three binary operations) that satisfies the identities: y = (y / x) \ast x y = (y \ast x) / x y = x \ast (x \backslash y) y = x \backslash (x \ast y) In other words: Multiplication and division in either order, one after the other, on the same side by the same element, have no net effect.

Hence if is a quasigroup according to the definition of the previous section, then is the same quasigroup in the sense of universal algebra. And vice versa: if is a quasigroup according to the sense of universal algebra, then is a quasigroup according to the first definition. x ∗ e = x and e ∗ x = x for all x in Q. It follows that the identity element, e, is unique, and that every element of Q has unique left and right inverses (which need not be the same). Since the presence of an identity element is essential, a loop cannot be empty.

A quasigroup with an idempotent element is called a pique ("pointed idempotent quasigroup"); this is a weaker notion than a loop but common nonetheless because, for example, given an abelian group, , taking its subtraction operation as quasigroup multiplication yields a pique with the group identity (zero) turned into a "pointed idempotent". (That is, there is a principal isotopy .) A loop that is associative is a group. A group can have a strictly nonassociative pique isotope, but it cannot have a strictly nonassociative loop isotope.

There are weaker associativity properties that have been given special names. For instance, a Bol loop is a loop that satisfies either: x ∗ (y ∗ (x ∗ z)) = (x ∗ (y ∗ x)) ∗ z for each x, y and z in Q (a left Bol loop), or else ((z ∗ x) ∗ y) ∗ x = z ∗ ((x ∗ y) ∗ x) for each x, y and z in Q (a right Bol loop). A loop that is both a left and right Bol loop is a Moufang loop.

This is equivalent to any one of the following single Moufang identities holding for all x, y, z: x ∗ (y ∗ (x ∗ z)) = ((x ∗ y) ∗ x) ∗ z z ∗ (x ∗ (y ∗ x)) = ((z ∗ x) ∗ y) ∗ x (x ∗ y) ∗ (z ∗ x) = x ∗ ((y ∗ z) ∗ x) (x ∗ y) ∗ (z ∗ x) = (x ∗ (y ∗ z)) ∗ x. According to Jonathan D. H. Smith, "loops" were named after the Chicago Loop, as their originators were studying quasigroups in Chicago at the time. (c ∗ x) ∗ y = (c ∗ y) ∗ x implies that x = y.

A quasigroup is called totally anti-symmetric if, in addition, for all , the following implication holds: x ∗ y = y ∗ x implies that x = y. This property is required, for example, in the Damm algorithm. (x 1 , x 2 , x 3 , x 4 ) ∗ (y 1 , y 2 , y 3 , y 4 ) = (x 1 , x 2 , x 3 , x 4 ) + (y 1 , y 2 , y 3 , y 4 ) + (0, 0, 0, (x 3 − y 3 )(x 1 y 2 − x 2 y 1 )). Then, is a commutative Moufang loop that is not a group. More generally, the nonzero elements of any division algebra form a quasigroup with the operation of multiplication in the algebra.

L x (y) = xy R x (y) = yx The definition says that both mappings are bijections from Q to itself. A magma Q is a quasigroup precisely when all these operators, for every x in Q, are bijective. The inverse mappings are left and right division, that is, In this notation the identities among the quasigroup's multiplication and division operations (stated in the section on universal algebra) are where denotes the identity mapping on Q.

The multiplication table of a finite quasigroup is a Latin square: an table filled with n different symbols in such a way that each symbol occurs exactly once in each row and exactly once in each column. Conversely, every Latin square can be taken as the multiplication table of a quasigroup in many ways: the border row (containing the column headers) and the border column (containing the row headers) can each be any permutation of the elements. See Small Latin squares and quasigroups. α(x)β(y) = γ(xy) for all x, y in Q.

A quasigroup homomorphism is just a homotopy for which the three maps are equal. An isotopy is a homotopy for which each of the three maps is a bijection. Two quasigroups are isotopic if there is an isotopy between them. In terms of Latin squares, an isotopy is given by a permutation of rows α, a permutation of columns β, and a permutation on the underlying element set γ. An autotopy is an isotopy from a quasigroup to itself. The set of all autotopies of a quasigroup forms a group with the automorphism group as a subgroup.

Every quasigroup is isotopic to a loop. If a loop is isotopic to a group, then it is isomorphic to that group and thus is itself a group. However, a quasigroup that is isotopic to a group need not be a group. For example, the quasigroup on R with multiplication given by is isotopic to the additive group , but is not itself a group as it has no identity element. Every medial quasigroup is isotopic to an abelian group by the Bruck–Toyoda theorem. f(x 1 , ..., x n ) = g(x 1 , ..., x i−1 , h(x i , ..., x j ), x j+1 , ..., x n ), where and .

Finite irreducible n-ary quasigroups exist for all ; see for details. An n-ary quasigroup with an n-ary version of associativity is called an n-ary group.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1369849496 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

5 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.