Introduction to Abstract Algebra/Problem set 2

From testwiki
Revision as of 04:41, 8 December 2019 by imported>MaintenanceBot (CourseCat)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem Set #2: Introduction to Abstract Algebra.

As you work through these problems, think about the logical steps you are using. You should know if your proof is correct or not if you have a reason for every step.

1: Determine if the follow maps are onto and/or 1:1:

  • f:+ such that f(x)=x2.
  • f:++ such that f(x)=x2.
  • f: such that f(x)=x2.
  • f: such that f(x)=2x.

2: Prove that if A and B are nonempty sets, then the function f:A×BB×A given by the relation f((a,b))=(b,a) is a bijection.

3: Suppose the set A is finite.

  • Prove that if f:AA is an onto map, then f is a one-to-one map.
  • Prove that if f:AA is a one-to-one map, then f is an onto map.

4: Suppose that the set A is not finite.

  • Provide a counter example to the proposition that if f:AA is an onto map, then f is a one-to-one map.
  • Provide a counter example to the proposition that if f:AA is a one-to-one map, then f is an onto map.

Template:CourseCat