Study guide
14.4 Random Variables, Expected Value, Variance, and Common Distributions
GRE Subject Test: Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Single-Variable Differential Calculus
1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves
2 Chapter 2: Single-Variable Integral Calculus
2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria
3 Chapter 3: Sequences, Infinite Series & Power Series
3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds
4 Chapter 4: Multivariable Differential Calculus
4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers
5 Chapter 5: Multivariable Integration & Vector Calculus
5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem
6 Chapter 6: Ordinary Differential Equations
6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters
7 Chapter 7: Elementary Algebra & Number Theory
7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient
8 Chapter 8: Linear Algebra: Vector Spaces & Transformations
8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis
9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
10 Chapter 10: Abstract Algebra: Groups, Rings & Fields
10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
11 Chapter 11: Introductory Real Analysis
11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence
12 Chapter 12: Complex Analysis
12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem
13 Chapter 13: Topology, Geometry & Numerical Analysis
13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature
14 Chapter 14: Probability, Statistics & Discrete Mathematics
14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions
14.4 Random Variables, Expected Value, Variance, and Common Distributions
Key Takeaways Explain This Topic AI
Expectation is unconditionally linear: E[sum a_i X_i + c] = sum a_i E[X_i] + c holds for all random variables regardless of whether they are independent.
Variance obeys quadratic scaling Var(aX + b) = a^2 Var(X), and Var(X + Y) = Var(X) + Var(Y) + 2Cov(X, Y); independent or uncorrelated variables have additive variances.
Uncorrelated random variables (Cov(X, Y) = 0) are not necessarily independent, as non-linear functional dependencies can have zero linear covariance.
The Geometric distribution (discrete) and Exponential distribution (continuous) are the unique distributions possessing the memoryless property P(X > s+t | X > s) = P(X > t).
Chebyshev's inequality guarantees P(|X - mu| >= k sigma) <= 1/k^2 for any distribution with finite variance, while the Central Limit Theorem establishes asymptotic normality of standardized sample sums.
Last updated: September 2026
14.4 Random Variables, Expected Value, Variance, and Common Distributions
Random variables and probability distributions on the GRE Mathematics Subject Test require mastery of distribution functions, linearity of expectation, variance and covariance algebra, common discrete and continuous families, and asymptotic limit theorems.
Random Variables and Distribution Functions
A random variable X X X on ( Ω , F , P ) (\Omega, \mathcal{F}, P) ( Ω , F , P ) is a Borel-measurable function X : Ω → R X: \Omega \to \mathbb{R} X : Ω → R .
PMF, PDF, and CDF
Discrete: Described by PMF p X ( x ) = P ( X = x ) ≥ 0 p_X(x) = P(X = x) \ge 0 p X ( x ) = P ( X = x ) ≥ 0 with ∑ x p X ( x ) = 1 \sum_x p_X(x) = 1 ∑ x p X ( x ) = 1 .
Continuous: Described by PDF f X ( x ) ≥ 0 f_X(x) \ge 0 f X ( x ) ≥ 0 with ∫ − ∞ ∞ f X ( x ) d x = 1 \int_{-\infty}^\infty f_X(x) \, dx = 1 ∫ − ∞ ∞ f X ( x ) d x = 1 , where P ( a ≤ X ≤ b ) = ∫ a b f X ( x ) d x P(a \le X \le b) = \int_a^b f_X(x) \, dx P ( a ≤ X ≤ b ) = ∫ a b f X ( x ) d x . For any single point c c c , P ( X = c ) = 0 P(X = c) = 0 P ( X = c ) = 0 .
Cumulative Distribution Function (CDF): F X ( x ) = P ( X ≤ x ) F_X(x) = P(X \le x) F X ( x ) = P ( X ≤ x ) for all variables. Every CDF satisfies:
Monotonically non-decreasing: x 1 < x 2 ⟹ F ( x 1 ) ≤ F ( x 2 ) x_1 < x_2 \implies F(x_1) \le F(x_2) x 1 < x 2 ⟹ F ( x 1 ) ≤ F ( x 2 ) .
Right-continuous: lim t → x + F ( t ) = F ( x ) \lim_{t \to x^+} F(t) = F(x) lim t → x + F ( t ) = F ( x ) .
Limits: lim x → − ∞ F ( x ) = 0 \lim_{x \to -\infty} F(x) = 0 lim x → − ∞ F ( x ) = 0 and lim x → ∞ F ( x ) = 1 \lim_{x \to \infty} F(x) = 1 lim x → ∞ F ( x ) = 1 .
For continuous variables, f X ( x ) = F X ′ ( x ) f_X(x) = F_X'(x) f X ( x ) = F X ′ ( x ) almost everywhere.
Expected Value and Linearity
The expected value E [ X ] E[X] E [ X ] measures the center of the distribution: E [ X ] = { ∑ x x p X ( x ) discrete ∫ − ∞ ∞ x f X ( x ) d x continuous E[X] = \begin{cases} \sum_x x \, p_X(x) & \text{discrete} \\[4pt] \int_{-\infty}^\infty x \, f_X(x) \, dx & \text{continuous} \end{cases} E [ X ] = { ∑ x x p X ( x ) ∫ − ∞ ∞ x f X ( x ) d x discrete continuous
provided the sum or integral converges absolutely.
LOTUS and Unconditional Linearity
LOTUS: E [ g ( X ) ] = ∫ − ∞ ∞ g ( x ) f X ( x ) d x E[g(X)] = \int_{-\infty}^\infty g(x) f_X(x) \, dx E [ g ( X )] = ∫ − ∞ ∞ g ( x ) f X ( x ) d x or ∑ x g ( x ) p X ( x ) \sum_x g(x) p_X(x) ∑ x g ( x ) p X ( x ) .
Linearity: For any random variables X 1 , … , X n X_1, \dots, X_n X 1 , … , X n and scalars a i , c ∈ R a_i, c \in \mathbb{R} a i , c ∈ R : E [ ∑ i = 1 n a i X i + c ] = ∑ i = 1 n a i E [ X i ] + c E\left[\sum_{i=1}^n a_i X_i + c\right] = \sum_{i=1}^n a_i E[X_i] + c E [ i = 1 ∑ n a i X i + c ] = i = 1 ∑ n a i E [ X i ] + c Linearity holds unconditionally, requiring no independence assumptions.
Variance, Covariance, and Independence
The variance measures dispersion: Var ( X ) = E [ ( X − μ ) 2 ] = E [ X 2 ] − ( E [ X ] ) 2 \operatorname{Var}(X) = E[(X - \mu)^2] = E[X^2] - (E[X])^2 Var ( X ) = E [( X − μ ) 2 ] = E [ X 2 ] − ( E [ X ] ) 2
Scaling: Var ( a X + b ) = a 2 Var ( X ) \operatorname{Var}(aX + b) = a^2 \operatorname{Var}(X) Var ( a X + b ) = a 2 Var ( X ) . Standard deviation is σ = Var ( X ) \sigma = \sqrt{\operatorname{Var}(X)} σ = Var ( X ) .
Covariance and Variance of Sums
The covariance is Cov ( X , Y ) = E [ X Y ] − E [ X ] E [ Y ] \operatorname{Cov}(X, Y) = E[XY] - E[X]E[Y] Cov ( X , Y ) = E [ X Y ] − E [ X ] E [ Y ] . Var ( X + Y ) = Var ( X ) + Var ( Y ) + 2 Cov ( X , Y ) \operatorname{Var}(X + Y) = \operatorname{Var}(X) + \operatorname{Var}(Y) + 2\operatorname{Cov}(X, Y) Var ( X + Y ) = Var ( X ) + Var ( Y ) + 2 Cov ( X , Y ) Var ( ∑ i = 1 n X i ) = ∑ i = 1 n Var ( X i ) + 2 ∑ i < j Cov ( X i , X j ) \operatorname{Var}\left(\sum_{i=1}^n X_i\right) = \sum_{i=1}^n \operatorname{Var}(X_i) + 2 \sum_{i < j} \operatorname{Cov}(X_i, X_j) Var ( i = 1 ∑ n X i ) = i = 1 ∑ n Var ( X i ) + 2 i < j ∑ Cov ( X i , X j )
Independence: If X X X and Y Y Y are independent, Cov ( X , Y ) = 0 \operatorname{Cov}(X, Y) = 0 Cov ( X , Y ) = 0 , so Var ( X + Y ) = Var ( X ) + Var ( Y ) \operatorname{Var}(X + Y) = \operatorname{Var}(X) + \operatorname{Var}(Y) Var ( X + Y ) = Var ( X ) + Var ( Y ) .
Exam Alert: Cov ( X , Y ) = 0 \operatorname{Cov}(X, Y) = 0 Cov ( X , Y ) = 0 does not imply independence (e.g., X ∼ Uniform ( − 1 , 1 ) X \sim \text{Uniform}(-1, 1) X ∼ Uniform ( − 1 , 1 ) and Y = X 2 Y = X^2 Y = X 2 ).
Catalogue of Common Distributions
Distribution Type PMF / PDF Mean E [ X ] E[X] E [ X ] Variance Var ( X ) \operatorname{Var}(X) Var ( X ) Key Properties
Bernoulli( p p p ) Discrete p x ( 1 − p ) 1 − x , x ∈ { 0 , 1 } p^x (1-p)^{1-x}, x \in \{0, 1\} p x ( 1 − p ) 1 − x , x ∈ { 0 , 1 } p p p p ( 1 − p ) p(1-p) p ( 1 − p ) Single binary trial
Binomial( n , p n, p n , p ) Discrete ( n k ) p k ( 1 − p ) n − k \binom{n}{k} p^k (1-p)^{n-k} ( k n ) p k ( 1 − p ) n − k n p np n p n p ( 1 − p ) np(1-p) n p ( 1 − p ) Sum of n n n i.i.d. Bernoulli
Geometric( p p p ) Discrete ( 1 − p ) k − 1 p , k ≥ 1 (1-p)^{k-1} p, k \ge 1 ( 1 − p ) k − 1 p , k ≥ 1 1 p \frac{1}{p} p 1 1 − p p 2 \frac{1-p}{p^2} p 2 1 − p Memoryless discrete trial count
Poisson( λ \lambda λ ) Discrete λ k e − λ k ! , k ≥ 0 \frac{\lambda^k e^{-\lambda}}{k!}, k \ge 0 k ! λ k e − λ , k ≥ 0 λ \lambda λ λ \lambda λ Rare events limit of Binomial
Uniform( a , b a, b a , b ) Continuous 1 b − a , x ∈ [ a , b ] \frac{1}{b-a}, x \in [a, b] b − a 1 , x ∈ [ a , b ] a + b 2 \frac{a+b}{2} 2 a + b ( b − a ) 2 12 \frac{(b-a)^2}{12} 12 ( b − a ) 2 Constant density
Exponential( λ \lambda λ ) Continuous λ e − λ x , x ≥ 0 \lambda e^{-\lambda x}, x \ge 0 λ e − λ x , x ≥ 0 1 λ \frac{1}{\lambda} λ 1 1 λ 2 \frac{1}{\lambda^2} λ 2 1 Memoryless continuous waiting time
Normal( μ , σ 2 \mu, \sigma^2 μ , σ 2 ) Continuous 1 σ 2 π e − ( x − μ ) 2 2 σ 2 \frac{1}{\sigma\sqrt{2\pi}} e^{-\frac{(x-\mu)^2}{2\sigma^2}} σ 2 π 1 e − 2 σ 2 ( x − μ ) 2 μ \mu μ σ 2 \sigma^2 σ 2 Symmetric bell curve, CLT limit
Memoryless Property
Geometric and Exponential distributions uniquely satisfy P ( X > s + t ∣ X > s ) = P ( X > t ) P(X > s + t \mid X > s) = P(X > t) P ( X > s + t ∣ X > s ) = P ( X > t ) for s , t ≥ 0 s, t \ge 0 s , t ≥ 0 .
Tail Inequalities and Limit Theorems
Markov's Inequality: For X ≥ 0 X \ge 0 X ≥ 0 and a > 0 a > 0 a > 0 , P ( X ≥ a ) ≤ E [ X ] a P(X \ge a) \le \frac{E[X]}{a} P ( X ≥ a ) ≤ a E [ X ] .
Chebyshev's Inequality: For finite variance σ 2 \sigma^2 σ 2 , P ( ∣ X − μ ∣ ≥ ϵ ) ≤ σ 2 ϵ 2 P(|X - \mu| \ge \epsilon) \le \frac{\sigma^2}{\epsilon^2} P ( ∣ X − μ ∣ ≥ ϵ ) ≤ ϵ 2 σ 2 or P ( ∣ X − μ ∣ ≥ k σ ) ≤ 1 k 2 P(|X - \mu| \ge k\sigma) \le \frac{1}{k^2} P ( ∣ X − μ ∣ ≥ kσ ) ≤ k 2 1 .
Weak Law of Large Numbers (WLLN): For i.i.d. X i X_i X i with mean μ \mu μ , sample mean X ˉ n → P μ \bar{X}_n \xrightarrow{P} \mu X ˉ n P μ .
Central Limit Theorem (CLT): For i.i.d. X i X_i X i with mean μ \mu μ and variance σ 2 ∈ ( 0 , ∞ ) \sigma^2 \in (0, \infty) σ 2 ∈ ( 0 , ∞ ) : Z n = X ˉ n − μ σ / n → d N ( 0 , 1 ) Z_n = \frac{\bar{X}_n - \mu}{\sigma / \sqrt{n}} \xrightarrow{d} \mathcal{N}(0, 1) Z n = σ / n X ˉ n − μ d N ( 0 , 1 )
Step-by-Step Worked Problem
Problem: A bin contains 50 lightbulbs, of which 10 are defective. If 5 bulbs are selected at random without replacement, let X X X be the number of defective bulbs chosen. Find E [ X ] E[X] E [ X ] and Var ( X ) \operatorname{Var}(X) Var ( X ) .
Solution:
Indicator representation: Let I j = 1 I_j = 1 I j = 1 if the j j j -th drawn bulb is defective, and 0 otherwise ( j = 1 , … , 5 j = 1, \dots, 5 j = 1 , … , 5 ). Then X = ∑ j = 1 5 I j X = \sum_{j=1}^5 I_j X = ∑ j = 1 5 I j .
Expectation: By symmetry, P ( I j = 1 ) = 10 / 50 = 1 / 5 P(I_j = 1) = 10/50 = 1/5 P ( I j = 1 ) = 10/50 = 1/5 . By linearity of expectation: E [ X ] = ∑ j = 1 5 E [ I j ] = 5 × 1 5 = 1 E[X] = \sum_{j=1}^5 E[I_j] = 5 \times \frac{1}{5} = 1 E [ X ] = j = 1 ∑ 5 E [ I j ] = 5 × 5 1 = 1
Variance components: Since I j 2 = I j I_j^2 = I_j I j 2 = I j , Var ( I j ) = 1 5 − 1 25 = 4 25 \operatorname{Var}(I_j) = \frac{1}{5} - \frac{1}{25} = \frac{4}{25} Var ( I j ) = 5 1 − 25 1 = 25 4 .
For j ≠ k j \neq k j = k , P ( I j = 1 , I k = 1 ) = 10 50 × 9 49 = 9 245 P(I_j = 1, I_k = 1) = \frac{10}{50} \times \frac{9}{49} = \frac{9}{245} P ( I j = 1 , I k = 1 ) = 50 10 × 49 9 = 245 9 . Cov ( I j , I k ) = 9 245 − ( 1 5 ) 2 = 9 245 − 1 25 = − 4 1225 \operatorname{Cov}(I_j, I_k) = \frac{9}{245} - \left(\frac{1}{5}\right)^2 = \frac{9}{245} - \frac{1}{25} = -\frac{4}{1225} Cov ( I j , I k ) = 245 9 − ( 5 1 ) 2 = 245 9 − 25 1 = − 1225 4
Summing variance: Var ( X ) = 5 ( 4 25 ) + 20 ( − 4 1225 ) = 4 5 − 16 245 = 180 245 = 36 49 \operatorname{Var}(X) = 5\left(\frac{4}{25}\right) + 20\left(-\frac{4}{1225}\right) = \frac{4}{5} - \frac{16}{245} = \frac{180}{245} = \frac{36}{49} Var ( X ) = 5 ( 25 4 ) + 20 ( − 1225 4 ) = 5 4 − 245 16 = 245 180 = 49 36
GRE Exam Traps & Pitfalls
Trap 1: Dropping a 2 a^2 a 2 in Variance Scaling Remember Var ( a X + b ) = a 2 Var ( X ) \operatorname{Var}(aX + b) = a^2 \operatorname{Var}(X) Var ( a X + b ) = a 2 Var ( X ) . Scalar constants pull out squared, while additive constants vanish. Var ( − X ) = Var ( X ) \operatorname{Var}(-X) = \operatorname{Var}(X) Var ( − X ) = Var ( X ) , never − Var ( X ) -\operatorname{Var}(X) − Var ( X ) .
Trap 2: Assuming Zero Covariance Implies Independence Zero covariance implies no linear relationship, but non-linear deterministic dependence (like Y = X 2 Y = X^2 Y = X 2 for symmetric X X X ) still produces Cov ( X , Y ) = 0 \operatorname{Cov}(X, Y) = 0 Cov ( X , Y ) = 0 .
Trap 3: Adding Variances of Dependent Variables Var ( X + Y ) = Var ( X ) + Var ( Y ) \operatorname{Var}(X + Y) = \operatorname{Var}(X) + \operatorname{Var}(Y) Var ( X + Y ) = Var ( X ) + Var ( Y ) requires uncorrelatedness. Without it, the cross-term 2 Cov ( X , Y ) 2\operatorname{Cov}(X, Y) 2 Cov ( X , Y ) must be included.
Trap 4: Geometric Support Ambiguity Verify whether Geometric( p p p ) counts total trials ( k ∈ { 1 , 2 , … } , E = 1 / p k \in \{1, 2, \dots\}, E = 1/p k ∈ { 1 , 2 , … } , E = 1/ p ) or failures before success ( k ∈ { 0 , 1 , … } , E = ( 1 − p ) / p k \in \{0, 1, \dots\}, E = (1-p)/p k ∈ { 0 , 1 , … } , E = ( 1 − p ) / p ).