an associative quasigroup is a group
Proposition 1.
Let G be a set and ⋅ a binary operation on G. Write ab for a⋅b. The following are equivalent
:
-
1.
(G,⋅) is an associative quasigroup
.
-
2.
(G,⋅) is an associative loop.
-
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 xe1=x=e2x. So xe21=xe1=x, which shows that e21=e1. Let a∈G be such that e1a=x. Then e2e1a=e2x=x=e1a, so that e2e1=e1=e21, or e2=e1. Set e=e1. For any y∈G, we have ey=e2y, so y=ey. Similarly, ye=ye2 implies y=ye. This shows that e is an identity
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 xy=zx=e. Then y=ey=(zx)y=z(xy)=ze=z. This shows that x has a unique two-sided inverse
x-1:=. Therefore, is a group under .
- .
-
Every group is clearly a quasigroup, and the binary operation is associative.
This completes the proof.
∎
Remark. In fact, if on is flexible, then every element in has a unique inverse: for , so by left division (by ), we get , and therefore , again by left division (by ). However, 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 |