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 is in a set by , and that is not in by .
For example, is a set with three elements, and by definition , , . However, the number four is not in , so . Now the order of the elements in a set does not matter, so , and so on. Similarly, a set only cares about distinct members so . 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 and , denoted by , which is the set of all elements that are in or in . In mathematics we use the word “or” in the inclusive sense, so if an element is in both and , it is still in . This is denoted as . Similarly, we can take the intersection of two sets and , denoted by , which is the set of all elements that are in both and . This is denoted as . 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 or { }.
The elements in sets can be anything (ignoring ZFC for now), so we can put sets inside a set. For example is a set containing one element, the empty set. Equivalently is a set with one element, the empty set (So ). To give another example, the set is a set with elements (not ), specifically, , , . Although B contains the element , we should recognise that and . 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 of course has and .
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 and , suppose that each is related to one element of , denoted by . Then we call a function from to . Denoted by . Here we call the domain of , and the codomain of . Also note that the range is the set . A function is injective (or one-to-one, i.e. each input has its own unique output) if implies that . A function is surjective (or onto, i.e. every codomain (output) element is reached by at least one domain (input) element) if, for each there exists some such that . A function is bijective if it is both injective and surjective.
Naturals, Integers, and Rationals
Definition 4 (Natural numbers). The set of natural numbers denoted by is . An element of is a natural number.
Definition 5 (Integers). The set of integers is the set . An element of is an integer.
Definition 6 (Rationals). The set of rationals is the set
An element of is a rational number.
These sets build on each other, so we have . 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, 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 is closed under an operation if for each , the result is also in .
Similarly, is also closed under addition and multiplication, but not subtraction or division (subtracting from returns , which is not in , and dividing by returns , which is also not in ). So we can see that is closed under some operations, but not others. If we introduce the integers , we fill in the “gaps” of as is closed under everything that is closed under, and also closed under subtraction. However, is not closed under division (the same problem; dividing by returns and ). As you’d expect, the rationals fill in the “gaps” of as is closed under everything that is closed under, while also being closed under division (except for division by zero, which is undefined, and also why we define in its definition). And so the set of integers contains all the natural numbers, hence , and the set of rationals contains all the integers, hence . Leaving us with .
So we have a pretty cool set to work with, the rationals . Let’s precisely define some of the properties of . First is of course closure, under addition, subtraction, multiplication, and division. A way to write this precisely is to say if , then (closure under addition). If , then (closure under subtraction). If , then (closure under multiplication). If and , then (closure under division). Another interesting property is the density of the rationals.
Theorem 8 (Density). Between any two rational numbers and , we can always find another rational number .
Proof. Let with . Define . Since is closed under addition and division by non-zero rationals, .
Now,
because . Thus . And,
Thus . Combining both inequalities, , so there exists a rational number between and .□
This is cool, however it doesn’t mean that is “complete”. For example, . Why does that matter? Well there’s a lot of reasons, but one of the most important is that is not closed under taking limits. For example, consider the sequence , which is a sequence of rational numbers that converges to , 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 is not algebraically closed. For example, the polynomial has no roots in . So we want to “fill in the gaps” of to get a set that is closed under taking limits and algebraically closed, which leads us to the real numbers and the complex numbers which we won’t delve into yet. And that’s it for now.