TANMAY SARKAR
Department of Mathematics,
Indian Institute of Technology Jammu.
Real Numbers
Email: tanmay.sarkar@iitjammu.ac.in
Q UESTIONS
What is Calculus?
Q UESTIONS
What is Calculus?
What is the real number set R?
Q UESTIONS
What is Calculus?
What is the real number set R?
N UMBERS
Set of Natural numbers,
Set of Integers,
Set of Rational numbers.
A LGEBRAIC PROPERTIES
a + b ∈ R, ∀a, b ∈ R,
(a + b) + c = a + (b + c), ∀a, b, c ∈ R,
∃0 ∈ R s.t. a + 0 = a, ∀a ∈ R,
for each a ∈ R, ∃(−a) ∈ R s.t. a + (−a) = 0,
a + b = b + a, ∀a, b ∈ R.
A LGEBRAIC PROPERTIES
a + b ∈ R, ∀a, b ∈ R,
(a + b) + c = a + (b + c), ∀a, b, c ∈ R,
∃0 ∈ R s.t. a + 0 = a, ∀a ∈ R,
for each a ∈ R, ∃(−a) ∈ R s.t. a + (−a) = 0,
a + b = b + a, ∀a, b ∈ R.
a · b ∈ R; (a · b) · c = a · (b · c), ∀a, b, c ∈ R;
∃1 ∈ R s.t. a · 1 = a,
1
for a 6= 0, ∃ a1 ∈ R s.t. a · = 1,
a
a · b = b · a, ∀a, b ∈ R,
A LGEBRAIC PROPERTIES
a + b ∈ R, ∀a, b ∈ R,
(a + b) + c = a + (b + c), ∀a, b, c ∈ R,
∃0 ∈ R s.t. a + 0 = a, ∀a ∈ R,
for each a ∈ R, ∃(−a) ∈ R s.t. a + (−a) = 0,
a + b = b + a, ∀a, b ∈ R.
a · b ∈ R; (a · b) · c = a · (b · c), ∀a, b, c ∈ R;
∃1 ∈ R s.t. a · 1 = a,
1
for a 6= 0, ∃ a1 ∈ R s.t. a · = 1,
a
a · b = b · a, ∀a, b ∈ R,
a · (b + c) = a · b + a · c, ∀a, b, c ∈ R.
D EFINITION
Let S ⊂ R. Then u is an upper bound of S if
x ∈S ⇒ x ≤ u, ∀x ∈ S.
D EFINITION
Let S ⊂ R. Then u is an upper bound of S if
x ∈S ⇒ x ≤ u, ∀x ∈ S.
x ≥ `, ∀x ∈ S.
D EFINITION
Let S ⊂ R. Then u is an upper bound of S if
x ∈S ⇒ x ≤ u, ∀x ∈ S.
x ≥ `, ∀x ∈ S.
D EFINITION
Let S ⊂ R. Then u is an upper bound of S if
x ∈S ⇒ x ≤ u, ∀x ∈ S.
x ≥ `, ∀x ∈ S.
E XAMPLES
S = {1, 1/2, 1/3, ...}.
D EFINITION
Let S ⊂ R. Then u is an upper bound of S if
x ∈S ⇒ x ≤ u, ∀x ∈ S.
x ≥ `, ∀x ∈ S.
E XAMPLES
S = {1, 1/2, 1/3, ...}.
S = {x ∈ R : 1 ≤ x ≤ 2}.
D EFINITION
Let S ⊂ R. Then u is said to be Supremum of S if
( A ) x ≤ u, ∀x ∈ S,
( B ) given ε > 0, ∃s1 ∈ S s.t.
u − ε < s1 ≤ u.
D EFINITION
Let S ⊂ R. Then u is said to be Supremum of S if
( A ) x ≤ u, ∀x ∈ S,
( B ) given ε > 0, ∃s1 ∈ S s.t.
u − ε < s1 ≤ u.
LUB AXIOM
Every non-empty subset of R that is bounded above has a least upper bound.
D EFINITION
Let S ⊂ R. Then u is said to be Supremum of S if
( A ) x ≤ u, ∀x ∈ S,
( B ) given ε > 0, ∃s1 ∈ S s.t.
u − ε < s1 ≤ u.
LUB AXIOM
Every non-empty subset of R that is bounded above has a least upper bound.
T HEOREM
Let S ⊂ R, S 6= φ and S is bounded below. Then S has an infimum.
D EFINITION
Let S ⊂ R. Then u is said to be Supremum of S if
( A ) x ≤ u, ∀x ∈ S,
( B ) given ε > 0, ∃s1 ∈ S s.t.
u − ε < s1 ≤ u.
LUB AXIOM
Every non-empty subset of R that is bounded above has a least upper bound.
T HEOREM
Let S ⊂ R, S 6= φ and S is bounded below. Then S has an infimum.
√
A := {r ∈ Q : 0 ≤ r ≤ 2}.
T HEOREM
If x, y ∈ R and x > 0, y > 0, then ∃n ∈ N such that
ny > x. (0.1)
T HEOREM
If x, y ∈ R and x > 0, y > 0, then ∃n ∈ N such that
ny > x. (0.1)
P ROOF .
Suppose for every k ∈ N, ky ≤ x. Let
S := {ky : k ∈ N}.
T HEOREM
If x, y ∈ R and x > 0, y > 0, then ∃n ∈ N such that
ny > x. (0.1)
P ROOF .
Suppose for every k ∈ N, ky ≤ x. Let
S := {ky : k ∈ N}.
T HEOREM
If x, y ∈ R and x > 0, y > 0, then ∃n ∈ N such that
ny > x. (0.1)
P ROOF .
Suppose for every k ∈ N, ky ≤ x. Let
S := {ky : k ∈ N}.
b − y < py ≤ b,
⇒ (p + 1)y > b.
Contradiction.
P ROPERTIES
1 If x, y ∈ R with x < y , then ∃r ∈ Q such that
P ROPERTIES
1 If x, y ∈ R with x < y , then ∃r ∈ Q such that
P ROPERTIES
1 If x, y ∈ R with x < y , then ∃r ∈ Q such that
T YPES OF SETS
1 Intervals,
2 Open sets,
3 Interior points,
4 Closed sets,
5 Limit point of a set
T YPES OF SETS
1 Intervals,
2 Open sets,
3 Interior points,
4 Closed sets,
5 Limit point of a set
T YPES OF SETS
1 Intervals,
2 Open sets,
3 Interior points,
4 Closed sets,
5 Limit point of a set
D EFINITION (C OUNTABLE S ET )
Let S ⊂ R. S is said to be countable if there exists a bijective mapping
f : N → S.