Prove that A ∪ ∅=A
how rigorous of a proof is what i'm wondering...
Hmm.. me too.
|dw:1340462741204:dw|
this is the venn diagram of a union \(\phi\)
\[\begin{align}A \cup \emptyset &= \{x|x\in A \wedge x\in\emptyset\}\\ &=\{x|x\in A\}\\ &=A \end{align}\] since \(x\in\emptyset=F\), so that \(x\in A=T\).
but \(\phi\) is nothing, zilch! so anything combined with zilch is that thing itself!!
right @apoorvk hence proved :)
phi is the empty set
you prove two sets are equal by showing containment in each direction, i.e. showing \ \[A\subseteq (A \cup \emptyset)\] and \[(A \cup \emptyset)\subseteq \cup A\]
Btw, HAPPY BIRTH CENTENARY to ALAN TURING, aka @TuringTest in this life :P
Hence, Proved -_- @mathslover lol
lol
or you can use blockcolder way but i think there is a typo there \[\begin{align}A \cup \emptyset &= \{x|x\in A \lor x\in\emptyset\}\\ &=\{x|x\in A\}\\ &=A \end{align}\]
Thanks for all your responses .
Oh yeah. Never noticed that. Thanks for the correction!
@Hollywood_chrissy you can do this the slow way by picking \(x\in A\) and showing it is in \(A\cup \emptyset\) which it is, since it is in A and then pick \(x\in A\cup \emptyset\) and showing it is in A, since \(\emptyset\) is empty, if \(x\in A\cup \emptyset\) then \(x\in A\) and you are done
suppose \(A=\mathbb{R}\)?
\[A=\{a_0, a_1,a_2,\cdots,a_n\}\qquad ø=\{\}\] \[A+ø=\{a_0,\}+\{a_1\}+\{a_2\}+\cdots+\{a_n\}+\{\}\]\[\qquad=\{a_0, a_1,a_2,\cdots,a_n\}=A\]
Join our real-time social learning platform and learn together with your friends!