MATH 461 Homework 1

Aiden Cullo

February 9, 2020

Section 2: 1, 2 (a,b)

1. Let f : A → B. Let A0 ⊂ A and B0 ⊂ B.

(a) Show that A0 ⊂ f −1 (f (A0 ))

i. By def f −1 (f (A0 )) = f −1 ({f (a) s.t. a ∈ A0 }) = {b | f (b) ∈ {f (a) s.t. a ∈ A0 } b ∈ A}

ii. If x ∈ A0

iii. x ∈ A0 =⇒ f (x) ∈ {f (a) s.t. a ∈ A0 }

iv. x ∈ A =⇒ x ∈ f −1 (f (A0 ))

v. ∴ A0 ⊂ f −1 (f (A0 ))

(b) Show that A0 = f −1 (f (A0 )) holds if f is injective

i. By def f −1 (f (A0 )) = {f −1 (f (a)) | a ∈ A0 }

ii. By injection, there is a unique a for every f (a)

iii. =⇒ f −1 (f (a)) = a

iv. =⇒ f −1 (f (A0 )) = {a | a ∈ A0 } = A0

2. Let f : A → B and let Ai ⊂ A and Bi ⊂ B for i = 0 and i = 1. Show that f −1 preserves inclusions,

unions, intersections, and differences of sets.

1
 (a) B0 ⊂ B1 =⇒ f −1 (B0 ) ⊂ f −1 (B1 )

i. If x ∈ f −1 (B0 )

ii. By def of f −1 , f (x) ∈ B0

iii. Given B0 ⊂ B =⇒ f (x) ∈ B1

iv. By def of f −1 , x ∈ f −1 (B1 )

v. ∴ f −1 (B0 ) ⊂ f −1 (B1 ) and inclusion is preserved by f −1

(b) f −1 (B0 ∪ B1 ) = f −1 (B0 ) ∪ f −1 (B1 )

i. WTS: f −1 (B0 ∪ B1 ) ⊂ f −1 (B0 ) ∪ f −1 (B1 )

A. If x ∈ f −1 (B0 ∪ B1 )

B. =⇒ f (x) ∈ B0 ∪ B1

C. =⇒ x ∈ f −1 (B0 ) ∪ f −1 (B1 )

ii. WTS: f −1 (B0 ) ∪ f −1 (B1 ) ⊂ f −1 (B0 ∪ B1 )

A. If x ∈ f −1 (B0 ) ∪ f −1 (B1 )

B. =⇒ f (x) ∈ B0 ∪ B1

C. =⇒ x ∈ f −1 (B0 ∪ B1 )

iii. ∴ f −1 (B0 ∪ B1 ) = f −1 (B0 ) ∪ f −1 (B1 )

Section 3: 4, 5 (a,b), 9, 11

4. Let f : A → B be a surjective function. Let us define a relation on A by setting a0 ∼ a1 if

f (a0 ) = f (a1 )

(a) Show that this is an equivalence relation

(1) Reflexivity

2
 i. If x = x for x ∈ A

ii. f is a function =⇒ f (x) is unique ∀x ∈ A =⇒ f (x) = f (x)

iii. =⇒ x ∼ x

(2) Symmetry

i. If x ∼ y and f (x) = f (y) for x, y ∈ A

ii. f (x) = f (y) =⇒ f (y) = f (x)

iii. =⇒ y ∼ x

(3) Transitivity

i. If x ∼ y, y ∼ z, f (x) = f (y), and f (y) = f (z) for x, y, z ∈ A

ii. f (x) = f (y), and f (y) = f (z) =⇒ f (x) = f (z)

iii. =⇒ x ∼ z

(b) Let A∗ be the set of equivalence classes. Show there is a bijective correspondence of A∗ with B.

(1) Define g : A∗ → B as f (a) s.t. a is any element in x where x ∈ A∗

