MHB How can we prove $P(A \cap B) = P(A) \cap P(B)$?

  • Thread starter Thread starter tmt1
  • Start date Start date
  • Tags Tags
    Power Sets
tmt1
Messages
230
Reaction score
0
$P(A \cap B) = P(A) \cap P(B)$

How can we prove this to be true?
 
Last edited by a moderator:
Physics news on Phys.org
Hi tmt,

To show two sets $X$ and $Y$ are equal, you must prove that every element of $X$ belongs to $Y$ and vice versa. In your case, you must prove that every element of $P(A\cap B)$ belongs to $P(A)\cap P(B)$, and every element of $P(A) \cap P(B)$ belongs to $P(A\cap B)$. Use the definitions of the power set and intersection $\cap$ to do it.
 
Normally, the way one proves that two sets are equal is to show they contain exactly the same elements-which is equivalent to showing they are subsets of each other.

Here's how one such proof might begin:

Suppose $X \in P(A \cap B)$. Then $X \subseteq A \cap B$.

Now $A \cap B \subseteq A$, and $A \cap B \subseteq B$, by the definition of "$\cap$".

So, $X \subseteq A$, and...
 
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...
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Back
Top