last day (15 days later) » 

23:25
Oh neat-o!
Okay, so let's see what we have here
Okie, let me just copy paste from previously :D
$P(X)$ :
$P(A\cap B^c) = P(A) + P(B^c) - P(A \cup B^c)$
$P(Y)$:
$P(A^c \cap B) = P(A^c) + P(B) - P(A^c \cup B)$
The proof in question is:
prove: $P((A\cap B^c) \cup (A^c\cap B)) = P(A) + P(B) - 2P(A \cap B)$
where $X = A \cap B^c$ and $Y = A^c \cap B$
Okay, I agree with everything you have
23:28
And $P(X) + P(Y)$ is equal to the LHS of the proof statement
@OneRaynyDay Yep.
awesome, okay so after adding both and rearranging I get:
$P(A) + P(A^c) + P(B) + P(B^c) - P(A \cup B^c) - P(A^c \cup B)$
Whereas we can see it's equal to $ 2 - P(A \cup B^c) - P(A^c \cup B)$
Yeah, and then you have $P(X) + P(Y) = $ that stuff ^
Now here's the problem
yup :D
The only thing you can do from here is use the addition rule again... chances are, if you're having to use the addition rule twice on the same union, you're probably doing something wrong
23:30
yeah... So that was my first attempt
I figured I was in a dead-end in this respect
K, let's see your 2nd one
Cool, so for the 2nd one I tackled it straight in the statement $(A \cap B^c) \cup (A^c \cap B)$
(the statement within the LHS probability function)
This was where I asked for the foil-y statement confirmation haha
So following that I got:
$((A\cap B^c)\cup A^c) \cap ((A \cap B^c)\cup B)$
And upon rearranging:
$((A \cup A^c) \cap B^c) \cap ((B^c \cup B) \cap A)$
and as we know that means it's
$B^c \cap A$
Unfortunately, what you did there isn't true
23:33
Oh nos
Actually, $(A \cap B^c) \cup A^c = (A \cap A^c) \cup (B^c \cap A^c)$
OH.
Ohmy- okay I see what you mean
Then the correct version would be...
@OneRaynyDay OOOPS
I did that wrong
did what wrong?
Wait, nvm
My work is right
I always screw up those set properties
23:36
yeah same haha
@OneRaynyDay Wait
Lol
Let's look here
The algebra of sets defines the properties and laws of sets, the set-theoretic operations of union, intersection, and complementation and the relations of set equality and set inclusion. It also provides systematic procedures for evaluating expressions, and performing calculations, involving these operations and relations. Any set of sets closed under the set-theoretic operations forms a Boolean algebra with the join operator being union, the meet operator being intersection, and the complement operator being set complement. == Fundamentals == The algebra of sets is the set-theoretic analogue of...
$(A \cap B^c) \cup A^c = A^c \cup (A \cap B^c)$
so that would be
$(A^c \cup A) \cap (A^c \cup B^c)$
Whew, there we go
wait... but if we apply the associative principle
$(X \cap Y) \cup Z$
@OneRaynyDay No, notice that everything faces the same way for associative
They're either all $\cup$ or $\cap$
Ahhhhh
Not the case here
23:38
Wow I would've gotten that wrong so hard on an exam
thanks for the save haha
Okie, then following the previous agreed answer, we'd have something like...
$P(A^c \cup B^c)$ right?
woopsies not so fast
@OneRaynyDay Yeah, it's some strange compound set
Yeah - it would be
Let's just put it this way... you don't want to work with $(A^c \cup A) \cap (A^c \cup B^c)$.
but $(A^c \cup A) = \omega$
If you'd like, I can guide you through an approach
23:41
oops the capital omega
oh yeah sure!
Yes, but the thing is, you want to work with disjoint unions. $P$ works well with those, not so well with intersections
ohh I see
got it
So we want to prove $P((A \cap B^c) \cup (A^c \cap B)) = P(A) + P(B) - 2P(A \cap B)$
To start, it should be easy to see that $A \cap B^c$ and $A^c \cap B$ are a disjoint union
so on the LHS, we can do $P(A \cap B^c) + P(A^c \cap B)$
right
ohhhh I see it LOL
the moment you stated the additiveness, I see it pretty straight
Now let's see how this works
23:43
$P(A \cap B^c) = P(A) - P(A \cup B)$?
Yeah, then apply that same equation to the other one, since $A^c \cap B = B \cap A^c$
If you've already proven that equation, this is easy
omg I see it LOL
and you're done
ahhhh -scratches head- how did you see that so easily
I've had a lot of practice with these
To see it visually though
Quick sec
Here's $A^c \cap B$:
23:46
ahh right
and here's $A \cap B^c$:
This isn't a "rigorous" proof that they're disjoint, but it's easy to see
right, intuitively that makes sense
and what's nice about $P$ is that when you take a union of two sets that are disjoint, you can add those two probabilities together instead
I.e., if $X$ and $Y$ are disjoint, $P(X \cup Y) = P(X) + P(Y)$
Also I didn't have a "rigorous" proof that $P(A \cap B^c) = P(A) - P(A \cap B)$ but rather visualized it
Mmm, gotcha
I should look out for the disjointness of sets when doing these problems
@OneRaynyDay Well, let's make it rigorous
@OneRaynyDay Oh wait
@OneRaynyDay It should be $A \cap B$, not $A \cup B$
23:49
ohh woops
@OneRaynyDay Anyway, it's pretty easy to prove rigorously. Show $A = (A \cap B^c) \cup (A \cap B)$ is a disjoint union
@OneRaynyDay Thus, $P(A) = P(A \cap B^c) + P(A \cap B)$. Done.
ah yeah - after I made it into a $\cap$ it made a ton of sense LOL
silly mistakes oh man ;-;
Better to make them now than on the exam, I'd say
It'll take some practice
Gotcha. Thank you sooooo much man :) This was an enlightening discussion
I've seen this stuff for like 4-5 years, so I've had a lot of practice
No problem
23:51
yep! I was just reading this book: athenasc.com/Prob-2nd-Ch1.pdf
Oh I see :D Do you do a lot of probability theory/statistics?
@OneRaynyDay Yeah, I'm doing a masters in statistics
Ahhh - inference based?
This is the kinda stuff I've been doing lately
Sounds fun nonetheless!
For now, yes; I'm bringing in machine learning into my toolset as well
23:52
Ah wow - one day I hope to be like you haha
I'm a computer science major, but looking to specialize in machine learning
Haha, I'm flattered. Probability's so much fun
I wish I had a better CS background
unlike everyone who follows the latest trends without understanding it I'd much rather learn the material rigorously
so I'm starting from the basics of probability and building up from there :) so I'd say I envy your background!
My math/stats background is fine, but I'm having to self-teach the CS stuff. Looking into learning about algorithmic efficiency soon, maybe some C++ too
Ooh - if you'd like, I could teach you C++ and we can trade skills?
We can even trade contacts that way
Hmm, if you're serious about that, I'd like to pursue it
23:54
I'm pretty proficient in C++, enough to get me into Microsoft and Bloomberg's internship program
Dang
Congrats on that
So yeah! PLEASE let me know if you'd like any help haha
Yeah, here's my programming background
Thank you! It's nothing special though, when compared to your statistics background LOL
VBA, LaTeX (if you even consider that programming), Python, and I use SQL and R on a daily basis
23:55
Ah yeah, R is a statistician's language
Well, what would you prefer: FB or e-mail?
both is fine! :D
I look forward to working with you more :)
Sent you a request (I'm Ray Zhang)
Awesome :) thank you man!
Well, Ray, nice to meet you. I'm starting to learn C++ since it underlies R
23:56
I'll be taking a machine learning class next quarter and I'll definitely need some help haha, so don't hesitate to message me whenever you want to know something about C++, it's my most proficient language second to java/python
because if you don't, I'd feel like I'm bothering you too much ^_^
Yeah, I'm no machine learning expert lol. I'm still learning. Stats helps some, but not much
My forte is the math/stats side
yeah - but it's no problem! The class is very probability-theory heavy and so as a result the class is more theoretical
The programming aspect is easy if you understand the math :)
K, well, feel free to just chat me on FB whenever you feel like it. Got any other questions?
no questions for now! :D thanks!
@OneRaynyDay K, then I have one quick question for you
23:59
and same for you; I'm pretty active on messenger :)
If I know basic programming in R/Python, you know - variables, loops, conditional statements, data structures and the like, how do I become a better programmer? @OneRaynyDay

  last day (15 days later) »