Real Analysis 1

Sets and Functions

First we’ll define the notation of a set.

Definition 1 (Set). A set is a collection of objects, called elements (or members). We denote that an element xx is in a set AA by xAx \in A, and that xx is not in AA by xAx \notin A.

For example, A={1,2,3}A = \{1, 2, 3\} is a set with three elements, and by definition 1A1 \in A, 2A2 \in A, 3A3 \in A. However, the number four is not in AA, so 4A4 \notin A. Now the order of the elements in a set does not matter, so {1,2,3}={3,2,1}={2,1,3}\{1, 2, 3\} = \{3, 2, 1\} = \{2, 1, 3\}, and so on. Similarly, a set only cares about distinct members so {1,2,3,3,3}={1,2,3}\{1,2,3,3,3\}=\{1,2,3\}. We don’t count the extra threes, as they are the same object and sets don’t care for duplicates. We should also learn how to manipulate sets. For example, we can take the union of two sets AA and BB, denoted by ABA \cup B, which is the set of all elements that are in AA or in BB. In mathematics we use the word “or” in the inclusive sense, so if an element is in both AA and BB, it is still in ABA \cup B. This is denoted as AB={x:xA or xB}A \cup B = \{x: x \in A \text{ or } x \in B\}. Similarly, we can take the intersection of two sets AA and BB, denoted by ABA \cap B, which is the set of all elements that are in both AA and BB. This is denoted as AB={x:xA and xB}A \cap B = \{x: x \in A \text{ and } x \in B\}. A set can be thought of as a box which contains elements, separated by a comma which leads us to our next definition.

Definition 2 (Empty Set). The empty set is the unique set that contains no elements. Often denoted by \emptyset or { }.

The elements in sets can be anything (ignoring ZFC for now), so we can put sets inside a set. For example {}\{\emptyset \} is a set containing one element, the empty set. Equivalently {{}}\{ \{ \}\} is a set with one element, the empty set (So {}={{}} \{\emptyset \} = \{ \{ \}\}). To give another example, the set B={1,2,3,a,{b,c}}B = \{1,2,3,a,\{b,c\}\} is a set with 55 elements (not 66), specifically, 1B1 \in B, 2B2 \in B, 3B,aB,{b,c}B3 \in B, a \in B, \{b,c\} \in B. Although B contains the element {b,c}\{b,c\}, we should recognise that bBb \notin B and cBc \notin B. So even if our set contains an element that is a set, and that set contains more elements inside of it, it is not considered an element of the set is in contained in. However, given a set C={1,2,3,a,{b,c},b,c}C = \{1,2,3,a,\{b,c\},b,c\} of course has bCb \in C and cCc \in C. \newline

Now that we know what a set is, let’s look at the definition of a function which will help us pair every element from a given set, to another element from a different (or the same) set.

Definition 3 (Function). Given two sets AA and BB, suppose that each xAx \in A is related to one element of BB, denoted by f(x)f(x). Then we call ff a function from AA to BB. Denoted by f:ABf:A \to B. Here we call AA the domain of ff, and BB the codomain of ff. Also note that the range is the set {f(x):xA}\{f(x): x \in A \}. A function f:ABf:A \to B is injective (or one-to-one, i.e. each input has its own unique output) if f(a)=f(b)f(a)=f(b) implies that a=ba=b. A function f:ABf:A \to B is surjective (or onto, i.e. every codomain (output) element is reached by at least one domain (input) element) if, for each bBb \in B there exists some aAa \in A such that f(a)=bf(a)=b. A function f:ABf:A \to B is bijective if it is both injective and surjective.

Naturals, Integers, and Rationals

Definition 4 (Natural numbers). The set of natural numbers denoted by N\N is {0,1,2,3,}\{0,1,2,3,\dots \}. An element of N\N is a natural number.

Definition 5 (Integers). The set of integers Z\Z is the set {,3,2,1,0,1,2,3,}\{\dots, -3,-2,-1,0,1,2,3,\dots \}. An element of Z\Z is an integer.

Definition 6 (Rationals). The set of rationals Q\Q is the set

