Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
7 views2 pages

Problem Set 1

Uploaded by

isaacspoon0310
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)
7 views2 pages

Problem Set 1

Uploaded by

isaacspoon0310
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

Econ 2174

Homework 1

Due: September 16

Problem 1.

S is a set that has n < ∞ elements. How many subsets does S have? Explain.

Problem 2.

Prove that (A ∩ B) ∩ C = A ∩ (B ∩ C).

Problem 3.

Prove that A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C).

Problem 4.

Is it possible that for three sets A, B, C: A ∩ B 6= ∅, A ∩ C 6= ∅, B ∩ C 6= ∅, yet


A ∩ B ∩ C = ∅?

Problem 5.

Consider the mapping f : R → R where f (x) = |x|. Is it one-to-one? Is it onto?


Explain.

Problem 6.

Find a bijective mapping from N to Z and explain why it is bijective.

1
Problem 7.

Consider any strictly increasing mapping f : R → R such that x > y implies


f (x) > f (y) ∀x, y ∈ R. Show that f is one-to-one.

Problem 8.

Suppose f : A → B is one-to-one and g : B → C is also one-to-one. Prove that


the mapping h : A → C where h(x) := g(f (x)) is one-to-one.

Problem 9. (Challenging)

Suppose there exist two mappings f : A → B and g : B → A which are both


onto. Prove that |A| = |B|.

You might also like