# Quasi-group

A set with a binary operation (usually called multiplication) in which each of the equations and has a unique solution, for any elements of the set. A quasi-group with a unit is called a loop.

A quasi-group is a natural generalization of the concept of a group. Quasi-groups arise in various areas of mathematics, for example in the theory of projective planes, non-associative division rings, in a number of questions in combinatorial analysis, etc. The term "quasi-group" was introduced by R. Moufang; it was after her work on non-Desarguesian planes (1935), in which she elucidated the connection of such planes with quasi-groups, that the development of the theory of quasi-groups properly began.

## Basic concepts.

The mappings and are called right and left translations (or displacements) by the element . In a quasi-group, translations are permutations of the underlying set (cf. Permutation of a set). The subgroup of the group of permutations of the set generated by all translations of the quasi-group is called the group associated with the quasi-group . There is a close relation between the structure of and that of .

A homomorphic image of a quasi-group need not, in general, be a quasi-group, but it is a groupoid with division. Corresponding to homomorphisms of a quasi-group onto a quasi-group are the so-called normal congruences. (A congruence (cf. Congruence (in algebra)) on is normal if each of the relations and implies .) In groups all congruences are normal. A sub-quasi-group is called normal if there exists a normal congruence such that coincides with one of the congruence classes. There exist congruences on quasi-groups in which two or even all congruence classes with respect to are sub-quasi-groups.

Associated with every quasi-group operation on a set are two further operations, called the left and right division operations, and denoted respectively by and . They are defined as follows: and if . By considering all possible permutations of , one can obtain five further quasi-group operations apart from the initial one. Transition from the basic operation to one of the new ones is called parastrophy. Quasi-groups in which all these operations are the same as the basic one are called totally-symmetric or TS-quasi-groups. TS-quasi-groups can also be defined as quasi-groups satisfying the identities and . Idempotent TS-quasi-groups (that is, those satisfying the additional relation ) are called Steiner quasi-groups. They are closely related to Steiner triple systems.

One of the most important concepts in the theory of quasi-groups is that of an isotopy. Two quasi-groups and are isotopic if there exist three bijections such that for all . The number of non-isotopic quasi-groups that can be defined on a finite set of cardinality is known (1978) only for .

## Basic classes of quasi-groups.

The earliest papers on quasi-groups are related to generalizations of groups in which the requirement of associativity is replaced by weaker conditions, now called the "A" and "B" Sushkevich postulates. A quasi-group satisfies the "A" Sushkevich postulate if the solution of the equation depends only on and , and the "B" postulate if the solution depends only on . It has been proved that the quasi-groups of these classes are isotopic to groups. In case the solution of such an equation depends on and , the quasi-group is called a left -quasi-group. A right -quasi-group is similarly defined via the equation . A quasi-group that is both a left and a right -quasi-group is called an -quasi-group. An idempotent -quasi-group is called a distributive quasi-group and can be defined by the identities:

called the distributive identities. It has been proved that distributive quasi-groups are isotopic to Moufang loops (see Loop). Not all quasi-groups are isotopic to groups. A quasi-group is medial if the following identity holds:

Every medial quasi-group is isotopic to an Abelian group and the isotopy has the form

