Real Analysis: The Real Numbers
Algebra on $\mathbb{R}$
Axiomatic Definition
The real numbers are a set of numbers, denoted as $\mathbb{R}$, that extend the rational numbers to ensure that there are no "gaps" in the number line. For example, there is neither a rational number whose square is $2$ nor one that measures the ratio of the circumference of a circle to its diameter, but there are real numbers that fit these criteria, namely $\sqrt{2}$ and $\pi$.
The real numbers are defined according to a list of axioms, or statements we take as true by definition. In rigorous mathematics, every true statement must follow from some other, more fundamental true statement, but at some point we have to dig our heels in and assume a few very fundamental things to be true. The list of axioms should therefore ideally be small, where each one defines a key aspect of the set. One noteworthy detail is that no axiom should be able to be derived from a combination of the other ones  if this were the case, we would have no reason to assume it as an axiom, as it would (by definition) be implied by the others.
Let $\mathbb{R}$ be the real numbers, which form a set with the following properties:

$\mathbb{R}$ is closed under the addition function $+ : \mathbb{R} \times \mathbb{R} \rightarrow \mathbb{R}$, which has the following properties

Commutativity of addition: $a + b = b + a$ for all $a, b \in \mathbb{R}$.

Associativity of addition: $a + (b + c) = (a + b) + c$ for all $a, b, c \in \mathbb{R}$.

Additive identity: There exists an element $0 \in \mathbb{R}$ called zero such that $a + 0 = a$ for all $a \in \mathbb{R}$.

Additive inverse: For each $a \in \mathbb{R}$ there exists an element $a \in \mathbb{R}$ such that $a + (a) = 0$.


$\mathbb{R}$ is closed under the multiplication function $\cdot : \mathbb{R} \times \mathbb{R} \rightarrow \mathbb{R}$, which has the following properties:

Commutativity of multiplication: $a \cdot b = b \cdot a$ for all $a, b \in \mathbb{R}$.

Associativity of multiplication: $a + (b + c) = (a + b) + c$ for all $a, b, c \in \mathbb{R}$.

Multiplicative identity: There exists an element $1 \in \mathbb{R}$ called one such that $a \cdot 1 = a$ for all $a \in \mathbb{R}$.

Multiplicative inverse: For each $a \neq 0 \in \mathbb{R}$ there exists an element $\dfrac{1}{a}$ such that $a \cdot \dfrac{1}{a} = 1$. The multiplicative inverse of a value is also called its reciprocal.


The distributive law holds: $a \cdot (b + c) = a \cdot b + a \cdot c$ for all $a, b, c \in \mathbb{R}$.

The Least Upper Bound property holds on $\mathbb{R}$.

$\mathbb{R}$ contains $\mathbb{Q}$ as a subfield.

There exists an order relation < with the following properties

If $y < z$, then $x + y < x + z$.

If $x > 0$ and $y > 0$, then $xy > 0$.

