SlideShare uma empresa Scribd logo
1 de 18
1.3 Elementary Theoremsand Conditional Probability
Theorem 1,2 Generalization of third axiom of probability Theorem 1: If A1, A2,….,Anare mutually exclusive events in a sample space, then P(A1 A2….An) = P(A1) + P(A2) + …+ P(An). Rule for calculating probability of an event Theorem 2: If A is an event in the finite sample space S, then P(A) equals the sum of the probabilities of the individual outcome comprising A.
Theorem 3 Proof: If E1, E2,……Enbe the n outcomes comprising event A, then A = E1E2 ……  En. Since the E’s areindividual outcomesthey are mutually exclusive, and by Theorem 1, we have  		P(A) = P(E1E2 ……  En)          	        = P(E1) + P(E2) + …+ P(En). General addition rule for probability Theorem 3: If  A and  B are any events in S, then 			   P(AB) = P(A) + P(B) – P(AB).
Theorem 4 Note: When A and B are mutually exclusive  so that P(AB) = 0, Theorem 3 reduces to the third axiom of probability therefore the third axiom of probability also called the special addition rule Probability rule of the complements Theorem 4: If A is any event in S, then  P( ) = 1 – P(A).
Proof are mutually exclusive by Proof: Since A and definition and A =  S. Hence we have ) = P(S) = 1. P(A) + P( ) = P (A P(    ) = 1 – P( ) = 1 – P( S ) = 0. If A  B then P(B) = P(B) - P(A)  P(A  B) = P(A) + P(B) - 2 P(AB)
 Conditional Probability If we ask for the probability of an event then it is meaningful only if we mention about the sample space. When we use the symbol P(A) for probability of A, we really mean the probability of A with respect to some sample space S.  Since there are problems in which we are interested in probabilities of A with respect to more sample spaces than one, the notation P(A|S) is used to make it clear that we are referring to a particular sample space S.
Conditional Probability P(A|S)  conditional probability of A relative to S. Conditional probability: If A and B are any events in S and P(B)  0, the conditional probability of A given B is  P (A|B) is the probability that event A occurs once event B has occurred
Conditional Probability (cont’d) Reduced Sample Space A  B S B A P(A|B) measures the relative probability of A with respect to the reduced sample space B
Conditional Probability (cont’d) If A and B are any two events in the sample space S, Then the event A is independent of the event B if and only if  P(A|B) = P(A) i.e. occurrence of B does not influence the     occurrence of A.  But B is independent of A whenever A is independent of B.   A and B are independent events if and only if  either  P(A|B) = P(A)or    P(B|A) = P(B)
Conditional Probability General multiplication rule of probability Theorem 5: If A and B are any events in S, then P(AB) = P(A)· P(B|A)	if P(A)0 = P(B)· P(A|B)	if P(B)0 Special product rule of probability Theorem 6: Two events A and B are independent events if and only if 		   P(AB) = P(A)· P(B)
The mutually exclusive events are not independent unless one of them has zero probability. If an event A is independent of itself then P(A) = 0 or P(A) = 1 If the events A and B are independent, then so are events     and B, events A and     and events     and                    .
Bayes’ Theorem Let S be a sample space and B1, B2,….Bnbe mutually exclusive events such that               S = B1B2 …… Bn and A be an event in the sample space S. Then 		A = AS = A(B1B2 …… Bn) 		   = (A B1)  (A B2) ……. (A Bn). Since all A  Bi ’s are mutually exclusive events     P(A)=P(AB1) + P(AB2) +……. + P(ABn).
Bayes’ Theorem or But from multiplication rule for probability P(ABi) = P(Bi)·P(A|Bi),    for i = 1, 2, …, n hence we have
Bayes’ Theorem Rule of elimination or rule of total probability Theorem 7 : Let A be an event in a sample space S and if B1, B2,……Bn are mutually exclusive events such that S = B1B2 …… Bnand P (Bi)  0 for i = 1, 2, …, n, then
Bayes’ Theorem To visualize this result, we have to construct a tree   diagram where the probability of the final outcome is  given by the sum of the products of the probabilities    corresponding to each branch of the tree. P(A|B1) B1 A B2 P(A|B2) P(B1) A Figure: Tree diagram for rule of elimination P(B2) P(Bn) P(A|Bn) A Bn
Bayes’ Theorem (cont’d) from the definitionof  conditional probability but according to multiplication rule of probability, we have P (Bk  A) = P(Bk)·P(A|Bk). Hence, we have
Bayes’ Theorem Using rule of total probability, we have following result. Bayes’ Theorem Theorem 8: Let A be an event in a sample space S and if B1, B2,……Bn are mutually exclusive events such that S = B1B2 …… Bn and P (Bi)  0 for i = 1, 2, …, n, then for k = 1, 2,….., n.
Bayes’ Theorem This theorem provides a formula for finding the probability that the “effect” A was “caused” by the event Bk. Note: The expression in the numerator is the probability of reaching A via the kth branch of the tree and the expression in the denominator is the sum of the probabilities of reaching A via the n branches of the tree.

Mais conteúdo relacionado

Mais procurados

Mais procurados (20)

Basic concepts of probability
Basic concepts of probabilityBasic concepts of probability
Basic concepts of probability
 
introduction to probability
introduction to probabilityintroduction to probability
introduction to probability
 
Unit 1-probability
Unit 1-probabilityUnit 1-probability
Unit 1-probability
 
Probability
ProbabilityProbability
Probability
 
Introduction to Maximum Likelihood Estimator
Introduction to Maximum Likelihood EstimatorIntroduction to Maximum Likelihood Estimator
Introduction to Maximum Likelihood Estimator
 
Conditional probability
Conditional probabilityConditional probability
Conditional probability
 
Basic concept of probability
Basic concept of probabilityBasic concept of probability
Basic concept of probability
 
Binomial probability distributions
Binomial probability distributions  Binomial probability distributions
Binomial probability distributions
 
Poision distribution
Poision distributionPoision distribution
Poision distribution
 
introduction to Probability theory
introduction to Probability theoryintroduction to Probability theory
introduction to Probability theory
 
Probability&Bayes theorem
Probability&Bayes theoremProbability&Bayes theorem
Probability&Bayes theorem
 
Conditional Probability
Conditional ProbabilityConditional Probability
Conditional Probability
 
Probability Distributions
Probability DistributionsProbability Distributions
Probability Distributions
 
Bernoullis Random Variables And Binomial Distribution
Bernoullis Random Variables And Binomial DistributionBernoullis Random Variables And Binomial Distribution
Bernoullis Random Variables And Binomial Distribution
 
Probability distribution
Probability distributionProbability distribution
Probability distribution
 
Probability basics and bayes' theorem
Probability basics and bayes' theoremProbability basics and bayes' theorem
Probability basics and bayes' theorem
 
Basic Probability
Basic Probability Basic Probability
Basic Probability
 
Probability And Its Axioms
Probability And Its AxiomsProbability And Its Axioms
Probability And Its Axioms
 
probability
probabilityprobability
probability
 
Bernoulli distribution
Bernoulli distributionBernoulli distribution
Bernoulli distribution
 

Semelhante a Theorems And Conditional Probability

Probability Arunesh Chand Mankotia 2005
Probability   Arunesh Chand Mankotia 2005Probability   Arunesh Chand Mankotia 2005
Probability Arunesh Chand Mankotia 2005
Consultonmic
 
Show that if A is a fixed event of positive probability, then the fu.pdf
Show that if A is a fixed event of positive probability, then the fu.pdfShow that if A is a fixed event of positive probability, then the fu.pdf
Show that if A is a fixed event of positive probability, then the fu.pdf
akshitent
 
Briefnts1 events
Briefnts1 eventsBriefnts1 events
Briefnts1 events
ilathahere
 
Probability Review Additions
Probability Review AdditionsProbability Review Additions
Probability Review Additions
rishi.indian
 
1 Probability Please read sections 3.1 – 3.3 in your .docx
 1 Probability   Please read sections 3.1 – 3.3 in your .docx 1 Probability   Please read sections 3.1 – 3.3 in your .docx
1 Probability Please read sections 3.1 – 3.3 in your .docx
aryan532920
 
Discrete probability
Discrete probabilityDiscrete probability
Discrete probability
Ranjan Kumar
 
CSE357 fa21 (1) Course Intro and Probability 8-26.pdf
CSE357 fa21 (1) Course Intro and Probability 8-26.pdfCSE357 fa21 (1) Course Intro and Probability 8-26.pdf
CSE357 fa21 (1) Course Intro and Probability 8-26.pdf
NermeenKamel7
 
Information Theory and coding - Lecture 1
Information Theory and coding - Lecture 1Information Theory and coding - Lecture 1
Information Theory and coding - Lecture 1
Aref35
 

Semelhante a Theorems And Conditional Probability (20)

Probability Arunesh Chand Mankotia 2005
Probability   Arunesh Chand Mankotia 2005Probability   Arunesh Chand Mankotia 2005
Probability Arunesh Chand Mankotia 2005
 
Show that if A is a fixed event of positive probability, then the fu.pdf
Show that if A is a fixed event of positive probability, then the fu.pdfShow that if A is a fixed event of positive probability, then the fu.pdf
Show that if A is a fixed event of positive probability, then the fu.pdf
 
S244 10 Probability.ppt
S244 10 Probability.pptS244 10 Probability.ppt
S244 10 Probability.ppt
 
Briefnts1 events
Briefnts1 eventsBriefnts1 events
Briefnts1 events
 
Probability
ProbabilityProbability
Probability
 
Course material mca
Course material   mcaCourse material   mca
Course material mca
 
Probability Review Additions
Probability Review AdditionsProbability Review Additions
Probability Review Additions
 
1 Probability Please read sections 3.1 – 3.3 in your .docx
 1 Probability   Please read sections 3.1 – 3.3 in your .docx 1 Probability   Please read sections 3.1 – 3.3 in your .docx
1 Probability Please read sections 3.1 – 3.3 in your .docx
 
1-Probability-Conditional-Bayes.pdf
1-Probability-Conditional-Bayes.pdf1-Probability-Conditional-Bayes.pdf
1-Probability-Conditional-Bayes.pdf
 
Deep learning .pdf
Deep learning .pdfDeep learning .pdf
Deep learning .pdf
 
Discrete probability
Discrete probabilityDiscrete probability
Discrete probability
 
Probability.pptx
Probability.pptxProbability.pptx
Probability.pptx
 
Introduction to Discrete Probabilities with Scilab - Michaël Baudin, Consort...
Introduction to Discrete Probabilities with Scilab - Michaël Baudin, Consort...Introduction to Discrete Probabilities with Scilab - Michaël Baudin, Consort...
Introduction to Discrete Probabilities with Scilab - Michaël Baudin, Consort...
 
Probability Theory 6
Probability Theory 6Probability Theory 6
Probability Theory 6
 
Probability concepts for Data Analytics
Probability concepts for Data AnalyticsProbability concepts for Data Analytics
Probability concepts for Data Analytics
 
Making probability easy!!!
Making probability easy!!!Making probability easy!!!
Making probability easy!!!
 
BHARAT & KAJAL.pptx
BHARAT & KAJAL.pptxBHARAT & KAJAL.pptx
BHARAT & KAJAL.pptx
 
CSE357 fa21 (1) Course Intro and Probability 8-26.pdf
CSE357 fa21 (1) Course Intro and Probability 8-26.pdfCSE357 fa21 (1) Course Intro and Probability 8-26.pdf
CSE357 fa21 (1) Course Intro and Probability 8-26.pdf
 
Information Theory and coding - Lecture 1
Information Theory and coding - Lecture 1Information Theory and coding - Lecture 1
Information Theory and coding - Lecture 1
 
Chap03 probability
Chap03 probabilityChap03 probability
Chap03 probability
 

Mais de mathscontent

Mais de mathscontent (14)

Simulation
SimulationSimulation
Simulation
 
Sampling Distributions
Sampling DistributionsSampling Distributions
Sampling Distributions
 
Interval Estimation & Estimation Of Proportion
Interval Estimation & Estimation Of ProportionInterval Estimation & Estimation Of Proportion
Interval Estimation & Estimation Of Proportion
 
Point Estimation
Point EstimationPoint Estimation
Point Estimation
 
Normal Distribution
Normal DistributionNormal Distribution
Normal Distribution
 
Poisson Distribution, Poisson Process & Geometric Distribution
Poisson Distribution, Poisson Process & Geometric DistributionPoisson Distribution, Poisson Process & Geometric Distribution
Poisson Distribution, Poisson Process & Geometric Distribution
 
Hypergeometric Distribution
Hypergeometric DistributionHypergeometric Distribution
Hypergeometric Distribution
 
Gamma, Expoential, Poisson And Chi Squared Distributions
Gamma, Expoential, Poisson And Chi Squared DistributionsGamma, Expoential, Poisson And Chi Squared Distributions
Gamma, Expoential, Poisson And Chi Squared Distributions
 
Uniform Distribution
Uniform DistributionUniform Distribution
Uniform Distribution
 
Continuous Random Variables
Continuous Random VariablesContinuous Random Variables
Continuous Random Variables
 
Moment Generating Functions
Moment Generating FunctionsMoment Generating Functions
Moment Generating Functions
 
Mathematical Expectation And Variance
Mathematical Expectation And VarianceMathematical Expectation And Variance
Mathematical Expectation And Variance
 
Discrete Random Variables And Probability Distributions
Discrete Random Variables And Probability DistributionsDiscrete Random Variables And Probability Distributions
Discrete Random Variables And Probability Distributions
 
Sample Space And Events
Sample Space And EventsSample Space And Events
Sample Space And Events
 

Último

Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
vu2urc
 

Último (20)

Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024
 
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemkeProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
 
HTML Injection Attacks: Impact and Mitigation Strategies
HTML Injection Attacks: Impact and Mitigation StrategiesHTML Injection Attacks: Impact and Mitigation Strategies
HTML Injection Attacks: Impact and Mitigation Strategies
 
The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024
 
Tata AIG General Insurance Company - Insurer Innovation Award 2024
Tata AIG General Insurance Company - Insurer Innovation Award 2024Tata AIG General Insurance Company - Insurer Innovation Award 2024
Tata AIG General Insurance Company - Insurer Innovation Award 2024
 
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024
 
Advantages of Hiring UIUX Design Service Providers for Your Business
Advantages of Hiring UIUX Design Service Providers for Your BusinessAdvantages of Hiring UIUX Design Service Providers for Your Business
Advantages of Hiring UIUX Design Service Providers for Your Business
 
Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...
 
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
 
Understanding Discord NSFW Servers A Guide for Responsible Users.pdf
Understanding Discord NSFW Servers A Guide for Responsible Users.pdfUnderstanding Discord NSFW Servers A Guide for Responsible Users.pdf
Understanding Discord NSFW Servers A Guide for Responsible Users.pdf
 
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law DevelopmentsTrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
 
2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
 
Strategies for Landing an Oracle DBA Job as a Fresher
Strategies for Landing an Oracle DBA Job as a FresherStrategies for Landing an Oracle DBA Job as a Fresher
Strategies for Landing an Oracle DBA Job as a Fresher
 
GenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdfGenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdf
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)
 
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
 
