# Axioms of Probability

1. Apr 25, 2005

### eddo

In my probability class we were given two versions of probability axioms which are equivalent. Let S be the sure event, A and B any arbitrary events, I the impossible event. I will use u to denote union, and n to denote intersection:

Version 1
1. P(S)=1
2. P(A)>=0
3. If AnB=I, than P(AuB)=P(A)+P(B)

Version 2
1. P(S)=1
2. P(A)>=0
3. P(I)=0
4. P(AuB)=P(A)+P(B)-P(AnB)

It is easy to go from version 2 to version 1, and I can see how to show that P(I)=0 using version 1. The problem I'm having is how to derive axiom 4 of version 2 from version 1. I know I will have to consider two events made up of unions and intersections of A and B, to which I can apply axiom 3 of version 1, but I can't quite figure out how to do it. Thanks for any help.

2. Apr 25, 2005

### BicycleTree

After some trial and error I got this: partition A u B into A n ~B, A n B, and B n ~A. If you work that out you can get the right expression; one of the terms you'll get is P(A n B), and there is a way to go from P(A n B) to -P(A n B) and the other terms will fall into place.

3. Apr 25, 2005

### eddo

I tried this but wasn't able to work it out. How do you go from P(AnB) to -P(AnB)? Once I get to the second step I'm not sure how to write the two terms other than P(AnB) in any other way, since they involve intersections, and the axioms version 1 don't say anything about intersections. You can rewrite the other two terms (before you make them into 2 seperate terms) as (An~B)u(Bn~A)=(AuB)n(~Bu~A), but once again this involves intersections, not unions which doesn't help much.

4. Apr 25, 2005

### eddo

Nevermind I got it. You just have to turn P(AnB) into 2P(AnB)-P(AnB), then group one of each of the positive terms with your other two terms. Axiom 3 of version 1 can than be used in reverse to turn each of these into a single probability, where the events in question simplify, using boolean algebra, to A and B. Thanks for the help Bicycle Tree.

Similar Discussions: Axioms of Probability
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8273283839225769, "perplexity": 580.1276336176694}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-34/segments/1502886104636.62/warc/CC-MAIN-20170818121545-20170818141545-00565.warc.gz"}