While this list of properties may seem a bit long, you will quickly discover that many familiar algebraic operations must be derived from them. Even something as seemingly obvious as the fact that if $x + y = x$, then $y = 0$ must be proven from the axioms.
The Field Axioms
The above arithmetic axioms pertaining to addition, multiplication, and distributivity are collectively called the field axioms. A field is any set that fulfills these axioms, and the letter $F$ (or $\mathbb{F}$) is often used instead of $\mathbb{R}$ to denote this generalization. A field that also fulfills the two ordering axioms above is, naturally, an ordered field. A subfield is a field that is a subset of another field and uses the same arithmetic operations.
Other examples of fields include the rational numbers and complex numbers, although the natural numbers and integers are not fields. Fields don't necessarily need to be "numbers," as any set that fulfills the axioms is, by definition, a field. (One such more exotic example of a field is the set of all rational functions over some field $F$, i.e. all functions made up of one polynomial divided by another.) However, fields themselves are more closely studied in abstract algebra, along with other algebraic structures like groups and rings. Real analysis is interested in the particular field of the real numbers.
Notation
Some familiar notation regarding parenthesis, addition, and multiplication is used for real analysis just as it is for high school algebra. Namely, parenthesis are only used when necessary, and the multiplication dot is elided entirely. Thus, we write $ab + c$ instead of $(a \cdot b) + c$. Likewise, multiplicative inverses are written as the denominator of fractions, with the terms by which they are multiplied placed in the numerator. Thus we write $\dfrac{b}{a}$ instead of $a^{1}b$. Other shortcuts, such as the fact that $a = 1 \cdot a$, are results we must first prove.
Rational and Irrational Numbers
$\mathbb{R}$ contains $\mathbb{Q}$ as a subfield. This means that all of the rational numbers are also real numbers, and the algebraic properties defined for them are the same as for $\mathbb{Q}$ itself. Note that this does not mean more properties can't be defined for them as part of $\mathbb{R}$. Indeed, $\sqrt{2}$ not a rational number, as proved below, but that does mean it's not a real number. Which leads us to irrational numbers.
The irrational numbers are the real numbers that are not rational numbers. Formally, the irrational numbers are $\mathbb{R}  \mathbb{Q}$. There is unfortunately no standardized symbol for the irrational numbers, but currently the most popular seems to be $\mathbb{P}$. If we wish to use $\mathbb{P}$ to denote the set of irrational numbers, we will explicitly say so.
Real Functions
A function whose domain is $\mathbb{R}$ is called a function of a real variable. Likewise, a function whose codomain is $\mathbb{R}$ is called a real valued function. A real valued function of a real value is called a real function for short. Real analysis is largely the study of functions of real variables, and most often real functions.
Algebra on real functions is defined as we might expect:

$(f + g)(x) = f(x) + g(x).$

$(f  g)(x) = f(x)  g(x).$

$(f \cdot g)(x) = f(x)(g).$

$(f / g)(x) = \dfrac{f(x)}{g(x)}.$

$(f \circ g)(x) = f(g(x)).$
The Extended Real Numbers
While there is no greatest real number, we can define the symbol $\infty$, called infinity or positive infinity, such that $\infty > x$ for all $x \in \mathbb{R}$. Likewise, we can define $\infty$, accordingly called negative infinity, such that $\infty < x$ for all $x \in \mathbb{R}$. We call the set $\mathbb{R} \cup \{\infty, \infty\}$ the extended real numbers, as it includes both positive and negative infinity, and denote it as $\overline{\mathbb{R}}$.
The extended real numbers are defined to have the following algebraic properties:

$x + \infty = \infty$

$x  \infty = \infty$

$\dfrac{x}{\infty} = \dfrac{x}{\infty} = 0$

$x\infty = \infty$ if $x > 0$ and $x\infty = \infty$ if $x < 0$

$x(\infty) = \infty$ if $x > 0$ and $x(\infty) = \infty$ if $x < 0$

