Section 1

Operations on subsets. Calculation of the number of elements

[6/50%]
Show
LaTeX
Problem 1.1

Let Ai(i∈I),BA_{i}(i \in I), B be subsets of XX. Prove the equalities:

?
(a)

(⋃i∈IAi)∩B=⋃i∈I(Ai∩B)\left(\bigcup_{i \in I} A_{i}\right) \cap B=\bigcup_{i \in I}\left(A_{i} \cap B\right);

(b)

(⋂i∈IAi)∪B=⋂i∈I(Ai∪B)\left(\bigcap_{i \in I} A_{i}\right) \cup B=\bigcap_{i \in I}\left(A_{i} \cup B\right);

(c)

⋃i∈IAi‾=⋂i∈IAi‾\overline{\bigcup_{i \in I} A_{i}}=\bigcap_{i \in I} \overline{A_{i}};

(d)

⋂i∈IAi=⋃i∈IAi‾\bigcap_{i \in I} A_{i}=\bigcup_{i \in I} \overline{A_{i}}.

Problem 1.2

Let XX be an arbitrary set, and let 2X2^{X} be the set of all its subsets. Prove that the operation △\triangle of symmetric difference

AΔB=(A∩Bˉ)∪(Aˉ∩B) A \Delta B=(A \cap \bar{B}) \cup (\bar{A} \cap B)

on the set 2X2^{X} has the following properties:

?
(a)

A△B=B△AA \triangle B=B \triangle A;

(b)

(A△B)△C=A△(B△C)(A \triangle B) \triangle C=A \triangle (B \triangle C);

(c)

A△∅=AA \triangle \varnothing =A;

(d)

for any subset A⊂XA \subset X there exists a subset B⊂XB \subset X such that A△B=∅A \triangle B=\varnothing;

(e)

(A△B)∩C=(A∩B)△(A∩C)(A \triangle B) \cap C=(A \cap B) \triangle (A \cap C);

(f)

A△B=(A∪B)\(A∩B)A \triangle B=(A \cup B) \backslash (A \cap B);

(g)

AΔB=(A\B)∪(B\A)A \Delta B=(A \backslash B) \cup (B \backslash A).

Problem 1.3

Prove that for any finite sets A1,…,AnA_{1}, \ldots , A_{n}

∣⋃i=1nAi∣=∑i=1n∣Ai∣−∑1⩽i<j⩽n∣Ai∩Aj∣+……+(−1)k−1∑1⩽i1<…<ik⩽n∣Ai1∩…∩Aik∣+……+(−1)n−1∣A1∩…∩An∣ \begin{aligned} \left|\bigcup _{i=1}^{n} A_{i}\right|= & \sum _{i=1}^{n}\left|A_{i}\right|-\sum _{1 \leqslant i<j \leqslant n}\left|A_{i} \cap A_{j}\right|+\ldots \\ & \quad \ldots +(-1)^{k-1} \sum _{1 \leqslant i_{1}<\ldots <i_{k} \leqslant n}\left|A_{i_{1}} \cap \ldots \cap A_{i_{k}}\right|+\ldots \\ & \quad \ldots +(-1)^{n-1}\left|A_{1} \cap \ldots \cap A_{n}\right| \end{aligned}
?
Problem 1.4

Prove that for any natural number n>1n>1

φ(n)=n(1−1p1)(1−1p2)…(1−1pr). \varphi (n)=n\left(1-\frac{1}{p_{1}}\right)\left(1-\frac{1}{p_{2}}\right) \ldots \left(1-\frac{1}{p_{r}}\right).

where p1,p2,…,prp_{1}, p_{2}, \ldots , p_{r} are all the distinct prime divisors of nn, and φ(n)\varphi (n) is Euler's function.

?
Problem 1.5

What is the maximum number of subsets that can be formed from nn given subsets of a fixed set using the operations of intersection, union, and complementation?

?
Problem 1.6

Let A,B,CA, B, C be subsets of some set. Prove that A∩B⊆CA \cap B \subseteq C if and only if A⊆Bˉ∪CA \subseteq \bar{B} \cup C.

?