MHB Set Theory Proofs: A, B, and C - Solving for Set Equality and Complements

MikeLandry
Messages
2
Reaction score
0
I have gotten to this point with a and b but do i am totally lost with c. Any help would be much appreciated

Consider any three arbitrary sets A, B and C.
(a) Show that if A ∩ B = A∩ C and A ∪ B = A ∪ C, then B = C.
(b) Show that if A − B = B − A, then A = B.
(c) Show that if A∩B = A∩C = B ∩C and A∪B ∪C = U, then A⊕B ⊕C = U.

For the three proofs so far i have

a) So A intersects C = A intersects B and A union B= A union C.

Let
png.latex
then
png.latex
. Suppose then that
png.latex
then
png.latex
and thus
png.latex
. Contradiction.

Similarly, let
png.latex
then
png.latex
. Suppose that
png.latex
then
png.latex
and so
png.latex
. Contradiction

b)
AB=ABc where Bc is the complement of B.

Now if AB then (x)[xABc or xBAc]for
 
Physics news on Phys.org
Hi MikeLandry,

Welcome to MHB! :)

I think you have the right idea for part one, but I would alter a couple of things. To show two sets, $B$ and $C$ are equal you need to show $B \subseteq C$ and $C \subseteq B$. Put another way $x \in B \implies x \in C$ and $x \in C \implies x \in B$. I think you already showed both of those things by the contrapositive but you didn't write what you showed implies.

Jameson
 
Thank you very much for your quick reply. I feel confident with my solutions for questions a and b but any insite on how to solve part c would be greatly appreciated
 
MikeLandry said:
I feel confident with my solutions for questions a and b but any insite on how to solve part c would be greatly appreciated

An elegant way (but not the only one), is to use the characteristic function. Being $U$ an universal set and $M\subset U$ the characteristic function $1_M:U\to \{0,1\}$ is defined by: $$1_M(x)=\left \{ \begin{matrix} 1 & \mbox{ if }& x\in M \\0 & \mbox{if}& x\not\in M\end{matrix}\right.$$ Using the properties $$\begin{aligned}&M_1=M_2\Leftrightarrow1_{M_1}=1_{M_2}\\&1_{M\cup N}=1_M+1_N-1_M\cdot 1_N\\&1_{M\oplus N}=1_M+1_N-2\cdot1_M\cdot 1_N\end{aligned}$$ and the hypothesis $A\cup B\cup C=U$ (that is, $1_{A\cup B\cup C}=1_U$) you'll easily verify that $A\oplus B\oplus C=U$ iff: $$1_A\cdot 1_B+1_A\cdot 1_C+1_B\cdot 1_C-3\cdot 1_A\cdot 1_B\cdot 1_C=0$$ Now, use the hypothesis $A\cap B=A\cap C=B\cap C$.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top