Left-associative elements of loop form subgroup: Difference between revisions
No edit summary |
(→Proof) |
||
| Line 16: | Line 16: | ||
'''Given''': A loop <math>(L,*)</math> with identity element <math>e</math>. <math>S</math> is the set of left-associative elements of <math>L</math>. | '''Given''': A loop <math>(L,*)</math> with identity element <math>e</math>. <math>S</math> is the set of left-associative elements of <math>L</math>. | ||
'''To prove''': <math>S</math> is a subgroup 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''': | '''Proof''': | ||
| Line 29: | Line 29: | ||
| 3 || For any <math>a \in S</math>, the right 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>(b * c) *d = b * (c * d)</math>. || || <math>L</math> is a loop, so any equation <math>a * x = z</math> has a unique solution for <math>x</math>. || Step (2) || We have:<math>a * ((b * c) * d) = (a * (b * c)) * d = ((a * b) * c) * d) = (e * c) * d = c * d</math>.<br><math>a * (b * (c * d)) = (a * b) * (c * d) = e * (c * d) = c * d</math><br>Thus, we get: <math>a * (b * (c * d)) = a * ((b * c) * d) = c * d</math>.<br>Since the equation <math>a * x = c * d</math> has a unique solution, we get that <math>b * (c * d) = (b * c) * d</math>. | | 3 || For any <math>a \in S</math>, the right 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>(b * c) *d = b * (c * d)</math>. || || <math>L</math> is a loop, so any equation <math>a * x = z</math> has a unique solution for <math>x</math>. || Step (2) || We have:<math>a * ((b * c) * d) = (a * (b * c)) * d = ((a * b) * c) * d) = (e * c) * d = c * d</math>.<br><math>a * (b * (c * d)) = (a * b) * (c * d) = e * (c * d) = c * d</math><br>Thus, we get: <math>a * (b * (c * d)) = a * ((b * c) * d) = c * d</math>.<br>Since the equation <math>a * x = c * d</math> has a unique solution, we get that <math>b * (c * d) = (b * c) * d</math>. | ||
|- | |- | ||
| 4 || <math>(S,*)</math> is a monoid in which every element has a right inverse. || || || Steps (1), (3) || Step-combination direct | | 4 || <math>(S,*)</math> is a monoid with identity element <math>e</math> in which every element has a right inverse. || || || Steps (1), (3) || Step-combination direct | ||
|- | |- | ||
| 5 || <math>(S,*)</math> is a group, completing the proof. || Fact (2) || || Step (4) || Step-fact 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. | ||
|} | |} | ||
Revision as of 20:08, 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
- Left-associative elements of magma form submagma: Further, this submagma is a subsemigroup, and if the whole magma has a neutral element, it has the same neutral element and becomes a monoid.
- Monoid where every element is right-invertible implies group
Proof
Given: A loop with identity element . is the set of left-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 right inverse of in , i.e., an element such that . | is a loop | |||
| 3 | For any , the right 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) | We have:. Thus, we get: . Since the equation has a unique solution, we get that . | |
| 4 | is a monoid with identity element in which every element has a right 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. |