Home » Food Marketing Corner » Algebraic Proof for Simple Set Theory Problem

Algebraic Proof for Simple Set Theory Problem

Alexander Ross • • 2 min read
Algebraic Proof for Simple Set Theory Problem
$\begingroup$

Prove that:

$(A^{c}\cap B^{c} \cap C) \cup (B \cap C) \cup (A \cap C) = C$

(cmp = complement)

Now, one way to solve this is to take a small universe $U$, say $U$ = {a, b, c, d, e, f, g}, draw the Venn diagram, figure out the union-ed parts of the equation and prove it.

How can we do this purely algebraically? using the laws of sets like the idempotent law, duality, domination, absorption etc?

$\endgroup$
1

1 Answer

$\begingroup$

The algebraic way to solve this is to remember that union and intersection are distributive over one another, therefore:

$$\begin{align} & (A^c\cap B^c\cap C) \cup (B\cap C) \cup (A\cap C) &=&(\text{un-distribute } \cap C) \\ & \Big( (A^c\cap B^c) \cup B \cup A\Big)\cap C &=&(\text{distribute }\cup B) \\ & \Big( (A\cup B)^c \cup (B\cup A)\Big)\cap C &=&(\text{de Morgan's law}) \\ & &=&C \end{align}$$

(As Theo suggested, using de Morgan's law shortens the proof.)

$\endgroup$
2

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Alexander Ross
Author

Alexander Ross

Alexander Ross has covered the video game industry for a decade, writing deep dives on game design, esports tournaments, VR developments, and gaming culture.