<< Chapter < Page Chapter >> Page >
A fundamental problem is to determine the probability of a logical (Boolean) combination of a finite class of events, when the probabilities of certain other combinations are known. If we partition an event F into component events whose probabilities can be determined, then the additivity property implies the probability of F is the sum of these component probabilities. Frequently, the event F is a Boolean combination of members of a finite class -- say {A, B, C} or {A, B, C,D}. For each such finite class, there is a fundamental partition determined by the class. The members of this partition are called minterms. Any Boolean combination of members of the class can be expressed as the disjoint union of a unique subclass of the minterms. If the probability of every minterm in this subclass can be determined, then by additivity the probability of the Boolean combination is determined. An important geometric aid to analysis is the minterm map, which has spaces for minterms in an orderly arrangement.

Introduction

A fundamental problem in elementary probability is to find the probability of a logical (Boolean) combination of a finite class of events, when the probabilities ofcertain other combinations are known. If we partition an event F into component events whose probabilities can be determined, then the additivity property implies the probability of F is the sum of these component probabilities. Frequently, the event F is a Boolean combination of members of a finite class– say, { A , B , C } or { A , B , C , D } . For each such finite class, there is a fundamental partition determined by the class. The members of this partition are called minterms . Any Boolean combination of members of the class can be expressed as the disjoint union of a unique subclass of the minterms. If the probability of every mintermin this subclass can be determined, then by additivity the probability of the Boolean combination is determined. We examine these ideas in more detail.

Partitions and minterms

To see how the fundamental partition arises naturally, consider first the partition of the basic space produced by a single event A .

Ω = A A c

Now if B is a second event, then

A = A B A B c and A c = A c B A c B c , so that Ω = A c B c A c B A B c A B

The pair { A , B } has partitioned Ω into { A c B c , A c B , A B c , A B } . Continuation is this way leads systematically to a partition by three events { A , B , C } , four events { A , B , C , D } , etc.

We illustrate the fundamental patterns in the case of four events { A , B , C , D } . We form the minterms as intersections of members of the class, with various patterns of complementation.For a class of four events, there are 2 4 = 16 such patterns, hence 16 minterms. These are, in a systematic arrangement,

A c B c C c D c A c B C c D c A B c C c D c A B C c D c
A c B c C c D A c B C c D A B c C c D A B C c D
A c B c C D c A c B C D c A B c C D c A B C D c
A c B c C D A c B C D A B c C D A B C D

No element can be in more than one minterm, because each differs from the others by complementation of at least one member event. Eachelement ω is assigned to exactly one of the minterms by determining the answers to four questions:

Is it in A ? Is it in B ? Is it in C ? Is it in D ?

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Applied probability. OpenStax CNX. Aug 31, 2009 Download for free at http://cnx.org/content/col10708/1.6
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Applied probability' conversation and receive update notifications?

Ask