EBGN 509 Problem Set 1

1. Consider the following four sets: 𝑺𝟏 = {𝟐, 𝟒, 𝟔}, 𝑺𝟐 = {𝟕, 𝟐, 𝟔}, 𝑺𝟑 = {𝟒, 𝟐, 𝟔} and 𝑺𝟒 = {𝟐, 𝟒}.

a) How does each set relate to other? Use formal notation where possible.

𝑆1 = 𝑆3 ; 𝑆4 ⊂ S1; 𝑆1 ∩ S2 = S4

b) Find 𝑆1 ∪ S2

𝑆1 ∪ S2 = {2, 4, 6, 7}
c) Find 𝑆2 ∩ S4

𝑆2 ∩ S4 = {2}
2. The complement of the U (Universal Set) is the ∅ (null set). But since the null set is a subset of
any set, ∅ must be a subset of U. Inasmuch as the term “complement of U” implies the notion of
being not in U, whereas the term “subset of U” implies the notion of being in U, it seems
paradoxical for ∅ to be both of these. How do you resolve tis paradox?

By definition,

𝐴𝑐 = {𝑥 ∈ 𝑈 | 𝑥 ∉ 𝐴}
Then,

𝑈 𝑐 = {𝑥 ∈ 𝑈 | 𝑥 ∉ 𝑈} = ∅
There isn’t any paradox while we are talking about the null set as a subset of every set not a part of
any set.

3. Given 𝑺𝟏 = {𝟑, 𝟔, 𝟗}, 𝑺𝟐 = {𝒂, 𝒃}, 𝒂𝒏𝒅 𝑺𝟑 = {𝒎, 𝒏}, find the Cartesian products 𝑺𝟏 × 𝑺𝟐 and
𝑺𝟐 × 𝑺𝟑
a) 𝑆1 × 𝑆2 = {(3, 𝑎), (3, 𝑏), (6, 𝑎), (6, 𝑏), (9, 𝑎), (9, 𝑏)}

b) 𝑆2 × 𝑆3 = {(𝑎, 𝑚), (𝑎, 𝑛), (𝑏, 𝑚), (𝑏, 𝑛)}

4. If the domain of the function 𝒚 = 𝟓 + 𝟑𝒙 is the set {𝒙 | 𝟏 ≤ 𝒙 ≤ 𝟗}, find the range of the
function and express it as a set.

Range of y is the set {𝑦 | 8 ≤ 𝑦 ≤ 32}

5. Consider a set X whose element are (x, y) coordinates. If {(𝟏, 𝟒), (𝟓, 𝟕), (𝟏𝟐, 𝟒)} ⊂ 𝑿, could
elements of X feasibly be represented by 𝒚 = 𝒇(𝒙)? Why or why not? Generally, what is the
distinction between a relation (correspondence) and a function?

Elements of X could be represented by a function or they might not, it will depend on the other
elements of X, but only considering those three elements of the subset it is possible to represent
them by a function, because each element of X it is only paired with one element of Y. On the other
hand, a relation (correspondence) does not required to have a unique output or correspondence
for each element in the domain.
6. Condense the following expressions:

𝑎) 𝑥 4 × 𝑥 15 = 𝑥 (4+15) = 𝑥 19
𝑥3
𝑏) = 𝑥 3−(−3) = 𝑥 6
𝑥 −3
1 1
𝑥2 × 𝑥3 3 2 4 1
𝑐) 2 = 𝑥 (6+6−6) = 𝑥 6
𝑥3
𝑑) 𝑥 3 × 𝑦 3 × 𝑧 6 = (𝑥𝑦𝑧 2 )3

7. Provide a proof for 𝒙𝒎 × 𝒚𝒎 = (𝒙𝒚)𝒎

By induction

For m=1

𝑥 1 × 𝑦1 = 𝑥𝑦 = (𝑥𝑦)1
Now if 𝑚1 = 𝑘 holds then prove 𝑚2 = 𝑘 + 1 holds:

𝑥 𝑚1 × 𝑦 𝑚1 = 𝑥 𝑘 × 𝑦 𝑘 = (𝑥𝑦)𝑘

𝑥 𝑚2 × 𝑦 𝑚2 = 𝑥 𝑘+1 × 𝑦 𝑘+1 = 𝑥 𝑘 × 𝑥 × 𝑦 𝑘 × 𝑦
= (𝑥 𝑘 × 𝑦 𝑘 ) × (𝑥 × 𝑦) = (𝑥𝑦)𝑘 × (𝑥𝑦) = (𝑥𝑦)𝑘+1
(𝑥𝑦)𝑚2