Driving Behavioral Change for Information Management through Data-Driven Gree...
Driving Behavioral Change for Information Management through Data-Driven Gree...Driving Behavioral Change for Information Management through Data-Driven Gree...
Driving Behavioral Change for Information Management through Data-Driven Gree...
 

Theorems And Conditional Probability

  • 1. 1.3 Elementary Theoremsand Conditional Probability
  • 2. Theorem 1,2 Generalization of third axiom of probability Theorem 1: If A1, A2,….,Anare mutually exclusive events in a sample space, then P(A1 A2….An) = P(A1) + P(A2) + …+ P(An). Rule for calculating probability of an event Theorem 2: If A is an event in the finite sample space S, then P(A) equals the sum of the probabilities of the individual outcome comprising A.
  • 3. Theorem 3 Proof: If E1, E2,……Enbe the n outcomes comprising event A, then A = E1E2 ……  En. Since the E’s areindividual outcomesthey are mutually exclusive, and by Theorem 1, we have P(A) = P(E1E2 ……  En) = P(E1) + P(E2) + …+ P(En). General addition rule for probability Theorem 3: If A and B are any events in S, then P(AB) = P(A) + P(B) – P(AB).
  • 4. Theorem 4 Note: When A and B are mutually exclusive so that P(AB) = 0, Theorem 3 reduces to the third axiom of probability therefore the third axiom of probability also called the special addition rule Probability rule of the complements Theorem 4: If A is any event in S, then P( ) = 1 – P(A).
  • 5. Proof are mutually exclusive by Proof: Since A and definition and A = S. Hence we have ) = P(S) = 1. P(A) + P( ) = P (A P( ) = 1 – P( ) = 1 – P( S ) = 0. If A  B then P(B) = P(B) - P(A) P(A  B) = P(A) + P(B) - 2 P(AB)
  • 6. Conditional Probability If we ask for the probability of an event then it is meaningful only if we mention about the sample space. When we use the symbol P(A) for probability of A, we really mean the probability of A with respect to some sample space S. Since there are problems in which we are interested in probabilities of A with respect to more sample spaces than one, the notation P(A|S) is used to make it clear that we are referring to a particular sample space S.
  • 7. Conditional Probability P(A|S)  conditional probability of A relative to S. Conditional probability: If A and B are any events in S and P(B)  0, the conditional probability of A given B is P (A|B) is the probability that event A occurs once event B has occurred
  • 8. Conditional Probability (cont’d) Reduced Sample Space A  B S B A P(A|B) measures the relative probability of A with respect to the reduced sample space B
  • 9. Conditional Probability (cont’d) If A and B are any two events in the sample space S, Then the event A is independent of the event B if and only if P(A|B) = P(A) i.e. occurrence of B does not influence the occurrence of A. But B is independent of A whenever A is independent of B.  A and B are independent events if and only if either P(A|B) = P(A)or P(B|A) = P(B)
  • 10. Conditional Probability General multiplication rule of probability Theorem 5: If A and B are any events in S, then P(AB) = P(A)· P(B|A) if P(A)0 = P(B)· P(A|B) if P(B)0 Special product rule of probability Theorem 6: Two events A and B are independent events if and only if P(AB) = P(A)· P(B)
  • 11. The mutually exclusive events are not independent unless one of them has zero probability. If an event A is independent of itself then P(A) = 0 or P(A) = 1 If the events A and B are independent, then so are events and B, events A and and events and .
  • 12. Bayes’ Theorem Let S be a sample space and B1, B2,….Bnbe mutually exclusive events such that S = B1B2 …… Bn and A be an event in the sample space S. Then A = AS = A(B1B2 …… Bn) = (A B1)  (A B2) ……. (A Bn). Since all A  Bi ’s are mutually exclusive events P(A)=P(AB1) + P(AB2) +……. + P(ABn).
  • 13. Bayes’ Theorem or But from multiplication rule for probability P(ABi) = P(Bi)·P(A|Bi), for i = 1, 2, …, n hence we have
  • 14. Bayes’ Theorem Rule of elimination or rule of total probability Theorem 7 : Let A be an event in a sample space S and if B1, B2,……Bn are mutually exclusive events such that S = B1B2 …… Bnand P (Bi)  0 for i = 1, 2, …, n, then
  • 15. Bayes’ Theorem To visualize this result, we have to construct a tree diagram where the probability of the final outcome is given by the sum of the products of the probabilities corresponding to each branch of the tree. P(A|B1) B1 A B2 P(A|B2) P(B1) A Figure: Tree diagram for rule of elimination P(B2) P(Bn) P(A|Bn) A Bn
  • 16. Bayes’ Theorem (cont’d) from the definitionof conditional probability but according to multiplication rule of probability, we have P (Bk  A) = P(Bk)·P(A|Bk). Hence, we have
  • 17. Bayes’ Theorem Using rule of total probability, we have following result. Bayes’ Theorem Theorem 8: Let A be an event in a sample space S and if B1, B2,……Bn are mutually exclusive events such that S = B1B2 …… Bn and P (Bi)  0 for i = 1, 2, …, n, then for k = 1, 2,….., n.
  • 18. Bayes’ Theorem This theorem provides a formula for finding the probability that the “effect” A was “caused” by the event Bk. Note: The expression in the numerator is the probability of reaching A via the kth branch of the tree and the expression in the denominator is the sum of the probabilities of reaching A via the n branches of the tree.