where are commuting automorphisms of the group and is some element of (Toyoda's theorem).

## Systems of quasi-groups and functional equations.

Suppose that a system of quasi-groups is defined on a set . In this case the operations are more conveniently denoted by letters: e.g., instead of one writes . The quasi-group operations on are assumed to be related in some way, most often by identities, called in this case "functional equations" . One can usually solve the problem of finding a system of quasi-groups on satisfying given functional equations. For example, the equation of general associativity

 (1)

has been solved; namely, it has proved that if four quasi-groups satisfy (1), then they are isotopic to one and the same group , and the general solution is given by the equalities:

where are arbitrary permutations of . The equation of general mediality is similarly solved:

Here all six quasi-groups turn out to be isotopic to one and the same Abelian group.

## -quasi-groups.

A set with an -ary operation is called an -quasi-group if each of the equations

(where , ) has a unique solution. The basic concepts (isotopy, parastrophy, etc.) of the theory of quasi-groups carry over to -quasi-groups. Each -quasi-group is isotopic to a certain -loop (see Loop).

Certain classes of ordinary binary quasi-groups (such as the classes of medial and TS-quasi-groups, etc.) have an analogue in the -ary case. An -ary operation is reducible if there exist two operations , , of arity at least 2, such that

(written for short). Otherwise is said to be irreducible. An analogue of the theorem on the canonical factorization of positive integers into prime numbers holds for -quasi-groups.

## Combinatorial questions.

The multiplication table of a finite quasi-group, that is, its Cayley table, is known in combinatorics as a Latin square. One of the problems of the combinatorial theory of quasi-groups, finding systems of mutually orthogonal quasi-groups on a given set, is important for the construction of finite projective planes. Two quasi-groups and defined on a set are orthogonal if the system of equations , has a unique solution for any and in . Orthogonality of finite quasi-groups is equivalent to that of their Latin squares. It has been proved that a system of mutually orthogonal quasi-groups defined on a set of elements cannot contain more than quasi-groups.

Another combinatorial concept related to that of a quasi-group is that of a full permutation. A permutation of a quasi-group is said to be full if the mapping is also a permutation of . Not every quasi-group has a full permutation. A quasi-group admitting a full permutation is called admissible. For an admissible group there exists a quasi-group orthogonal to it and conversely: If a group has a quasi-group orthogonal to it, then the group is admissible. If a finite quasi-group of order is admissible, then one can obtain from it a quasi-group of order by a special process (extension).

## Algebraic nets.

Quasi-groups have a natural geometric interpretation by means of algebraic nets, also called algebraic webs (see Webs, geometry of). An algebraic net is a set consisting of elements of two types, lines and points, with a certain incidence relation between them. (Instead of the word "incident" one can use the expression "passes through" or "lies on" .) Let the set of lines of be divided into three classes such that the following axioms hold: 1) two lines of different classes are incident to exactly one common point of ; and 2) each point is incident to exactly one line of each class. Then is called a -net. Similarly, a -net is defined by partitioning into classes. The number (cardinality of the set) of lines in each class is the same and is equal to the number (cardinality of the set) of points of any line of the net. It is called the order of the net. Nets can be coordinatized by means of quasi-groups as follows: Suppose one is given a -net with sets of lines . Let be a set whose cardinality is equal to the order of . Let one-to-one correspondences between and each of the be fixed, that is, to each line in there is given a coordinate in . The set becomes a quasi-group (the coordinate quasi-group of the net) if the following operation is defined on it: if and only if the common point of the line with coordinate in and the line with coordinate in lies on the line with coordinate in . Conversely, each quasi-group is the coordinate quasi-group of some -net. For different one-to-one correspondences between and the one obtains different, but isotopic, quasi-group structures on . Corresponding to each -net in which the order of the classes , and is fixed, is the class of all quasi-groups isotopic to one another. A parastrophy of coordinate quasi-groups corresponds to a renumbering of the classes of the net.

There corresponds to each property of a -net an isotopy-invariant (that is, universal) property of the quasi-group. Examples of such properties are closure conditions (cf. Closure condition), the best known of which are the Thomsen, Reidemeister, Bol, and hexagon closure conditions. The Thomsen condition for a coordinate quasi-group means that the relations and for the elements , of it, imply the relation . The Thomsen condition holds in a quasi-group if and only if the latter is isotopic to an Abelian group. Similar characterizations for a quasi-group are also obtained for the other closure conditions.

-nets are coordinatized by means of mutually orthogonal quasi-groups.

#### References

 [1] V.D. Belousov, "Foundations of the theory of quasi-groups and loops" , Moscow (1967) (In Russian) [2] V.D. Belousov, "Nonassociative binary systems" Progress in Math. , 5 (1969) pp. 57–76 Itogi Nauk. Algebra. Topol. Geom. 1965 (1967) pp. 63–81 [3] R.H. Bruck, "A survey of binary systems" , Springer (1971) [4] R.H. Bruck, "What is a loop" A.A. Albert (ed.) , Studies in Modern Algebra , Studies in math. , 2 , Math. Assoc. Amer. (1962) pp. 59–99 [5] J. Aczél, "Quasigroups, nets and nomograms" Adv. Math. , 1 : 3 (1965) pp. 383–450