8. Provide a proof for 𝑨 ∩ (𝑩 ∪ 𝑪) = (𝑨 ∩ 𝑩) ∪ (𝑨 ∩ 𝑪)

Part 1 (->)

𝐼𝑓 𝑥 ∈ 𝐴 ∩ (𝐵 ∪ 𝐶) 𝑡ℎ𝑒𝑛 𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥 ∈ (𝐵 ∪ 𝐶) 𝑤ℎ𝑖𝑐ℎ 𝑚𝑒𝑎𝑛𝑠:

𝑎) 𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥 ∈ 𝐵, 𝑜𝑟
𝑏) 𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥 ∈ 𝐶,

So 𝑥 ∈ (𝐴 ∩ 𝐵) 𝑜𝑟 𝑥 ∈ (𝐴 ∩ 𝐶) = 𝑥 ∈ (𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶)

Part 2 (<-)

𝐼𝑓 𝑥 ∈ (𝐴 ∩ 𝐵) 𝑜𝑟 𝑥 ∈ (𝐴 ∩ 𝐶) 𝑡ℎ𝑒𝑛
𝑎) 𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥 ∈ 𝐵, 𝑜𝑟
𝑏) 𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥 ∈ 𝐶,
So 𝑥 ∈ 𝐴 𝑎𝑛𝑑 (𝑥 ∈ 𝐵 𝑜𝑟 𝑥 ∈ 𝐶) = 𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥 ∈ (𝐵 ∪ 𝐶) = 𝑥 ∈ 𝐴 ∩ (𝐵 ∪ 𝐶)

9. Prove that if 𝒂𝟐 is even, so is 𝒂

By contradiction, assume a is odd, then

𝑎 = 2𝑞 − 1, 𝑞 𝑖𝑠 𝑎 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒 𝑖𝑛𝑡𝑒𝑔𝑒𝑟
Then

𝑎2 = (2𝑞 − 1)2 = 4𝑞 2 − 4𝑞 + 1 = 2(2𝑞 2 − 2𝑞) + 1

Let 𝑝 = 2𝑞 2 − 2𝑞 (integer positive for every value of q), then

𝑎2 = 2𝑝 + 1 𝑤ℎ𝑖𝑐ℎ 𝑖𝑠 𝑜𝑑𝑑 → ⟹⟸
Then a is even.
𝒏(𝒏+𝟏)
10. Prove that the sum of the first n natural numbers (1+2+3+4+…+n) is equal to 𝟐

By induction, for n=1:

1(1 + 1)
=1
2
Now if 𝑛1 = 𝑘 holds then prove 𝑛2 = 𝑘 + 1 holds:
𝑛1
𝑛1 (𝑛1 + 1) 𝑘(𝑘 + 1)
∑𝑖 = = , 𝑡ℎ𝑒𝑛
2 2
𝑖=1
𝑘+1 𝑘
𝑘(𝑘 + 1) 2𝑘 + 2 𝑘 2 + 3𝑘 + 2 (𝑘 + 1 + 1)(𝑘 + 1)
∑ 𝑖 = ∑ 𝑖 + (𝑘 + 1) = + = =
2 2 2 2
𝑖=1 𝑖=1

𝑛2 (𝑛2 + 1)
2
11. Prove that if ≽ is rational and 𝒙 ≻ 𝒚 ≽ 𝒛, then 𝒙 ≻ 𝒛

(𝑥 ≻ 𝑦 ≽ 𝑧) means that (𝑥 ≽ 𝑦) and 𝑛𝑜𝑡 (𝑦 ≽ 𝑥) and (𝑦 ≽ 𝑧). And given that the relation is
rational, it is transitive, then (𝑥 ≽ 𝑧).

Now suppose that (𝑧 ≽ 𝑥), then if 𝑦 ≽ 𝑧 by transitivity we have that (𝑦 ≽ 𝑥).

But that contradicts 𝑥 ≻ 𝑦, which means (𝑥 ≽ 𝑦) and 𝑛𝑜𝑡 (𝑦 ≽ 𝑥). Then we cannot have (𝑧 ≽ 𝑥).

Finally, (𝑥 ≽ 𝑧) and not (𝑧 ≽ 𝑥), that is 𝑥 ≻ 𝑧