(2) By def each equivalence class is nonempty because it must contain the element that deter-

mines it.

(3) WTS: g is injective

i. If g(x) = g(y) for x, y ∈ A∗

ii. =⇒ f (a) = f (b) where a ∈ x, b ∈ y

iii. =⇒ a ∼ b

iv. =⇒ a ∈ y

v. Equivalence classes are either disjoint or equal thus x = y

vi. =⇒ g is injective

(4) WTS: g is surjective

3
 i. If d ∈ B

ii. Since f is surjective, ∃ at least one a ∈ A s.t. f (a) = d

iii. The union of all elements of A∗ is A so ∃ x ∈ A∗ s.t. a ∈ x

iv. Suppose b, c ∈ A and f (b) = f (c) = d

A. =⇒ b ∼ c

B. =⇒ b and c are in the same equivalence class

v. =⇒ all a ∈ A s.t. f (a) = d will be in x

vi. =⇒ ∃ x s.t. any a ∈ x satisfies f (a) = d

vii. =⇒ by definition ∃ x s.t. g(x) = d

viii. =⇒ g is surjective

5. Let S and S 0 be the following subsets of the plane:

S = {(x, y)|y = x + 1 and 0 < x < 2}

S = {(x, y)|y − x is an integer}

(a) Show S 0 is an equivalence relation on the real line and S 0 ⊃ S. Describe the equivalence classes

of S 0 .

(1) S 0

i. Reflexivity

A. If x ∈ S 0

B. x − x = 0

C. =⇒ x ∼ x

ii. Symmetry

A. If x ∼ y and y − x is an integer

4
 B. x − y = −(y − x)

C. y − x is an integer =⇒ −(y − x) is an integer

D. =⇒ x − y is an integer and y ∼ x

iii. Transitivity

A. If x ∼ y, y ∼ z, and hence y − x and z − y are integers

B. z − x = z + 0 − x = z + (y − y) − x = (z − y) + (y − x)

C. An integer plus an integer is an integer

D. =⇒ z − x is an integer and x ∼ z

(2) S

i. Reflexivity

A. If x ∈ S

B. x − x = 1

C. =⇒ x ∼ x

ii. Symmetry

A. If x ∼ y and y − x = 1

B. x − y = −(y − x) = −1

C. =⇒ y ∼ x

iii. Transitivity

A. If x ∼ y, y ∼ z, and hence y − x = 1 and z − y = 1

B. z − x = z + 0 − x = z + (y − y) − x = (z − y) + (y − x) = 1 + 1 = 2

C. =⇒ x ∼ z

(3) The equivalence classes of S 0 are the line y=x shifted vertically up and down by integer

values

5
 (b) Show that given any collection of equivalence relations on a set A, their intersection is an

equivalence relation on A.

(1) Let ∼1 and ∼2 be two difference equivalence relations and ∼12 be their intersection

(2) Reflexivity

i. If x ∈ A

ii. By definition of an equivalence relation, x ∼1 x and x ∼2 x =⇒ x ∼12 x

(3) Symmetry

i. If x ∼12 y

ii. x ∼1 y =⇒ y ∼1 x

iii. x ∼2 y =⇒ y ∼2 x

iv. =⇒ y ∼12 x

(4) Transitivity

i. If x ∼12 y and y ∼12 z

ii. x ∼1 y and y ∼1 z =⇒ x ∼1 z

iii. x ∼2 y and y ∼2 z =⇒ x ∼2 z

iv. =⇒ x ∼12 z

9. Check that the dictionary order relation is an order relation.

1. Suppose that A and B are two sets with order relations <A and <B , respectively. Let <D be

dictionary order.

2. Comparability

(a) If x 6= y where x, y ∈ A × B and x = (a0 , b0 ) and y = (a1 , b1 )

(b) Case 1: a0 6= a1

6
 i. Case 1a: a0 <A a1 =⇒ x <D y