$0\infty$ is undefined.
To distinguish the strictly real numbers from the two infinities, the former are called finite.
Construction of $\mathbb{R}$
What is a construction? It's a process by which a more complicated set is assembled out of more primitive sets that are known to exist according to some prior and more fundamental set of axioms. How do we know which objects exist? For one, the axioms of set theory define a few very primitive sets into existence, such as the empty set, out of which the natural numbers can be constructed. In turn, there is a construction of the integers from the natural numbers, and a construction of the rational numbers from the integers, and finally a construction of the real numbers from the rational numbers. In fact, there are a number of ways of performing this last construction. Many of them are fairly obscure, but two are well known. One construction uses the concept of a Dedekind cut, and the other uses the concept of a Cauchy sequence. The one thing common to all of these constructions is that they form a set that fulfills the axioms listed above.
You might be asking  which construction is the "real" one? Which one do we "use" when doing real analysis? The answer is actually none of them. We just use the axioms as listed. To wit, the entire mark of a successful construction of $\mathbb{R}$ is that it perfectly fulfills all of the axioms. Once we have constructed some set that does that, it makes no difference whatsoever which one may be lurking in the background, as all of the interesting properties of $\mathbb{R}$ derive from the axioms and not any details particular to the construction. Indeed, we may skip all this construction and simply define the sets $\mathbb{N}$ through $\mathbb{R}$ to exist in the first place if we wanted. So then why construct them at all? One reason is that it is philosophically satisfying to be able to build up more sophisticated mathematical objects out of simpler ones, i.e. from the "ground up." We like to be confident that we can break down even the loftiest theorems of integrals, probability, and topology into statements concerning the fundamental axioms of set theory and logic. Formally constructing $\mathbb{R}$ from $\mathbb{Q}$ lets us sleep easy at night.
In contrast, sets that are possible to define but not construct may be less interesting  if we can't actually come up with an example of such an object, what exactly are we studying in the first place? Additionally, the more extensive the set of axioms we require in order to construct something, the harder it is to map it onto physical phenomena in the real world. In fact, some stricter mathematicians object to the existence of the real numbers themselves, despite the constructions, because the constructions rely on certain axioms pertaining to the existence of infinite sets that the mathematicians don't think reflect physical reality very well. For example, computers use finite bytes to do calculations on either integers or rational numbers within a certain amount of precision, and all of our scientific and engineering tools use finite precision, so who needs infinity? Why make a mathematical construction that clearly has a hard time mapping onto reality? Alternatively, $\sqrt{2}$ is clearly a useful representation of the length of the hypotenuse of an isosceles right triangle, and every finite approximation we make of it tends towards that number. Ultimately the answer to these philosophical chestnuts is that we like the real numbers around here, so we're going to study them.
Problems
Cancellation Law (Addition): Show that if $x + y = x + z$, then $y = z$.
$ x + y = x + z \\ x + (x + y) = x + (x + z) \\ (x + x) + y = (x + x) + z \\ 0 + y = 0 + z \\ y = z $
Zero is Unique: Show that if $x + y = x$, then $y = 0$.
$ x + y = x \\ (x) + (x + y) = x + x \\ (x + x) + y = x + x \\ 0 + y = 0 \\ y = 0 \\ $
Additive Inverses are Unique: Show that if $x + y = 0$, then $y = x$.
$ x + y = 0 \\ x + (x + y) = x + 0 \\ (x + x) + y = x \\ 0 + y = x \\ y = x \\ $
Additive Inverse of Additive Inverse is the Original Value: Show that $(x) = x$.
$x + (x) = 0 \\ x + ((x)) = 0 \\ x + (x) = x + ((x)) \\ x = (x)$
Cancellation Law (Multiplication): Show that if $x \neq 0$, and $x \cdot y = x \cdot z$, then $y = z$.
If $x \neq 0$, then $\dfrac{1}{x}$ exists. Multiplying both sides of the equation gives the desired result:
$ xy = xz \\ \left(\dfrac{1}{x}\right)(xy) = \left(\dfrac{1}{x}\right)(xz) \\ \left(\dfrac{1}{x} \cdot x \right) \cdot y = \left(\dfrac{1}{x} \cdot x \right) \cdot z \\ 1y = 1z \\ y = z \\$
Multiplicative Identity is Unique: Show that if $x \neq 0$ and $xy = x$, then $y = 1$.
If $x \neq 0$, then $\dfrac{1}{x}$ exists. Multiplying both sides by $\dfrac{1}{x}$ gives the desired result:
$ xy = x \\ \left( \dfrac{1}{x} \right) (xy) = \left( \dfrac{1}{x} \right) x \\ \left( \dfrac{1}{x} \cdot x \right) \cdot y = \left( \dfrac{1}{x} \right) x\\ 1y = 1 \\ y = 1 \\ $
Reciprocals Are Unique: Show that if $x \neq 0$ and $xy = 1$, then $y = \dfrac{1}{x}$.
$ xy = 1 \\ \left( \dfrac{1}{x} \right)(xy) = \dfrac{1}{x}(1) \\ \left( \dfrac{1}{x} \cdot x \right) \cdot y = \dfrac{1}{x} \\ 1y = \dfrac{1}{x} \\ y = \dfrac{1}{x} \\ $
Show that if $x \neq 0$, then $\dfrac{1}{\frac{1}{x}} = x$.
Since $x$ is nonzero, $\dfrac{1}{x}$ exists. Likewise, since $\dfrac{1}{x}$ is itself nonzero, $\dfrac{1}{\frac{1}{x}}$ exists. Arithmetic and the cancellation law produce the desired result:
$ x \cdot \dfrac{1}{x} = 1 \\ \dfrac{1}{\frac{1}{x}} \cdot \dfrac{1}{x} = 1 \\ x \cdot \dfrac{1}{x} = \dfrac{1}{\frac{1}{x}} \cdot \dfrac{1}{x} \\ x = \dfrac{1}{\frac{1}{x}} \\ $
Prove that $0x = 0$ for all $x \in \mathbb{R}$.
$ 0x = (0 + 0) \cdot x \\ 0x = 0x + 0x \\ 0 = 0x \\ $
Show that if $x \neq 0$ and $y \neq 0$, then $xy \neq 0$.
Proof by contradiction. Assume $xy = 0$. By the multiplicative inverse axiom, we have
$ 1 = \left(\dfrac{1}{x}\right)x \\ 1 = \left(\dfrac{1}{y}\right)y \\ 1 \cdot 1 = \left(\dfrac{1}{x}\right)x \cdot \left(\dfrac{1}{y}\right)y \\ 1 = \left(\dfrac{1}{x}\right)\left(\dfrac{1}{y}\right)xy \\ 1 = \left(\dfrac{1}{x}\right)\left(\dfrac{1}{y}\right)0 \\ 1 = 0 \\ $
Clearly $1$ is not equal to $0$. Thus $xy \neq 0$.
Show that $x = 1 \cdot x$.
$ 1x + x = 1x + 1x \\ 1x + x = (1 + 1)x \\ 1x + x = 0 \\ (1x + x)  x = x \\ 1x + (x  x) = x \\ 1x = x \\ $
Show that $(x)y = (xy) = x(y)$.
$(x)y + xy = (x +x)y \\ (x)y + xy = 0y \\ (x)y + xy = 0 \\ (x)y = (xy)$
The proof that $(xy) = x(y)$ is the same:
$x(y) + xy = x(y+y) \\ x(y) + xy = x0 \\ x(y) + xy = 0 \\ x(y) = (xy)$
Show that $x^{1}y^{1} = (xy)^{1}$.
$ x^{1}y^{1} = 1 \cdot x^{1}y^{1} \\ x^{1}y^{1} = (xy)(xy)^{1}x^{1}y^{1} \\ x^{1}y^{1} = (x^{1}x)(y^{1}y)(xy)^{1} \\ x^{1}y^{1} = 1\cdot1\cdot(xy)^{1} \\ x^{1}y^{1} = (xy)^{1} \\ $
Show that if $x > 0$ and $y > 0$, then $x + y > 0$.
Let $x \gt 0$. By the first ordering property, $x + y \gt y$. Since $y \gt 0$, $x + y \gt 0$ by transitivity of order relations.
Show that if $x > 0$, then $x < 0$. Likewise, show that if $x < 0$, then $x > 0$.
If $x > 0$, then by the first ordering axiom $x + (x) > 0 + (x)$, so $x < 0$. Likewise, if $x < 0$, then $x + (x) < 0 + (x)$, so $x > 0$.
Show that if $x >0$ and $y < 0$, then $xy < 0$. Likewise, show that $xy > 0$ when $x < 0$ instead.
If $x > 0$ and $y < 0$, then $0 < y$. By the second ordering axiom, $0 < x(y) = (xy)$. Adding $xy$ to both sides shows that $xy < 0$.
If instead $x < 0$, then $0 < x$. By the second ordering axiom, $0 < (x)(y) = (1)x(1)y = xy$.
Show that if $z > 0$, then $x < y$ if and only if $zx < zy$.
Assume $x < y$. By trichotomy, either $zx < zy$, $zx = zy$, or $zx > zy$. If $zx = zy$, then $x = y$, which is a contradiction. If instead $zx > zy$, then $zx  zy = z(xy) > 0$. But $x  y < 0$, and therefore by the prior proof $z(xy) < 0$, which is a contradiction. Therefore $zx < zy$.
Conversely, assume $zx < zy$. By trichotomy, either $x < y$, $x = y$, or $x > y$. If $x = y$, then $zx = zy$, which is a contradiction. If instead $x > y$, then $y  x < 0$. Likewise, $zy  zx = z(yx) > 0$. But this is a contradiction, as by the prior proof $z(yx) < 0$. Therefore $x < y$.
Show that $0 < a < 1$ and $b > 0$ if and only if $0 < ab < b$.
Assume $0 < a < 1$ and $b > 0$. Then $ab > 0$ follows directly from the second ordering axiom. To show $ab < b$, note that $a < 1$, so $0 < 1  a$. Therefore by the second ordering axiom, $0 < (1a)b = b  ab$. Adding $ab$ to both sides reveals $ab < b$.
Conversely, assume $0 < ab < b$. Then $b > 0$ by transitivity. Likewise, since $ab < b$, then $0 < b  ab = (1a)b$. Note that $b^{1} > 0$, so by the second ordering axiom, $0 < (1a)b \cdot b^{1} = 1a$. Therefore $a < 1$. If $a = 0$, then $ab = 0$, which is a contradiction. If instead $a < 0$, then $ab < 0$, which is also a contradiction. Thus $a > 0$ by trichotomy. Therefore $0 < a < 1$.
Show that if $x < y$ then $y^{1} < x^{1}$ for all positive $x, y \in \mathbb{R}.$
$x < y \\ xy^{1} < yy^{1} \\ xy^{1} < 1 \\ (x^{1}x)y^{1} < x^{1} \\ y^{1} < x^{1} $
Show that $0 < x^{1} < 1$ if and only if $x > 1.$
Assume $x > 1.$ Then $x \cdot x^{1} > 1 \cdot x^{1}$, which simplifies to $1 > x^{1}.$ By trichotomy, we see that $x^{1} > 0,$ for if $x^{1}$, then $x \cdot x^{1} =$, and instead if $x^{1} < 0$, then $x \cdot x^{1} < 0,$ both of which are contradiction. Hence $0 < x^{1} < 1.$
Conversely, assume $0 < x^{1} < 1.$ By trichotomy, it must be that $x > 0,$ as otherwise $x^{1}x < 0$ when $x < 0$ or $x^{1}x = 0$ when $x = 0$, both of which are contradictions. Therefore $x^{1} \cdot x < 1 \cdot x,$ which simplifies to $1 < x.$
Summation Notation: Let $\{x_1, \ldots, x_n\}$ be a finite set of real numbers. Their sum is denoted with the $\Sigma$ symbol:
$$\sum\limits_{i=1}^{n} x_i = x_1 + \ldots + x_n$$
The index variable $i$ can also be used algebraically as well:
$$\sum\limits_{i=1}^{n} i = 1 + 2 + \ldots + n$$
Compute the following sums:

