Answer: Binary operation Problem
Saturday, 19 of January , 2008 at 2:17 pm
Question: Assume that a binary operation
on a set
has a left unit and satisfies the identity
. Prove that
is associative and commutative.
Answer - Proving that
is commutative:
First, let x be equal to the left unit,
. Since the identity
is true
and since
because of the definition of a left unit, therefore
.
Since
, which will mean
and therefore
Because
is a binary operation, therefore
. This means that
. Therefore, we know from the definition of a left unit that
.
This means:
is commutative.
Answer - Proving that
is associative:
Since the identity
is true
, we can rename the variables while maintaining the validity of the identity.
If we use the commutative law (which we just proved), we know that
.
This means
is associative.
Question: Assume that a binary operation
on a set
has a left unit and satisfies the identity
. Prove that
is associative and commutative.
Answer - Proving that
is commutative:
First, let x be equal to the left unit,
. Since the identity
is true
and since
because of the definition of a left unit, therefore
.
Since
, which will mean
and therefore

Because
is a binary operation, therefore
. This means that
. Therefore, we know from the definition of a left unit that
.
This means:

is commutative.
Answer - Proving that
is associative:
Since the identity
is true
, we can rename the variables while maintaining the validity of the identity.

If we use the commutative law (which we just proved), we know that
.

This means
is associative.
No comments yet.





