Skip to main content
Logo image

PreTeXt Sample Book: Abstract Algebra (SAMPLE ONLY)

Exercises 1.4 Exercises

Warm-up

This is a meaningless subdivision of the exercises for the sake of testing output.

1.

Suppose that
A={x:xN and x is even},B={x:xN and x is prime},C={x:xN and x is a multiple of 5}.
Describe each of the following sets.
  1. AB
  2. BC
  3. AB
  4. A(BC)

2.

If A={a,b,c}, B={1,2,3}, C={x}, and D=, list all of the elements in each of the following sets.
  1. A×B
  2. B×A
  3. A×B×C
  4. A×D
Hint.
(a) A×B={(a,1),(a,2),(a,3),(b,1),(b,2),(b,3),(c,1),(c,2),(c,3)}; (d) A×D=.

3.

Find an example of two nonempty sets A and B for which A×B=B×A is true.

4.

Prove A=A and A=.

5.

Prove AB=BA and AB=BA.

6.

Prove A(BC)=(AB)(AC).
Hint.
If xA(BC), then either xA or xBC. Thus, xAB and AC. Hence, x(AB)(AC). Therefore, A(BC)(AB)(AC). Conversely, if x(AB)(AC), then xAB and AC. Thus, xA or x is in both B and C. So xA(BC) and therefore (AB)(AC)A(BC). Hence, A(BC)=(AB)(AC).

7.

Prove A(BC)=(AB)(AC).

8.

Prove AB if and only if AB=A.

9.

Prove (AB)=AB.

10.

Prove AB=(AB)(AB)(BA).
Hint.
(AB)(AB)(BA)=(AB)(AB)(BA)=[A(BB)](BA)=A(BA)=(AB)(AA)=AB.

11.

Prove (AB)×C=(A×C)(B×C).

14.

Prove A(BC)=(AB)(AC).
Hint.
A(BC)=A(BC)=(AA)(BC)=(AB)(AC)=(AB)(AC).

More Exercises

This is a meaningless subdivision of the exercises for the sake of testing output.

15.

Prove A(BC)=(AB)(AC).

16.

Prove (AB)(BA)=(AB)(AB).

17.

Which of the following relations f:QQ define a mapping? In each case, supply a reason why f is or is not a mapping.
  1. f(p/q)=p+1p2
  2. f(p/q)=3p3q
  3. f(p/q)=p+qq2
  4. f(p/q)=3p27q2pq

18.

Determine which of the following functions are one-to-one and which are onto. If the function is not onto, determine its range.
  1. f:RR defined by f(x)=ex
  2. f:ZZ defined by f(n)=n2+3
  3. f:RR defined by f(x)=sinx
  4. f:ZZ defined by f(x)=x2
Hint.
(a) f is one-to-one but not onto. f(R)={xR:x>0}. (c) f is neither one-to-one nor onto. f(R)={x:1x1}.

19.

Let f:AB and g:BC be invertible mappings; that is, mappings such that f1 and g1 exist. Show that (gf)1=f1g1.

20.

  1. Define a function f:NN that is one-to-one but not onto.
  2. Define a function f:NN that is onto but not one-to-one.
Hint.
(a) f(n)=n+1.

21.

Prove the relation defined on R2 by (x1,y1)(x2,y2) if x12+y12=x22+y22 is an equivalence relation.

22.

Let f:AB and g:BC be maps.
  1. If f and g are both one-to-one functions, show that gf is one-to-one.
  2. If gf is onto, show that g is onto.
  3. If gf is one-to-one, show that f is one-to-one.
  4. If gf is one-to-one and f is onto, show that g is one-to-one.
  5. If gf is onto and g is one-to-one, show that f is onto.
Hint.
(a) Let x,yA. Then g(f(x))=(gf)(x)=(gf)(y)=g(f(y)). Thus, f(x)=f(y) and x=y, so gf is one-to-one. (b) Let cC, then c=(gf)(x)=g(f(x)) for some xA. Since f(x)B, g is onto.

23.

Define a function on the real numbers by
f(x)=x+1x1.
What are the domain and range of f? What is the inverse of f? Compute ff1 and f1f.

24.

Let f:XY be a map with A1,A2X and B1,B2Y.
  1. Prove f(A1A2)=f(A1)f(A2).
  2. Prove f(A1A2)f(A1)f(A2). Give an example in which equality fails.
  3. Prove f1(B1B2)=f1(B1)f1(B2), where
    f1(B)={xX:f(x)B}.
  4. Prove f1(B1B2)=f1(B1)f1(B2).
  5. Prove f1(YB1)=Xf1(B1).
Hint.
(a) Let yf(A1A2). Then there exists an xA1A2 such that f(x)=y. Hence, yf(A1) or f(A2). Therefore, yf(A1)f(A2). Consequently, f(A1A2)f(A1)f(A2). Conversely, if yf(A1)f(A2), then yf(A1) or f(A2). Hence, there exists an xA1 or there exists an xA2 such that f(x)=y. Thus, there exists an xA1A2 such that f(x)=y. Therefore, f(A1)f(A2)f(A1A2), and f(A1A2)=f(A1)f(A2).

25.

Determine whether or not the following relations are equivalence relations on the given set. If the relation is an equivalence relation, describe the partition given by it. If the relation is not an equivalence relation, state why it fails to be one.
  1. xy in R if xy
  2. mn in Z if mn>0
  3. xy in R if |xy|4
  4. mn in Z if mn(mod6)

26.

Define a relation on R2 by stating that (a,b)(c,d) if and only if a2+b2c2+d2. Show that is reflexive and transitive but not symmetric.

27.

Show that an m×n matrix gives rise to a well-defined map from Rn to Rm.

28.

Find the error in the following argument by providing a counterexample. “The reflexive property is redundant in the axioms for an equivalence relation. If xy, then yx by the symmetric property. Using the transitive property, we can deduce that xx.
Hint.
Let X=N{2} and define xy if x+yN.

29. Projective Real Line.

Define a relation on R2{(0,0)} by letting (x1,y1)(x2,y2) if there exists a nonzero real number λ such that (x1,y1)=(λx2,λy2). Prove that defines an equivalence relation on R2(0,0). What are the corresponding equivalence classes? This equivalence relation defines the projective line, denoted by P(R), which is very important in geometry.
You have attempted 1 of 1 activities on this page.