12. Prove that if ≽ is rational, then ~ is reflexive (𝒙~𝒙 for all 𝒙), transitive (if 𝒙~𝒚 and 𝒚~𝒛, then
𝒙~𝒛), and symmetric (if 𝒙~𝒚, then 𝒚~𝒙)

∀𝑥, 𝑦 ∈ 𝑋 𝑥~𝑦 ⟺ 𝑥 ≽ 𝑦 𝑎𝑛𝑑 𝑦 ≽ 𝑥

Given rationality, the relation is complete, then ∀𝑥, 𝑦 ∈ 𝑋, 𝑥 ≽ 𝑦 𝑜𝑟 𝑦 ≽ 𝑥, then choosing y=x, we
have 𝑥 ≽ 𝑥. Then ∀𝑥, 𝑦 ∈ 𝑋 𝑥~𝑥 ⟺ 𝑥 ≽ 𝑥 then ~ is reflexive.

If 𝑥~𝑦 𝑎𝑛𝑑 𝑦~𝑧 then we have that (𝑥 ≽ 𝑦 𝑎𝑛𝑑 𝑦 ≽ 𝑧) 𝑎𝑛𝑑 (𝑦 ≽ 𝑥 𝑎𝑛𝑑 𝑧 ≽ 𝑦). By transitivity of
the rational relation we have that (𝑥 ≽ 𝑧) 𝑎𝑛𝑑 (𝑧 ≽ 𝑥), then 𝑥~𝑧 and the relation is transitive.

If 𝑥~𝑦 then we have that (𝑥 ≽ 𝑦 𝑎𝑛𝑑 𝑦 ≽ 𝑥) . Reordering, ( 𝑦 ≽ 𝑥 𝑎𝑛𝑑 𝑥 ≽ 𝑦), then 𝑦~𝑥 and the
relation is symmetric.
13. Consider a rational relation ≽. Show that if 𝒖(𝒙) = 𝒖(𝒚) implies 𝒙~𝒚 and if 𝒖(𝒙) > 𝒖(𝒚)
implies 𝒙 ≻ 𝒚, then 𝒖(∙) is a utility function representing ≽.

We have that 𝑢(𝑥) = 𝑢(𝑦) ⇒ 𝑥~𝑦 and 𝑢(𝑥) > 𝑢(𝑦) ⇒ 𝑥 ≻ 𝑦. To show that U is a utility function
representing ≽ we must prove that 𝑢(𝑥) ≥ 𝑢(𝑦) ⇒ 𝑥 ≽ 𝑦.
1. 𝑢(𝑥) > 𝑢(𝑦) 𝑤ℎ𝑖𝑐ℎ 𝑖𝑚𝑝𝑙𝑖𝑒𝑠 𝑡ℎ𝑎𝑡 𝑥 ≻ 𝑦
𝑢(𝑥) ≥ 𝑢(𝑦) ⇒ 𝑇ℎ𝑒𝑛 𝑒𝑖𝑡ℎ𝑒𝑟 { 𝑜𝑟
2. 𝑢(𝑥) = 𝑢(𝑦) 𝑤ℎ𝑖𝑐ℎ 𝑖𝑚𝑝𝑙𝑖𝑒𝑠 𝑡ℎ𝑎𝑡 𝑥~𝑦
In the first case, we have that (𝑥 ≽ 𝑦) and 𝑛𝑜𝑡 (𝑦 ≽ 𝑥).

In the second case, we have that (𝑥 ≽ 𝑦) and (𝑦 ≽ 𝑥).

So, either way we have that (𝑥 ≽ 𝑦), then 𝑢(𝑥) ≥ 𝑢(𝑦) ⇒ 𝑥 ≽ 𝑦

14. Consider the choice structure (𝜷, 𝑪(∙)) with 𝜷 = ({𝒙, 𝒚}, {𝒙, 𝒚, 𝒛}) and 𝑪({𝒙, 𝒚}) = {𝒙}. Show
that if (𝜷, 𝑪(∙)) satisfies WARP, then it must be the case that 𝑪({𝒙, 𝒚, 𝒛}) ∈ {{𝒙}, {𝒛}, {𝒙, 𝒛}}.

Let suppose that 𝐶({𝑥, 𝑦, 𝑧}) ∉ {{𝑥}, {𝑧}, {𝑥, 𝑧}}, then 𝐶({𝑥, 𝑦, 𝑧}) ∈ {{𝑦}, {𝑥, 𝑦}, {𝑦, 𝑧}, {𝑥, 𝑦, 𝑧}}. For
each element, we need to prove a contradiction.

If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑦}, then given that{𝑥, 𝑦} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑥, 𝑦} ∈ {𝑥, 𝑦} and given that (𝛽, 𝐶(∙))
satisfies WARP, {𝑦} ∈ 𝐶({𝑥, 𝑦}), contradicting 𝐶({𝑥, 𝑦}) = {𝑥}.

