random variable =============== A random variable (also called random quantity, aleatory variable, or stochastic variable) is a mathematical formalization of a quantity or object which depends on random events. The term 'random variable' in its mathematical definition refers to neither randomness nor variability but instead is a mathematical function in which * the domain is the set of possible outcomes in a sample space (e.g. the set \{H,T\} (which are the possible upper sides of a flipped coin heads H or tails T as the result from tossing a coin); and * the range is a measurable space (e.g. corresponding to the domain above, the range might be the set \{-1, 1\} if say heads H mapped to −1 and T mapped to 1). Typically, the range of a random variable is a subset of the real numbers. Informally, randomness typically represents some fundamental element of chance, such as in the roll of a die; it may also represent uncertainty, such as measurement error. However, the interpretation of probability is philosophically complicated, and even in specific cases is not always straightforward. The purely mathematical analysis of random variables is independent of such interpretational difficulties, and can be based upon a rigorous axiomatic setup.… A random variable (also called random quantity, aleatory variable, or stochastic variable) is a mathematical formalization of a quantity or object which depends on random events. The term 'random variable' in its mathematical definition refers to neither randomness nor variability but instead is a mathematical function in which the domain is the set of possible outcomes in a sample space (e.g. the set \{H,T\} (which are the possible upper sides of a flipped coin heads H or tails T as the result from tossing a coin); and the range is a measurable space (e.g. corresponding to the domain above, the range might be the set \{-1, 1\} if say heads H mapped to −1 and T mapped to 1). Typically, the range of a random variable is a subset of the real numbers. Informally, randomness typically represents some fundamental element of chance, such as in the roll of a die; it may also represent uncertainty, such as measurement error. However, the interpretation of probability is philosophically complicated, and even in specific cases is not always straightforward. The purely mathematical analysis of random variables is independent of such interpretational difficulties, and can be based upon a rigorous axiomatic setup. In the formal mathematical language of measure theory, a random variable is defined as a measurable function from a probability measure space (called the sample space) to a measurable space. This allows consideration of the pushforward measure, which is called the distribution of the random variable; the distribution is thus a probability measure on the set of all possible values of the random variable. It is possible for two random variables to have identical distributions but to differ in significant ways; for instance, they may be independent. It is common to consider the special cases of discrete random variables and absolutely continuous random variables, corresponding to whether a random variable is valued in a countable subset or in an interval of real numbers. There are other important possibilities, especially in the theory of stochastic processes, wherein it is natural to consider random sequences or random functions. Sometimes a random variable is taken to be automatically valued in the real numbers, with more general random quantities instead being called random elements. A random variate is a particular outcome or realization of a random variable. According to George Mackey, Pafnuty Chebyshev was the first person "to think systematically in terms of random variables". \operatorname{P}(X \in S) = \operatorname{P}(\{ \omega \in \Omega \mid X(\omega) \in S \}). In many cases, X is real-valued, i.e. E = \mathbb{R} . In some contexts, the term random element (see extensions) is used to denote a random variable not of this form. When the image (or range) of X is finite or countably infinite, the random variable is called a discrete random variable and its distribution is a discrete probability distribution, i.e. can be described by a probability mass function that assigns a probability to each value in the image of X . If the image is uncountably infinite (usually an interval) then X is called a continuous random variable. In the special case that it is absolutely continuous, its distribution can be described by a probability density function, which assigns probabilities to intervals; in particular, each individual point must necessarily have probability zero for an absolutely continuous random variable. Not all continuous random variables are absolutely continuous. Any random variable can be described by its cumulative distribution function, which describes the probability that the random variable will be less than or equal to a certain value. If a random variable X\colon \Omega \to \mathbb{R} defined on the probability space (\Omega, \mathcal{F}, \operatorname{P}) is given, we can ask questions like "How likely is it that the value of X is equal to 2?". This is the same as the probability of the event \{ \omega : X(\omega) = 2 \}\,\! which is often written as P(X = 2)\,\! or p_X(2) for short. Recording all these probabilities of outputs of a random variable X yields the probability distribution of X . The probability distribution "forgets" about the particular probability space used to define X and only records the probabilities of various output values of X . Such a probability distribution, if X is real-valued, can always be captured by its cumulative distribution function F_X(x) = \operatorname{P}(X \le x) and sometimes also using a probability density function, f_X . In measure-theoretic terms, we use the random variable X to "push-forward" the measure P on \Omega to a measure p_X on \mathbb{R} . The measure p_X is called the "(probability) distribution of X " or the "law of X ". The density f_X = dp_X/d\mu , the Radon–Nikodym derivative of p_X with respect to some reference measure \mu on \mathbb{R} (often, this reference measure is the Lebesgue measure in the case of continuous random variables, or the counting measure in the case of discrete random variables). The underlying probability space \Omega is a technical device used to guarantee the existence of random variables, sometimes to construct them, and to define notions such as correlation and dependence or independence based on a joint distribution of two or more random variables on the same probability space. In practice, one often disposes of the space \Omega altogether and just puts a measure on \mathbb{R} that assigns measure 1 to the whole real line, i.e., one works with probability distributions instead of random variables. See the article on quantile functions for fuller development. If \{a_n\}, \{b_n\} are countable sets of real numbers, b_n >0 and , then F=\sum_n b_n \delta_{a_n}(x) is a discrete distribution function. Here \delta_t(x) = 0 for , for . Taking for instance an enumeration of all rational numbers as , one gets a discrete function that is not necessarily a step function (piecewise constant). The possible outcomes for one coin toss can be described by the sample space \Omega = \{\text{heads}, \text{tails}\} . We can introduce a real-valued random variable Y that models a $1 payoff for a successful bet on heads as follows: Y(\omega) = \begin{cases} 1, & \text{if } \omega = \text{heads}, \\[6pt] 0, & \text{if } \omega = \text{tails}. \end{cases} If the coin is a fair coin, has a probability mass function f_Y given by: f_Y(y) = \begin{cases} \tfrac 12,& \text{if }y=1,\\[6pt] \tfrac 12,& \text{if }y=0, \end{cases} X((n_1, n_2)) = n_1 + n_2 and (if the dice are fair) has a probability mass function f X given by: f_X(S) = \frac{\min(S-1, 13-S)}{36}, \text{ for } S \in \{2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12\} Formally, a continuous random variable is a random variable whose cumulative distribution function is continuous everywhere. There are no "gaps", which would correspond to numbers which have a finite probability of occurring. Instead, continuous random variables almost never take an exact prescribed value c (formally, \forall c \in \mathbb{R}:\; \Pr(X = c) = 0 ) but there is a positive probability that its value will lie in particular intervals which can be arbitrarily small. Continuous random variables usually admit probability density functions (PDF), which characterize their CDF and probability measures; such distributions are also called absolutely continuous; but some continuous distributions are singular, or mixes of an absolutely continuous part and a singular part. An example of a continuous random variable would be one based on a spinner that can choose a horizontal direction. Then the values taken by the random variable are directions. We could represent these directions by North, West, East, South, Southeast, etc. However, it is commonly more convenient to map the sample space to a random variable which takes values which are real numbers. This can be done, for example, by mapping a direction to a bearing in degrees clockwise from North. The random variable then takes values which are real numbers from the interval [0, 360), with all parts of the range being "equally likely". In this case, X = the angle spun. Any real number has probability zero of being selected, but a positive probability can be assigned to any range of values. For example, the probability of choosing a number in [0, 180] is . Instead of speaking of a probability mass function, we say that the probability density of X is 1/360. The probability of a subset of [0, 360) can be calculated by multiplying the measure of the set by 1/360. In general, the probability of a set for a given continuous random variable can be calculated by integrating the density over the given set. More formally, given any interval I = [a, b] = \{x \in \mathbb{R} : a \le x \le b \} , a random variable X_I \sim \operatorname{U}(I) = \operatorname{U}[a, b] is called a "continuous uniform random variable" (CURV) if the probability that it takes a value in a subinterval depends only on the length of the subinterval. This implies that the probability of X_I falling in any subinterval [c, d] \sube [a, b] is proportional to the length of the subinterval, that is, if , one has \Pr\left( X_I \in [c,d]\right) = \frac{d - c}{b - a} where the last equality results from the unitarity axiom of probability. The probability density function of a CURV X \sim \operatorname {U}[a, b] is given by the indicator function of its interval of support normalized by the interval's length: f_X(x) = \begin{cases} \displaystyle{1 \over b-a}, & a \le x \le b \\ 0, & \text{otherwise}. \end{cases} Of particular interest is the uniform distribution on the unit interval [0, 1] . Samples of any desired probability distribution \operatorname{D} can be generated by calculating the quantile function of \operatorname{D} on a randomly-generated number distributed uniformly on the unit interval. This exploits properties of cumulative distribution functions, which are a unifying framework for all random variables. An example of a random variable of mixed type would be based on an experiment where a coin is flipped and the spinner is spun only if the result of the coin toss is heads. If the result is tails, X = −1; otherwise X is the value of the spinner as in the preceding example. There is a probability of that this random variable will have the value −1. Other ranges of values would have half the probabilities of the last example. Most generally, every probability distribution on the real line is a mixture of discrete part, singular part, and an absolutely continuous part; see . The discrete part is concentrated on a countable set, but this set may be dense (like the set of all rational numbers). Let (\Omega, \mathcal{F}, P) be a probability space and (E, \mathcal{E}) a measurable space. Then an (E, \mathcal{E}) -valued random variable is a measurable function , which means that, for every subset , its preimage is \mathcal{F} -measurable; X^{-1}(B)\in \mathcal{F} , where X^{-1}(B) = \{\omega : X(\omega)\in B\} . This definition enables us to measure any subset B\in \mathcal{E} in the target space by looking at its preimage, which by assumption is measurable. In more intuitive terms, a member of \Omega is a possible outcome, a member of \mathcal{F} is a measurable subset of possible outcomes, the function P gives the probability of each such measurable subset, E represents the set of values that the random variable can take (such as the set of real numbers), and a member of \mathcal{E} is a "well-behaved" (measurable) subset of E (those for which the probability may be determined). The random variable is then a function from any outcome to a quantity, such that the outcomes leading to any useful subset of quantities for the random variable have a well-defined probability. When E is a topological space, then the most common choice for the σ-algebra \mathcal{E} is the Borel σ-algebra , which is the σ-algebra generated by the collection of all open sets in E . In such case the (E, \mathcal{E}) -valued random variable is called an E -valued random variable. Moreover, when the space E is the real line \mathbb{R} , then such a real-valued random variable is called simply a random variable. Note that we are not giving \mathbb R the usual Lebesgue \sigma -algebra, which is the completion of the Borel \sigma -algebra. This choice allows for more measurable functions f:\Omega\to \mathbb R and makes it easier to check that a function f:\Omega\to \mathbb R is measurable, as we only need to check that preimages of open sets are measurable. \{ \omega : X(\omega) \le r \} \in \mathcal{F} \qquad \forall r \in \mathbb{R}. This definition is a special case of the above because the set \{(-\infty, r]: r \in \R\} generates the Borel σ-algebra on the set of real numbers, and it suffices to check measurability on any generating set. Here we can prove measurability on this generating set by using the fact that . Moments can only be defined for real-valued functions of random variables (or complex-valued, etc.). If the random variable is itself real-valued, then moments of the variable itself can be taken, which are equivalent to moments of the identity function f(X)=X of the random variable. However, even for non-real-valued random variables, moments can be taken of real-valued functions of those variables. For example, for a categorical random variable X that can take on the nominal values "red", "blue" or "green", the real-valued function [X = \text{green}] can be constructed; this uses the Iverson bracket, and has the value 1 if X has the value "green", 0 otherwise. Then, the expected value and other moments of this function can be determined. A new random variable can be defined by applying a real Borel measurable function g\colon \mathbb{R} \rightarrow \mathbb{R} to the outcomes of a real-valued random variable X . That is, Y=g(X) . The cumulative distribution function of Y is then F_Y(y) = \operatorname{P}(g(X) \le y). If function g is invertible (i.e., h = g^{-1} exists, where h is g 's inverse function) and is either increasing or decreasing, then the previous relation can be extended to obtain F_Y(y) = \operatorname{P}(g(X) \le y) = \begin{cases} \operatorname{P}(X \le h(y)) = F_X(h(y)), & \text{if } h = g^{-1} \text{ increasing} ,\\ \\ \operatorname{P}(X \ge h(y)) = 1 - F_X(h(y)), & \text{if } h = g^{-1} \text{ decreasing} . \end{cases} With the same hypotheses of invertibility of g , assuming also differentiability, the relation between the probability density functions can be found by differentiating both sides of the above expression with respect to y , in order to obtain f_Y(y) = f_X\bigl(h(y)\bigr) \left| \frac{d h(y)}{d y} \right|. If there is no invertibility of g but each y admits at most a countable number of roots (i.e., a finite, or countably infinite, number of x_i such that y = g(x_i) ) then the previous relation between the probability density functions can be generalized with f_Y(y) = \sum_{i} f_X(g_{i}^{-1}(y)) \left| \frac{d g_{i}^{-1}(y)}{d y} \right| where , according to the inverse function theorem. The formulas for densities do not demand g to be increasing. In the measure-theoretic, axiomatic approach to probability, if a random variable X on \Omega and a Borel measurable function g\colon \mathbb{R} \rightarrow \mathbb{R} , then Y = g(X) is also a random variable on , since the composition of measurable functions is also measurable. (However, this is not necessarily true if g is Lebesgue measurable. ) The same procedure that allowed one to go from a probability space (\Omega, P) to (\mathbb{R}, dF_{X}) can be used to obtain the distribution of . F_Y(y) = \operatorname{P}(X^2 \le y). If , then , so F_Y(y) = 0\qquad\hbox{if}\quad y If , then \operatorname{P}(X^2 \le y) = \operatorname{P}(|X| \le \sqrt{y}) = \operatorname{P}(-\sqrt{y} \le X \le \sqrt{y}), so F_Y(y) = F_X(\sqrt{y}) - F_X(-\sqrt{y})\qquad\hbox{if}\quad y \ge 0. F_{X}(x) = P(X \leq x) = \frac{1}{(1 + e^{-x})^{\theta}} where \theta > 0 is a fixed parameter. Consider the random variable Y = \mathrm{log}(1 + e^{-X}). Then, F_{Y}(y) = P(Y \leq y) = P(\mathrm{log}(1 + e^{-X}) \leq y) = P(X \geq -\mathrm{log}(e^{y} - 1)).\, The last expression can be calculated in terms of the cumulative distribution of , so \begin{align} F_Y(y) & = 1 - F_X(-\log(e^y - 1)) \\[5pt] & = 1 - \frac{1}{(1 + e^{\log(e^y - 1)})^\theta} \\[5pt] & = 1 - \frac{1}{(1 + e^y - 1)^\theta} \\[5pt] & = 1 - e^{-y \theta}, \end{align} which is the cumulative distribution function (CDF) of an exponential distribution. f_X(x) = \frac{1}{\sqrt{2\pi}}e^{-x^2/2}. Consider the random variable . We can find the density using the above formula for a change of variables: f_Y(y) = \sum_{i} f_X(g_{i}^{-1}(y)) \left| \frac{d g_{i}^{-1}(y)}{d y} \right|. In this case the change is not monotonic, because every value of Y has two corresponding values of X (one positive and negative). However, because of symmetry, both halves will transform identically, i.e., f_Y(y) = 2f_X(g^{-1}(y)) \left| \frac{d g^{-1}(y)}{d y} \right|. The inverse transformation is x = g^{-1}(y) = \sqrt{y} and its derivative is \frac{d g^{-1}(y)}{d y} = \frac{1}{2\sqrt{y}} . Then, f_Y(y) = 2\frac{1}{\sqrt{2\pi}}e^{-y/2} \frac{1}{2\sqrt{y}} = \frac{1}{\sqrt{2\pi y}}e^{-y/2}. This is a chi-squared distribution with one degree of freedom. f_X(x) = \frac{1}{\sqrt{2\pi\sigma^2}}e^{-(x-\mu)^2/(2\sigma^2)}. Consider the random variable Y = X^2. We can find the density using the above formula for a change of variables: f_Y(y) = \sum_{i} f_X(g_{i}^{-1}(y)) \left| \frac{d g_{i}^{-1}(y)}{d y} \right|. In this case the change is not monotonic, because every value of Y has two corresponding values of X (one positive and negative). Differently from the previous example, in this case however, there is no symmetry and we have to compute the two distinct terms: f_Y(y) = f_X(g_1^{-1}(y))\left|\frac{d g_1^{-1}(y)}{d y} \right| +f_X(g_2^{-1}(y))\left| \frac{d g_2^{-1}(y)}{d y} \right|. The inverse transformation is x = g_{1,2}^{-1}(y) = \pm \sqrt{y} and its derivative is \frac{d g_{1,2}^{-1}(y)}{d y} = \pm \frac{1}{2\sqrt{y}} . Then, f_Y(y) = \frac{1}{\sqrt{2\pi\sigma^2}} \frac{1}{2\sqrt{y}} (e^{-(\sqrt{y}-\mu)^2/(2\sigma^2)}+e^{-(-\sqrt{y}-\mu)^2/(2\sigma^2)}) . This is a noncentral chi-squared distribution with one degree of freedom. \operatorname{P}(X \le x) = \operatorname{P}(Y \le x)\quad\text{for all }x. To be equal in distribution, random variables need not be defined on the same probability space. Two random variables having equal moment generating functions have the same distribution. This provides, for example, a useful method of checking equality of certain functions of independent, identically distributed (IID) random variables. However, the moment generating function exists only for distributions that have a defined Laplace transform. Two random variables X and Y are equal almost surely (denoted X \; \stackrel{\text{a.s.}}{=} \; Y ) if, and only if, the probability that they are different is zero: \operatorname{P}(X \neq Y) = 0. For all practical purposes in probability theory, this notion of equivalence is as strong as actual equality. It is associated to the following distance: d_\infty(X,Y)=\operatorname{ess} \sup_\omega|X(\omega)-Y(\omega)|, where "ess sup" represents the essential supremum in the sense of measure theory. X(\omega)=Y(\omega)\qquad\hbox{for all }\omega. This notion is typically the least useful in probability theory because in practice and in theory, the underlying measure space of the experiment is rarely explicitly characterized or even characterizable. For example, consider the real random variables A, B, C, and D all defined on the same probability space. Suppose that A and B are equal almost surely ( A \; \stackrel{\text{a.s.}}{=} \; B ), but A and C are only equal in distribution ( A ~\stackrel{d}{=}~ C ). Then A + D \; \stackrel{\text{a.s.}}{=} \; B + D , but in general A + D \neq C + D (not even in distribution). Similarly, we have that the expectation values \mathbb{E}(AD) = \mathbb{E}(BD) , but in general \mathbb{E}(AD) \neq \mathbb{E}(CD) . Therefore, two random variables that are equal in distribution (but not equal almost surely) can have different covariances with a third random variable. REFERENCES ---------- BIBLIOGRAPHY (BibTeX) -------------------- @article{ref0, title = {random variable}, url = {https://encyclopegia.org/a/random-variable} } BIBLIOGRAPHY (RIS) ------------------- TY - JOUR TI - random variable UR - https://encyclopegia.org/a/random-variable ER - CITE THIS ARTICLE ---------------- Cite this article: random variable Derived from: https://en.wikipedia.org/w/index.php?oldid=1377239815 Licence: CC BY-SA 4.0 Snapshot: random-variable-021176-bbe38774e8eedbb4 Content hash: bbe38774e8eedbb45b560ddfd34d1b168775c3e9eb386f82e95d881c88ae9e50 Permalink: /a/random-variable