Lecture 1
Lecture 1
2021/22, 10 CFU
Politecnico di Torino
Department of Mathematical Sciences DISMA
General information
Four tests:
1 Test 1: Friday 29 October 16:00
2 Test 2: Friday 19 November 16:00
3 Test 3: Friday 17 December 16:00
4 Test 4: Friday 7 January 16:00
Example: 34 ∈ N where
N = {0, 1, 2, . . . }
is the set of natural numbers.
Example: 34 ∈ N where
N = {0, 1, 2, . . . }
is the set of natural numbers.
Example: π ∈
/N
Example: 34 ∈ N where
N = {0, 1, 2, . . . }
is the set of natural numbers.
Example: π ∈
/N
Example: 34 ∈ N where
N = {0, 1, 2, . . . }
is the set of natural numbers.
Example: π ∈
/N
Example: 34 ∈ N where
N = {0, 1, 2, . . . }
is the set of natural numbers.
Example: π ∈
/N
B = {n ∈ N : n > 2} = {3, 4, . . . }
B = {n ∈ N : n > 2} = {3, 4, . . . }
B = {n ∈ N : n > 2} = {3, 4, . . . }
B = {n ∈ N : n > 2} = {3, 4, . . . }
B = {n ∈ N : n > 2} = {3, 4, . . . }
Example: X = {1, 3}
B = {n ∈ N : n > 2} = {3, 4, . . . }
Example: X = {1, 3}
B = {n ∈ N : n > 2} = {3, 4, . . . }
Example: X = {1, 3}
CA = {x ∈ X : x ∈
/ A}
CA = {x ∈ X : x ∈
/ A}
CX = ∅ C∅ = X C(CA) = A
CA = {x ∈ X : x ∈
/ A}
CX = ∅ C∅ = X C(CA) = A
Intersection of A ⊆ X and B ⊆ X :
A ∩ B = {x ∈ X : x ∈ A and x ∈ B}
CA = {x ∈ X : x ∈
/ A}
CX = ∅ C∅ = X C(CA) = A
Intersection of A ⊆ X and B ⊆ X :
A ∩ B = {x ∈ X : x ∈ A and x ∈ B}
Union of A ⊆ X and B ⊆ X :
A ∪ B = {x ∈ X : x ∈ A or x ∈ B}
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C .
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C .
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C . Thus x ∈ A ∪ C and
x ∈ B ∪ C.
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C . Thus x ∈ A ∪ C and
x ∈ B ∪ C . This shows x ∈ (A ∪ C ) ∩ (B ∪ C ).
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C . Thus x ∈ A ∪ C and
x ∈ B ∪ C . This shows x ∈ (A ∪ C ) ∩ (B ∪ C ). We have shown
(A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C . Thus x ∈ A ∪ C and
x ∈ B ∪ C . This shows x ∈ (A ∪ C ) ∩ (B ∪ C ). We have shown
(A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
2. (A ∪ C ) ∩ (B ∪ C ) ⊆ (A ∩ B) ∪ C
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C . Thus x ∈ A ∪ C and
x ∈ B ∪ C . This shows x ∈ (A ∪ C ) ∩ (B ∪ C ). We have shown
(A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
2. (A ∪ C ) ∩ (B ∪ C ) ⊆ (A ∩ B) ∪ C
Take x ∈ (A ∪ C ) ∩ (B ∪ C ).
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C . Thus x ∈ A ∪ C and
x ∈ B ∪ C . This shows x ∈ (A ∪ C ) ∩ (B ∪ C ). We have shown
(A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
2. (A ∪ C ) ∩ (B ∪ C ) ⊆ (A ∩ B) ∪ C
Take x ∈ (A ∪ C ) ∩ (B ∪ C ). Then x ∈ A ∪ C and x ∈ B ∪ C .
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C . Thus x ∈ A ∪ C and
x ∈ B ∪ C . This shows x ∈ (A ∪ C ) ∩ (B ∪ C ). We have shown
(A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
2. (A ∪ C ) ∩ (B ∪ C ) ⊆ (A ∩ B) ∪ C
Take x ∈ (A ∪ C ) ∩ (B ∪ C ). Then x ∈ A ∪ C and x ∈ B ∪ C . Either
x ∈ C.
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C . Thus x ∈ A ∪ C and
x ∈ B ∪ C . This shows x ∈ (A ∪ C ) ∩ (B ∪ C ). We have shown
(A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
2. (A ∪ C ) ∩ (B ∪ C ) ⊆ (A ∩ B) ∪ C
Take x ∈ (A ∪ C ) ∩ (B ∪ C ). Then x ∈ A ∪ C and x ∈ B ∪ C . Either
x ∈ C . If x ∈
/ C then x ∈ A ∩ B.
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C . Thus x ∈ A ∪ C and
x ∈ B ∪ C . This shows x ∈ (A ∪ C ) ∩ (B ∪ C ). We have shown
(A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
2. (A ∪ C ) ∩ (B ∪ C ) ⊆ (A ∩ B) ∪ C
Take x ∈ (A ∪ C ) ∩ (B ∪ C ). Then x ∈ A ∪ C and x ∈ B ∪ C . Either
x ∈ C . If x ∈
/ C then x ∈ A ∩ B. Thus x ∈ (A ∩ B) ∪ C .
(A ∩ B) ∪ C = (A ∪ C ) ∩ (B ∪ C )
Proof: 1. (A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
Take x ∈ (A ∩ B) ∪ C . Then x ∈ A ∩ B or x ∈ C . Thus x ∈ A ∪ C and
x ∈ B ∪ C . This shows x ∈ (A ∪ C ) ∩ (B ∪ C ). We have shown
(A ∩ B) ∪ C ⊆ (A ∪ C ) ∩ (B ∪ C )
2. (A ∪ C ) ∩ (B ∪ C ) ⊆ (A ∩ B) ∪ C
Take x ∈ (A ∪ C ) ∩ (B ∪ C ). Then x ∈ A ∪ C and x ∈ B ∪ C . Either
x ∈ C . If x ∈
/ C then x ∈ A ∩ B. Thus x ∈ (A ∩ B) ∪ C . We have shown
(A ∪ C ) ∩ (B ∪ C ) ⊆ (A ∩ B) ∪ C
Mathematical Analysis I Lecture 1 Politecnico di Torino 10 / 30
(A ∪ B) ∩ C = (A ∩ C ) ∪ (B ∩ C )
De Morgan laws:
C(A ∩ B) = CA ∪ CB
De Morgan laws:
C(A ∩ B) = CA ∪ CB
C(A ∪ B) = CA ∩ CB
De Morgan laws:
C(A ∩ B) = CA ∪ CB
C(A ∪ B) = CA ∩ CB
Relative complement:
A \ B = A ∩ CB
Conjunction: p and q
p∧q
Conjunction: p and q
p∧q
Disjunction: p or q
p∨q
Conjunction: p and q
p∧q
Disjunction: p or q
p∨q
Implication:
P⇒Q
Conjunction: p and q
p∧q
Disjunction: p or q
p∨q
Implication:
P⇒Q
Conjunction: p and q
p∧q
Disjunction: p or q
p∨q
Implication:
P⇒Q
P⇔Q
P⇔Q
Contrapositive implication:
P⇒Q ⇔ ¬Q ⇒ ¬P
P⇔Q
Contrapositive implication:
P⇒Q ⇔ ¬Q ⇒ ¬P
Proof of P ⇒ Q by contradiction:
P⇒Q ⇔ (P ∧ ¬Q) ⇒ ¬P
P⇔Q
Contrapositive implication:
P⇒Q ⇔ ¬Q ⇒ ¬P
Proof of P ⇒ Q by contradiction:
P⇒Q ⇔ (P ∧ ¬Q) ⇒ ¬P
or
P⇒Q ⇔ (P ∧ ¬Q) ⇒ r ∧ ¬r
for some formula r
∃x ∈ X : p(x)
∃x ∈ X : p(x)
reads “there exists x ∈ X such that p(x) holds”
∃x ∈ X : p(x)
reads “there exists x ∈ X such that p(x) holds”
Examples:
∀n ∈ N : 2n is an even number
∃x ∈ X : p(x)
reads “there exists x ∈ X such that p(x) holds”
Examples:
∀n ∈ N : 2n is an even number
∃n ∈ N : n > 273
∃x ∈ X : p(x)
reads “there exists x ∈ X such that p(x) holds”
Examples:
∀n ∈ N : 2n is an even number
∃n ∈ N : n > 273
1 = 0.9999 · · ·
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2∈
/Q
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2∈
/Q
Proof.
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q
Proof. By contradiction.
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √ p
Proof. By contradiction. Suppose 2 = q where p and q have no
common factors.
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √ p
Proof. By contradiction. Suppose 2 = q where p and q have no
common factors. Then p 2 = 2q 2 .
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √
Proof. By contradiction. Suppose 2 = qp where p and q have no
common factors. Then p 2 = 2q 2 . Thus p 2 is even,
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √
Proof. By contradiction. Suppose 2 = qp where p and q have no
common factors. Then p 2 = 2q 2 . Thus p 2 is even, and p cannot be odd:
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √
Proof. By contradiction. Suppose 2 = qp where p and q have no
common factors. Then p 2 = 2q 2 . Thus p 2 is even, and p cannot be odd:
(2k + 1)2 = 4k 2 + 4k + 1 is odd.
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √
Proof. By contradiction. Suppose 2 = qp where p and q have no
common factors. Then p 2 = 2q 2 . Thus p 2 is even, and p cannot be odd:
(2k + 1)2 = 4k 2 + 4k + 1 is odd. Hence p = 2k is even.
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √
Proof. By contradiction. Suppose 2 = qp where p and q have no
common factors. Then p 2 = 2q 2 . Thus p 2 is even, and p cannot be odd:
(2k + 1)2 = 4k 2 + 4k + 1 is odd. Hence p = 2k is even. This gives
4k 2 = 2q 2 that is q 2 = 2k 2 .
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √
Proof. By contradiction. Suppose 2 = qp where p and q have no
common factors. Then p 2 = 2q 2 . Thus p 2 is even, and p cannot be odd:
(2k + 1)2 = 4k 2 + 4k + 1 is odd. Hence p = 2k is even. This gives
4k 2 = 2q 2 that is q 2 = 2k 2 . Thus q 2 is even
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √
Proof. By contradiction. Suppose 2 = qp where p and q have no
common factors. Then p 2 = 2q 2 . Thus p 2 is even, and p cannot be odd:
(2k + 1)2 = 4k 2 + 4k + 1 is odd. Hence p = 2k is even. This gives
4k 2 = 2q 2 that is q 2 = 2k 2 . Thus q 2 is even ⇒ q = 2n is even.
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √
Proof. By contradiction. Suppose 2 = qp where p and q have no
common factors. Then p 2 = 2q 2 . Thus p 2 is even, and p cannot be odd:
(2k + 1)2 = 4k 2 + 4k + 1 is odd. Hence p = 2k is even. This gives
4k 2 = 2q 2 that is q 2 = 2k 2 . Thus q 2 is even ⇒ q = 2n is even. This
contradicts the assumption of no common factors in p and q.
1 = 0.9999 · · ·
Proof:
1
= 0.333 · · ·
3
1
⇒1=3· = 0.999 · · ·
3
√
Theorem: 2 ∈ /Q √
Proof. By contradiction. Suppose 2 = qp where p and q have no
common factors. Then p 2 = 2q 2 . Thus p 2 is even, and p cannot be odd:
(2k + 1)2 = 4k 2 + 4k + 1 is odd. Hence p = 2k is even. This gives
4k 2 = 2q 2 that is q 2 = 2k 2 . Thus q 2 is even ⇒ q = 2n is even. This
contradicts
√ the assumption of no common factors in p and q. Thus
p
2 = q cannot hold. 2
x 6y =⇒ xz 6 yz ∀z > 0
x 6y =⇒ xz 6 yz ∀z > 0
x 6y =⇒ xz > yz ∀z < 0
Mathematical Analysis I Lecture 1 Politecnico di Torino 17 / 30
Absolute value
|xy | = |x||y |
|xy | = |x||y |
Triangle inequality
|x + y | 6 |x| + |y |
|xy | = |x||y |
Triangle inequality
|x + y | 6 |x| + |y |
Proof: ±x 6 |x| implies
|xy | = |x||y |
Triangle inequality
|x + y | 6 |x| + |y |
Proof: ±x 6 |x| implies
x + y 6 |x| + y 6 |x| + |y |
|xy | = |x||y |
Triangle inequality
|x + y | 6 |x| + |y |
Proof: ±x 6 |x| implies
x + y 6 |x| + y 6 |x| + |y |
−x − y 6 |x| − y 6 |x| + |y |
|xy | = |x||y |
Triangle inequality
|x + y | 6 |x| + |y |
Proof: ±x 6 |x| implies
x + y 6 |x| + y 6 |x| + |y |
−x − y 6 |x| − y 6 |x| + |y |
|x + y | = ±(x + y ) 6 |x| + |y |
Mathematical Analysis I Lecture 1 Politecnico di Torino 18 / 30
If a > 0 then |x| 6 a ⇔ −a 6 x 6 a
[a, b] = {x ∈ R : a 6 x 6 b}
[a, b] = {x ∈ R : a 6 x 6 b}
a b
[a, b] = {x ∈ R : a 6 x 6 b}
a b
[a, b] = {x ∈ R : a 6 x 6 b}
a b
a b
a b
a b
a b
a b
a b
a b
|x − x0 | 6 a ⇐⇒ −a 6 x − x0 6 a ⇐⇒ x0 − a 6 x 6 x0 + a
a b
a b
|x − x0 | 6 a ⇐⇒ −a 6 x − x0 6 a ⇐⇒ x0 − a 6 x 6 x0 + a
x0 − a x0 x0 + a
Mathematical Analysis I Lecture 1 Politecnico di Torino 20 / 30
[a, +∞) = {x ∈ R : x > a}
(−∞, a] = {x ∈ R : x 6 a}
(−∞, a] = {x ∈ R : x 6 a}
(−∞, a) = {x ∈ R : x < a}
a
Mathematical Analysis I Lecture 1 Politecnico di Torino 21 / 30
Maximum and minimum
x 6 xM ∀x ∈ A
x 6 xM ∀x ∈ A
x > xm ∀x ∈ A
x 6 xM ∀x ∈ A
x > xm ∀x ∈ A
x 6 xM ∀x ∈ A
x > xm ∀x ∈ A
Examples:
max({1, 4, 67}) = 67
x 6 xM ∀x ∈ A
x > xm ∀x ∈ A
Examples:
max({1, 4, 67}) = 67
min({1, 4, 67}) = 1
x 6 xM ∀x ∈ A
x > xm ∀x ∈ A
Examples:
max({1, 4, 67}) = 67
min({1, 4, 67}) = 1
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃α ∈ R : ∀x ∈ A : x 6 α
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
∃β ∈ R : ∀x ∈ A : x > β
For an upper bounded set A ⊆ R the least upper bound is called the
supremum denoted
sup A
For an upper bounded set A ⊆ R the least upper bound is called the
supremum denoted
sup A
s = sup A satisfies
(i ) x 6 s ∀x ∈ A
(ii ) r < s ⇒ ∃x ∈ A : x > r
For an upper bounded set A ⊆ R the least upper bound is called the
supremum denoted
sup A
s = sup A satisfies
(i ) x 6 s ∀x ∈ A
(ii ) r < s ⇒ ∃x ∈ A : x > r
For a lower bounded set A ⊆ R the greatest lower bound is called the
infimum denoted
inf A
For a lower bounded set A ⊆ R the greatest lower bound is called the
infimum denoted
inf A
s = inf A satisfies
(i ) x > s ∀x ∈ A
(ii ) r > s ⇒ ∃x ∈ A : x < r
For a lower bounded set A ⊆ R the greatest lower bound is called the
infimum denoted
inf A
s = inf A satisfies
(i ) x > s ∀x ∈ A
(ii ) r > s ⇒ ∃x ∈ A : x < r
···
1 − 11 1 − 21 1 − 31 1
···
1 − 11 1 − 21 1 − 31 1
1
For any n ∈ N, n 6= 0, 1 − n 6 1.
···
1 − 11 1 − 21 1 − 31 1
For any n ∈ N, n 6= 0, 1 − n1 6 1.
Thus 1 is an upper bound of A.
···
1 − 11 1 − 21 1 − 31 1
For any n ∈ N, n 6= 0, 1 − n1 6 1.
Thus 1 is an upper bound of A.
For any ε > 0 we have
1
1− >1−ε
n
if − n1 > −ε ⇔ 1
n < ε, that is n > 1ε .
···
1 − 11 1 − 21 1 − 31 1
For any n ∈ N, n 6= 0, 1 − n1 6 1.
Thus 1 is an upper bound of A.
For any ε > 0 we have
1
1−>1−ε
n
if − n1 > −ε ⇔ n1 < ε, that is n > 1ε .
Hence no number smaller than 1 is an upper bound of A.
···
1 − 11 1 − 21 1 − 31 1
For any n ∈ N, n 6= 0, 1 − n1 6 1.
Thus 1 is an upper bound of A.
For any ε > 0 we have
1
1−>1−ε
n
if − n1 > −ε ⇔ n1 < ε, that is n > 1ε .
Hence no number smaller than 1 is an upper bound of A.
It follows
sup A = 1
···
1 − 11 1 − 21 1 − 31 1
For any n ∈ N, n 6= 0, 1 − n1 6 1.
Thus 1 is an upper bound of A.
For any ε > 0 we have
1
1−>1−ε
n
if − n1 > −ε ⇔ n1 < ε, that is n > 1ε .
Hence no number smaller than 1 is an upper bound of A.
It follows
sup A = 1
inf[0, 1] = min[0, 1] = 0
inf[0, 1] = min[0, 1] = 0
sup(0, 1] = max(0, 1] = 1
inf[0, 1] = min[0, 1] = 0
sup(0, 1] = max(0, 1] = 1
inf[0, 1] = min[0, 1] = 0
sup(0, 1] = max(0, 1] = 1
inf[0, 1] = min[0, 1] = 0
sup(0, 1] = max(0, 1] = 1
inf[0, 1) = min[0, 1) = 0
Mathematical Analysis I Lecture 1 Politecnico di Torino 28 / 30
Mathematical Analysis I Lecture 1 Politecnico di Torino 29 / 30
sup(0, 1) = 1, max(0, 1) does not exist
Upper bounds of A in Q:
There is no smallest
√ element in B!
In fact sup A = 2 ∈ R \ Q.
There is no smallest
√ element in B!
In fact sup A = 2 ∈ R \ Q.
There is no smallest
√ element in B!
In fact sup A = 2 ∈ R \ Q.
inf A ∈ R
Mathematical Analysis I Lecture 1 Politecnico di Torino 30 / 30