- Source: Quasigroup
In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure resembling 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 with an identity element is called a loop.
Definitions
There are at least two structurally equivalent formal definitions of quasigroup:
One defines a quasigroup as a set with one binary operation.
The other, from universal algebra, defines a quasigroup as having three primitive operations.
The homomorphic image of a quasigroup defined with a single binary operation, however, need not be a quasigroup. We begin with the first definition.
= Algebra
=A quasigroup (Q, ∗) is a non-empty set Q with a binary operation ∗ (that is, a magma, indicating that a quasigroup has to satisfy closure property), obeying the Latin square property. This states that, for each a and b in Q, there exist unique elements x and y in Q such that both
a ∗ x = b
y ∗ 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 x and y be unique can be replaced by the requirement that the magma be cancellative.
The unique solutions to these equations are written x = a \ b and y = b / a. 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 b entry in the a row is in the x column while the second equation (right division) means that the b entry in the a column is in the y row.
The empty set equipped with the empty binary operation satisfies this definition of a quasigroup. Some authors accept the empty quasigroup but others explicitly exclude it.
= Universal algebra
=Given some algebraic structure, an identity is an equation in which all variables are tacitly universally quantified, and in which all operations are among the primitive operations proper to the structure. Algebraic structures that satisfy axioms that are given solely by identities are called a variety. Many standard results in universal algebra hold only for varieties. Quasigroups form a variety if left and right division are taken as primitive.
A right-quasigroup (Q, ∗, /) is a type (2, 2) algebra that satisfy both identities:
y = (y / x) ∗ x
y = (y ∗ x) / x.
A left-quasigroup (Q, ∗, \) is a type (2, 2) algebra that satisfy both identities:
y = x ∗ (x \ y)
y = x \ (x ∗ y).
A quasigroup (Q, ∗, \, /) is a type (2, 2, 2) algebra (i.e., equipped with three binary operations) that satisfy the identities:
y = (y / x) ∗ x
y = (y ∗ x) / x
y = x ∗ (x \ y)
y = x \ (x ∗ 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 (Q, ∗) is a quasigroup according to the definition of the previous section, then (Q, ∗, \, /) is the same quasigroup in the sense of universal algebra. And vice versa: if (Q, ∗, \, /) is a quasigroup according to the sense of universal algebra, then (Q, ∗) is a quasigroup according to the first definition.
Loops
A loop is a quasigroup with an identity element; that is, an element, e, such that
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).
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, (A, +), taking its subtraction operation as quasigroup multiplication yields a pique (A, −) with the group identity (zero) turned into a "pointed idempotent". (That is, there is a principal isotopy (x, y, z) ↦ (x, −y, z).)
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), or
(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.
Symmetries
(Smith 2007) names the following important properties and subclasses:
= Semisymmetry
=A quasigroup is semisymmetric if any of the following equivalent identities hold:
x ∗ y = y / x
y ∗ x = x \ y
x = (y ∗ x) ∗ y
x = y ∗ (x ∗ y).
Although this class may seem special, every quasigroup Q induces a semisymmetric quasigroup QΔ on the direct product cube Q3 via the following operation:
(x1, x2, x3) ⋅ (y1, y2, y3) = (y3 / x2, y1 \ x3, x1 ∗ y2) = (x2 // y3, x3 \\ y1, x1 ∗ y2),
where "//" and "\\" are the conjugate division operations given by y // x = x / y and y \\ x = x \ y.
= Triality
=A quasigroup may exhibit semisymmetric triality.
= Total symmetry
=A narrower class is a totally symmetric quasigroup (sometimes abbreviated TS-quasigroup) in which all conjugates coincide as one operation: x ∗ y = x / y = x \ y. Another way to define (the same notion of) totally symmetric quasigroup is as a semisymmetric quasigroup that is commutative, i.e. x ∗ y = y ∗ x.
Idempotent total symmetric quasigroups are precisely (i.e. in a bijection with) Steiner triples, so such a quasigroup is also called a Steiner quasigroup, and sometimes the latter is even abbreviated as squag. The term sloop refers to an analogue for loops, namely, totally symmetric loops that satisfy x ∗ x = 1 instead of x ∗ x = x. Without idempotency, total symmetric quasigroups correspond to the geometric notion of extended Steiner triple, also called Generalized Elliptic Cubic Curve (GECC).
= Total antisymmetry
=A quasigroup (Q, ∗) is called weakly totally anti-symmetric if for all c, x, y ∈ Q, the following implication holds.
(c ∗ x) ∗ y = (c ∗ y) ∗ x implies that x = y.
A quasigroup (Q, ∗) is called totally anti-symmetric if, in addition, for all x, y ∈ Q, the following implication holds:
x ∗ y = y ∗ x implies that x = y.
This property is required, for example, in the Damm algorithm.
Examples
Every group is a loop, because a ∗ x = b if and only if x = a−1 ∗ b, and y ∗ a = b if and only if y = b ∗ a−1.
The integers Z (or the rationals Q or the reals R) with subtraction (−) form a quasigroup. These quasigroups are not loops because there is no identity element (0 is a right identity because a − 0 = a, but not a left identity because, in general, 0 − a ≠ a).
The nonzero rationals Q× (or the nonzero reals R×) with division (÷) form a quasigroup.
Any vector space over a field of characteristic not equal to 2 forms an idempotent, commutative quasigroup under the operation x ∗ y = (x + y) / 2.
Every Steiner triple system defines an idempotent, commutative quasigroup: a ∗ b is the third element of the triple containing a and b. These quasigroups also satisfy (x ∗ y) ∗ y = x for all x and y in the quasigroup. These quasigroups are known as Steiner quasigroups.
The set {±1, ±i, ±j, ±k} where ii = jj = kk = +1 and with all other products as in the quaternion group forms a nonassociative loop of order 8. See hyperbolic quaternions for its application. (The hyperbolic quaternions themselves do not form a loop or quasigroup.)
The nonzero octonions form a nonassociative loop under multiplication. The octonions are a special type of loop known as a Moufang loop.
An associative quasigroup is either empty or is a group, since if there is at least one element, the invertibility of the quasigroup binary operation combined with associativity implies the existence of an identity element, which then implies the existence of inverse elements, thus satisfying all three requirements of a group.
The following construction is due to Hans Zassenhaus. On the underlying set of the four-dimensional vector space F4 over the 3-element Galois field F = Z/3Z define
(x1, x2, x3, x4) ∗ (y1, y2, y3, y4) = (x1, x2, x3, x4) + (y1, y2, y3, y4) + (0, 0, 0, (x3 − y3)(x1y2 − x2y1)).
Then, (F4, ∗) 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.
Properties
In the remainder of the article we shall denote quasigroup multiplication simply by juxtaposition.
Quasigroups have the cancellation property: if ab = ac, then b = c. This follows from the uniqueness of left division of ab or ac by a. Similarly, if ba = ca, then b = c.
The Latin square property of quasigroups implies that, given any two of the three variables in xy = z, the third variable is uniquely determined.
= Multiplication operators
=The definition of a quasigroup can be treated as conditions on the left and right multiplication operators Lx, Rx : Q → Q, defined by
L
x
(
y
)
=
x
y
R
x
(
y
)
=
y
x
{\displaystyle {\begin{aligned}L_{x}(y)&=xy\\R_{x}(y)&=yx\\\end{aligned}}}
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,
L
x
−
1
(
y
)
=
x
∖
y
R
x
−
1
(
y
)
=
y
/
x
{\displaystyle {\begin{aligned}L_{x}^{-1}(y)&=x\backslash y\\R_{x}^{-1}(y)&=y/x\end{aligned}}}
In this notation the identities among the quasigroup's multiplication and division operations (stated in the section on universal algebra) are
L
x
L
x
−
1
=
i
d
corresponding to
x
(
x
∖
y
)
=
y
L
x
−
1
L
x
=
i
d
corresponding to
x
∖
(
x
y
)
=
y
R
x
R
x
−
1
=
i
d
corresponding to
(
y
/
x
)
x
=
y
R
x
−
1
R
x
=
i
d
corresponding to
(
y
x
)
/
x
=
y
{\displaystyle {\begin{aligned}L_{x}L_{x}^{-1}&=\mathrm {id} \qquad &{\text{corresponding to}}\qquad x(x\backslash y)&=y\\L_{x}^{-1}L_{x}&=\mathrm {id} \qquad &{\text{corresponding to}}\qquad x\backslash (xy)&=y\\R_{x}R_{x}^{-1}&=\mathrm {id} \qquad &{\text{corresponding to}}\qquad (y/x)x&=y\\R_{x}^{-1}R_{x}&=\mathrm {id} \qquad &{\text{corresponding to}}\qquad (yx)/x&=y\end{aligned}}}
where id denotes the identity mapping on Q.
= Latin squares
=The multiplication table of a finite quasigroup is a Latin square: an n × n 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.
Infinite quasigroups
For a countably infinite quasigroup Q, it is possible to imagine an infinite array in which every row and every column corresponds to some element q of Q, and where the element a ∗ b is in the row corresponding to a and the column responding to b. In this situation too, the Latin square property says that each row and each column of the infinite array will contain every possible value precisely once.
For an uncountably infinite quasigroup, such as the group of non-zero real numbers under multiplication, the Latin square property still holds, although the name is somewhat unsatisfactory, as it is not possible to produce the array of combinations to which the above idea of an infinite array extends since the real numbers cannot all be written in a sequence. (This is somewhat misleading however, as the reals can be written in a sequence of length
c
{\displaystyle {\mathfrak {c}}}
, assuming the well-ordering theorem.)
= Inverse properties
=The binary operation of a quasigroup is invertible in the sense that both
L
x
{\displaystyle L_{x}}
and
R
x
{\displaystyle R_{x}}
, the left and right multiplication operators, are bijective, and hence invertible.
Every loop element has a unique left and right inverse given by
x
λ
=
e
/
x
x
λ
x
=
e
{\displaystyle x^{\lambda }=e/x\qquad x^{\lambda }x=e}
x
ρ
=
x
∖
e
x
x
ρ
=
e
{\displaystyle x^{\rho }=x\backslash e\qquad xx^{\rho }=e}
A loop is said to have (two-sided) inverses if
x
λ
=
x
ρ
{\displaystyle x^{\lambda }=x^{\rho }}
for all x. In this case the inverse element is usually denoted by
x
−
1
{\displaystyle x^{-1}}
.
There are some stronger notions of inverses in loops that are often useful:
A loop has the left inverse property if
x
λ
(
x
y
)
=
y
{\displaystyle x^{\lambda }(xy)=y}
for all
x
{\displaystyle x}
and
y
{\displaystyle y}
. Equivalently,
L
x
−
1
=
L
x
λ
{\displaystyle L_{x}^{-1}=L_{x^{\lambda }}}
or
x
∖
y
=
x
λ
y
{\displaystyle x\backslash y=x^{\lambda }y}
.
A loop has the right inverse property if
(
y
x
)
x
ρ
=
y
{\displaystyle (yx)x^{\rho }=y}
for all
x
{\displaystyle x}
and
y
{\displaystyle y}
. Equivalently,
R
x
−
1
=
R
x
ρ
{\displaystyle R_{x}^{-1}=R_{x^{\rho }}}
or
y
/
x
=
y
x
ρ
{\displaystyle y/x=yx^{\rho }}
.
A loop has the antiautomorphic inverse property if
(
x
y
)
λ
=
y
λ
x
λ
{\displaystyle (xy)^{\lambda }=y^{\lambda }x^{\lambda }}
or, equivalently, if
(
x
y
)
ρ
=
y
ρ
x
ρ
{\displaystyle (xy)^{\rho }=y^{\rho }x^{\rho }}
.
A loop has the weak inverse property when
(
x
y
)
z
=
e
{\displaystyle (xy)z=e}
if and only if
x
(
y
z
)
=
e
{\displaystyle x(yz)=e}
. This may be stated in terms of inverses via
(
x
y
)
λ
x
=
y
λ
{\displaystyle (xy)^{\lambda }x=y^{\lambda }}
or equivalently
x
(
y
x
)
ρ
=
y
ρ
{\displaystyle x(yx)^{\rho }=y^{\rho }}
.
A loop has the inverse property if it has both the left and right inverse properties. Inverse property loops also have the antiautomorphic and weak inverse properties. In fact, any loop that satisfies any two of the above four identities has the inverse property and therefore satisfies all four.
Any loop that satisfies the left, right, or antiautomorphic inverse properties automatically has two-sided inverses.
Morphisms
A quasigroup or loop homomorphism is a map f : Q → P between two quasigroups such that f(xy) = f(x)f(y). Quasigroup homomorphisms necessarily preserve left and right division, as well as identity elements (if they exist).
= Homotopy and isotopy
=Let Q and P be quasigroups. A quasigroup homotopy from Q to P is a triple (α, β, γ) of maps from Q to P such that
α
(
x
)
β
(
y
)
=
γ
(
x
y
)
{\displaystyle \alpha (x)\beta (y)=\gamma (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 (x, y) ↦ (x + y)/2 is isotopic to the additive group (R, +), 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.
= Conjugation (parastrophe)
=Left and right division are examples of forming a quasigroup by permuting the variables in the defining equation. From the original operation ∗ (i.e., x ∗ y = z) we can form five new operations: x o y := y ∗ x (the opposite operation), / and \, and their opposites. That makes a total of six quasigroup operations, which are called the conjugates or parastrophes of ∗. Any two of these operations are said to be "conjugate" or "parastrophic" to each other (and to themselves).
= Isostrophe (paratopy)
=If the set Q has two quasigroup operations, ∗ and ·, and one of them is isotopic to a conjugate of the other, the operations are said to be isostrophic to each other. There are also many other names for this relation of "isostrophe", e.g., paratopy.
Generalizations
= Polyadic or multiary quasigroups
=An n-ary quasigroup is a set with an n-ary operation, (Q, f) with f : Qn → Q, such that the equation f(x1,...,xn) = y has a unique solution for any one variable if all the other n variables are specified arbitrarily. Polyadic or multiary means n-ary for some nonnegative integer n.
A 0-ary, or nullary, quasigroup is just a constant element of Q. A 1-ary, or unary, quasigroup is a bijection of Q to itself. A binary, or 2-ary, quasigroup is an ordinary quasigroup.
An example of a multiary quasigroup is an iterated group operation, y = x1 · x2 · ··· · xn; it is not necessary to use parentheses to specify the order of operations because the group is associative. One can also form a multiary quasigroup by carrying out any sequence of the same or different group or quasigroup operations, if the order of operations is specified.
There exist multiary quasigroups that cannot be represented in any of these ways. An n-ary quasigroup is irreducible if its operation cannot be factored into the composition of two operations in the following way:
f
(
x
1
,
…
,
x
n
)
=
g
(
x
1
,
…
,
x
i
−
1
,
h
(
x
i
,
…
,
x
j
)
,
x
j
+
1
,
…
,
x
n
)
,
{\displaystyle f(x_{1},\dots ,x_{n})=g(x_{1},\dots ,x_{i-1},\,h(x_{i},\dots ,x_{j}),\,x_{j+1},\dots ,x_{n}),}
where 1 ≤ i < j ≤ n and (i, j) ≠ (1, n). Finite irreducible n-ary quasigroups exist for all n > 2; see Akivis and Goldberg (2001) for details.
An n-ary quasigroup with an n-ary version of associativity is called an n-ary group.
Number of small quasigroups and loops
The number of isomorphism classes of small quasigroups (sequence A057991 in the OEIS) and loops (sequence A057771 in the OEIS) is given here:
See also
Division ring – a ring in which every non-zero element has a multiplicative inverse
Semigroup – an algebraic structure consisting of a set together with an associative binary operation
Monoid – a semigroup with an identity element
Planar ternary ring – has an additive and multiplicative loop structure
Problems in loop theory and quasigroup theory
Mathematics of Sudoku
Notes
References
= Citations
== Sources
=External links
quasigroups
"Quasi-group", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
Kata Kunci Pencarian:
- Kuasigrup
- Quasigroup
- CH-quasigroup
- Magma (algebra)
- Small Latin squares and quasigroups
- List of problems in loop theory and quasigroup theory
- Semigroup
- Associator
- Damm algorithm
- Loop (topology)
- Cancellation property
