20180606

Please Login to access more options.

Today

Problem 41 (More Practice With Universal Quantifiers)

For each $n\in \mathbb{N}$, define $\ds a_n = \frac{n-1}{n}$. Only one of the statements below is true. Rewrite each statement using the quantifiers $\forall$ and $\exists$. Then determine which statement is true, prove that statement is true, and then prove the other statement is false.

1. For each real number $\varepsilon>0$, there exists $N\in \mathbb{N}$ such that for every $n\in \mathbb{N}$, if $n>N$ then $\ds \left|a_n-0\right|<\varepsilon$.
2. For each real number $\varepsilon>0$, there exists $N\in \mathbb{N}$ such that for every $n\in \mathbb{N}$, if $n>N$ then $\ds \left|a_n-1\right|<\varepsilon$.

We use Cartesian products all the time without realizing it. When we look for relationships between two groups, we are looking at a subset of a Cartesian product. Family history involves looking at a Cartesian product. For example, we could let $A$ and $B$ both be the set of all humans that have lived on the planet. In our family tree, we often care to know when person $x$ descends from person $y$. One goal of family history is to determine all the pairs $(x,y)$ where person $x$ descends from person $y$. This is a subset of $A\times B$. Similarly, any time we start grouping objects together from two sets, we're formally stating a relationship between the two sets and looking for a subset of the Cartesian product. We call these subsets relations.

Definition (Relation Between Two Sets)

Let $A$ and $B$ be sets. A relation $\mathrm{R}$ between $A$ and $B$ is a subset of $A\times B$, so $\mathrm{R}\subseteq A\times B$. Given $a\in A$ and $b\in B$, we write $(a,b)\in\mathrm{R}$ precisely when $a$ is related to $b$.

A function is one important kind of relation that we've been studying since middle school. Here's a formal definition.

Definition (Function)

Let $A$ and $B$ be sets. A function $f$ from $A$ into $B$, written $f:A\to B$, is a relation between $A$ and $B$ (so $f\subseteq A\times B$) such that for every $x\in A$, there exists a unique $y\in B$ such that $(x,y)\in f$. When $f$ is a function from $A$ into $B$, we'll use the notation $y=f(x)$ or $f(x)=y$ rather than the more cumbersome notation $(x,y)\in f$ used for sets.

Problem 42: (Which Relations Are Functions)

In each number below, you are given a relation $\mathrm{R}$ between a set $A$ and a set $B$. Prove that the relation is a function from $A$ into $B$ or give a counter example to show that the relation is not a function from $A$ into $B$.

1. Let $\mathrm{R}$ be the relation between $\mathbb{N}$ and $\mathbb{Z}$ given by $(n,m)\in \mathrm{R}$ if and only if $n^2=m$.
2. Let $\mathrm{R}$ be the relation between $\mathbb{N}$ and $\mathbb{Z}$ given by $(n,m)\in \mathrm{R}$ if and only if $n=m^2$.
3. Let $\mathrm{R}$ be the relation between $\mathbb{R}\times\mathbb{R}$ and $\mathbb{R}$ given by $((x,y),z)\in \mathrm{R}$ if and only if $x+y=z$.
4. Let $\mathrm{R}$ be the relation between $\mathbb{R}\times\mathbb{R}$ and $\mathbb{R}$ given by $((x,y),z)\in \mathrm{R}$ if and only if $x/y=z$.

Definition (Domain And Codomain)

Let $A$ and $B$ be sets and let $f$ be a function from $A$ into $B$, so we have $f:A\to B$.

• We call the set $A$ the domain of $f$.
• We call the set $B$ the codomain of $f$.

Definition (Injective, Surjective, And Bijective)

Let $D$ and $R$ be sets and let $f$ be a function from $D$ into $R$, so we have $f:D\to R$.

• We say that $f$ is injective (or one-to-one) if and only if for every $a,b\in D$ we have $f(a)=f(b)$ implies $a=b$.
• We say that $f$ is surjective (or onto) if and only if for every $y\in R$ there exists an $x\in D$ such that $y=f(x)$.
• We say that $f$ is bijective if and only if the function $f$ is both injective and surjective.

Problem 43: (Practice With Injective And Surjective)

For each function below, state the domain and codomain, determine if the function is injective, and then determine if the function is surjective.

1. Let $f:\mathbb{R}\to\mathbb{R}$ be defined by $f(x)=x^2$.
2. Let $f:[0,\infty)\to\mathbb{R}$ be defined by $f(x)=x^2$.
3. Let $f:\mathbb{R}\to [0,\infty)$ be defined by $f(x)=x^2$.
4. Let $f:[0,\infty)\to[0,\infty)$ be defined by $f(x)=x^2$.

As always, remember to justify each claim you make.

Problem 45: (Relationships Between Subsets, Infimums, And Supremums)

Suppose that $S$ and $T$ are nonempty bounded subsets of $\mathbb{R}$ and that $S\subseteq T$. Prove that $$\inf T \leq \inf S \leq \sup S\leq \sup T.$$

Definition (Epsilon Neighborhoods And Deleted Neighborhoods)

Given $\varepsilon>0$, an $\varepsilon$-neighborhood of the real number $x$ is the interval $$N_{\varepsilon}(x) = (x-\varepsilon,x+\varepsilon) = \{y\in \mathbb{R}\colon |x-y|<\varepsilon\}.$$ A deleted $\varepsilon$-neighborhood of $x$ is the same interval minus the point $x$, which we'll write as $$N^*_{\varepsilon}(x) = N_{\varepsilon}(x)\setminus\{x\} = (x-\varepsilon,x)\cup(x,x+\varepsilon) = \{y\in \mathbb{R}\colon 0<|x-y|<\varepsilon\}.$$

Definition (Interior Point, Open Set, Closed Set)

Let $S\subseteq \mathbb{R}$.

• We say that $x$ is an interior point of $S$ if and only if there exists an $\varepsilon>0$ such that $N_\varepsilon(x)\subseteq S$.
• The interior of $S$ is the collection of interior points of $S$.
• We say that $S$ is an open set if and only if for every $x\in S$ there exists an $\varepsilon>0$ such that $N_\varepsilon(x)\subseteq S$ (so every point in $S$ is an interior point, or equivalently $S$ equals the interior of $S$).
• We say that $S$ is a closed set if and only if the complement $\mathbb{R}\setminus S$ is open.

Problem 47: (Open Intervals Are Open Sets)

Prove that if $a$ and $b$ are real numbers such that $a<b$, then the interval $S=(a,b)$ is an open set.

Problem 48: (Closed Intervals Are Closed Sets)

Prove that if $a$ and $b$ are real numbers such that $a<b$, then the interval $ S=[a,b] $ is a closed set.

For more problems, see AllProblems