# Probability/Print version

Jump to navigation
Jump to search

- ↑ usually the
*first*few letters in alphabetical order , e.g. and , or (mnemonic for set) - ↑ usually the
*last*few letters in alphabetical order), e.g. and - ↑ It is
*not*. - ↑ For numbers, they can be just typed out.
- ↑ This makes the symbol bigger than that using <math display=inline></math>, and thus is clearer.
- ↑ However, conventional notations should take precedenece. E.g., we should use , instead of , for mean.
- ↑ e.g., A a
- ↑ Notice that we cannot regard the situation as placing three indistinguishable balls (representing three groups) into four distinguishable cells (representing four people) with capacity one (since every person can only assigned to one group).
Since with this consideration, it is impossible to assign a group to
*every*person (we can only assign groups to three people). Also, with such consideration, one ball can only be put in one cell, which implies one group can only contain one person, but this is not the case. - ↑ One may prove this by
*contrapositive*: Assume that . Then, by the nonegativity of probability, this means . Then, (that is, the sum*diverges*). So, . - ↑ This is true in general, for selection of distinguishable objects. This is because every unordered selection corresponds to a fixed number of ordered selection.
*However*, this is*not*true if the objects are*indistinguishable*, since the unordered selections may correspond to*different*numbers of ordered selections. This is the same reason for showing that we*cannot*use the division counting principle to derive the formula for placing indistinguishable balls into distinguishable cells with unlimited capacity, based on that for distinguishable balls. - ↑ Graphically,
. . . . . . *-----------* |###########| *--------*##| |////////|##| *----*///|##| ... |....|///|##| |....|///|##| *----*---*--* E_1 E_2 E_3 ... .. .. : F_1 // // : F_2 ## ## : F_3

- ↑ Alternatively, we can define the events as
- ↑ 'indpt.' stands for independence.
- ↑ This is because there is unordered selection of (distinguishable and ordered) trials for 'success' without replacement from trials (then the remaining position is for 'failure').
- ↑ Occurrence of the rare event is viewed as 'success' and non-occurrence of the rare event is viewed as 'failure'.
- ↑ Unlike the outcomes for the binomial distribution, there is only
*one*possible sequence for each . - ↑ There is unordered selection of trials for 'failures' (or trials for 'successes') from trials without replacement
- ↑ The restriction on is imposed so that the binomial coefficients are defined, i.e. the expression 'makes sense'. In practice, we rarely use this condition directly. Instead, we usually directly determine whether a specific value of 'makes sense'.
- ↑ It is out of scope for this book.
- ↑ The probability is 'distributed uniformly over an interval'.
- ↑ A random variable following the
*Cauchy*distribution has a relatively high probability to take*extreme values*, compared with other*light-tailed*distributions (e.g. the normal distribution). Graphically, the 'tails' (i.e. left end and right end) of the pdf. - ↑ The case for holds similarly (The inequality sign is in opposite direction, and eventually we will have two negative signs cancelling each other). Also when , the r.v. becomes a non-random constant, and so we are not interested in this case.
- ↑ Then, .
- ↑ If the object is allocated to a cell other than th cell, then it is 'failure'
- ↑ The subscript for is to emphasize that the distribution is -dimensional, and is optional.
- ↑ Each of the Bernoulli r.v.'s acts as an indicator for the success of the corresponding trial. Since, there are independent Bernoulli trials, there are such indicators.
- ↑ Each geometric r.v. shows the number of failure for the corresponding success.
- ↑ since this probability is unconditional, because the corresponding mean is also unconditional, so that their sum is also unconditional mean (as in the proposition)
- ↑ are
*dependent*, but we can still use the linearity of expectation, since it does not require independence. - ↑ Each geometric r.v. shows the number of failure for the corresponding success.
- ↑ or equivalently, transformation between supports of and