$\sum\limits_{i=1}^4 i$

$\sum\limits_{i=1}^6 3i$

$\sum\limits_{i=1}^5 2^i$

$\sum\limits_{i=1}^4 i = 1 + 2 + 3 + 4 = 10$

$\sum\limits_{i=1}^6 3i = 3(1) + 3(2) + 3(3) + 4(3) = 30$

$\sum\limits_{i=1}^5 2^i = 2^1 + 2^2 + 2^3 + 2^4 + 2^5 = 2 + 4 + 8 + 16 + 32 = 62$

Product of Sums I: Show that $c\sum\limits_{i=0}^{n} a_i = \sum\limits_{i=0}^{n} ca_i.$
Hint: Use induction.
Proof by induction. Base case: $c\sum\limits_{i=0}^{0} a_i = ca_0 = \sum\limits_{i=0}^{0}ca_i.$ Inductive step: Assume $c\sum\limits_{i=0}^{n}a_i = \sum\limits_{i=0}^{n}ca_i.$ Then
$ c\sum\limits_{i=0}^{n+1}a_i = c\left(\left(\sum\limits_{i=0}^{n}a_i\right) + a_{n+1}\right) \\ c\sum\limits_{i=0}^{n+1}a_i = c\left(\sum\limits_{i=0}^{n}a_i\right) + ca_{n+1} \\ c\sum\limits_{i=0}^{n+1}a_i = \left(\sum\limits_{i=0}^{n}ca_i\right) + ca_{n+1} \\ c\sum\limits_{i=0}^{n+1}a_i = \sum\limits_{i=0}^{n+1}ca_i $
The result follows by induction.
Product of Sums II: Show that $\left(\sum\limits_{i=0}^{n} a_i\right)\left(\sum\limits_{i=0}^{m} b_i\right) = \sum\limits_{i=0}^{n}\left(\sum\limits_{j=0}^{m} a_ib_j\right).$
Hint: Use induction.
Proof by induction. Base case:
$ \left(\sum\limits_{i=0}^0a_i\right)\left(\sum\limits_{j=0}^{m}b_j\right) = a_0\left(\sum\limits_{j=0}^{m}b_j\right)\\ \left(\sum\limits_{i=0}^0a_i\right)\left(\sum\limits_{j=0}^{m}b_j\right) = \left(\sum\limits_{j=0}^{m}a_0b_j\right)\\ \left(\sum\limits_{i=0}^0a_i\right)\left(\sum\limits_{j=0}^{m}b_j\right) = \sum\limits_{i=0}^{0}\left(\sum\limits_{j=0}^{m}a_ib_j\right)\\ $
Inductive step: Assume $\left(\sum\limits_{i=0}^{n}a_i\right)\left(\sum\limits_{j=0}^{m}b_j\right) = \sum\limits_{i=0}^{n}\left(\sum\limits_{j=0}^{m}a_ib_j\right).$ Then
$ \left(\sum\limits_{i=0}^{n+1}a_i\right)\left(\sum\limits_{j=0}^{m}b_j\right) = \left(a_{n+1} + \sum\limits_{i=0}^{n}a_i\right)\left(\sum\limits_{j=0}^{m}b_j\right) \\ \left(\sum\limits_{i=0}^{n+1}a_i\right)\left(\sum\limits_{j=0}^{m}b_j\right) = a_{n+1}\left(\sum\limits_{j=0}^{m}b_j\right) + \left(\sum\limits_{i=0}^{n}a_i\right)\left(\sum\limits_{j=0}^{m}b_j\right) \\ \left(\sum\limits_{i=0}^{n+1}a_i\right)\left(\sum\limits_{j=0}^{m}b_j\right) = \left(\sum\limits_{j=0}^{m}a_{n+1}b_j\right) + \sum\limits_{i=0}^{n}\left(\sum\limits_{j=0}^{m}a_ib_j\right) \\ \left(\sum\limits_{i=0}^{n+1}a_i\right)\left(\sum\limits_{j=0}^{m}b_j\right) = \sum\limits_{i=0}^{n+1}\left(\sum\limits_{j=0}^{m}a_ib_j\right) \\ $
The result follows by induction.
Let $x$ be a nonzero rational number and $y$ be an irrational number. Show the following:

