10.1 Sets and Set Notation 集合与集合记号
本页译自 LibreTexts · A First Course in Linear Algebra (Kuttler)「Some Prerequisite Topics」第 10.1 节。公式经 MathJax 渲染,自定义宏已注入。
A set is a collection of things called elements. For example $\left\{1,2,3,8\right\}$ would be a set consisting of the elements $1,2,3$, and $8$.
To indicate that $3$ is an element of $\left\{1,2,3,8\right\}$, it is customary to write $3\in\left\{1,2,3,8\right\}$. We can also indicate when an element is not in a set, by writing $9\notin\left\{1,2,3,8\right\}$, which says that $9$ is not an element of $\left\{1,2,3,8\right\}$.
Sometimes a rule specifies a set. For example you could specify a set as all integers larger than $2$. This would be written as $$S=\left\{x\in\mathbb{Z}:x>2\right\}.$$ This notation says: $S$ is the set of all integers $x$, such that $x>2$.
Suppose $A$ and $B$ are sets with the property that every element of $A$ is an element of $B$. Then we say that $A$ is a subset of $B$. For example, $\left\{1,2,3,8\right\}$ is a subset of $\left\{1,2,3,4,5,8\right\}$. In symbols, we write $$\left\{1,2,3,8\right\}\subseteq\left\{1,2,3,4,5,8\right\}.$$
It is sometimes said that “$A$ is contained in $B$” or even “$B$ contains $A$”. The same statement about the two sets may also be written as $$\left\{1,2,3,4,5,8\right\}\supseteq\left\{1,2,3,8\right\}.$$
We can also talk about the union of two sets, which we write as $A\cup B$. This is the set consisting of everything which is an element of at least one of the sets, $A$ or $B$. As an example of the union of two sets, consider $$\left\{1,2,3,8\right\}\cup\left\{3,4,7,8\right\}=\left\{1,2,3,4,7,8\right\}.$$ This set is made up of the numbers which are in at least one of the two sets. In general $$A\cup B=\left\{x:x\in A\text{ or }x\in B\right\}.$$
Notice that an element which is in both $A$ and $B$ is also in the union, as well as elements which are in only one of $A$ or $B$.
Another important set is the intersection of two sets $A$ and $B$, written $A\cap B$. This set consists of everything which is in both of the sets. Thus $\left\{1,2,3,8\right\}\cap\left\{3,4,7,8\right\}=\left\{3,8\right\}$ because $3$ and $8$ are those elements the two sets have in common. In general, $$A\cap B=\left\{x:x\in A\text{ and }x\in B\right\}.$$
If $A$ and $B$ are two sets, $A\setminus B$ denotes the set of things which are in $A$ but not in $B$. Thus $$A\setminus B=\left\{x\in A:x\notin B\right\}.$$ For example, if $A=\left\{1,2,3,8\right\}$ and $B=\left\{3,4,7,8\right\}$, then $A\setminus B=\left\{1,2,3,8\right\}\setminus\left\{3,4,7,8\right\}=\left\{1,2\right\}$.
A special set which is very important in mathematics is the empty set denoted by $\emptyset$, which is defined as the set which has no elements in it. It follows that the empty set is a subset of every set. This is true because if it were not so, there would have to exist a set $A$, such that $\emptyset$ has something in it which is not in $A$. However, $\emptyset$ has nothing in it and so it must be that $\emptyset\subseteq A$.
We can also use brackets to denote sets which are intervals of numbers. Let $a$ and $b$ be real numbers. Then:
- $\left[a,b\right]=\left\{x\in\mathbb{R}:a\leq x\leq b\right\}$
- $\left[a,b\right)=\left\{x\in\mathbb{R}:a\leq x
- $\left(a,b\right)=\left\{x\in\mathbb{R}:a
- $\left(a,b\right]=\left\{x\in\mathbb{R}:a
- $\left[a,\infty\right)=\left\{x\in\mathbb{R}:x\geq a\right\}$
- $\left(-\infty,a\right]=\left\{x\in\mathbb{R}:x\leq a\right\}$
- $\left(a,b\right)=\left\{x\in\mathbb{R}:a
- 闭区间 $\left[a,b\right]$,即 $a\leq x\leq b$
- 左闭右开区间 $\left[a,b\right)$,即 $a\leq x
- 开区间 $\left(a,b\right)$,即 $a
- 左开右闭区间 $\left(a,b\right]$,即 $a
- 区间 $\left[a,\infty\right)$,即 $x\geq a$
- 区间 $\left(-\infty,a\right]$,即 $x\leq a$
- 开区间 $\left(a,b\right)$,即 $a
These sorts of sets of real numbers are called intervals. The two points $a$ and $b$ are called endpoints, or bounds, of the interval. In particular, $a$ is the lower bound while $b$ is the upper bound of the above intervals, where applicable. Other intervals such as $\left(-\infty,b\right)$ are defined by analogy. In general, the curved parenthesis indicates that the end point is not included in the interval, while the square parenthesis indicates that this end point is included. The reason that there will always be a curved parenthesis next to $\infty$ or $-\infty$ is that these are not real numbers and cannot be included in the interval in the way a real number can.
To illustrate the use of this notation relative to intervals consider three examples of inequalities. Their solutions will be written in the interval notation just described.
Example 1: Solving an Inequality
Solve the inequality $2x+4\leq x-8$.
Solution. We need to find $x$ such that $2x+4\leq x-8$. Solving for $x$, we see that $x\leq-12$ is the answer. This is written in terms of an interval as $(-\infty,-12]$.
Consider the following example.
Example 2: Solving an Inequality
Solve the inequality $\left(x+1\right)\left(2x-3\right)\geq 0$.
Solution. We need to find $x$ such that $\left(x+1\right)\left(2x-3\right)\geq 0$. The solution is given by $x\leq-1$ or $x\geq\frac{3}{2}$. Therefore, those $x$ which fit into either of these intervals give a solution. In terms of set notation this is denoted by $(-\infty,-1]\cup\left[\frac{3}{2},\infty\right)$.
Consider one last example.
Example 3: Solving an Inequality
Solve the inequality $x\left(x+2\right)\geq-4$.
Solution. This inequality is true for any value of $x$ where $x$ is a real number. We can write the solution as $\mathbb{R}$ or $(-\infty,\infty)$.
In the next section, we examine another important mathematical concept.
10.2 Well Ordering and Induction 良序原理与数学归纳
本页同属「Some Prerequisite Topics」第 10.2 节,公式经 MathJax 渲染。
We begin this section with some important notation. Summation notation, written $\sum_{i=1}^{j} i$, represents a sum. Here, $i$ is called the index of the sum, and we add iterations until $i=j$. For example, $$\sum_{i=1}^{j} i=1+2+\cdots+j.$$ Another example: $$a_{11}+a_{12}+a_{13}=\sum_{i=1}^{3}a_{1i}.$$
The following notation is a specific use of summation notation.
Summation Notation. Let $a_{ij}$ be real numbers, and suppose $1\leq i\leq r$ while $1\leq j\leq s$. These numbers can be listed in a rectangular array as given by $$\begin{array}{cccc}a_{11}&a_{12}&\cdots&a_{1s}\\a_{21}&a_{22}&\cdots&a_{2s}\\\vdots&\vdots&&\vdots\\a_{r1}&a_{r2}&\cdots&a_{rs}\end{array}$$ Then $\sum_{j=1}^{s}\sum_{i=1}^{r} a_{ij}$ means to first sum the numbers in each column (using $i$ as the index) and then to add the sums which result (using $j$ as the index). Similarly, $\sum_{i=1}^{r}\sum_{j=1}^{s} a_{ij}$ means to sum the vectors in each row (using $j$ as the index) and then to add the sums which result (using $i$ as the index).
Notice that since addition is commutative, $$\sum_{j=1}^{s}\sum_{i=1}^{r} a_{ij}=\sum_{i=1}^{r}\sum_{j=1}^{s} a_{ij}.$$
We now consider the main concept of this section. Mathematical induction and well ordering are two extremely important principles in math. They are often used to prove significant things which would be hard to prove otherwise.
Definition 1: Well Ordered
A set is well ordered if every nonempty subset $S$ contains a smallest element $z$ having the property that $z\leq x$ for all $x\in S$.
In particular, the set of natural numbers defined as $$\mathbb{N}=\left\{1,2,\cdots\right\}$$ is well ordered.
Consider the following proposition.
Proposition 1: Well Ordered Sets
Any set of integers larger than a given number is well ordered.
This proposition claims that if a set has a lower bound which is a real number, then this set is well ordered.
Further, this proposition implies the principle of mathematical induction. The symbol $\mathbb{Z}$ denotes the set of all integers. Note that if $a$ is an integer, then there are no integers between $a$ and $a+1$.
Theorem 1: Mathematical Induction
A set $S\subseteq\mathbb{Z}$, having the property that $a\in S$ and $n+1\in S$ whenever $n\in S$, contains all integers $x\in\mathbb{Z}$ such that $x\geq a$.
Proof. Let $T$ consist of all integers larger than or equal to $a$ which are not in $S$. The theorem will be proved if $T=\emptyset$. If $T\neq\emptyset$ then by the well ordering principle, there would have to exist a smallest element of $T$, denoted as $b$. It must be the case that $b>a$ since by definition, $a\notin T$. Thus $b\geq a+1$, and so $b-1\geq a$ and $b-1\notin S$ because if $b-1\in S$, then $b-1+1=b\in S$ by the assumed property of $S$. Therefore, $b-1\in T$ which contradicts the choice of $b$ as the smallest element of $T$ ($b-1$ is smaller). Since a contradiction is obtained by assuming $T\neq\emptyset$, it must be the case that $T=\emptyset$ and this says that every integer at least as large as $a$ is also in $S$.
Mathematical induction is a very useful device for proving theorems about the integers. The procedure is as follows.
Procedure 1: Proof by Mathematical Induction
Suppose $S_n$ is a statement which is a function of the number $n$, for $n=1,2,\cdots$, and we wish to show that $S_n$ is true for all $n\geq 1$. To do so using mathematical induction, use the following steps.
- Base Case: Show $S_1$ is true.
- Assume $S_n$ is true for some $n$, which is the induction hypothesis. Then, using this assumption, show that $S_{n+1}$ is true.
- 归纳基础:证明 $S_1$ 成立。
- 假设对某个 $n$,$S_n$ 成立(这称为归纳假设),然后利用这一假设证明 $S_{n+1}$ 成立。
Proving these two steps shows that $S_n$ is true for all $n=1,2,\cdots$.
We can use this procedure to solve the following examples.
Example 1: Proving by Induction
Prove by induction that $$\sum_{k=1}^{n}k^{2}=\frac{n\left(n+1\right)\left(2n+1\right)}{6}.$$
Solution. By the Procedure above, we first need to show that this statement is true for $n=1$. When $n=1$, the statement says that $$\sum_{k=1}^{1}k^{2}=\frac{1\left(1+1\right)\left(2(1)+1\right)}{6}=\frac{6}{6}=1.$$ The sum on the left hand side also equals $1$, so this equation is true for $n=1$.
Now suppose this formula is valid for some $n\geq 1$ where $n$ is an integer. Hence, the following equation is true. $$\sum_{k=1}^{n}k^{2}=\frac{n\left(n+1\right)\left(2n+1\right)}{6}.$$ We want to show that this is true for $n+1$. Suppose we add $\left(n+1\right)^{2}$ to both sides of the equation above.
The step going from the first to the second line is based on the assumption that the formula is true for $n$. Now simplify the expression in the second line, $$\frac{n\left(n+1\right)\left(2n+1\right)}{6}+\left(n+1\right)^{2}.$$ This equals $\left(n+1\right)\left(\frac{n\left(2n+1\right)}{6}+\left(n+1\right)\right)$ and $\frac{n\left(2n+1\right)}{6}+\left(n+1\right)=\frac{6\left(n+1\right)+2n^{2}+n}{6}=\frac{\left(n+2\right)\left(2n+3\right)}{6}$. Therefore, $$\sum_{k=1}^{n+1}k^{2}=\frac{\left(n+1\right)\left(n+2\right)\left(2n+3\right)}{6}=\frac{\left(n+1\right)\left(\left(n+1\right)+1\right)\left(2\left(n+1\right)+1\right)}{6},$$ showing the formula holds for $n+1$ whenever it holds for $n$. This proves the formula by mathematical induction. In other words, this formula is true for all $n=1,2,\cdots$.
Consider another example.
Example 2: Proving an Inequality by Induction
Show that for all $n\in\mathbb{N}$, $$\frac{1}{2}\cdot\frac{3}{4}\cdots\frac{2n-1}{2n}<\frac{1}{\sqrt{2n+1}}.$$
Solution. Again we will use the Procedure above to prove that this statement is true for all $n$. Suppose $n=1$. Then the statement says $\frac{1}{2}<\frac{1}{\sqrt{3}}$, which is true.
Suppose then that the inequality holds for $n$. In other words, $\frac{1}{2}\cdot\frac{3}{4}\cdots\frac{2n-1}{2n}<\frac{1}{\sqrt{2n+1}}$ is true. Now multiply both sides of this inequality by $\frac{2n+1}{2n+2}$. This yields $$\frac{1}{2}\cdot\frac{3}{4}\cdots\frac{2n-1}{2n}\cdot\frac{2n+1}{2n+2}<\frac{1}{\sqrt{2n+1}}\frac{2n+1}{2n+2}=\frac{\sqrt{2n+1}}{2n+2}.$$
The theorem will be proved if this last expression is less than $\frac{1}{\sqrt{2n+3}}$. This happens if and only if $$\left(\frac{1}{\sqrt{2n+3}}\right)^{2}=\frac{1}{2n+3}>\frac{2n+1}{\left(2n+2\right)^{2}},$$ which occurs if and only if $\left(2n+2\right)^{2}>\left(2n+3\right)\left(2n+1\right)$, and this is clearly true which may be seen from expanding both sides. This proves the inequality.
Let's review the process just used. If $S$ is the set of integers at least as large as $1$ for which the formula holds, the first step was to show $1\in S$ and then that whenever $n\in S$, it follows $n+1\in S$. Therefore, by the principle of mathematical induction, $S$ contains $\left[1,\infty\right)\cap\mathbb{Z}$, all positive integers. In doing an inductive proof of this sort, the set $S$ is normally not mentioned. One just verifies the steps above.