Scribd
Upload
155 views2 pages

Math 3IA3 - Homework 1: Noah Forman Due: Monday, - 2022 by Midnight

This document provides instructions and questions for Math 3IA3 Homework 1. Students are asked to provide full solutions to 9 questions: 1) Prove a subset relationship about images of sets under a function. 2) Prove two sets are equal in terms of images of sets under a function. 3) Provide a counterexample to a subset relationship about images of sets. 4) Use mathematical induction to prove an inequality about factorials. 5) Prove two countably infinite sets unioned is also countably infinite. 6) Prove a property about negatives of elements in an ordered field. 7) Prove a property about multiplication of negatives in an ordered field.

Uploaded by

瑾瑜
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
155 views2 pages

Math 3IA3 - Homework 1: Noah Forman Due: Monday, - 2022 by Midnight

This document provides instructions and questions for Math 3IA3 Homework 1. Students are asked to provide full solutions to 9 questions: 1) Prove a subset relationship about images of sets under a function. 2) Prove two sets are equal in terms of images of sets under a function. 3) Provide a counterexample to a subset relationship about images of sets. 4) Use mathematical induction to prove an inequality about factorials. 5) Prove two countably infinite sets unioned is also countably infinite. 6) Prove a property about negatives of elements in an ordered field. 7) Prove a property about multiplication of negatives in an ordered field.

Uploaded by

瑾瑜
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/ 2

Math 3IA3 - Homework 1

Noah Forman
Due: Monday, —– 2022 by Midnight

Instructions (PLEASE READ CAREFULLY): For each question,


please provide a full solution. If the question asks for an example or counter-
example, please provide justification for your solution.
All solutions should be uploaded to Crowdmark with the correct orientation
(i.e. please do not submit solutions that are sideways or upside-down). Please
upload each solution separately in order to facilitate grading. Solutions type-set
in LATEX are strongly encouraged.
Working in groups is not only allowed, it is encouraged, and completing the
assignments on your own will probably be difficult. However, the final write-up
should be completely in your own words. Please list the people you worked with
on your final submission.
Due to the size of the course, not all solutions will be graded. The solutions
to be graded will be chosen randomly, so it is in your best interest to do all
of them. Each graded question will be graded out of 10 points, with points
awarded for completeness, correctness, and readability.

For questions 1–3, suppose f : A → B is a function and R and S are subsets


of A. We will write f (R) to denote the image of R under f ,

f (R) = {f (x) : x ∈ R},

and likewise for any other subset of A.


For example, if f : Z → Z is the function f (n) = n2 , then f (5) = 25 – this
is just an evaluation of the function – whereas f ({−3, 0, 5}) = {0, 9, 25} – this
is the image of a subset of the domain under the function.

1. Prove that f (R ∩ S) ⊆ f (R) ∩ f (S).


Hint: Refer back to the formal definition of “subsets” from lecture 1 or
chapter 1.1 of the textbook. You may also want to look up the formal
definition of intersections in chapter 1.1.
2. Prove that f (R ∪ S) = f (R) ∪ f (S).
Hint: In order to prove that two sets are equal, you need to prove that
each side is a subset of the other.

1
3. Give a counterexample in which f (R ∩ S) ̸= f (R) ∩ f (S).
This means you must choose sets A, B, R and S and invent a function f
that satisfies this property. Hint: I can come up with a counterexample in
which A is very small; nothing large or complicated is needed.

4. Use mathematical induction to prove that 2n < n! for all n ≥ 4.


5. Prove that if S and T are countably infinite sets (meaning |S| = |N| = |T |)
then S ∪ T is also countably infinite.
Hint: Start by proving this in the case where S and T are disjoint, S ∩T =
∅, and then prove it in the general case. It might be helpful, although not
necessary, to use the Cantor-Schröder-Bernstein theorem, mentioned in
Lecture 2.

For the remaining exercises, (F, +, ·, <) is an ordered field. You may use any
of the axioms and theorems stated in class about ordered fields.

6. Prove that ∀a ∈ F, −(−a) = a.


7. Prove that ∀a, b ∈ F, (−a) · b = −(a · b).

8. Prove that ∀a ∈ F, (a · a) + 1 > 0.


9. Use the previous result to prove that it is impossible to put an ordering “<”
on the field of complex numbers (C, +, ·) that would satisfy the ordered
field axioms, (O1)–(O4) from lecture.

You might also like