If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑥, 𝑦}, then given that {𝑥, 𝑦} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑥, 𝑦} ∈ {𝑥, 𝑦} and given that (𝛽, 𝐶(∙))
satisfies WARP, {𝑦} ∈ 𝐶({𝑥, 𝑦}), contradicting 𝐶({𝑥, 𝑦}) = {𝑥}.

If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑦, 𝑧}, then given that {𝑥, 𝑦} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑥, 𝑦} ∈ {𝑥, 𝑦} and given that (𝛽, 𝐶(∙))
satisfies WARP, {𝑦} ∈ 𝐶({𝑥, 𝑦}), contradicting 𝐶({𝑥, 𝑦}) = {𝑥}.

If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑥, 𝑦, 𝑧}, then given that {𝑥, 𝑦} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑥, 𝑦} ∈ {𝑥, 𝑦} and given that
(𝛽, 𝐶(∙)) satisfies WARP, {𝑦} ∈ 𝐶({𝑥, 𝑦}), contradicting 𝐶({𝑥, 𝑦}) = {𝑥}.

Then 𝐶({𝑥, 𝑦, 𝑧}) ∈ {{𝑥}, {𝑧}, {𝑥, 𝑧}}.

15. Show that WARP is equivalent to the following property: Suppose that 𝑩, 𝑩’ ∈ 𝜷, that 𝒙, 𝒚 ∈
𝑩, and that 𝒙, 𝒚 ∈ 𝑩′ . Then if 𝒙 ∈ 𝑪(𝑩) 𝒂𝒏𝒅 𝒚 ∈ 𝑪(𝑩′ ), it must be the case that {𝒙, 𝒚} ⊆
𝑪(𝑩) 𝒂𝒏𝒅 {𝒙, 𝒚} ⊆ 𝑪(𝑩′)
We need to prove that (𝑥 ∈ 𝐶(𝐵) 𝑎𝑛𝑑 𝑦 ∈ 𝐶(𝐵′ ) ⇒ {𝑥, 𝑦} ⊆ 𝐶(𝐵) 𝑎𝑛𝑑 {𝑥, 𝑦} ⊆ 𝐶(𝐵′ )) is
equivalent (⇔) to (𝑥 ∈ 𝐶(𝐵) 𝑎𝑛𝑑 𝑦 ∈ 𝐶(𝐵′ ) ⇒ {𝑥} ∈ 𝐶(𝐵′) )

First part (⇒)

If (𝑥 ∈ 𝐶(𝐵) 𝑎𝑛𝑑 𝑦 ∈ 𝐶(𝐵′ ) ⇒ {𝑥, 𝑦} ⊆ 𝐶(𝐵′ ) then {𝑥} ∈ 𝐶(𝐵′) )

Second part (⇐)

𝑥 ∈ 𝐶(𝐵) 𝑎𝑛𝑑 𝑦 ∈ 𝐶(𝐵′ ) ⇒ {𝑥} ∈ 𝐶(𝐵′) , and analogously we could say that 𝑦 ∈ 𝐶(𝐵′ ) 𝑎𝑛𝑑 𝑥 ∈
𝐶(𝐵) ⇒ {𝑦} ∈ 𝐶(𝐵) ). Then {𝑦} ∈ 𝐶(𝐵′ ) 𝑎𝑛𝑑 {𝑥} ∈ 𝐶(𝐵′ ) 𝑎𝑛𝑑 {𝑦} ∈ 𝐶(𝐵) 𝑎𝑛𝑑 {𝑥} ∈ 𝐶(𝐵).

