Left-associative elements of loop form subgroup: Difference between revisions

From Groupprops
 
(One intermediate revision by the same user not shown)
Line 27: Line 27:
| 2 || For any <math>a \in S</math>, there is a right inverse of <math>a</math> in <math>L</math>, i.e., an element <math>b \in L</math> such that <math>a * b = e</math>. || || <math>L</math> is a loop || ||  
| 2 || For any <math>a \in S</math>, there is a right inverse of <math>a</math> in <math>L</math>, i.e., an element <math>b \in L</math> such that <math>a * b = e</math>. || || <math>L</math> is a loop || ||  
|-
|-
| 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) || Using left-associativity of <math>a</math>, we get:<math>a * ((b * c) * d) = (a * (b * c)) * d = ((a * b) * c) * d) = (e * c) * d = c * d</math><br>Similarly, <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 with identity element <math>e</math> 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

Latest revision as of 20:17, 20 June 2012

Statement

Suppose (L,*) is a loop. Then, the left nucleus of L, i.e., the set of left-associative elements of L, is nonempty and forms a subgroup of L. This subgroup is sometimes termed the left kernel of L or the left-associative center of L.

Related facts

Facts used

  1. 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.
  2. Monoid where every element is right-invertible equals group, which in turn uses equality of left and right inverses in monoid

Proof

Given: A loop (L,*) with identity element e. S is the set of left-associative elements of L.

To prove: S is a subgroup of L. More explicitly, (S,*) is a group with identity element e.

Proof:

Step no. Assertion/construction Facts used Given data used Previous steps used Explanation
1 (S,*) is a monoid with identity element e. Fact (1) (L,*) has identity element e Follows directly from Fact (1).
2 For any aS, there is a right inverse of a in L, i.e., an element bL such that a*b=e. L is a loop
3 For any aS, the right inverse b constructed in Step (2) is in S. In other words, for any c,dS, we have (b*c)*d=b*(c*d). L is a loop, so any equation a*x=z has a unique solution for x. Step (2) Using left-associativity of a, we get:a*((b*c)*d)=(a*(b*c))*d=((a*b)*c)*d)=(e*c)*d=c*d
Similarly, a*(b*(c*d))=(a*b)*(c*d)=e*(c*d)=c*d
Thus, we get: a*(b*(c*d))=a*((b*c)*d)=c*d.
Since the equation a*x=c*d has a unique solution, we get that b*(c*d)=(b*c)*d.
4 (S,*) is a monoid with identity element e in which every element has a right inverse. Steps (1), (3) Step-combination direct
5 (S,*) is a group with identity element e, completing the proof. Fact (2) Step (4) Step-fact combination direct.