ii. Case 1b: a1 <A a0 =⇒ x >D y

(c) Case 2: a1 = a0

i. Case 2a: b0 <B b1 =⇒ x <D y

ii. Case 2b: b1 <B b0 =⇒ x >D y

(d) =⇒ in all cases x >D y or x <D y

(e) x 6= y =⇒ x <D y or x >D y

3. Nonreflexivity

(a) If x ∈ A × B and x = (a0 , b0 )

(b) Since <A is an order relation on A it respects Nonreflexivity

(c) =⇒ a0 ≮A a0

(d) =⇒ x ≮D x

4. Transitivity

(a) If x <D y and y <D z s.t. x, y, z ∈ A × B where x = (a0 , b0 ), y = (a1 , b1 ), and z = (a2 , b2 )

(b) x <D y =⇒ a0 <A a1

(c) y <D z =⇒ a1 <A a2

(d) By Transitivity of <A , a0 <A a2

(e) By Definition of <D , x <D z

11. (i)Show that an element in an ordered set has at most one immediate successor (ii)and at most one

immediate predecessor. (iii)Show that a subset of an ordered set has at most one smallest element

(iv)and at most one largest element.

(i) Show that an element in an ordered set has at most one immediate successor

7
 (a) Let a ∈ A where A is an ordered set.

(b) Assume a has two immediate successors b1 , b2 ∈ A

(c) By definition of immediate successor, a < b1 , a < b2 , {x|a < x < b1 } = ∅, and {x|a < x <

b2 } = ∅.

(d) Since A is an ordered set either b1 < b2 or b2 < b1 , but not b1 < b2 and b2 < b1 .

(e) Case 1: b1 < b2

i. a < b1 < b2 =⇒ {x|a < x < b2 } =

6 ∅

ii. =⇒ b2 is not an immediate successor of a.

(f) Case 2: b2 < b1

i. a < b2 < b1 =⇒ {x|a < x < b1 } =

6 ∅

ii. =⇒ b1 is not an immediate successor of a.

(g) =⇒ either b1 or b2 is not an immediate successor of a.

(h) =⇒ E

(ii) Show that an element in an ordered set has at most one immediate predecessor

(a) Let a ∈ A where A is an ordered set.

(b) Assume a has two immediate predecessors b1 , b2 ∈ A

(c) By definition of immediate predecessor, a > b1 , a > b2 , {x|a > x > b1 } = ∅, and {x|a >

x > b2 } = ∅.

(d) Since A is an ordered set either b1 < b2 or b2 < b1 , but not b1 < b2 and b2 < b1 .

(e) Case 1: b1 > b2

i. a > b1 > b2 =⇒ {x|a > x > b2 } =

6 ∅

ii. =⇒ b2 is not an immediate predecessor of a.

(f) Case 2: b2 > b1

8
 i. a > b2 > b1 =⇒ {x|a > x > b1 } =
6 ∅

ii. =⇒ b1 is not an immediate predecessor of a.

(g) =⇒ either b1 or b2 is not an immediate predecessor of a.

(h) =⇒ E

(iii) Show that a subset of an ordered set has at most one smallest element

(a) Let A0 ⊂ A where A is an ordered set.

(b) Assume A0 has two smallest elements a1 , a2

(c) Because elements of A0 obey an ordered relation, either a1 < a2 or a2 < a1 , but not a1 < a2

and a2 < a1 .

(d) =⇒ either a1 or a2 is not a smallest element of A0 .

(e) =⇒ E

(iv) Show that a subset of an ordered set has at most one largest element

(a) Let A0 ⊂ A where A is an ordered set.

(b) Assume A0 has two largest elements a1 , a2

(c) Because elements of A0 obey an ordered relation, either a1 < a2 or a2 < a1 , but not a1 < a2

and a2 < a1 .

(d) =⇒ either a1 or a2 is not a largest element of A0 .

(e) =⇒ E