2
$\begingroup$

I am having a hard time proving this simple and natural identity of sets. what I do is go round and round in circles:

$$A\cup( A\cap B) = (A\cup A) \cap (A\cup B)$$ $$= A \cap(A\cup B)$$

Now what? I apply the distributive property again and reach the first expression. How can I show this using set properties (distributive, idempotent, associative, de morgan etc)?

$\endgroup$
10
  • 3
    $\begingroup$ Hint: $A\cap B\subset A$. $\endgroup$ Feb 10, 2016 at 17:07
  • $\begingroup$ Do you have the absorption laws in your toolkit? This is one of them. $\endgroup$ Feb 10, 2016 at 17:08
  • $\begingroup$ @gniourf_gniourf I have done it by element chasing method, but wanted to use set properties instead. You mean proving each other the subsets of each other to show equality right? $\endgroup$
    – jonsno
    Feb 10, 2016 at 17:08
  • 1
    $\begingroup$ @DrHAL But that is still not using the set properties. Although it is valid proof. $\endgroup$
    – jonsno
    Feb 10, 2016 at 17:17
  • 1
    $\begingroup$ @BrianM.Scott Yes they are in my toolkit! $\endgroup$
    – jonsno
    Feb 10, 2016 at 17:18

3 Answers 3

2
$\begingroup$

Assume that $A$ and $B$ are subsets of some universal set $X$. Then

$$\begin{align*} A\cup(A\cap B)&=(\color{red}A\cap X)\cup(\color{red}A\cap B)\\ &=\color{red}A\cap(X\cup B)\\ &=A\cap X\\ &=A\;. \end{align*}$$

$\endgroup$
2
  • $\begingroup$ Thanks but I cant get how you got to second step $(A\cap(X\cup B))$ from line 1 $\endgroup$
    – jonsno
    Feb 10, 2016 at 17:20
  • $\begingroup$ @samjoe: One of the distributive laws. $\endgroup$ Feb 10, 2016 at 17:21
0
$\begingroup$

Answer 1. Clearly $A \subseteq A\cup (A\cap B).$
For the converse, Note that $\color{maroon}A \subseteq A$ and $\color{lime}{A\cap B} \subseteq A$. So $\color{maroon}A\cup \color{lime}{(A\cap B)} \subseteq A.$


Answer 2. If $x\in A$, clearly $x\in A\cup (A\cap B).$
Let $x\in A\cup (A\cap B).$ So either $\color{red}{x\in A}$ or $\color{blue}{x\in (A\cap B)}.$ The blue means $\color{blue}{x\in A},$ and $\color{blue}{x\in B}.$ So in both cases (blue&red) we have $x\in A$.

$\endgroup$
-1
$\begingroup$

$A∪(A∩B)=(A∪A)∩(A∪B)$=$A∩(A∪B)$=$A$, the first equality using the distribution law and the last equality since $A\subset A∪B$.

$\endgroup$
0

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .