0% found this document useful (0 votes)
99 views6 pages

Real Analysis-2

Uploaded by

benulchenuka2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
99 views6 pages

Real Analysis-2

Uploaded by

benulchenuka2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Real Analysis – MA1014 - 2022 Batch

Chapter 1 – Real Numbers


The set of real numbers ℝ is defined as a complete ordered field axiomatically using 3 types of
axioms:
1. Field axioms (algebraic structure)
2. Order axioms (inequalities)
3. Completeness axiom.

1.1 Field axioms of ℝ


Definition 1.1.1: Field of real numbers ℝ.

Theorem 1.1.1: For every 𝑎, 𝑏, 𝑐 ∈ ℝ ,

1
H H S R Samarasiri, PhD, Department of Mathematics, University of Moratuwa, Sri Lanka
Last updated: 05/23/2023 23:45
Real Analysis – MA1014 - 2022 Batch

Proof: Exercise

Definition 1.1.2: The operations subtraction and division are defined as follows:
∀𝑎, 𝑏 ∈ ℝ ,
𝑎 − 𝑏 ≔ 𝑎 + (−𝑏)
𝑎
if 𝑏 ≠ 0, 𝑏 ∶= 𝑎 ⋅ 𝑏 −1 .

Definition 1.1.3:

2
H H S R Samarasiri, PhD, Department of Mathematics, University of Moratuwa, Sri Lanka
Last updated: 05/23/2023 23:45
Real Analysis – MA1014 - 2022 Batch

Theorem 1.1.2:

Proof is omitted.

Conjecture 1.1.1: An unproven idea by Goldbach,


Every even number greater than 2 is a sum of two primes.

Definition 1.1.4:

Cardinality of sets: Will be explained in class.

1.2 Order axioms of ℝ


As we have constructed the algebraic structure of ℝ, now we can define an order < on ℝ.

Definition 1.2.1: Order Axioms of ℝ

Further it is customary to consider 𝑏 > 𝑎 to be the same as 𝑎 < 𝑏 and we also write 𝑎 ≤ 𝑏 to
mean 𝑎 < 𝑏 𝑜𝑟 𝑎 = 𝑏 .

3
H H S R Samarasiri, PhD, Department of Mathematics, University of Moratuwa, Sri Lanka
Last updated: 05/23/2023 23:45
Real Analysis – MA1014 - 2022 Batch

Definition 1.2.2: Absolute value


𝑥, 𝑥≥0
|𝑥| ∶= {
−𝑥, 𝑥<0

Theorem 1.2.1:

Definition 1.2.3: Let 𝐴 be a non-empty subset of ℝ.

1. Given 𝑢 ∈ ℝ, we say that the set 𝐴 is bounded above by u, iff ∀𝑎 ∈ 𝐴, 𝑎 ≤ 𝑢.

2. We say that the set 𝐴 is bounded above, iff ∃𝑢 ∈ ℝ 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 ∀𝑎 ∈ 𝐴, 𝑎 ≤ 𝑢 .

3. Given 𝑢 ∈ ℝ, we say that 𝑢 is the maximum element of 𝐴, iff 𝐴 is bounded above by 𝑢 and
𝑢 ∈ 𝐴.

4. Given 𝑙 ∈ ℝ, we say that the set 𝐴 is bounded below by 𝑙, iff ∀𝑎 ∈ 𝐴, 𝑎 ≥ 𝑙.

5. We say that the set 𝐴 is bounded below, iff ∃𝑙 ∈ ℝ 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 ∀𝑎 ∈ 𝐴, 𝑎 ≥ 𝑙 .

6. Given 𝑙 ∈ ℝ, we say that 𝑙 is the minimum element of 𝐴, iff 𝐴 is bounded below by 𝑙 and
𝑙 ∈ 𝐴.

4
H H S R Samarasiri, PhD, Department of Mathematics, University of Moratuwa, Sri Lanka
Last updated: 05/23/2023 23:45
Real Analysis – MA1014 - 2022 Batch

7. We say that 𝐴 is bounded, iff 𝐴 is bounded above and 𝐴 is bounded below.

1.3 ℝ as a complete ordered field

Definition 1.3.1: Completeness axiom


16. The set of upper bounds of a non-empty 𝐴 ⊆ ℝ that is bounded above has a least
element, which we call the supremum of 𝐴 and denote as sup(A).
Important: For any 𝑢 ∈ ℝ,
a) 𝑢 is an upper bound of 𝐴 ⇒ sup(𝐴) ≤ 𝑢
b) 𝑢 < sup(𝐴) ⇒ 𝑢 is not an upper bound of 𝐴. (Contrapositive of a)

Theorem 1.3.1: Let 𝐴 ⊆ ℝ be non-empty and bounded above, and let 𝑢 ∈ ℝ ,


then 𝑢 < sup(𝐴) ⇒ ∃𝛼 ∈ 𝐴 ∶ 𝑢 < 𝛼 ≤ sup(𝐴).
Proof: Will be done in class.

Theorem 1.3.2: Let 𝐴 ⊆ ℝ be non-empty and bounded below, then the set of lower bounds has
a greatest element, which we call infimum of 𝐴 and is denoted as inf(𝐴).
Proof: Will be done in class.

Theorem 1.3.3: ℤ is not bounded above neither below.


Proof: Will be done in class.

Theorem 1.3.4: Archemedean Property

Proof is an exercise.

Theorem 1.3.5: Well Ordering Principle


1. Every non-empty subset of ℤ which is bounded above has a maximum.
2. Every non-empty subset of ℤ which is bounded below has a minimum.

5
H H S R Samarasiri, PhD, Department of Mathematics, University of Moratuwa, Sri Lanka
Last updated: 05/23/2023 23:45
Real Analysis – MA1014 - 2022 Batch

Exercises
1. Prove 𝑠𝑢𝑝(𝑎, 𝑏) = 𝑏 , 𝑖𝑛𝑓(𝑎, 𝑏) = 𝑎
2. For any non-empty subsets 𝐴, 𝐵 of ℝ that are bounded above,

3. For any non-empty subsets 𝐴, 𝐵 of ℝ that are bounded below,

6
H H S R Samarasiri, PhD, Department of Mathematics, University of Moratuwa, Sri Lanka
Last updated: 05/23/2023 23:45

You might also like