Scribd
Upload
16 views

Mod 2 LT2

This document discusses computations involving a binary operation * defined on a set S. It examines whether * is associative and commutative by calculating various expressions. It also considers defining binary operations on other sets and determining if they satisfy the necessary conditions.

Uploaded by

jakedioqueno23
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Mod 2 LT2

This document discusses computations involving a binary operation * defined on a set S. It examines whether * is associative and commutative by calculating various expressions. It also considers defining binary operations on other sets and determining if they satisfy the necessary conditions.

Uploaded by

jakedioqueno23
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Deoquino, Ivy C.

BSED-Math 3 Abstract Algebra Module 2: Learning task 2

Computations
Exercises 1 through 4 concern the binary operation ∗ de ined on S = {a, b,c, d, e} by means of Table
2.26.
1. Compute b ∗ d, c ∗ c, and [(a ∗ c) ∗ e] ∗ a.
 b∗d=e
 c∗c=b
 [(a∗c)∗e]∗a=[(c∗a)∗e]∗a=(b∗e)∗a=d∗a=e
2. Compute (a ∗ b) ∗ c and a ∗ (b ∗ c). Can you say on the basis of this computations whether ∗ is
associative?
 (a∗b)∗c=(b∗c)∗c=(e∗c)∗c=c∗c=b
 a∗(b∗c)=a∗(a)=b
Since (a∗b)∗c≠a∗(b∗c), the operation ∗ is not associative.

3. Compute (b ∗ d) ∗ c and b ∗ (d ∗ c). Can you say on the basis of this computation whether ∗ is
associative?
 b∗d)∗c=(e∗d)∗c=b∗c=a
 b∗(d∗c)=b∗(e)=c
Since (b∗d)∗c≠b∗(d∗c), the operation ∗∗ is not associative.

4. Is ∗ commutative? Why?
Yes, ∗ is commutative. For example, a∗b=b∗a because a∗b=b and b∗a=b. This holds for all pairs
of elements in S. Therefore, the operation ∗ is commutative.
5. Complete Table 2.27 so as to de ine a commutative binary operation ∗ on S = {a, b, c, d}.

1. a∗d=d∗a. Since d∗a=d, we have a∗d=d.


2. c∗b=b∗c. Since c∗b=a, we have b∗c=a.
3. d ∗b =b∗d. Since b∗d=c, we have d∗b=c.
4. d ∗c =c∗d. Since c∗d=b, we have d∗c=b.
5. Table 2.28 can be completed to de ine an associative binary operation ∗ on S = {a, b, c, d}. Assume
this is possible and compute the missing entries.
*|a|b|c|d|
--------------------
a|b|e|a|d|
b|b|a|c|d|
c|c|d|c|a|
d|e|c|d|b|
In Exercises 7 through 11, determine whether the binary operation ∗ de ined is commutative and
whether ∗ is associative.
12. Let S be a set having exactly one element. How many different binary operations can be
de ined on S? Answer the question if S has exactly 2 elements; exactly 3 elements; exactly n
elements.
13. How many different commutative binary operations can be de ined on a set of 2 elements? on a set of
3 elements? on a set of n elements?
Concepts

In Exercises 14 through 16, correct the de inition of the italicized term without reference to the text, if
correction is needed, so that it is in a form acceptable for publication.

14. A binary operation ∗ is commutative if and only if a ∗b = b ∗ a.

15. A binary operation ∗ on a set S is associative if and only if, for all a, b, c ∈ S, we have (b∗c)∗a=b∗{c∗a).

16. A subset H of a set S is closed under a binary operation ∗ on S if and only if (a ∗ b) ∈ H for all a, b ∈ S.

Corrected:

14.) A binary operation ⋆ is commutative if and only if a⋆b=b⋆a.


15.) A binary operation ⋆ on a set S is associative if and only if, for all a,b,c∈S, we have (b⋆c)⋆a=b⋆(c⋆a).
16.)A subset H of a set S is closed under a binary operation ⋆ on S if and only if (a⋆b)∈H for all a,b∈S.

In Exercises 17 through 22, determine whether the de inition of ∗ does give a binary operation on the set.
In the event that ∗ is not a binary operation, state whether Condition 1, Condition 2, or both of these
conditions on page 23 are violated.

17. On ℤ+, de ine ∗ by letting a ∗ b =a - b.

18. On ℤ+, de ine ∗ by letting a ∗ b =ab .

19. On ℝ, de ine ∗ by letting a ∗ b =a - b.

20. On ℤ+, de ine ∗ by letting a ∗ b = c, where c is the smallest integer greater than both a and b.
To determine whether the given de inition of ⋆ gives a binary operation on the set, we need to verify if the
operation satis ies the conditions of a binary operation

Condition 1:

For all a,b in the set, a⋆b is uniquely de ined.

Condition 2:

The operation ⋆ must be closed under the given set

Let's analyze each case:

17) On Z^+, de ine ⋆ by letting a⋆b=a−b.

 This operation violates Condition 2 because a−b may not always be a non-negative integer (an
element of Z^+).

18) On Z^+, de ine ⋆ by letting a⋆b=ab.

 This operation satis ies both Condition 1 and Condition 2. ab is always a non-negative integer.

19) On R, de ine ⋆ by letting a⋆b=a−b.

 This operation satis ies both Condition 1 and Condition 2. a−b is a real number for all a,b in R.

20) On Z^+, de ine ⋆ by letting a⋆b=c, where c is the smallest integer greater than both a and b.

 This operation violates both Condition 1 and Condition 2 because the result c might not always be
in Z^+, and it's not always uniquely de ined.

In summary:

 Operation ⋆ de ined as a⋆b=ab on Z^+ and ⋆ de ined as a⋆b=a−b on R satisfy the conditions of a
binary operation.

 Operations ⋆ de ined as a⋆b=a−b on Z^+ and ⋆ de ined as a⋆b=c, where c is the smallest integer
greater than both a and b on Z^+ do not satisfy the conditions of a binary operation.

You might also like