an associative quasigroup is a group


Proposition 1.

Let G be a set and ⋅ a binary operationMathworldPlanetmath on G. Write a⁢b for a⋅b. The following are equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmath:

  1. 1.

    (G,⋅) is an associative quasigroupPlanetmathPlanetmath.

  2. 2.

    (G,⋅) is an associative loop.

  3. 3.

    (G,⋅) is a group.

Proof.

We will prove this in the following direction (1)⇒(2)⇒(3)⇒(1).

(1)⇒(2).

Let x∈G, and e1,e2∈G such that x⁢e1=x=e2⁢x. So x⁢e12=x⁢e1=x, which shows that e12=e1. Let a∈G be such that e1⁢a=x. Then e2⁢e1⁢a=e2⁢x=x=e1⁢a, so that e2⁢e1=e1=e12, or e2=e1. Set e=e1. For any y∈G, we have e⁢y=e2⁢y, so y=e⁢y. Similarly, y⁢e=y⁢e2 implies y=y⁢e. This shows that e is an identityPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath of G.

(2)⇒(3).

First note that all of the group axioms are automatically satisfied in G under ⋅, except the existence of an (two-sided) inverse element, which we are going to verify presently. For every x∈G, there are unique elements y and z such that x⁢y=z⁢x=e. Then y=e⁢y=(z⁢x)⁢y=z⁢(x⁢y)=z⁢e=z. This shows that x has a unique two-sided inverseMathworldPlanetmathPlanetmathPlanetmath x-1:=y=z. Therefore, G is a group under ⋅.

(3)⇒(1).

Every group is clearly a quasigroup, and the binary operation is associative.

This completesPlanetmathPlanetmathPlanetmathPlanetmath the proof. ∎

Remark. In fact, if ⋅ on G is flexible, then every element in G has a unique inverse: for z⁢(x⁢z)=(z⁢x)⁢z=e⁢z=z=z⁢e, so by left division (by z), we get x⁢z=e=x⁢y, and therefore z=y, again by left division (by x). However, G may no longer be a group, because associativity may longer hold.

Title an associative quasigroup is a group
Canonical name AnAssociativeQuasigroupIsAGroup
Date of creation 2013-03-22 18:28:50
Last modified on 2013-03-22 18:28:50
Owner CWoo (3771)
Last modified by CWoo (3771)
Numerical id 7
Author CWoo (3771)
Entry type Derivation
Classification msc 20N05
Related topic Group