algebraic structures and binary operations 二項演算 にこうえんざん : basic exercises
1Corresponding lectures
data/lecture/math/abstract-algebra/introduction-to-algebraic-structures.lecture.n.md data/lecture/math/abstract-algebra/binary-operations-and-closure.lecture.n.md data/lecture/math/abstract-algebra/semigroups-monoids-and-groups.lecture.n.mdProblems 1–3 can be attempted after the lecture on binary operations. Attempt Problem 4 after the lecture on semigroups, monoids, and groups.
2Related exercises
data/exercise/math/abstract-algebra/groups-and-subgroups.exercise.n.md data/exercise/math/abstract-algebra/rings-ideals-and-quotient-rings.exercise.n.md3Problem 1: decide whether an operation is binary
Is
3.1Answer
It is not a
and .
3.2Explanation
For a
4Problem 2: find an identity element 単位元 たんいげん
On , consider the operation . Find the
4.1Answer
Let the
Therefore
so . Similarly, also holds, so the
4.2Explanation
An
5Problem 3: find an inverse
For the operation in Problem 2, find the
5.1Answer
Let the inverse be . Since the
That is,
so
Since this operation satisfies , the opposite order also gives .
5.2Explanation
An inverse is defined relative to the identity element and must work on both sides. Here the identity is 3, and commutativity lets one calculation verify both orders.
6Problem 4: semigroup, monoid, or group?
For the operation from Problems 2 and 3, check closure and associativity, and determine which of the conditions for a semigroup, a monoid, and a group are satisfied by .
6.1Answer
For all , we have , so closure holds. For all ,
Thus the operation is associative and is a semigroup. By Problem 2 its identity is 3, so it is a monoid. By Problem 3, every has the inverse . Therefore is a group.
6.2Explanation
Computing an identity and inverses alone does not yet prove that an operation forms a group. One must separately verify that the rule is a binary operation on the set and that it is associative.