Left-associative elements of loop form subgroup: Difference between revisions
No edit summary |
|||
| Line 1: | Line 1: | ||
==Statement== | ==Statement== | ||
Suppose <math>(L,*)</math> is | Suppose <math>(L,*)</math> is a [[loop]]. Then, the [[fact about::left nucleus;1| ]][[left nucleus]] of <math>L</math>, i.e., the set of left-associative elements of <math>L</math>, is nonempty and forms a subgroup of <math>L</math>. This subgroup is sometimes termed the '''left kernel''' of <math>L</math> or the '''left-associative center''' of <math>L</math>. | ||
==Related facts== | ==Related facts== | ||
Revision as of 19:54, 20 June 2012
Statement
Suppose is a loop. Then, the left nucleus of , i.e., the set of left-associative elements of , is nonempty and forms a subgroup of . This subgroup is sometimes termed the left kernel of or the left-associative center of .
Related facts
Facts used
Proof
Given: An algebra loop with identity element . is the set of left-associative elements of .
To prove: is a subgroup of .
Proof: By fact (1), is closed under . Also, is clearly in . Since all elements of are left-associative, itself satisfies associativity, so is a submonoid of .
We now show that if , and is the right inverse of in , then . For any , we have:
.
Similarly, we have:
.
Thus, we get:
.
Since the equation has a unique solution, we get that:
.
Thus, is left-associative.
Thus, the right inverse of every element in is in . Thus, is a monoid in which every element has a right inverse. We now want to show that every element has a two-sided inverse.
Suppose with right inverse . has right inverse . Then, by associativity in , . Thus, and are two-sided inverses of each other, completing the proof.