Q:={pq:p,qZ,q0}.\Q := \left\{\frac{p}{q}: p,q \in \Z, q \neq 0 \right\}.

An element of Q\Q is a rational number.

These sets build on each other, so we have NZQ\N \subseteq \Z \subseteq \Q. Ok but how do we find these relationships, and why do we care about these sets? One approach is to look at the properties of the sets and see how and why we want to fill in the “gaps”. For example, N\N the natural numbers starts at zero and increments by one towards infinity. However it never actually reaches infinity. It’s closed under the incrementation operation, but not the decrementation operation (which subtracts a given value by one unit).

Definition 7 (Closure). A set SS is closed under an operation * if for each a,bSa, b \in S, the result aba * b is also in SS.

Similarly, N\N is also closed under addition and multiplication, but not subtraction or division (subtracting 33 from 22 returns 1-1, which is not in N\N, and dividing 22 by 33 returns 23\frac{2}{3}, which is also not in N\N). So we can see that N\N is closed under some operations, but not others. If we introduce the integers Z\Z, we fill in the “gaps” of N\N as Z\Z is closed under everything that N\N is closed under, and also closed under subtraction. However, Z\Z is not closed under division (the same problem; dividing 22 by 33 returns 23\frac{2}{3} and 23Z\frac{2}{3} \notin \Z). As you’d expect, the rationals Q\Q fill in the “gaps” of Z\Z as Q\Q is closed under everything that Z\Z is closed under, while also being closed under division (except for division by zero, which is undefined, and also why we define q0q \neq 0 in its definition). And so the set of integers contains all the natural numbers, hence NZ\N \subseteq \Z, and the set of rationals contains all the integers, hence ZQ\Z \subseteq \Q. Leaving us with NZQ\N \subseteq \Z \subseteq \Q.

So we have a pretty cool set to work with, the rationals Q\Q. Let’s precisely define some of the properties of Q\Q. First is of course closure, under addition, subtraction, multiplication, and division. A way to write this precisely is to say if a,bQa,b \in \Q, then a+bQa+b \in \Q (closure under addition). If a,bQa,b \in \Q, then abQa-b \in \Q (closure under subtraction). If a,bQa,b \in \Q, then abQab \in \Q (closure under multiplication). If a,bQa,b \in \Q and b0b \neq 0, then abQ\frac{a}{b} \in \Q (closure under division). Another interesting property is the density of the rationals.

Theorem 8 (Density). Between any two rational numbers aa and bb, we can always find another rational number c=a+b2c=\frac{a+b}{2}.

Proof. Let a,bQa,b\in\mathbb{Q} with a<ba<b. Define c:=a+b2c:=\frac{a+b}{2}. Since Q\mathbb{Q} is closed under addition and division by non-zero rationals, cQc\in\mathbb{Q}.

Now,

ca=a+b2a=ba2>0c-a=\frac{a+b}{2}-a=\frac{b-a}{2}>0

because b>ab>a. Thus a<ca<c. And,

bc=ba+b2=ba2>0,b-c=b-\frac{a+b}{2}=\frac{b-a}{2}>0,

Thus c<bc<b. Combining both inequalities, a<c<ba<c<b, so there exists a rational number cc between aa and bb.

This is cool, however it doesn’t mean that Q\Q is “complete”. For example, 2\sqrt{2} \notin Q\Q. Why does that matter? Well there’s a lot of reasons, but one of the most important is that Q\Q is not closed under taking limits. For example, consider the sequence an=1,1.4,1.41,1.414,1.4142,a_n = 1, 1.4, 1.41, 1.414, 1.4142, \dots, which is a sequence of rational numbers that converges to 2\sqrt{2}, which is not a rational number. So we have a sequence of rational numbers that converges to a non-rational number. This is a problem because we want to be able to take limits of sequences and still stay within the same set. Another problem is that Q\Q is not algebraically closed. For example, the polynomial x22x^2-2 has no roots in Q\Q. So we want to “fill in the gaps” of Q\Q to get a set that is closed under taking limits and algebraically closed, which leads us to the real numbers R\R and the complex numbers C\C which we won’t delve into yet. And that’s it for now.