Then given that 𝑥, 𝑦 ∈ 𝐶(𝐵) and 𝑥, 𝑦 ∈ 𝐶(𝐵′), {𝑥, 𝑦} ⊆ 𝐶(𝐵) 𝑎𝑛𝑑 {𝑥, 𝑦} ⊆ 𝐶(𝐵′).
16. Let 𝑿 = {𝒙, 𝒚, 𝒛} and consider the choice structure (𝜷, 𝑪(∙)) 𝒘𝒊𝒕𝒉 𝜷 =
({𝒙, 𝒚}, {𝒚, 𝒛}, {𝒙, 𝒛}, {𝒙, 𝒚, 𝒛}) and 𝑪({𝒙, 𝒚}) = {𝒙}, 𝑪({𝒚, 𝒛}) = {𝒚}, 𝑪({𝒙, 𝒛}) = {𝒛}. Show that
(𝜷, 𝑪(∙)) violates WARP.

If (𝛽, 𝐶(∙)) is a choice structure, then 𝐶({𝑥, 𝑦, 𝑧}) exists and 𝐶({𝑥, 𝑦, 𝑧}) ∈
{{𝑥}, {𝑦}, {𝑧}, {𝑥, 𝑦}, {𝑦, 𝑧}, {𝑥, 𝑧}, {𝑥, 𝑦, 𝑧}}. Then either:
𝑎. 𝐶({𝑥, 𝑦, 𝑧}) = {𝑥}
𝑜𝑟
𝑏. 𝐶({𝑥, 𝑦, 𝑧}) = {𝑦}
𝑜𝑟
𝑐. 𝐶({𝑥, 𝑦, 𝑧}) = {𝑧}
𝑜𝑟
𝑑. 𝐶({𝑥, 𝑦, 𝑧}) = {𝑥, 𝑦}
𝑜𝑟
𝑒. 𝐶({𝑥, 𝑦, 𝑧}) = {𝑦, 𝑧}
𝑜𝑟
𝑓. 𝐶({𝑥, 𝑦, 𝑧}) = {𝑥, 𝑧}
𝑜𝑟
𝑔. 𝐶({𝑥, 𝑦, 𝑧}) = {𝑥, 𝑦, 𝑧}
a. If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑥} and 𝐶({𝑥, 𝑧}) = {𝑧}, then given that {𝑥, 𝑧} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑥, 𝑧} ∈
{𝑥, 𝑧} 𝑎𝑛𝑑 {𝑥} ∉ 𝐶({𝑥, 𝑧}), WARP is violated
b. If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑦} and 𝐶({𝑥, 𝑦}) = {𝑥}, then given that {𝑥, 𝑦} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑥, 𝑦} ∈
{𝑥, 𝑦} 𝑎𝑛𝑑 {𝑦} ∉ 𝐶({𝑥, 𝑦}), WARP is violated
c. If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑧} and 𝐶({𝑦, 𝑧}) = {𝑦}, then given that {𝑦, 𝑧} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑦, 𝑧} ∈
{𝑦, 𝑧} 𝑎𝑛𝑑 {𝑧} ∉ 𝐶({𝑦, 𝑧}), WARP is violated
d. If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑥, 𝑦} and 𝐶({𝑥, 𝑦}) = {𝑥}, then given that {𝑥, 𝑦} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑥, 𝑦} ∈
{𝑥, 𝑦} 𝑎𝑛𝑑 {𝑦} ∉ 𝐶({𝑥, 𝑦}), WARP is violated.
e. If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑦, 𝑧} and 𝐶({𝑦, 𝑧}) = {𝑦}, then given that {𝑦, 𝑧} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑦, 𝑧} ∈
{𝑦, 𝑧} 𝑎𝑛𝑑 {𝑧} ∉ 𝐶({𝑦, 𝑧}), WARP is violated
f. If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑥, 𝑧} and 𝐶({𝑥, 𝑧}) = {𝑧}, then given that {𝑥, 𝑧} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑥, 𝑧} ∈
{𝑥, 𝑧} 𝑎𝑛𝑑 {𝑥} ∉ 𝐶({𝑥, 𝑧}), WARP is violated.
g. If 𝐶({𝑥, 𝑦, 𝑧}) = {𝑥, 𝑦, 𝑧} and 𝐶({𝑥, 𝑧}) = {𝑧}, then given that {𝑥, 𝑧} ∈ {𝑥, 𝑦, 𝑧} 𝑎𝑛𝑑 {𝑥, 𝑧} ∈
{𝑥, 𝑧} 𝑎𝑛𝑑 {𝑥} ∉ 𝐶({𝑥, 𝑧}), WARP is violated.

Then (𝛽, 𝐶(∙)) violates WARP.