Chapter 1 Real Numbers
Chapter 1 Real Numbers
fr
1 Introduction
Real Numbers form the foundation of Mathematical Analysis, providing a vast array of Mathematical concepts
and applications. They are defined as the set that includes the natural numbers, integers, rational numbers, and
irrational numbers.
In this chapter, we present several fundamental properties of real numbers, including the absolute value, the
integer part, interval, the density of Q in R, and basic algebraic identities.
2 Basic definitions
1. Natural numbers The set of numbers {0, 1, 2, . . .}, is called natural numbers and it is denoted by N.
That is,
N = {0, 1, 2, . . . , n} .
2. Integer numbers The set of numbers {. . . , −3, −2, −1, 0, 1, 2, . . .}, is called integers numbers and it is
denoted by Z. That is,
Z = {. . . , −3, −2, −1, 0, 1, 2, . . .} .
3. Rational numbers All numbers of the form ab , where a and b are integers and b 6= 0, are called rational
numbers. This set is denoted by Q. That is,
na o
Q= / a, b ∈ Z, b 6= 0 .
b
a
To express a rational number b as a decimal, we divide the denominator b into the numerator a. The
resulting decimal either terminates or repeats. For example:
5 43 3
= 2.5, = 5.373, = 0.6;
2 8 5
are terminating decimals;
1 15 ¯ 1
= 0.333333 . . . = 0, 3̄, = 0.363636 . . . = 0, 36, = 0.333333 . . . = 0, 3̄
3 11 3
are repeating decimals.
The converse is also true; namely, every terminating or repeating decimal represents a rational number.
For example:
4. Irrational numbers A number is called irrational if its decimal expansion neither terminates nor repeats.
For example:
√
π = 3.141592653 · · · , 2 = 1.414213562 · · ·
5. Real numbers The set which contains both rational and irrational numbers is called the real numbers
and is denoted by R.
1
3 Some properties of the Set of Real Numbers
3.1 The absolute value of a real number
Definition 1. The absolute value of a real number x is defined by
(
x if x ≥ 0,
|x| =
−x if x < 0.
− | x |≤ x ≤| x | and − | y |≤ y ≤| y | .
− (| x | + | y |) ≤ x + y ≤| x | + | x |,
thus
|x + y| ≤ |x| + |y| .
− | x − y |≤| x | − | y |≤| x − y |⇔ || x | − | y || ≤| x − y | .
2
Second proof (Using algebraic identities), we compute
q
2
| x − y | = (x − y)
p
= x2 + y 2 − 2xy
q q
2 2 2
p
≥ x2 + y 2 − 2 |x| |x| = |x| + |y| − 2 |x| |y| = (|x| − |y|) = ||x| − |y|| .
Hence
| x − y |≥ ||x| − |y|| .
|x − 1| + |x − 2| = 5. (5)
First, we need to eliminate the absolute value in equation (5) by using the defintion of absolute value, so we
constract the following singn table
−∞ 1 2 +∞
|x − 1| −x + 1 x−1 x−1
|x − 2| −x + 2 −x + 2 x−2
|x − 1| + |x − 2| = 5 −2x + 3 = 5 1=5 2x − 3 = 5
−2x + 3 = 5 ⇒ x = −1,
S1 = {−1} .
S2 = ∅.
−2x − 3 = 5 ⇒ x = 4,
S3 = {−1} .
3
Exercise 1. Try to solve this exercise on your own before consulting the solution
i). |x + 1| + |x − 2| + |x − 5| = 7;
ii). |x| − |x − 1| + 3 |x − 2| − 2 |x − 3| = x + 1.
n ≤ x < n + 1.
This integer n is called the integer part of x or the floor of x. It is denoted by n = [x], that is
In other words, [x] is the greatest integer less than or equal to x, and is given by
[x] = max {n ∈ Z, n ≤ x} .
[nx]
∗
1). ∀x ∈ Z, [x] = x; 5). ∀x ∈ R, ∀x ∈ N , = [x] ;
n
2). ∀x, y ∈ R x ≤ y ⇒ [x] ≤ [y] ; 6). ∀x, y ∈ R+ , [x.y] ≤ [x] . [y] ;
3). ∀x ∈ R, ∀k ∈ Z, [x + k] = [x] + k; 7). ∀x ∈ R, x − 1 < [x] ≤ x;
4). [x] + [y] ≤ [x + y] ≤ [x] + [y] + 1; 8). ∀x, y ∈ R [x + y] − [x] − [y] ∈ {0, 1} .
4
1. For (7), we begin by recalling the defintion of integer part of a real number. For all x ∈ R, the following
inequality holds:
[x] ≤ x < [x] + 1. (6)
Subtracting 1 from each side of the strict equality x < [x] + 1, we obtain
x − 1 < [x] . (7)
Combining inequalities (6) and (7), we deduce the following doube inequality
x − 1 < [x] ≤ x.
2. For (8), according to definition of the integer part of a real number, we have
∀x ∈ R, x − 1 < [x] ≤ x, (8)
∀x ∈ R, y − 1 < [y] ≤ y, (9)
∀x, y ∈ R, x + y − 1 < [x + y] ≤ x + y. (10)
By multiplying both sides of the inequalities (8) and (9) by - 1, we get
− x ≤ − [x] < −x + 1, (11)
− y ≤ − [y] < −y + 1. (12)
Adding inequalities (12), (11) and (10), we obtain
−1 < [x + y] − [x] − [y] < +2.
Note that the expression [x + y] − [x] − [y] ∈ Z, then, the only iinteger between −1 and 2 are 0 and 1.
Therefor, we conclude
[x + y] − [x] − [y] ∈ {0, 1} .
Exercise 2. Try to solve this exercise on your own before consulting the solution
1. Prove properties 1 to 6 of the integer part of a real number.
4. Prove that
1
∀x ∈ R, [x] + x + = [2x] .
2
5. Let n be a positive integer. Prove that for any real number x,
1 n−1
[nx] = [x] + x + + ··· + x + .
n n
6. Solve in R the equation
[x [x]] = 1.
5
3.3 Interval
As we have seen, Mathematical Analysis often studies subsets of R that have elements between two fxed
numbers. These subsets are called intervals
Definition 3. An interval is a subset I of R such that
∀a, b ∈ I ∀x ∈ R (a ≤ x ≤ b =⇒ x ∈ I) .
Example 3.
1. I = [1, 2] and J = [4, 5] , are intervals, but D = I ∪ J = [1, 2] ∪ [4, 5] is not, because for x ∈ I ⊂ D
and y ∈ J ⊂ D, ∃z = 3, x < z = 3 < y then 3 ∈ / D.
5. Half-open intervals
6. Unbounded Intervals:
3.5 Density of Q in R
Definition 4. Let A ⊂ R. We say A is dense in R if, between any two distinct real numbers, there exixts an
element of A.
Theorem 1. The rational numbers are dense in the reals ; that is, if a and b are real numbers with a < b, there
is a rational number p/q such that a < p/q < b.
Exercise 3. If a and b are two rational numbers, a < b, prove then that there exists an element c ∈ Q, such
that a < c < b.
Solution 1. We have
a+b
a < b ⇒ a + a < a + b ⇒ 2a < a + b ⇒ a < (13)
2
Also
a+b
a < b ⇒ a + b < b + b ⇒ a + b < 2b ⇒ <b (14)
2
Combining (13) and 14,
a+b
a =< c = =< b.
2
6
3.6 Upper and lower bounds, maximum and minimum, supremum and infimum
3.6.1 Upper and Lower Bounds
i) The real number M is called an upper bound of A if a ≤ M for every a ∈ A. In this case, A is said to
be bounded above by M , i.e.
∃M ∈ R, ∀a ∈ A a ≤ M.
ii) The real number m is called a lower bound of A if a ≥ m for every a ∈ A. In this case, A is said to be
bounded below by m, i.e.
∃m ∈ R, ∀a ∈ A a ≥ m.
∃(M, m) ∈ R2 , ∀x ∈ A m ≤ x ≤ M.
Example 4.
1. The subsets Q and Z of R are neither bounded above nor bounded below.
3. The set {2, 3, 4, 5} is bounded above by 5 and also bounded above by 6, 7, 8, etc. It is bounded below by
2 and also bounded below by −1, −2 − 3, etc. Therefore, {2, 3, 4, 5} is bounded as well.
Remark 2.
i) The upper and lower bounds of a set A of R are not unique. Indeed, in R the set E = [2, 3[ has an infnite
number of lower and upper bounds.
ii) The upper and lower bounds of a set A can belong to A or not. Indeed, for the set A = {3, −2, 0, 1, 5, 7},
−4 and −3 are two lower bounds of A, 3 belonging to A and 6 not belonging to A.
1. The real number M is called the maximum of A if M ∈ A and if M ≥ a for every a ∈ A. In this case,
we write M = max A, i.e.
(
∀a ∈ A a ≤ max A;
max A ∈ A.
2. The real number m is called the minimum of A if m ∈ A and if m ≤ a for every a ∈ A. In this case, we
write m = minA, i.e.
(
∀a ∈ A a ≤ min A;
min A ∈ A.
Example 5.
As observed above, a set may be bounded above and yet have no maximum, and it may be bounded below and
yet have no minimum. However, whenever they exist, the maximum and the minimum are unique.
7
3.7 Supremum and Infimum
Definition 7. Let A be a non-empty subset of R
i) If A is bounded above, the minimum upper bound of A is called the supremum and is denoted sup A. If
A is not bounded above, then we write sup A = +∞
ii) If A is bounded below, the maximum lower bound of A is called the infimum and is denoted inf A. If A
is not bounded below, then we write inf A = −∞.
In the literature, the supremum is also called least upper bound, abbreviated l.u.b., and the infimum is also
called greatest lower bound, abbreviated g.l.b.
Example 6. We have
Example 7. We have
1. If a non-empty set A of real numbers is bounded above, then sup A is the unique real number M such
that (
∀x ∈ A, x ≤ M ;
sup A = M =
∀ε > 0, ∃xε ∈ A, M − ε < xε .
2. If a non-empty set A of real numbers is bounded below, then inf A is the unique real number m such that
(
∀x ∈ A x ≥ m;
inf A = m =
∀ε > 0, ∃xε ∈ A, m + ε > xε .
Solution 2. Let show that sup ([0, 2[) = 2. Using the caracterisation of the least least upper bound (supre-
mum), we aim to show that 2 is the supremum of the set A = [0, 2[. That is, we must verify the following two
conditions:
∀x ∈ A, x ≤ 2; (15)
∀ε > 0, ∃xε ∈ A, 2 − ε < xε . (16)
0 ≤ x < 2 ⇒ x ≤ 2.
8
ii) Case 2: 2 − ε ∈ ]−∞, 0[.
In this case, it’s enough to take any point xε ∈ R, such that 0 ≤ xε < 2.
Since both conditions (15) and (16) hold, we conclude that 2 is least upper bound of A. Therefore,
i). A is not-empty.
ii). A is bounded.
Solution 3.
1. Non-emptiness of A :
We observe that A 6= ∅, because for example, when n = 4 ∈ N − {0, 1, 2}, we have
6
0=3− ∈ A.
4−2
Therefore A is not empty.
2. Boundedness of: A
We will show that A is bounded. Let n ∈ N with n ≥ 4, we have
1 6 6 6
n≥3⇒n−2≥1⇒0< ≤1⇒0< ≤ 6 ⇒ −6 ≤ − < 0 ⇒ −3 ≤ 3 − < 3.
n−2 n−2 n−2 n−2
Hence, for all x ∈ A,
−3 ≤ x < 3.
Thus, A is bounded below by −3 and bounded above by +3, so it is a bounded set.
9
i) The first condition is already satisfied, since for all n ≥ 3,
6
3− < 3.
3−2
ii) Now consider the second condition, let ε > 0 be given, we have to find nε ∈ N−{0, 1, 2} , such that:
6 6 6 6
3− >3−ε⇔− > −ε ⇔ ε > ⇔ nε > + 2.
nε − 2 nε − 2 nε − 2 ε
6
It suffices to take nε = E + 2 + 1 ∈ N − {0, 1, 2} .
ε
Thus,
sup A = 3.
Therefore, sup A = 3 ∈
/ A, so
max A does not exist.
Exercise 5. Try to solve this exercise on your own before consulting the solution
1.
2.
3.
Theorem 2 (Binomial Theorem for positive integer). If n is any positive integer, then
n n n−0 0 n n−1 1 n 0 n
(x + y) = x y + x y + ··· + x y , x, y ∈ R,
0 1 n
i,e.
n
n
X n
(x + y) = xn−k y k .
k
k=0
This is called binimial theorem.
Here,
n n n
, ,..., ,
0 1 n
are called binomial coefficients and
n n!
= , pour n ≥ k ≥ 0.
k (n − k)!k!
Theorem 3. For every n ∈ N∗ and a, b ∈ R, we have
n−1
X
xn − y n = (x − y) xn−1−k y k
k=0
x3 + y 3 = (x + y)(x2 − xy + y 2 ).
10