Professional Documents
Culture Documents
Lecture 2.1
1
The Real Numbers R 2 / 34
Algebraic Properties of R
The set R comes equipped with two binary operations denoted by + (addition) and ·
(multiplication). Let a, b, c ∈ R. The above operations satisfy the following properties.
A1. a + (b + c) = (a + b) + c
A2. a+b=b+a
A3. a+0= a
A4. There exists −a ∈ R such that a + (−a) = 0.
M1. a · (b · c) = (a · b) · c
M2. a·b=b·a
M3. a·1= a
M4. If a , 0, then there exists a−1 ∈ R such that a · a−1 = 1.
RSH MA313L2.1 – 3 / 34
Algebraic Properties of R
The set R comes equipped with two binary operations denoted by + (addition) and ·
(multiplication). Let a, b, c ∈ R. The above operations satisfy the following properties.
DL. a · (b + c) = a · b + a · c
RSH MA313L2.1 – 4 / 34
Theorem
(a) If z, a ∈ R with z + a = a, then z = 0.
(c) If a ∈ R, then a · 0 = 0.
Proof. Exercise.
RSH MA313L2.1 – 5 / 34
Theorem
Let a, b ∈ R.
Proof. Exercise.
RSH MA313L2.1 – 6 / 34
2
Theorem
√
2 is an irrational number.
(i) a, b ∈ P ⇒ a+b∈P
(ii) a, b ∈ P ⇒ ab ∈ P
(iii) a∈R ⇒ (a ∈ P ∨ a = 0 ∨ −a ∈ P)
RSH MA313L2.1 – 8 / 34
Theorem: Properties of R
Let a, b, c ∈ R.
(i) a+c=b+c ⇒ a= b
(ii) a0 = 0
(iii) (−a)b = −ab
(iv) (−a)(−b) = ab
(v) ac = bc, c , 0 ⇒ a = b
(vi) ab = 0 ⇒ a = 0 ∨ b = 0
Proof. Exercise.
RSH MA313L2.1 – 9 / 34
3
Theorem: Ordering Properties
Let a, b, c ∈ R.
(i) a ≤ b ⇒ −b ≤ −a
(ii) a ≤ b, c ≤ 0 ⇒ bc ≤ ac
(iii) 0 ≤ a, 0 ≤ b ⇒ 0 ≤ ab
(iv) 0 ≤ a2
(v) 0<1
(vi) 0 < a ⇒ 0 < a−1
(vii) 0 < a < b ⇒ 0 < b−1 < a−1
Proof. Exercise.
RSH MA313L2.1 – 11 / 34
ACTIVITY
Refer to Bartle–Sherbert’s Introduction to Real Analysis (3rd Edn).
(a) |a| ≥ 0
4
Corollary
Let a, b ∈ R.
Corollary
If a1 , a2 , . . . , an are real numbers, then
ǫ–neighbourhood
Let a ∈ R and ǫ > 0. Then the ǫ–neighbourhood of a is the set
Theorem
Let a ∈ R. If x belongs to the neighbourhood Vǫ (a) for all ǫ > 0, then x = a.
Proof. Exercise.
RSH MA313L2.1 – 19 / 34
ACTIVITY
Refer to Bartle–Sherbert’s Introduction to Real Analysis (3rd Edn).
5
Theorem: Properties of absolute value
Let a, b ∈ R.
(a) |a| ≥ 0
Corollary
If a1 , a2 , . . . , an are real numbers, then
ǫ–neighbourhood
Let a ∈ R and ǫ > 0. Then the ǫ–neighbourhood of a is the set
Theorem
Let a ∈ R. If x belongs to the neighbourhood Vǫ (a) for all ǫ > 0, then x = a.
Proof. Exercise.
RSH MA313L2.1 – 24 / 34
Cardinality
‘Cardinality’ of a set is a property that describes the size of the set.
Two sets S, T have the same cardinality if there is a bijection f from S to T such that
D( f ) = S and R( f ) = T. We then write
card(S) = card(T).
RSH MA313L2.1 – 25 / 34
6
Example
Clearly if S = {1, 2, 3} and T = {a, b, c}, then card(S) = card(T) since
1 ↔ a
2 ↔ b
3 ↔ c
,
RSH MA313L2.1 – 26 / 34
Example
The intervals (0, 1) and (5, 7) have the same cardinality since f (x) = 2x + 5 is a bijection
between the intervals. ,
RSH MA313L2.1 – 27 / 34
Example
card((3, 4)) = card((10, 15)) since
15 − 10
f (x) − 10 = (x − 3) ⇔ f (x) = 5x − 5
4−3
is a bijection between the open intervals (3, 4) and (10, 15). ,
RSH MA313L2.1 – 28 / 34
Exercise
Find a bijection between the open intervals (a, b) and (c, d). ,
RSH MA313L2.1 – 29 / 34
7
Theorem
Let S, T, U be sets. If
Claim: g ◦ f : S → U is bijective.
Let s1 , s2 ∈ S.
Uncountability of (0, 1)
The interval (0, 1) is uncountable.
Note Well.
• Every real number x ∈ (0, 1) has a decimal expansion
x = 0.a1 a2 a3 a4 . . . ,
8
Cantor’s Argument
Suppose (0, 1) is countable. Then there exists a bijection f : N → (0, 1).
Denote
x(n)
j
x < ran( f ),