Back to Discrete Math for Shockers

Relations and Functions

Ordered-pair correspondences between two sets, the properties that classify them, and the output rule that promotes a relation to a function.

Discrete Math for Shockers, Relations and Functions

Status
FlagsLoading your progress…

13 exercises

Exercise 1

Consider the relation .

  1. Is RR a function?
  2. Find R−1R^{-1}.
  3. Is R−1R^{-1} a function? Why or why not?
2.5

Exercise 2

  1. Is the sibling relation defined in this example a function? Why or why not?
  2. Is the divides relation defined in this example on the set {1,2,3,…,10}\{1, 2, 3, \dots, 10\} to itself a function? Why or why not?
  3. Is the height relation between the set of people and the set of natural numbers a function? Why or why not?
2.5

Exercise 5

Using the relations defined in this example, find the following compositions:

  1. R1∘R2R_1 \circ R_2
  2. R2∘R1R_2 \circ R_1
  3. R4∘R4R_4 \circ R_4
  4. R5∘R4R_5 \circ R_4
  5. R4∘R5R_4 \circ R_5
2.5

Exercise 6

Consider the function f:{1,2,3,4,5}→{1,2,3,4}f:\{1,2,3,4,5\} \to \{1,2,3,4\} given by the table below:

  1. Is ff injective? Explain.

  2. Is ff surjective? Explain.

  3. Is f−1f^{-1} a function? Explain.

2.5

Exercise 8

For each function given below, determine whether or not the function is injective and whether or not the function is surjective.

  1. f:N→Nf:\N \to \N given by f(n)=n+4f(n) = n+4.
  2. f:Z→Zf:\Z \to \Z given by f(n)=n+4f(n) = n+4.
  3. f:Z→Zf:\Z \to \Z given by f(n)=5n−8f(n) = 5n - 8.
  4. f:Z→Zf:\Z \to \Z given by f(n)={n/2 if n is even(n+1)/2 if n is odd.f(n) = \begin{cases}n/2 & \text{ if } n \text{ is even} \\ (n+1)/2 & \text{ if } n \text{ is odd} . \end{cases}
2.5

Exercise 9

Determine whether f:Z×Z→Zf:\Z \times \Z \to \Z is surjective if

  1. f(m,n)=m+nf(m,n) = m + n
  2. f(m,n)=m2+n2f(m,n) = m^2 + n^2
  3. f(m,n)=mf(m,n) = m
  4. f(m,n)=m−nf(m,n) = m - n
2.5

Exercise 10

Consider the function f:Z→Zf:\Z \to \Z given by f(n)={n+1 if n is evenn−3 if n is odd.f(n) = \begin{cases}n+1 & \text{ if }n\text{ is even} \\ n-3 & \text{ if }n\text{ is odd} . \end{cases}

  1. Is ff injective? Prove your answer.

  2. Is ff surjective? Prove your answer.

2.5

Exercise 11

Give an explicit formula for a function from the set of integers to the set of positive integers that is

  1. injective but not surjective
  2. surjective but not injective
  3. injective and surjective
  4. neither injective nor surjective
2.5

Exercise 14

What can you deduce about the sets XX and YY if you know …

  1. there is an injective function f:X→Yf:X \to Y? Explain.

  2. there is a surjective function f:X→Yf:X \to Y? Explain.

  3. there is a bijective function f:X→Yf:X \to Y? Explain.

2.5

Exercise 15

Suppose f:X→Yf:X \to Y is a function. Which of the following are possible? Explain.

  1. ff is injective but not surjective.
  2. ff is surjective but not injective.
  3. ∣X∣=∣Y∣|X| = |Y| and ff is injective but not surjective.
  4. ∣X∣=∣Y∣|X| = |Y| and ff is surjective but not injective.
  5. ∣X∣=∣Y∣|X| = |Y|, XX and YY are finite, and ff is injective but not surjective.
  6. ∣X∣=∣Y∣|X| = |Y|, XX and YY are finite, and ff is surjective but not injective.
2.5

Exercise 17

Find the floor and ceiling of each of the following real numbers:

  1. 8.675309
  2. π\pi
  3. −2.1-2.1
  4. 77
2.5

Exercise 18

Let f:Z5→Z5f:Z_5 \to Z_5 be defined by f(n)=⌊n2⌋f(n) = \left \lfloor \dfrac{n}{2}\right \rfloor. Complete the table of values:

Is ff injective? surjective?

2.5

Exercise 19

Are the floor or ceiling functions injective? Surjective? If so, prove it. If not, provide specific counterexamples to show why not.

2.5

Adapted from Discrete Math for Shockers © 2021 John Hammond. Licensed under CC BY-SA 4.0. Source: Discrete Math for Shockers. Imported at revision 2538beb.