3) Let X be a set with > 3 elements. Show that there exist bijective functions f :X → X and g : X + X, such that - fog + gof.

Prove or disprove if the composition of surjective relations is surjective. If it is not true, find additional assumptions that will make it true.

Let R, S, and T be sets. Let f: R -» S, and g: S -» T be maps. Assume we know that qf is 1-1 Must f be 1-1? Either prove that it is or find a counterexample (a) Must g be 1-1? Either prove that it is or find a counterexample (b)

Here are some set definitions that we will refer to in the exercises of this assignment. A={ 1, 3, 5, 7,9} • B={x| (x ≥ 1) ^ (x ≤ 9) } • C= {x| (x A) ^ (x = B) } • D={x| (vy)(x*y = y)} • E= {x|(3y)(x*y=y)} For each statement below, answer whether the statement is true or false, and briefly explain why. 1. 3€ A 2. 4€ A 3. 3 € B 4. 4 € B 5. 3 € C 6. 4 € C 7. CC B 8. BCC [ S 9. DcA 10. ECD G D C A D = I can give you any inteyen and call it x. Each x I give you has a y, so that for all Values of yx*y = y x=3 x=5 X= 7 X |Y LY|XOY X: = XIXI хочу |-||-|| Te و ال 13 Fol نعاما X= | 3 Since X Y X+Y 3-1 3 3 212 313 e- for all 1 the only this this is 3 bの 6 y x.. 5-4-574 0070 5 171 2 10 72 315 23 کی Š 5 5 хса alm X Y xey 9 T -q 90 00 9 9 18 9222 time the relation is true is when is false as it would need to be true in the set members