Frequent Links
Probability theory
This article needs additional citations for verification. (September 2009) 
Probability theory 

100px 
Probability theory is the branch of mathematics concerned with probability, the analysis of random phenomena.^{[1]} The central objects of probability theory are random variables, stochastic processes, and events: mathematical abstractions of nondeterministic events or measured quantities that may either be single occurrences or evolve over time in an apparently random fashion. If an individual coin toss or the roll of dice is considered to be a random event, then if repeated many times the sequence of random events will exhibit certain patterns, which can be studied and predicted. Two representative mathematical results describing such patterns are the law of large numbers and the central limit theorem.
As a mathematical foundation for statistics, probability theory is essential to many human activities that involve quantitative analysis of large sets of data. Methods of probability theory also apply to descriptions of complex systems given only partial knowledge of their state, as in statistical mechanics. A great discovery of twentieth century physics was the probabilistic nature of physical phenomena at atomic scales, described in quantum mechanics.
Contents
History
The mathematical theory of probability has its roots in attempts to analyze games of chance by Gerolamo Cardano in the sixteenth century, and by Pierre de Fermat and Blaise Pascal in the seventeenth century (for example the "problem of points"). Christiaan Huygens published a book on the subject in 1657^{[2]} and in the 19th century a big work was done by Laplace in what can be considered today as the classic interpretation.^{[3]}
Initially, probability theory mainly considered discrete events, and its methods were mainly combinatorial. Eventually, analytical considerations compelled the incorporation of continuous variables into the theory.
This culminated in modern probability theory, on foundations laid by Andrey Nikolaevich Kolmogorov. Kolmogorov combined the notion of sample space, introduced by Richard von Mises, and measure theory and presented his axiom system for probability theory in 1933. Fairly quickly this became the mostly undisputed axiomatic basis for modern probability theory but alternatives exist, in particular the adoption of finite rather than countable additivity by Bruno de Finetti.^{[4]}
Treatment
Most introductions to probability theory treat discrete probability distributions and continuous probability distributions separately. The more mathematically advanced measure theory based treatment of probability covers both the discrete, the continuous, any mix of these two and more.
Motivation
Consider an experiment that can produce a number of outcomes. The set of all outcomes is called the sample space of the experiment. The power set of the sample space is formed by considering all different collections of possible results. For example, rolling an honest die produces one of six possible results. One collection of possible results corresponds to getting an odd number. Thus, the subset {1,3,5} is an element of the power set of the sample space of die rolls. These collections are called events. In this case, {1,3,5} is the event that the die falls on some odd number. If the results that actually occur fall in a given event, that event is said to have occurred.
Probability is a way of assigning every "event" a value between zero and one, with the requirement that the event made up of all possible results (in our example, the event {1,2,3,4,5,6}) be assigned a value of one. To qualify as a probability distribution, the assignment of values must satisfy the requirement that if you look at a collection of mutually exclusive events (events that contain no common results, e.g., the events {1,6}, {3}, and {2,4} are all mutually exclusive), the probability that one of the events will occur is given by the sum of the probabilities of the individual events.^{[5]}
The probability that any one of the events {1,6}, {3}, or {2,4} will occur is 5/6. This is the same as saying that the probability of event {1,2,3,4,6} is 5/6. This event encompasses the possibility of any number except five being rolled. The mutually exclusive event {5} has a probability of 1/6, and the event {1,2,3,4,5,6} has a probability of 1, that is, absolute certainty.
Discrete probability distributions
Discrete probability theory deals with events that occur in countable sample spaces.
Examples: Throwing dice, experiments with decks of cards, random walk, and tossing coins
Classical definition: Initially the probability of an event to occur was defined as number of cases favorable for the event, over the number of total outcomes possible in an equiprobable sample space: see Classical definition of probability.
For example, if the event is "occurrence of an even number when a die is rolled", the probability is given by <math>\tfrac{3}{6}=\tfrac{1}{2}</math>, since 3 faces out of the 6 have even numbers and each face has the same probability of appearing.
Modern definition: The modern definition starts with a finite or countable set called the sample space, which relates to the set of all possible outcomes in classical sense, denoted by <math>\Omega</math>. It is then assumed that for each element <math>x \in \Omega\,</math>, an intrinsic "probability" value <math>f(x)\,</math> is attached, which satisfies the following properties:
 <math>f(x)\in[0,1]\mbox{ for all }x\in \Omega\,;</math>
 <math>\sum_{x\in \Omega} f(x) = 1\,.</math>
