Right-associative elements of loop form subgroup: Difference between revisions
(Created page with '==Statement== Suppose <math>(L,*)</math> is an algebra loop. Then, the set of right-associative elements of <math>L</math> is nonempty and forms a subgroup of <math>L</math>...') |
No edit summary |
||
(2 intermediate revisions by the same user not shown) | |||
Line 2: | Line 2: | ||
Suppose <math>(L,*)</math> is an [[algebra loop]]. Then, the set of right-associative elements of <math>L</math> is nonempty and forms a subgroup of <math>L</math>. This subgroup is termed the '''right kernel''' of <math>L</math> or the '''right-associative center''' of <math>L</math>. | Suppose <math>(L,*)</math> is an [[algebra loop]]. Then, the set of right-associative elements of <math>L</math> is nonempty and forms a subgroup of <math>L</math>. This subgroup is termed the '''right kernel''' of <math>L</math> or the '''right-associative center''' of <math>L</math>. | ||
==Definitions used== | |||
===Right-associative element=== | |||
An element <math>c \in L</math> is termed '''right-associative''' if, for all <math>a,b \in L</math>, we have: | |||
<math>(a * b) * c = a * (b * c)</math>. | |||
==Related facts== | |||
* [[Left-associative elements of loop form subgroup]]: Note that the proofs are identical and the facts can be deduced from each other using the [[opposite magma]] construction. | |||
==Facts used== | |||
# [[uses::Right-associative elements of magma form submagma]] | |||
# [[uses::Monoid where every element is left-invertible equals group]] | |||
==Proof== | |||
'''Given''': A loop <math>(L,*)</math> with identity element <math>e</math>. <math>S</math> is the set of right-associative elements of <math>L</math>. | |||
'''To prove''': <math>S</math> is a subgroup of <math>L</math>. More explicitly, <math>(S,*)</math> is a [[group]] with identity element <math>e</math>. | |||
'''Proof''': | |||
{| class="sortable" border="1" | |||
! Step no. !! Assertion/construction !! Facts used !! Given data used !! Previous steps used !! Explanation | |||
|- | |||
| 1 || <math>(S,*)</math> is a monoid with identity element <math>e</math>. || Fact (1) || <math>(L,*)</math> has identity element <math>e</math> || || Follows directly from Fact (1). | |||
|- | |||
| 2 || For any <math>a \in S</math>, there is a left inverse of <math>a</math> in <math>L</math>, i.e., an element <math>b \in L</math> such that <math>b * a = e</math>. || || <math>L</math> is a loop || || | |||
|- | |||
| 3 || For any <math>a \in S</math>, the left inverse <math>b</math> constructed in Step (2) is in <math>S</math>. In other words, for any <math>c,d \in S</math>, we have <math>(c * d) * b = c * (d * b)</math>. || || <math>L</math> is a loop, so any equation <math>x * a = z</math> has a unique solution for <math>x</math>. || Step (2) || Using right-associativity of <math>a</math>, we get:<br><math>((c * d) * b) * a = (c * d) * (b * a) = (c * d) * e = c * d</math>.<br>Similarly, <math>(c * (d * b)) * a = c * ((d * b) * a) = c * (d * (b * a)) = c * (d * e) = c * d</math>.<br>Thus, <math>((c * d) * b) * a = (c * (d * b)) * a = c * d</math>.<br>Thus, both <math>(c * d) * b</math> and <math>c * (d * b)</math> are solutions for <math>x</math> to <math>x * a = c * d</math>, hence they are equal. | |||
|- | |||
| 4 || <math>(S,*)</math> is a monoid with identity element <math>e</math> in which every element has a left inverse. || || || Steps (1), (3) || Step-combination direct | |||
|- | |||
| 5 || <math>(S,*)</math> is a group with identity element <math>e</math>, completing the proof. || Fact (2) || || Step (4) || Step-fact combination direct. | |||
|} |
Latest revision as of 20:16, 20 June 2012
Statement
Suppose is an algebra loop. Then, the set of right-associative elements of is nonempty and forms a subgroup of . This subgroup is termed the right kernel of or the right-associative center of .
Definitions used
Right-associative element
An element is termed right-associative if, for all , we have:
.
Related facts
- Left-associative elements of loop form subgroup: Note that the proofs are identical and the facts can be deduced from each other using the opposite magma construction.
Facts used
- Right-associative elements of magma form submagma
- Monoid where every element is left-invertible equals group
Proof
Given: A loop with identity element . is the set of right-associative elements of .
To prove: is a subgroup of . More explicitly, is a group with identity element .
Proof:
Step no. | Assertion/construction | Facts used | Given data used | Previous steps used | Explanation |
---|---|---|---|---|---|
1 | is a monoid with identity element . | Fact (1) | has identity element | Follows directly from Fact (1). | |
2 | For any , there is a left inverse of in , i.e., an element such that . | is a loop | |||
3 | For any , the left inverse constructed in Step (2) is in . In other words, for any , we have . | is a loop, so any equation has a unique solution for . | Step (2) | Using right-associativity of , we get: . Similarly, . Thus, . Thus, both and are solutions for to , hence they are equal. | |
4 | is a monoid with identity element in which every element has a left inverse. | Steps (1), (3) | Step-combination direct | ||
5 | is a group with identity element , completing the proof. | Fact (2) | Step (4) | Step-fact combination direct. |