Scribd
Upload
55 views3 pages

MATH 301 I A F 2016: Ntro To Nalysis ALL

This document contains the homework problems and solutions for MATH 301 Introduction to Analysis in Fall 2016. The homework covers topics including: 1) Proving that the square root of 3 is irrational using proof by contradiction. 2) Showing there is no rational number satisfying an equation. 3) Proving properties of rational and irrational numbers. 4) Giving examples of functions with certain properties from the natural numbers to natural or integer numbers. 5) Finding suprema and infima of specified sets. 6) Proving properties about the supremum of a set when an element is also an upper bound.

Uploaded by

limit gaming
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
55 views3 pages

MATH 301 I A F 2016: Ntro To Nalysis ALL

This document contains the homework problems and solutions for MATH 301 Introduction to Analysis in Fall 2016. The homework covers topics including: 1) Proving that the square root of 3 is irrational using proof by contradiction. 2) Showing there is no rational number satisfying an equation. 3) Proving properties of rational and irrational numbers. 4) Giving examples of functions with certain properties from the natural numbers to natural or integer numbers. 5) Finding suprema and infima of specified sets. 6) Proving properties about the supremum of a set when an element is also an upper bound.

Uploaded by

limit gaming
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/ 3

MATH 301 I NTRO TO A NALYSIS FALL 2016

Homework 01

Written Problems
√
1. (a) Prove that 3 is irrational.
√
(b) Can you use the same argument to prove 4 is irrational? Why or why not?

2. Show that there is no rational number r satisfying 2r = 3.


√
3. Prove or give counterexample: If x is irrational, then x is irrational.

4. Give an example for each or state that the request is impossible.

(a) f : N → N that is one-to-one but not onto.


(b) f : N → N that is onto but not one-to-one.
(c) f : N → Z that is one-to-one and onto.

5. Given an example of each of the following, or state that the request is impossible.

(a) A set B with inf B ≥ sup B.


(b) A finite set that contains its infimum but not its supremum.
(c) A bounded subset of Q that contains its supremum but not its infimum.

6. Prove that if a is an upper bound for A, and if a is also an element in A, then it must be that
a = sup A.

7. Find the suprema and infima (if they exist) of the following sets.

(a) {m/n : m, n ∈ N, m < n}.


(b) {(−1)m /n : m, n ∈ N}.
(c) {n/(3n + 1) : n ∈ N}.
(d) {m/(m + n) : m, n ∈ N}.
Solutions

Written Problems
√ √
1. (a) Assume the opposite, i.e. 3 is rational, 3 = m/n in its lowest term with m, n ∈ N and
n 6= 0. Then
 m 2 √ m2
= ( 3)2 , 2 = 3, m2 = 3n2 ,
n n
som2 is divisible by 3. It follows (*) that m is also divisible by 3, i.e. m = 3p for some p ∈ N.
Then
(3p)2 = 3n2 , n2 = 3p2 ,
therefore n2 is divisible by 3 and so is n. Thus m and n are both divisible by 3 and m/n is
not in its lowest term, a contradiction.

(*) We have yet to prove that if m2 is divisible by 3 then m is divisible by 3. The proof is as
follows: Prove the contraposition if m is NOT divisible by 3 then m2 is NOT divisible by 3.
Assume m is not divisible by 3, then m = 3p + 1 or m = 3p + 2 for some integer p. If
m = 3p + 1 then

m2 = (3p + 1)2 = 9p2 + 6p + 1 = 3(3p2 + 2p) + 1, which is NOT divisible by 3.

If m = 3p + 2 then

m2 = (3p + 2)2 = 9p2 + 12p + 4 = 3(3p2 + 4p + 1) + 1, which is NOT divisible by 3.

(b) We cannot use an analogous argument as in (a) because the (*) argument becomes if m2 is
divisible by 4 then m is divisible by 4, which is false: we can name a counterexample, say,
m = 6: m2 = 36 is divisible by 4 but m = 6 is not divisible by 4.

2. Assume the opposite, i.e. r is rational, r = m/n with m, n ∈ N, n 6= 0. Then 2m/n = 3, 2m = 3n .


Since m, n ∈ N, 2m is even and 3n is odd. This is a contradiction.
√ √
3. Proof by contraposition: assume that x is rational, x = m/n with m, n ∈ N, n 6= 0. Then

√  m 2 m 2
x = ( x)2 = = 2
n n
which is rational because m2 , n2 ∈ N and n2 6= 0.

4. (a) For example, f (n) = 2n.


(b) For example, f (n) = dn/2e.
(c) For example, f (x) = (−1)n bn/2c.

5. (a) This is possible when B has only one element. For example, if B = {3} then sup B = inf B =
3.
(b) This is impossible because for any finite set, its supremum equals its maximum, which is
always contained in the set.
√
(c) This is possible.
√ For example, consider
√ the set of rationals between 2 and 2, inclusive, i.e.
B = Q ∩ [ 2, 2]. Then inf B = 2 6∈ B but sup B = 2 ∈ B.

6. Since a is an upper bound, all we need to prove is that it is the least of all upper bounds. Consider
for any upper bound b of A, b ≥ a because a is an element in A. So a ≤ b for all upper bounds,
hence the least upper bound of A.

7. (a) Supremum 1; infimum 0.


(b) Supremum 1; infimum −1.
(c) Supremum 1/3; infimum 1/4.
(d) Supremum 1; infimum 0.

You might also like