That is, the probability function f(x) lies between zero and one for every value of x in the sample space Ω, and the sum of f(x) over all values x in the sample space Ω is equal to 1. An event is defined as any subset <math>E\,</math> of the sample space <math>\Omega\,</math>. The probability of the event <math>E\,</math> is defined as
 <math>P(E)=\sum_{x\in E} f(x)\,.</math>
So, the probability of the entire sample space is 1, and the probability of the null event is 0.
The function <math>f(x)\,</math> mapping a point in the sample space to the "probability" value is called a probability mass function abbreviated as pmf. The modern definition does not try to answer how probability mass functions are obtained; instead it builds a theory that assumes their existence.
Continuous probability distributions
Continuous probability theory deals with events that occur in a continuous sample space.
Classical definition: The classical definition breaks down when confronted with the continuous case. See Bertrand's paradox.
Modern definition: If the outcome space of a random variable X is the set of real numbers (<math>\mathbb{R}</math>) or a subset thereof, then a function called the cumulative distribution function (or cdf) <math>F\,</math> exists, defined by <math>F(x) = P(X\le x) \,</math>. That is, F(x) returns the probability that X will be less than or equal to x.
The cdf necessarily satisfies the following properties.
 <math>F\,</math> is a monotonically nondecreasing, rightcontinuous function;
 <math>\lim_{x\rightarrow \infty} F(x)=0\,;</math>
 <math>\lim_{x\rightarrow \infty} F(x)=1\,.</math>
If <math>F\,</math> is absolutely continuous, i.e., its derivative exists and integrating the derivative gives us the cdf back again, then the random variable X is said to have a probability density function or pdf or simply density <math>f(x)=\frac{dF(x)}{dx}\,.</math>
For a set <math>E \subseteq \mathbb{R}</math>, the probability of the random variable X being in <math>E\,</math> is
 <math>P(X\in E) = \int_{x\in E} dF(x)\,.</math>
In case the probability density function exists, this can be written as
 <math>P(X\in E) = \int_{x\in E} f(x)\,dx\,.</math>
Whereas the pdf exists only for continuous random variables, the cdf exists for all random variables (including discrete random variables) that take values in <math>\mathbb{R}\,.</math>
These concepts can be generalized for multidimensional cases on <math>\mathbb{R}^n</math> and other continuous sample spaces.
Measuretheoretic probability theory
The raison d'être of the measuretheoretic treatment of probability is that it unifies the discrete and the continuous cases, and makes the difference a question of which measure is used. Furthermore, it covers distributions that are neither discrete nor continuous nor mixtures of the two.
An example of such distributions could be a mix of discrete and continuous distributions—for example, a random variable that is 0 with probability 1/2, and takes a random value from a normal distribution with probability 1/2. It can still be studied to some extent by considering it to have a pdf of <math>(\delta[x] + \varphi(x))/2</math>, where <math>\delta[x]</math> is the Dirac delta function.
Other distributions may not even be a mix, for example, the Cantor distribution has no positive probability for any single point, neither does it have a density. The modern approach to probability theory solves these problems using measure theory to define the probability space:
Given any set <math>\Omega\,</math>, (also called sample space) and a σalgebra <math>\mathcal{F}\,</math> on it, a measure <math>P\,</math> defined on <math>\mathcal{F}\,</math> is called a probability measure if <math>P(\Omega)=1.\,</math>
If <math>\mathcal{F}\,</math> is the Borel σalgebra on the set of real numbers, then there is a unique probability measure on <math>\mathcal{F}\,</math> for any cdf, and vice versa. The measure corresponding to a cdf is said to be induced by the cdf. This measure coincides with the pmf for discrete variables and pdf for continuous variables, making the measuretheoretic approach free of fallacies.
The probability of a set <math>E\,</math> in the σalgebra <math>\mathcal{F}\,</math> is defined as
 <math>P(E) = \int_{\omega\in E} \mu_F(d\omega)\,</math>
