A set labeled \(X\) on the left consisting of elements \(x_1, x_2, x_3\text{.}\) A set \(Y\) on the right consisting of elements \(y_1, y_2, y_3\text{.}\) There is an arrow from \(x_1\) to \(y_1\text{,}\) an arrow from \(x_2\) to \(y_1\text{,}\) an arrow from \(x_2\) to \(y_2\text{,}\) and an arrow from \(x_3\) to \(y_3\text{.}\)
A set labeled \(X\) on the left consisting of elements \(x_1, x_2, x_3\text{.}\) A set \(Y\) on the right consisting of elements \(y_1, y_2, y_3\text{.}\) There is an arrow from \(x_2\) to \(y_1\) and an arrow from \(x_3\) to \(y_3\text{.}\)
A set labeled \(X\) on the left consisting of elements \(x_1, x_2, x_3\text{.}\) A set \(Y\) on the right consisting of elements \(y_1, y_2, y_3\text{.}\) There is an arrow from \(x_1\) to \(y_1\text{,}\) an arrow from \(x_2\) to \(y_1\text{,}\) and an arrow from \(x_3\) to \(y_3\text{.}\)
If we have a map from a finite set to a finite set, we can draw an arrow diagram in which we use arrows to represent the map from \(X\) to \(Y\text{,}\) as in ExampleΒ 7.1.2.
A set labeled \(X\) on the left consisting of elements \(a, b, c, d\text{.}\) A set \(Y\) on the right consisting of elements \(0, 1, 2\text{.}\) There is an arrow from \(a\) to \(0\text{,}\) an arrow from \(b\) to \(0\text{,}\) an arrow from \(c\) to \(2\text{,}\) and an arrow from \(d\) to \(2\text{.}\)
In this course we want to look at functions to and from sets other than just the real numbers. For example, we may have functions from finite sets to finite sets.
We may also have functions involving Cartesian products of sets. For example, \(f:\mathbb{Z}\times\mathbb{Z}\rightarrow\mathbb{Z}\) given by \(f(a, b)=a+b\text{.}\)
Since a function needs to satisfy the property that each \(x\in X\) can only map to one \(y \in Y\text{,}\) we say a function is well-defined if whenever \(a=b\text{,}\)\(f(a)=f(b)\text{.}\) Most of the functions youβve seen in algebra and calculus are clearly well-defined since when \(a=b\text{,}\)\(f(a)=f(b)\text{.}\) This property is really only interesting when elements of \(X\) have multiple representations. In other words, when two equal elements in \(X\) have two different forms. The most familiar set where this happens is \(\mathbb{Q}\text{.}\) For example, \(\frac{1}{2}=\frac{2}{4}\text{.}\)
Let \(f:\mathbb{Q}\rightarrow\mathbb{Z}\) be given by \(f(m/n)=m\text{.}\) Show \(f\) is not well-defined by finding two equivalent fractions in \(\mathbb{Q}\) that map to two different integers.
Let \(A=\{1, 2, 3, 4, 5\}\) and define a function \(F:{\cal P}(A)\rightarrow \mathbb{Z}\) where for all sets \(X\) in \({\cal P}(A)\text{,}\)
\begin{equation*}
F(X)=
\begin{cases}
0 &\text{if $X$ has an even number of elements}\\
1 &\text{if $X$ has an odd number of elements.}
\end{cases}
\end{equation*}
Let \(D\) be the set of all finite subsets of positive integers. Let \(T:\mathbb{Z}^+\rightarrow D\) be the function where for each positive integer \(n\text{,}\)\(T(n)\) is the set of positive divisors of \(n\text{.}\)
Define the function \(F:\mathbb{Z}\times\mathbb{Z}\rightarrow \mathbb{Z}\times\mathbb{Z}\) where for all ordered pairs \((a, b)\) of integers, \(F(a, b)=(2a+1, 3b-2)\text{.}\)