Change of Variables
For U = g 1 ( X , Y ) U = g_1(X, Y) U = g 1 ( X , Y ) , V = g 2 ( X , Y ) V = g_2(X, Y) V = g 2 ( X , Y ) one-to-one, with inverse x = h 1 ( u , v ) x = h_1(u, v) x = h 1 ( u , v ) , y = h 2 ( u , v ) y = h_2(u, v) y = h 2 ( u , v ) ,
f U , V ( u , v ) = f X , Y ( h 1 ( u , v ) , h 2 ( u , v ) ) ⋅ ∣ J ∣ , J = det [ ∂ x ∂ u ∂ x ∂ v ∂ y ∂ u ∂ y ∂ v ] f_{U,V}(u, v) = f_{X,Y}\big(h_1(u, v), h_2(u, v)\big) \cdot |J|, \qquad J = \det \begin{bmatrix} \frac{\partial x}{\partial u} & \frac{\partial x}{\partial v} \\ \frac{\partial y}{\partial u} & \frac{\partial y}{\partial v} \end{bmatrix} f U , V ( u , v ) = f X , Y ( h 1 ( u , v ) , h 2 ( u , v ) ) ⋅ ∣ J ∣ , J = det [ ∂ u ∂ x ∂ u ∂ y ∂ v ∂ x ∂ v ∂ y ]
Order Statistics
For X 1 , … , X n X_1, \ldots, X_n X 1 , … , X n IID with CDF F F F and density f f f , and X ( 1 ) ≤ ⋯ ≤ X ( n ) X_{(1)} \le \cdots \le X_{(n)} X ( 1 ) ≤ ⋯ ≤ X ( n ) the sorted values,
F X ( n ) ( x ) = F ( x ) n , F X ( 1 ) ( x ) = 1 − [ 1 − F ( x ) ] n F_{X_{(n)}}(x) = F(x)^n, \qquad F_{X_{(1)}}(x) = 1 - [1 - F(x)]^n F X ( n ) ( x ) = F ( x ) n , F X ( 1 ) ( x ) = 1 − [ 1 − F ( x ) ] n
f X ( n ) ( x ) = n F ( x ) n − 1 f ( x ) , f X ( 1 ) ( x ) = n [ 1 − F ( x ) ] n − 1 f ( x ) f_{X_{(n)}}(x) = nF(x)^{n-1}f(x), \qquad f_{X_{(1)}}(x) = n[1 - F(x)]^{n-1}f(x) f X ( n ) ( x ) = n F ( x ) n − 1 f ( x ) , f X ( 1 ) ( x ) = n [ 1 − F ( x ) ] n − 1 f ( x )
f X ( i ) ( x ) = ( n i − 1 , 1 , n − i ) F ( x ) i − 1 f ( x ) [ 1 − F ( x ) ] n − i f_{X_{(i)}}(x) = \binom{n}{i - 1, 1, n - i} F(x)^{i-1} f(x) [1 - F(x)]^{n-i} f X ( i ) ( x ) = ( i − 1 , 1 , n − i n ) F ( x ) i − 1 f ( x ) [ 1 − F ( x ) ] n − i
For i < j i < j i < j ,
f X ( i ) , X ( j ) ( x i , x j ) = ( n i − 1 , 1 , j − i − 1 , 1 , n − j ) F ( x i ) i − 1 f ( x i ) [ F ( x j ) − F ( x i ) ] j − i − 1 f ( x j ) [ 1 − F ( x j ) ] n − j I x i < x j f_{X_{(i)}, X_{(j)}}(x_i, x_j) = \binom{n}{i - 1, 1, j - i - 1, 1, n - j} F(x_i)^{i-1} f(x_i) [F(x_j) - F(x_i)]^{j-i-1} f(x_j) [1 - F(x_j)]^{n-j} \, I_{x_i < x_j} f X ( i ) , X ( j ) ( x i , x j ) = ( i − 1 , 1 , j − i − 1 , 1 , n − j n ) F ( x i ) i − 1 f ( x i ) [ F ( x j ) − F ( x i ) ] j − i − 1 f ( x j ) [ 1 − F ( x j ) ] n − j I x i < x j
and the joint density of all of them is
f ( x 1 , … , x n ) = n ! f ( x 1 ) f ( x 2 ) ⋯ f ( x n ) I x 1 < x 2 < ⋯ < x n f(x_1, \ldots, x_n) = n! \, f(x_1) f(x_2) \cdots f(x_n) \, I_{x_1 < x_2 < \cdots < x_n} f ( x 1 , … , x n ) = n ! f ( x 1 ) f ( x 2 ) ⋯ f ( x n ) I x 1 < x 2 < ⋯ < x n
Exchangeability
X 1 , … , X n X_1, \ldots, X_n X 1 , … , X n are exchangeable if their joint distribution is the same under every permutation of ( 1 , … , n ) (1, \ldots, n) ( 1 , … , n ) , i.e. no variable is any more likely to be at a certain place. IID implies exchangeable. Sampling without replacement from a finite population gives exchangeable but not independent samples (see survey sampling ).
Bivariate Normal
With Z 1 , Z 2 Z_1, Z_2 Z 1 , Z 2 IID N ( 0 , 1 ) \mathcal{N}(0, 1) N ( 0 , 1 ) ,
X = μ 1 + σ 1 Z 1 , Y = μ 2 + σ 2 ( ρ Z 1 + 1 − ρ 2 Z 2 ) X = \mu_1 + \sigma_1 Z_1, \qquad Y = \mu_2 + \sigma_2\big(\rho Z_1 + \sqrt{1 - \rho^2}\, Z_2\big) X = μ 1 + σ 1 Z 1 , Y = μ 2 + σ 2 ( ρ Z 1 + 1 − ρ 2 Z 2 )
gives ( X , Y ) ∼ B V N ( μ 1 , μ 2 , σ 1 2 , σ 2 2 , ρ ) (X, Y) \sim \mathrm{BVN}(\mu_1, \mu_2, \sigma_1^2, \sigma_2^2, \rho) ( X , Y ) ∼ BVN ( μ 1 , μ 2 , σ 1 2 , σ 2 2 , ρ ) , with ρ ( X , Y ) = C o v ( X , Y ) σ X σ Y = ρ \rho(X, Y) = \frac{\mathrm{Cov}(X, Y)}{\sigma_X \sigma_Y} = \rho ρ ( X , Y ) = σ X σ Y Cov ( X , Y ) = ρ .
Variance and Conditioning
V a r ( X ) = E [ V a r ( X ∣ Y ) ] + V a r ( E [ X ∣ Y ] ) \mathrm{Var}(X) = E[\mathrm{Var}(X | Y)] + \mathrm{Var}(E[X | Y]) Var ( X ) = E [ Var ( X ∣ Y )] + Var ( E [ X ∣ Y ])
By Cauchy-Schwarz ∣ E [ X Y ] ∣ ≤ ( E [ X 2 ] E [ Y 2 ] ) 1 / 2 |E[XY]| \le (E[X^2]E[Y^2])^{1/2} ∣ E [ X Y ] ∣ ≤ ( E [ X 2 ] E [ Y 2 ] ) 1/2 , so ∣ ρ ( X , Y ) ∣ ≤ 1 |\rho(X, Y)| \le 1 ∣ ρ ( X , Y ) ∣ ≤ 1 , and ∣ ρ ( X , Y ) ∣ = 1 |\rho(X, Y)| = 1 ∣ ρ ( X , Y ) ∣ = 1 implies Y = a X + b Y = aX + b Y = a X + b .