where the integration is with respect to the measure <math>\mu_F\,</math> induced by <math>F\,.</math>
Along with providing better understanding and unification of discrete and continuous probabilities, measuretheoretic treatment also allows us to work on probabilities outside <math>\mathbb{R}^n</math>, as in the theory of stochastic processes. For example to study Brownian motion, probability is defined on a space of functions.
Classical probability distributions
Certain random variables occur very often in probability theory because they well describe many natural or physical processes. Their distributions therefore have gained special importance in probability theory. Some fundamental discrete distributions are the discrete uniform, Bernoulli, binomial, negative binomial, Poisson and geometric distributions. Important continuous distributions include the continuous uniform, normal, exponential, gamma and beta distributions.
Convergence of random variables
In probability theory, there are several notions of convergence for random variables. They are listed below in the order of strength, i.e., any subsequent notion of convergence in the list implies convergence according to all of the preceding notions.
 Weak convergence: A sequence of random variables <math>X_1,X_2,\dots,\,</math> converges weakly to the random variable <math>X\,</math> if their respective cumulative distribution functions <math>F_1,F_2,\dots\,</math> converge to the cumulative distribution function <math>F\,</math> of <math>X\,</math>, wherever <math>F\,</math> is continuous. Weak convergence is also called convergence in distribution.
 Most common shorthand notation: <math>X_n \, \xrightarrow{\mathcal D} \, X\,.</math>
 Convergence in probability: The sequence of random variables <math>X_1,X_2,\dots\,</math> is said to converge towards the random variable <math>X\,</math> in probability if <math>\lim_{n\rightarrow\infty}P\left(\leftX_nX\right\geq\varepsilon\right)=0</math> for every ε > 0.
 Most common shorthand notation: <math>X_n \, \xrightarrow{P} \, X\,.</math>
 Strong convergence: The sequence of random variables <math>X_1,X_2,\dots\,</math> is said to converge towards the random variable <math>X\,</math> strongly if <math>P(\lim_{n\rightarrow\infty} X_n=X)=1</math>. Strong convergence is also known as almost sure convergence.
 Most common shorthand notation: <math>X_n \, \xrightarrow{\mathrm{a.s.}} \, X\,.</math>
As the names indicate, weak convergence is weaker than strong convergence. In fact, strong convergence implies convergence in probability, and convergence in probability implies weak convergence. The reverse statements are not always true.
Law of large numbers
Common intuition suggests that if a fair coin is tossed many times, then roughly half of the time it will turn up heads, and the other half it will turn up tails. Furthermore, the more often the coin is tossed, the more likely it should be that the ratio of the number of heads to the number of tails will approach unity. Modern probability provides a formal version of this intuitive idea, known as the law of large numbers. This law is remarkable because it is not assumed in the foundations of probability theory, but instead emerges from these foundations as a theorem. Since it links theoretically derived probabilities to their actual frequency of occurrence in the real world, the law of large numbers is considered as a pillar in the history of statistical theory and has had widespread influence.^{[6]}
The law of large numbers (LLN) states that the sample average
 <math>\overline{X}_n=\frac1n{\sum_{k=1}^n X_k}</math>
of a sequence of independent and identically distributed random variables <math>X_k</math> converges towards their common expectation <math>\mu</math>, provided that the expectation of <math>X_k</math> is finite.
It is in the different forms of convergence of random variables that separates the weak and the strong law of large numbers
 <math>