$x + y$ is irrational.

$xy$ is irrational.

Proof by contradiction: Assume $x + y$ is rational. Then there exist some integers $a$ and $b$ such that $x + y = \dfrac{a}{b}$. Then $y = \dfrac{a}{b}  x$. But the righthand side is a rational number, as $\mathbb{Q}$ is closed under addition. Therefore $x + y$ is irrational after all.

Proof by contradiction: Assume $xy$ is rational. Then there exist some integers $a$ and $b$ such that $xy = \dfrac{a}{b}$. Then $y = \dfrac{a}{b}x^{1}$. But the righthand side is a rational number, as $\mathbb{Q}$ is closed under multiplication. Therefore $xy$ is irrational after all.

Archimedean Property: If $x, y \in \mathbb{R}$, and $x > 0$, then there exists a natural number $n \in \mathbb{N}$ such that $xn > y$.
Proof by contradiction. Assume that there does not exist a natural number $n \in \mathbb{N}$ such that $xn > y$. Then consider the set $A = \{ nx : n \in \mathbb{N} \}$. It follows that $y$ is an upper bound of $A$. Since $A$ has an upper bound, it must have a least upper bound, call it $\alpha$. Since $x > 0$, it follows that $\alpha  x < \alpha$, and $\alpha  x$ is not an upper bound of $A$. Therefore $\alpha  x < a$ for some $a \in A$. Then $a = mx$ for some $ m \in \mathbb{N}$, so $\alpha  x < mx$. Adding $x$ to both sides produces $\alpha < (m+1)x$. But this is a contradiction, since $(m+1)x \in A$ and $\alpha$ is the least upper bound of $A$. Therefore the Archimedean property must hold after all.
$\mathbb{Q}$ is dense in $\mathbb{R}$: Show that for every two distinct real numbers $a < b$, there is a rational number $q$ such that $a < q < b$.
Consider two real numbers $a$ and $b$ such that $a < b$. Then $b  a > 0$. By the Archimedean property, there is some $n \in \mathbb{N}$ such that $(ba)n > 1$. Likewise, there is some $p \in \mathbb{N}$ such that $p > na$, and there is some $q \in \mathbb{N}$ such that $q > na$. It follows that $q < na < p$. Note then that there is some $k \in \mathbb{N}$ such that $q \leq k \leq p$ and $k  1 \leq na < k$. By transitivity, we see that $na < k \leq 1 + na < nb$. Dividing through by $n$ shows that $a < \dfrac{k}{n} < b$.
Show that between every two distinct real numbers there is an irrational number.
Let $a, b \in \mathbb{R}$, and without loss of generality, assume that $a < b$.
Assume both $a$ and $b$ are rational. Note that $0 < \sqrt{2} < 2$. Therefore $0 < \dfrac{\sqrt{2}}{2} < 1$. Therefore $0 < \dfrac{(ba)\sqrt{2}}{2} < ba$, so $a < a + \dfrac{(ba)\sqrt{2}}{2} < b$. Because $\sqrt{2}$ is irrational, it follows that $a + \dfrac{(ba)\sqrt{2}}{2}$ is irrational.
Assume instead that either $a$ or $b$ is irrational. Then $\dfrac{a + b}{2}$ is irrational and $a < \dfrac{a + b}{2} < b$.
Finally, assume that $a$ and $b$ are both irrational. If $a + b$ is irrational, then $\dfrac{a + b}{2}$ is also irrational, and $a < \dfrac{a + b}{2} < b$. If instead $a + b$ is rational, then so is $\dfrac{a + b}{2}$. Then by the prior case, $\dfrac{a + \frac{a + b}{2}}{2} = \dfrac{3a + b}{4}$ is irrational and $a < \dfrac{3a + b}{4} < \dfrac{a + b}{2} < b$.