The reader should be aware that although loops are quasigroups, it is often the case in the literature that a property named P can differ for quasigroups and loops. For instance, a Steiner loop is not necessarily a Steiner quasigroup.
To avoid such ambivalences, we often include the noun Loop
or Quasigroup
as
part of the name of the property, e.g. IsSteinerQuasigroup
versus
IsSteinerLoop
.
On the other hand, some properties coincide for quasigroups and loops and we
therefore do not include Loop
, Quasigroup
as part of the name of the
property, e.g. IsCommutative
.
The following properties test if a quasigroup Q is associative and commutative:
IsAssociative(
Q ) P
IsCommutative(
Q ) P
A loop L is said to be power-associative (resp. diassociative) if every monogenic subloop of L (resp. every 2-generated subloop of L) is a group.
IsPowerAssociative(
L ) P
IsDiassociative(
L ) P
A loop L has the left inverse property if xl(xy)=y for every x, y Î L, where xl is the left inverse of x. Dually, L has the right inverse property if (yx)xr=y for every x, y Î L, where xr is the right inverse of x. If L has both the left and right inverse properties, it has the inverse property. We say that L has two-sided inverses if xl=xr for every x Î L.
HasLeftInverseProperty(
L ) P
HasRightInverseProperty(
L ) P
HasInverseProperty(
L ) P
HasTwosidedInverses(
L ) P
A loop has the weak inverse property if (xy)l x = yl. Equivalently, a loop has the weak inverse property if x(yx)r = yr.
HasWeakInverseProperty(
L ) P
According to Ar, a loop L has the automorphic inverse property if (xy)l = xl yl, or, equivalently, (xy)r = xr yr. (In particular, when L has two-sided inverses and the automorphic inverse property, it satisfies (xy)-1=x-1y-1.) Similarly, L has the antiautomorphic inverse property if (xy)l=yl xl, or, equivalently, (xy)r = yr xr.
HasAutomorphicInverseProperty(
L ) P
HasAntiautomorphicInverseProperty(
L ) P
The following implications among inverse properties hold and are implemented in LOOPS:
A quasigroup Q is semisymmetric if (xy)x=y for every x, y Î Q. Equivalently, Q is semisymmetric if x(yx)=y for every x, y Î Q. A semisymmetric commutative quasigroup is known as totally symmetric. Totally symmetric quasigroups are precisely quasigroups satisfying xy=x\y = x/y.
IsSemisymmetric(
Q ) P
IsTotallySymmetric(
Q ) P
A quasigroup Q is idempotent if x2=x for every x Î Q. Idempotent totally symmetric quasigroups are known as Steiner quasigroups. A quasigroup Q is unipotent if x2=y2 for every x, y Î Q.
IsIdempotent(
Q ) P
IsSteinerQuasigroup(
Q ) P
IsUnipotent(
Q ) P
A quasigroup is left distributive if it satisfies x(yz)=(xy)(xz). Similarly, it is right distributive if it satisfies (xy)z=(xz)(yz). A distributive quasigroup is a quasigroup that is both left and right distributive. A quasigroup is called entropic or medial if it satisfies (xy)(zw)=(xz)(yw).
IsLeftDistributive(
Q ) P
IsRightDistributive(
Q ) P
IsDistributive(
Q ) P
IsEntropic(
Q ) P
IsMedial(
Q ) P
In order to be compatible with GAP's terminology, we also support the synonyms
IsLDistributive(
Q ) P
IsRDistributive(
Q ) P
for IsLeftDistributive
and IsRightDistributive
respectively.
Following Fe and PhVo, a variety of loops is said to be of Bol-Moufang type if it is defined by a single identity of Bol-Moufang type, i.e., by an identity that:
There are several varieties related to loops of Bol-Moufang type. A loop is said to be alternative if it is both left and right alternative, and nuclear square if it is left, middle and right nuclear square.
Here are the corresponding LOOPS commands (argument L indicates that the property applies only to loops, argument Q indicates that the property applies also to quasigroups):
IsExtraLoop(
L ) P
IsMoufangLoop(
L ) P
IsCLoop(
L ) P
IsLeftBolLoop(
L ) P
IsRightBolLoop(
L ) P
IsLCLoop(
L ) P
IsRCLoop(
L ) P
IsLeftNuclearSquareLoop(
L ) P
IsMiddleNuclearSquareLoop(
L ) P
IsRightNuclearSquareLoop(
L ) P
IsNuclearSquareLoop(
L ) P
IsFlexible(
Q ) P
IsLeftAlternative(
Q ) P
IsRightAlternative(
Q ) P
IsAlternative(
Q ) P
While listing the varieties of loops of Bol-Moufang type, we have also listed all inclusions among them. These inclusions are built into LOOPS.
The following trivial example shows some of the implications and the naming conventions of LOOPS at work:
gap> L := LoopByCayleyTable( [ [ 1, 2 ], [ 2, 1 ] ] ); <loop of order 2> gap> [ IsLeftBolLoop( L ), L ] [ true, <left Bol loop of order 2> ] gap> [ HasIsLeftAlternativeLoop( L ), IsLeftAlternativeLoop( L ) ]; [ true, true ] gap> [ HasIsRightBolLoop( L ), IsRightBolLoop( L ) ]; [ false, true ] gap> L; <Moufang loop of order 2> gap> [ IsAssociative( L ), L ]; [ true, <associative loop of order 2> ]
The analogous terminology for quasigroups of Bol-Moufang type is not standard yet, and hence is not supported in LOOPS.
A loop is left power alternative if it is power associative and xn(xm y) = xn+my for every x, y and all integers n, m. Similarly, a loop is right power alternative if it is power associative and (xyn)ym = xyn+m for all x, y and all integers n, m. A loop that is both left and right power alternative is said to be power alternative.
Left power alternative loops are left alternative and have the left inverse property. Left Bol loops and LC-loops are left power alternative.
IsLeftPowerAlternative(
L ) P
IsRightPowerAlternative(
L ) P
IsPowerAlternative(
L ) P
A loop is left (resp. right) conjugacy closed if its left (resp. right) translations are closed under conjugation. A loop that is both left and right conjugacy closed is called conjugacy closed. It is common to refer to these loops as LCC-, RCC-, CC-loops, respectively.
IsLCCLoop(
L ) P
IsRCCLoop(
L ) P
IsCCLoop(
L ) P
The equivalence LCC + RCC = CC is built into LOOPS.
A loop is Osborn if it satisfies x(yz· x)=(xl\y)(zx), where xl is the left inverse of x. Both Moufang loops and CC-loops are Osborn.
IsOsbornLoop(
L ) P
An (even) code loop is a Moufang 2-loop with Frattini subloop of order 1 or 2. Code loops are extra and conjugacy closed.
IsCodeLoop(
L ) P
Steiner loop is an inverse property loop of exponent 2. Steiner loops are commutative.
IsSteinerLoop(
L ) P
A left (resp. right) Bol loop with the automorphic inverse property is known as left (resp. right) Bruck loop. Bruck loops are also known as K-loops.
IsLeftBruckLoop(
L ) P
IsLeftKLoop(
L ) P
IsRightBruckLoop(
L ) P
IsRightKLoop(
L ) P
A loop whose all left (resp. middle, right) inner mappings are automorphisms is called a left (resp. middle, right) A-loop. A loop whose every inner mapping is an automorphism is known as an A-loop. Diassociative A-loops are Moufang by KiKuPh. See the built-in filters for additional properties of A-loops.
IsLeftALoop(
L ) P
IsMiddleALoop(
L ) P
IsRightALoop(
L ) P
IsALoop(
L ) P
Do not confuse IsALoop
and IsLoop
.
[Up] [Previous] [Next] [Index]
loops manual