\begin{array}{lll} \text{Weak law:} & \overline{X}_n \, \xrightarrow{P} \, \mu & \text{for } n \to \infty \\ \text{Strong law:} & \overline{X}_n \, \xrightarrow{\mathrm{a.\,s.}} \, \mu & \text{for } n \to \infty . \end{array} </math>
It follows from the LLN that if an event of probability p is observed repeatedly during independent experiments, the ratio of the observed frequency of that event to the total number of repetitions converges towards p.
For example, if <math>Y_1,Y_2,...\,</math> are independent Bernoulli random variables taking values 1 with probability p and 0 with probability 1p, then <math>\textrm{E}(Y_i)=p</math> for all i, so that <math>\bar Y_n</math> converges to p almost surely.
Central limit theorem
"The central limit theorem (CLT) is one of the great results of mathematics." (Chapter 18 in^{[7]}) It explains the ubiquitous occurrence of the normal distribution in nature.
The theorem states that the average of many independent and identically distributed random variables with finite variance tends towards a normal distribution irrespective of the distribution followed by the original random variables. Formally, let <math>X_1,X_2,\dots\,</math> be independent random variables with mean <math>\mu_\,</math> and variance <math>\sigma^2 > 0.\,</math> Then the sequence of random variables
 <math>Z_n=\frac{\sum_{i=1}^n (X_i  \mu)}{\sigma\sqrt{n}}\,</math>
converges in distribution to a standard normal random variable.
Notice that for some classes of random variables the classic central limit theorem works rather fast (see Berry–Esseen theorem), for example the distributions with finite first, second and third moment from the exponential family, on the other hand for some random variables of the heavy tail and fat tail variety, it works very slow or may not work at all: in such cases one may use the Generalized Central Limit Theorem (GCLT).
See also
Notes
 ^ "Probability theory, Encyclopaedia Britannica". Britannica.com. Retrieved 20120212.
 ^ Grinstead, Charles Miller; James Laurie Snell. "Introduction". Introduction to Probability. pp. vii.
 ^ Hájek, Alan. "Interpretations of Probability". Retrieved 20120620.
 ^ ""The origins and legacy of Kolmogorov's Grundbegriffe", by Glenn Shafer and Vladimir Vovk" (PDF). Retrieved 20120212.
 ^ Ross, Sheldon. A First course in Probability, 8th Edition. Page 26–27.
 ^ "Leithner & Co Pty Ltd  Value Investing, Risk and Risk Management  Part I". Leithner.com.au. 20000915. Retrieved 20120212.
 ^ David Williams, "Probability with martingales", Cambridge 1991/2008
References
This article includes a list of references, but its sources remain unclear because it has insufficient inline citations. (September 2009) 
 Pierre Simon de Laplace (1812). Analytical Theory of Probability.
 The first major treatise blending calculus with probability theory, originally in French: Théorie Analytique des Probabilités.
 A. Kolmogoroff (1933). Grundbegriffe der Wahrscheinlichkeitsrechnung. ISBN 9783642498886. doi:10.1007/9783642498886.
 An English translation by Nathan Morrison appeared under the title Foundations of the Theory of Probability (Chelsea, New York) in 1950, with a second edition in 1956.
 Patrick Billingsley (1979). Probability and Measure. New York, Toronto, London: John Wiley and Sons.
 Olav Kallenberg; Foundations of Modern Probability, 2nd ed. Springer Series in Statistics. (2002). 650 pp. ISBN 0387953132
 Henk Tijms (2004). Understanding Probability. Cambridge Univ. Press.
 A lively introduction to probability theory for the beginner.
 Olav Kallenberg; Probabilistic Symmetries and Invariance Principles. Springer Verlag, New York (2005). 510 pp. ISBN 0387251154
 Gut, Allan (2005). Probability: A Graduate Course. SpringerVerlag. ISBN 0387228330.
External links
