Lemma 1: Let A be a magma. If there is a left identity in A and a right identity in A it follows that .

Is there an identity in A, it is uniquely determined.

Proof: . The first identity holds because is a left identity, the right because is a right identity. It follows specially: If is an identity, it is uniquely determined: Let be another identity, then it is because is particularly a left identity and a right identity.

Lemma 2: Let A be a semigroup. If is a neutral element and every element has a left inverse it follows that every element has a right inverse.

Proof: Let . By condition it exists . Again by condition it exists . It follows

So we did not only show that there exists a right inverse, but also that left and right inverse are equal.

Exercise: Show that an inverse of an element in a semigroup A is uniquely determined.

Interesting sidenote: While the proof of Lemma 2 only needs that has the property of an left identity the proof of the exercise needs both properties of : that it is left and right identity. That said I should mention that in the definition of an inverse or a left inverse we expect to be a two-sided identity.

The proofs of both lemmas are straight forward. The first proof is much easier. The idea of it is to take the universal statement and substitute the special for a. Analogous with the other side. So how do we find the proof by ourselves? In this case it is simple:

There is simply no other way. The conditions only bring two universal statements and two special elements into play. We just have to substitute the special elements.

Contrary, the proof of Lemma 2, seems to fall from heaven. In the first place, it is not at all clear, that the left inverse is the searched right inverse. Then, in the proof we insert arbitrarily an identity (by the way we have 3 places to do so) and everything works fine.

I claim that the fundamental point is associativity. It allows us to use the symmetry between left- and right inverse: is left inverse to a and on the other side right inverse to .

Let us assume we dont know the proof. We want to show that there exists an element such that and let us assume we dont know that the we are searching for equals . What could we do? How do we find the “right” (assuming such one exists)?

Well, first we always look at the conditions. They tell us that there exists an such that . Now we got a new player and can substitute him. The problem is: Even if we substitute the “right” we cannot immediately deduce that . We only know that . Commutativity is not assumed. We can only continue to play on around:

also has an left inverse, lets call it . We get . What did we gain? On the right side “a” doesnt even show up anymore. Let us put everything into one line:

Still no idea. Let us meditate a bit over this line. Shortly before we fall asleep the right equal sign begins to fade away and the two `s become one. Mentioning that we still didnt use associativity, we see that .

The left inverse of the left inverse equals our original element. We went twice to the left and returned to the origin. Substituing back for in () we’ve got

I propose the following experiment: Find some first year undergraduate and let her/him try to proof Lemma 1 and Lemma 2 by her/himself. Do she/he finds the proofs and how? Even people who dont study maths and are told the basic definitions will find the proof of Lemma 1. I would be curious about the ways people handle Lemma 2.

Looking back at my way of finding the proof or better to say the essence of Lemma 2, it seems to me like nonsense – we just found the proof by playing around. How would you reveal the proof, what hints would you give to an undergraduate student so that she/he will find the proof?

## Leave a Reply