The Bivariate Normal Distribution

Suppose you know a student's SAT math score. What can you say about her SAT verbal score, before seeing it? These two scores are not independent. Students strong in one tend to be at least somewhat strong in the other. But neither are they rigidly linked. The bivariate normal distribution is the canonical model for exactly this situation. It describes two continuous random variables with a linear, noisy relationship. Each variable is individually bell-shaped. It is the simplest non-trivial joint distribution with dependence built in. It is also astonishingly tractable. Every conditional distribution, marginal distribution, and linear combination formed from it is again normal. This tractability is not a lucky accident. It is the reason the bivariate normal sits at the center of classical statistics. This spans regression, principal component analysis, and the theory of jointly Gaussian processes. The distribution is completely determined by five numbers — two means, two variances, and a correlation. Yet from those five numbers one can read off the entire conditional structure of the pair. In particular, the correlation coefficient ρ\rho controls everything. When ρ=0\rho=0 the two normal coordinates become fully independent. This is a striking fact that fails for almost every other joint distribution with normal marginals. The big picture this article develops is a chain of increasingly powerful facts. The joint density has a specific quadratic-form structure. The marginals are univariate normal. The conditional distributions are normal, with a mean that is linear in the conditioning variable (the population regression line). Their variance does not depend on the conditioning value at all. Finally, for jointly normal random variables, zero correlation is equivalent to independence. It is not merely a necessary condition, but sufficient too. This article delivers the density and its parameters. It provides derivations of the marginal and conditional laws. It gives a full proof of the independence-iff-uncorrelated theorem. This includes an explicit counterexample showing why joint, not merely marginal, normality is essential. Finally, it discusses how this two-dimensional picture is the seed. From it grow the Central Limit Theorem and the general multivariate normal distribution.

Key takeaways
  • The bivariate normal density is a specific bell-shaped surface on R2\mathbb{R}^2, governed by five parameters: μX,μY,σX2,σY2,ρ\mu_X,\mu_Y,\sigma_X^2,\sigma_Y^2,\rho.
  • Both marginals of a bivariate normal pair are univariate normal, but normal marginals alone do not imply a bivariate normal joint law.
  • Every conditional distribution Y∣X=xY\mid X=x is normal, with mean linear in xx (the regression line) and constant variance σY2(1−ρ2)\sigma_Y^2(1-\rho^2).
  • Correlation ρ\rho fully controls dependence: ρ=±1\rho = \pm 1 forces an exact linear relationship, ρ=0\rho=0 forces independence.
  • The independence-iff-uncorrelated equivalence is special to (jointly) normal pairs; it fails for general random variables.
  • This 2D structure is the prototype for the general multivariate normal, and its stability under linear combinations previews the Central Limit Theorem.
  • Key idea: joint normality means every linear combination of the coordinates is normal, and this single fact forces all the marginal, conditional, and independence structure that follows.

Where this lives today

The bivariate (and general multivariate) normal is the workhorse behind linear regression: the conditional mean formula proved above, E[Y∣X=x]=μY+ρσYσX(x−μX)E[Y\mid X=x] = \mu_Y + \rho\frac{\sigma_Y}{\sigma_X}(x-\mu_X), is exactly the population regression line, and ordinary least squares recovers its sample analogue. In finance, joint normality of asset log-returns underlies the Markowitz mean–variance portfolio theory and the covariance matrix used in risk models. In signal processing and communications, additive Gaussian noise models routinely require the joint (not just marginal) normality assumption to compute error probabilities like the one in Worked Example 1. In machine learning and statistics, the bivariate normal is the 22-dimensional case of the multivariate Gaussian used in Gaussian discriminant analysis, Kalman filtering, and Gaussian process regression, all of which rely on the same completing-the-square argument to derive closed-form conditional distributions. In physics, jointly Gaussian random fields (e.g. in statistical mechanics and cosmology, describing correlated fluctuations) use the identical machinery. Finally, this two-variable case is the seed of the Central Limit Theorem: sums of many small, weakly dependent contributions tend toward jointly Gaussian vectors, and understanding the two-dimensional conditional/independence structure here is the natural stepping stone to the general multivariate Gaussian limit theory.

:::quiz[For jointly normal (X,Y)(X,Y) with ρ=−0.6\rho = -0.6, σX=4\sigma_X=4, σY=5\sigma_Y=5, the slope of E[Y∣X=x]E[Y\mid X=x] in xx is]

  • −0.6-0.6
  • −0.75-0.75 ✓
  • 0.750.75
  • −3.0-3.0

Ask the tutor: How does this bivariate picture extend to the general multivariate normal distribution and its role in the multivariate Central Limit Theorem?

DefinitionBivariate Normal Distribution

Let μX,μY∈R\mu_X,\mu_Y \in \mathbb{R}, σX,σY>0\sigma_X,\sigma_Y > 0, and ρ∈(−1,1)\rho \in (-1,1). The pair (X,Y)(X,Y) has the bivariate normal distribution with parameters (μX,μY,σX2,σY2,ρ)(\mu_X,\mu_Y,\sigma_X^2,\sigma_Y^2,\rho) if it has joint probability density function

fX,Y(x,y)=12πσXσY1−ρ2exp⁡(−12(1−ρ2)[(x−μX)2σX2−2ρ(x−μX)(y−μY)σXσY+(y−μY)2σY2])f_{X,Y}(x,y) = \frac{1}{2\pi\sigma_X\sigma_Y\sqrt{1-\rho^2}} \exp\left(-\frac{1}{2(1-\rho^2)}\left[ \frac{(x-\mu_X)^2}{\sigma_X^2} - \frac{2\rho(x-\mu_X)(y-\mu_Y)}{\sigma_X\sigma_Y} + \frac{(y-\mu_Y)^2}{\sigma_Y^2}\right]\right)

for all (x,y)∈R2(x,y)\in\mathbb{R}^2. Here ρ\rho is (necessarily) the correlation coefficient of XX and YY, and σX2,σY2\sigma_X^2,\sigma_Y^2 are their variances. The degenerate boundary cases ρ=±1\rho=\pm1 correspond to YY being an exact affine function of XX almost surely, and are handled separately (the density above is not defined there, since the joint law is singular — supported on a line, not on all of R2\mathbb{R}^2). Equivalently, and more generally (covering ρ=±1\rho=\pm1 too), (X,Y)(X,Y) is called jointly normal (or jointly Gaussian) if every linear combination aX+bYaX+bY, for constants a,b∈Ra,b\in\mathbb{R} not both zero, has a univariate normal distribution (allowing the degenerate case of a point mass, i.e. variance 00).

Intuition

Picture the density surface: it is a single smooth bump over the plane, elliptical in cross-section. Slicing the surface horizontally at any height produces an ellipse; these ellipses are all similar and concentric, centered at (μX,μY)(\mu_X,\mu_Y), and their axes are tilted relative to the coordinate axes whenever ρ≠0\rho \ne 0. The tilt is the visual signature of dependence: if ρ>0\rho>0, the ellipses lean so that large XX tends to accompany large YY; if ρ<0\rho<0, they lean the other way; if ρ=0\rho=0, the ellipses are axis-aligned (circles when σX=σY\sigma_X=\sigma_Y), and the surface actually factors into a product of two independent univariate bumps. The conditional distribution of YY given X=xX=x can be visualized as taking a vertical slice through the bump at a fixed xx. Because of the special algebraic structure of the exponent (it is a quadratic form in (x,y)(x,y)), this slice — suitably rescaled — is again a normal density in yy, whose center drifts linearly in xx along the famous regression line y=μY+ρσYσX(x−μX)y = \mu_Y + \rho\frac{\sigma_Y}{\sigma_X}(x-\mu_X), and whose spread σY2(1−ρ2)\sigma_Y^2(1-\rho^2) shrinks toward zero as ∣ρ∣→1|\rho|\to 1 (the slice becomes a spike) and stays at σY2\sigma_Y^2 when ρ=0\rho=0 (slicing does not narrow the spread at all, consistent with independence).

Figure
Contour ellipses of a bivariate normal density with ρ=0.6\rho=0.6, showing the tilted major axis and the regression line for Y∣XY\mid X
x y μₓ,μᵧ regression line: E[Y | X=x] slope = ρ·σᵧ/σₓ ρ = 0.6 contour ellipses

The central theorem

TheoremMarginals, Conditionals, and Independence for the Bivariate Normal

Let (X,Y)(X,Y) have the bivariate normal density with parameters (μX,μY,σX2,σY2,ρ)(\mu_X,\mu_Y,\sigma_X^2,\sigma_Y^2,\rho), ρ∈(−1,1)\rho\in(-1,1), as in the Bivariate Normal Distribution definition. Then:

(1) Marginals. X∼N(μX,σX2)X \sim N(\mu_X,\sigma_X^2) and Y∼N(μY,σY2)Y \sim N(\mu_Y,\sigma_Y^2).

(2) Conditionals. The conditional distribution of YY given X=xX=x is

Y∣X=x ∼ N ⁣(μY+ρ σYσX(x−μX),  σY2(1−ρ2)),Y \mid X = x \ \sim\ N\!\left(\mu_Y + \rho\,\frac{\sigma_Y}{\sigma_X}(x - \mu_X),\ \ \sigma_Y^2(1-\rho^2)\right),

and symmetrically for XX given Y=yY=y.

(3) The correlation coefficient of (X,Y)(X,Y) (as defined by Corr(X,Y)=Cov(X,Y)/(σXσY)\mathrm{Corr}(X,Y)=\mathrm{Cov}(X,Y)/(\sigma_X\sigma_Y)) equals ρ\rho.

(4) Independence iff uncorrelated. XX and YY are independent if and only if ρ=0\rho = 0.

Proof

Setup. Write u=x−μXσXu = \frac{x-\mu_X}{\sigma_X}, v=y−μYσYv = \frac{y-\mu_Y}{\sigma_Y} for the standardized coordinates, so that x=μX+σXux=\mu_X+\sigma_X u, y=μY+σYvy = \mu_Y+\sigma_Y v, and the Jacobian of (x,y)↦(u,v)(x,y)\mapsto(u,v) has absolute value σXσY\sigma_X\sigma_Y. The density becomes, after this change of variables,

g(u,v):=σXσYfX,Y(x,y)=12π1−ρ2exp⁡(−u2−2ρuv+v22(1−ρ2)),g(u,v) := \sigma_X\sigma_Y f_{X,Y}(x,y) = \frac{1}{2\pi\sqrt{1-\rho^2}}\exp\left(-\frac{u^2 - 2\rho uv + v^2}{2(1-\rho^2)}\right),

which is the joint density of (U,V):=(X−μXσX,Y−μYσY)(U,V):=\left(\frac{X-\mu_X}{\sigma_X}, \frac{Y-\mu_Y}{\sigma_Y}\right). It suffices to prove all four claims for the standardized pair (U,V)(U,V) with density gg, since X=μX+σXUX=\mu_X+\sigma_X U and Y=μY+σYVY=\mu_Y+\sigma_Y V are just location–scale transforms.

Key algebraic identity. Complete the square in vv (treating uu as fixed):

u2−2ρuv+v2=(v−ρu)2+(1−ρ2)u2.u^2 - 2\rho uv + v^2 = (v-\rho u)^2 + (1-\rho^2)u^2.

This is verified by direct expansion: (v−ρu)2+(1−ρ2)u2=v2−2ρuv+ρ2u2+u2−ρ2u2=v2−2ρuv+u2(v-\rho u)^2 + (1-\rho^2)u^2 = v^2 - 2\rho uv + \rho^2 u^2 + u^2 - \rho^2 u^2 = v^2-2\rho uv+u^2. Substituting into gg:

g(u,v)=12π1−ρ2exp⁡(−(v−ρu)22(1−ρ2))exp⁡(−u22).g(u,v) = \frac{1}{2\pi\sqrt{1-\rho^2}}\exp\left(-\frac{(v-\rho u)^2}{2(1-\rho^2)}\right)\exp\left(-\frac{u^2}{2}\right).

Regroup the constants:

g(u,v)=12πe−u2/2⏟=: ϕ(u) ⋅ 12π(1−ρ2)exp⁡(−(v−ρu)22(1−ρ2))⏟=: h(v∣u).(∗)g(u,v) = \underbrace{\frac{1}{\sqrt{2\pi}}e^{-u^2/2}}_{=:\ \phi(u)}\ \cdot\ \underbrace{\frac{1}{\sqrt{2\pi(1-\rho^2)}}\exp\left(-\frac{(v-\rho u)^2}{2(1-\rho^2)}\right)}_{=:\ h(v\mid u)}. \tag{$\ast$}

Note ϕ\phi is exactly the standard normal density, and for each fixed uu, h(⋅∣u)h(\cdot\mid u) is the density of a N(ρu, 1−ρ2)N(\rho u,\, 1-\rho^2) distribution, hence integrates to 11 over v∈Rv\in\mathbb{R} for every fixed uu.

(1) Marginal of UU (hence of XX). Integrate (∗)(\ast) over v∈Rv\in\mathbb{R}:

fU(u)=∫−∞∞g(u,v) dv=ϕ(u)∫−∞∞h(v∣u) dv=ϕ(u)⋅1=ϕ(u),f_U(u) = \int_{-\infty}^\infty g(u,v)\,dv = \phi(u)\int_{-\infty}^\infty h(v\mid u)\,dv = \phi(u)\cdot 1 = \phi(u),

using that h(⋅∣u)h(\cdot\mid u) is a genuine probability density (it integrates to 11) as just observed. So U∼N(0,1)U \sim N(0,1). Since X=μX+σXUX = \mu_X + \sigma_X U is an affine function of a standard normal, X∼N(μX,σX2)X \sim N(\mu_X,\sigma_X^2): indeed for any Borel set AA,

P(X∈A)=P(μX+σXU∈A)=P(U∈A−μXσX)=∫(A−μX)/σXϕ(u) du,P(X\in A) = P(\mu_X+\sigma_X U \in A) = P\left(U \in \tfrac{A-\mu_X}{\sigma_X}\right) = \int_{(A-\mu_X)/\sigma_X} \phi(u)\,du,

and substituting x=μX+σXux = \mu_X+\sigma_X u (Jacobian 1/σX1/\sigma_X) turns this into ∫A1σXϕ(x−μXσX)dx\int_A \frac{1}{\sigma_X}\phi\left(\frac{x-\mu_X}{\sigma_X}\right)dx, the N(μX,σX2)N(\mu_X,\sigma_X^2) density integrated over AA. By the symmetry of gg under swapping (u,ρ)↔(v,ρ)(u,\rho)\leftrightarrow(v,\rho) — the quadratic form u2−2ρuv+v2u^2-2\rho uv+v^2 is symmetric in u,vu,v — the identical argument gives V∼N(0,1)V\sim N(0,1) and hence Y∼N(μY,σY2)Y\sim N(\mu_Y,\sigma_Y^2).

(2) Conditional distribution. By definition, for fU(u)>0f_U(u) > 0 (which holds for every u∈Ru\in\mathbb{R} since ϕ(u)>0\phi(u)>0 everywhere), the conditional density of VV given U=uU=u is

fV∣U(v∣u)=g(u,v)fU(u)=ϕ(u) h(v∣u)ϕ(u)=h(v∣u),f_{V\mid U}(v\mid u) = \frac{g(u,v)}{f_U(u)} = \frac{\phi(u)\,h(v\mid u)}{\phi(u)} = h(v\mid u),

using (∗)(\ast) and the marginal computed in (1). By the identification of h(⋅∣u)h(\cdot\mid u) made just after (∗)(\ast), this says

V∣U=u ∼ N(ρu, 1−ρ2).V \mid U=u \ \sim\ N(\rho u,\ 1-\rho^2).

Now transform back to (X,Y)(X,Y). Conditioning on X=xX=x is the same event as conditioning on U=u:=(x−μX)/σXU = u := (x-\mu_X)/\sigma_X (a measurable bijection), and Y=μY+σYVY = \mu_Y + \sigma_Y V, so

Y∣X=x ∼ μY+σY⋅N ⁣(ρ x−μXσX, 1−ρ2)=N ⁣(μY+ρσYσX(x−μX), σY2(1−ρ2)),Y \mid X=x \ \sim\ \mu_Y + \sigma_Y\cdot N\!\left(\rho\,\tfrac{x-\mu_X}{\sigma_X},\ 1-\rho^2\right) = N\!\left(\mu_Y + \rho\tfrac{\sigma_Y}{\sigma_X}(x-\mu_X),\ \sigma_Y^2(1-\rho^2)\right),

where we used that an affine transform a+bWa + bW of W∼N(m,s2)W\sim N(m,s^2) is N(a+bm,b2s2)N(a+bm, b^2 s^2). This proves (2); the statement for X∣Y=yX\mid Y=y follows by the same symmetry argument used at the end of part (1).

(3) Correlation. From (2), E[Y∣X]=μY+ρσYσX(X−μX)E[Y\mid X] = \mu_Y + \rho\frac{\sigma_Y}{\sigma_X}(X-\mu_X). Take expectations of (X−μX)Y(X-\mu_X)Y using the tower property (from Conditional Expectation):

E[(X−μX)Y]=E[(X−μX) E[Y∣X]]=E[(X−μX)(μY+ρσYσX(X−μX))].E[(X-\mu_X)Y] = E\big[(X-\mu_X)\,E[Y\mid X]\big] = E\left[(X-\mu_X)\left(\mu_Y + \rho\tfrac{\sigma_Y}{\sigma_X}(X-\mu_X)\right)\right].

Expand and use E[X−μX]=0E[X-\mu_X]=0 and E[(X−μX)2]=σX2E[(X-\mu_X)^2] = \sigma_X^2:

E[(X−μX)Y]=μY⋅0+ρσYσX⋅σX2=ρ σXσY.E[(X-\mu_X)Y] = \mu_Y\cdot 0 + \rho\frac{\sigma_Y}{\sigma_X}\cdot \sigma_X^2 = \rho\,\sigma_X\sigma_Y.

But the left side equals Cov(X,Y)\mathrm{Cov}(X,Y) (since E[(X−μX)Y]=E[(X−μX)(Y−μY)]+μYE[X−μX]=Cov(X,Y)+0E[(X-\mu_X)Y] = E[(X-\mu_X)(Y-\mu_Y)] + \mu_Y E[X-\mu_X] = \mathrm{Cov}(X,Y) + 0). Hence Cov(X,Y)=ρσXσY\mathrm{Cov}(X,Y) = \rho\sigma_X\sigma_Y, and dividing by σXσY\sigma_X\sigma_Y (both strictly positive) gives Corr(X,Y)=ρ\mathrm{Corr}(X,Y) = \rho, as claimed. (This computation also requires E[X],E[Y]E[X],E[Y] finite, which holds since X,YX,Y are normal and hence have finite moments of every order.)

(4) Independence iff ρ=0\rho=0. (⇐\Leftarrow) Suppose ρ=0\rho = 0. Then the joint density from the definition becomes

fX,Y(x,y)=12πσXσYexp⁡(−(x−μX)22σX2−(y−μY)22σY2)=12πσXe−(x−μX)2/2σX2⏟fX(x)⋅12πσYe−(y−μY)2/2σY2⏟fY(y),f_{X,Y}(x,y) = \frac{1}{2\pi\sigma_X\sigma_Y}\exp\left(-\frac{(x-\mu_X)^2}{2\sigma_X^2} - \frac{(y-\mu_Y)^2}{2\sigma_Y^2}\right) = \underbrace{\frac{1}{\sqrt{2\pi}\sigma_X}e^{-(x-\mu_X)^2/2\sigma_X^2}}_{f_X(x)}\cdot \underbrace{\frac{1}{\sqrt{2\pi}\sigma_Y}e^{-(y-\mu_Y)^2/2\sigma_Y^2}}_{f_Y(y)},

which factors as a product of the two marginal densities established in (1). A joint density that factors into (a function of xx alone) times (a function of yy alone), each of which is itself a valid marginal density, is precisely the definition of independence for continuous random variables: for any Borel sets A,B⊆RA,B\subseteq\mathbb{R},

P(X∈A,Y∈B)=∫A∫BfX(x)fY(y) dy dx=(∫AfX)(∫BfY)=P(X∈A)P(Y∈B).P(X\in A, Y\in B) = \int_A\int_B f_X(x)f_Y(y)\,dy\,dx = \left(\int_A f_X\right)\left(\int_B f_Y\right) = P(X\in A)P(Y\in B).

So X⊥YX\perp Y. (⇒\Rightarrow) Suppose XX and YY are independent. Independent random variables with finite variance are uncorrelated — this is a standard fact from the theory of Covariance and Correlation: independence gives E[XY]=E[X]E[Y]E[XY]=E[X]E[Y] (since for independent X,YX,Y, E[g(X)h(Y)]=E[g(X)]E[h(Y)]E[g(X)h(Y)] = E[g(X)]E[h(Y)] for any functions with finite expectation, applying this with g(x)=x,h(y)=yg(x)=x,h(y)=y), hence

Cov(X,Y)=E[XY]−E[X]E[Y]=0.\mathrm{Cov}(X,Y) = E[XY]-E[X]E[Y] = 0.

By part (3), Cov(X,Y)=ρσXσY\mathrm{Cov}(X,Y) = \rho\sigma_X\sigma_Y, and since σX,σY>0\sigma_X,\sigma_Y>0, we conclude ρ=0\rho = 0. Both directions are established, so X⊥Y  ⟺  ρ=0X\perp Y \iff \rho=0. ■\blacksquare

∎

The technique throughout is completing the square in the joint exponent to force a factorization (∗)(\ast), combined with the tower property of conditional expectation for part (3); no result depending on this theorem was used, so the proof is non-circular.

Worked examples

Example 1 (Asymmetric parameters — computing a conditional probability). Two components of a signal, XX (in volts) and YY (in volts), are jointly normal with

μX=2,μY=−1,σX2=9,σY2=4,ρ=−0.6.\mu_X = 2,\quad \mu_Y = -1,\quad \sigma_X^2 = 9,\quad \sigma_Y^2 = 4,\quad \rho = -0.6.

So σX=3\sigma_X = 3, σY=2\sigma_Y = 2. Suppose we observe X=5X = 5. Find P(Y>0∣X=5)P(Y > 0 \mid X=5). By part (2) of the theorem,

Y∣X=5 ∼ N ⁣(μY+ρσYσX(5−μX), σY2(1−ρ2)).Y\mid X=5 \ \sim\ N\!\left(\mu_Y + \rho\frac{\sigma_Y}{\sigma_X}(5-\mu_X),\ \sigma_Y^2(1-\rho^2)\right).

Compute the conditional mean:

ρσYσX(5−2)=(−0.6)⋅23⋅3=(−0.6)(2)=−1.2,\rho\frac{\sigma_Y}{\sigma_X}(5-2) = (-0.6)\cdot\frac{2}{3}\cdot 3 = (-0.6)(2) = -1.2,

so the conditional mean is −1+(−1.2)=−2.2-1 + (-1.2) = -2.2. Compute the conditional variance:

σY2(1−ρ2)=4(1−0.36)=4(0.64)=2.56,\sigma_Y^2(1-\rho^2) = 4(1-0.36) = 4(0.64) = 2.56,

so the conditional standard deviation is 2.56=1.6\sqrt{2.56} = 1.6. Thus Y∣X=5∼N(−2.2, 2.56)Y\mid X=5 \sim N(-2.2,\, 2.56), and

P(Y>0∣X=5)=P(Z>0−(−2.2)1.6)=P(Z>1.375),P(Y>0\mid X=5) = P\left(Z > \frac{0-(-2.2)}{1.6}\right) = P(Z > 1.375),

where ZZ is standard normal. From standard normal tables, P(Z>1.375)≈0.0846P(Z>1.375) \approx 0.0846. Notice this is much smaller than the unconditional probability P(Y>0)=P(Z>(0−(−1))/2)=P(Z>0.5)≈0.3085P(Y>0) = P(Z > (0-(-1))/2) = P(Z>0.5)\approx 0.3085: observing an unusually high XX, combined with the negative correlation, pulls the predicted YY down substantially, making Y>0Y>0 far less likely.

Example 2 (Verifying the correlation from a linear model, and checking consistency). Suppose test scores satisfy X∼N(70,100)X \sim N(70, 100) (mean 70, variance 100, so σX=10\sigma_X=10) and

Y=15+0.8X+ε,ε∼N(0,36) independent of X,Y = 15 + 0.8X + \varepsilon, \qquad \varepsilon \sim N(0, 36) \text{ independent of } X,

where YY represents a second test score. We claim (X,Y)(X,Y) is jointly (bivariate) normal, and we compute all five parameters. Joint normality. For any constants a,ba,b not both zero,

aX+bY=aX+b(15+0.8X+ε)=(a+0.8b)X+bε+15b.aX + bY = aX + b(15+0.8X+\varepsilon) = (a+0.8b)X + b\varepsilon + 15b.

Since XX and ε\varepsilon are independent normal (or degenerate) random variables, any linear combination (a+0.8b)X+bε(a+0.8b)X + b\varepsilon of independent normals is again normal (a fact from Sums of Random Variables and Convolution: the sum of independent normals is normal, and a constant multiple of a normal is normal), and adding the constant 15b15b preserves normality. Hence aX+bYaX+bY is normal for every a,ba,b, so by the general definition, (X,Y)(X,Y) is jointly normal. Parameters. μX=70\mu_X = 70, σX2=100\sigma_X^2=100. For YY:

μY=E[15+0.8X+ε]=15+0.8(70)+0=15+56=71.\mu_Y = E[15+0.8X+\varepsilon] = 15+0.8(70)+0 = 15+56 = 71.
Var(Y)=Var(0.8X)+Var(ε)=0.64(100)+36=64+36=100,\mathrm{Var}(Y) = \mathrm{Var}(0.8X) + \mathrm{Var}(\varepsilon) = 0.64(100) + 36 = 64+36=100,

using independence of X,εX,\varepsilon to add variances. So σY=10\sigma_Y = 10. For the covariance,

Cov(X,Y)=Cov(X, 15+0.8X+ε)=0.8 Cov(X,X)+Cov(X,ε)=0.8(100)+0=80,\mathrm{Cov}(X,Y) = \mathrm{Cov}(X,\, 15+0.8X+\varepsilon) = 0.8\,\mathrm{Cov}(X,X) + \mathrm{Cov}(X,\varepsilon) = 0.8(100) + 0 = 80,

so

ρ=Cov(X,Y)σXσY=8010⋅10=0.8.\rho = \frac{\mathrm{Cov}(X,Y)}{\sigma_X\sigma_Y} = \frac{80}{10\cdot 10} = 0.8.

Consistency check via the theorem. The theorem's formula for the conditional mean predicts

E[Y∣X=x]=μY+ρσYσX(x−μX)=71+0.8⋅1010(x−70)=71+0.8(x−70)=15+0.8x,E[Y\mid X=x] = \mu_Y + \rho\frac{\sigma_Y}{\sigma_X}(x-\mu_X) = 71 + 0.8\cdot\frac{10}{10}(x-70) = 71+0.8(x-70) = 15+0.8x,

which exactly matches E[Y∣X=x]=15+0.8x+E[ε]=15+0.8xE[Y\mid X=x] = 15+0.8x+E[\varepsilon]=15+0.8x computed directly from the linear model — confirming the theorem's regression-line formula against an independent derivation. Likewise the theorem predicts conditional variance σY2(1−ρ2)=100(1−0.64)=36\sigma_Y^2(1-\rho^2) = 100(1-0.64)=36, exactly Var(ε)\mathrm{Var}(\varepsilon), as it must be since ε\varepsilon is precisely the "noise" left in YY after regressing on XX.

CounterexampleNormal marginals do not imply joint normality

The independence-iff-uncorrelated theorem requires that (X,Y)(X,Y) be jointly normal — it is not enough that XX and YY each individually be normal. Here is an explicit pair with X,YX,Y each marginally N(0,1)N(0,1), with Corr(X,Y)=0\mathrm{Corr}(X,Y)=0, and yet X,YX,Y are not independent — showing the hypothesis of joint normality (not merely normal marginals) cannot be dropped from the theorem. Let X∼N(0,1)X \sim N(0,1), and define

Y={Xif ∣X∣≤c−Xif ∣X∣>cY = \begin{cases} X & \text{if } |X| \le c \\ -X & \text{if } |X| > c\end{cases}

for a fixed constant c>0c>0 to be chosen. This is a deterministic function of XX, so (X,Y)(X,Y) is a well-defined pair on the same probability space as XX. Marginal of YY is N(0,1)N(0,1). For any Borel set AA, symmetric around 00 or not, note that the map x↦y(x)x \mapsto y(x) agrees with xx on [−c,c][-c,c] and with −x-x outside it. Because the standard normal density ϕ\phi is an even function (ϕ(x)=ϕ(−x)\phi(x)=\phi(-x)), for any set BB,

P(Y∈B)=P(X∈B,∣X∣≤c)+P(−X∈B,∣X∣>c).P(Y\in B) = P(X\in B, |X|\le c) + P(-X\in B, |X|>c).

The second term equals P(X∈−B,∣X∣>c)P(X\in -B, |X|>c) by relabeling (−X∈B  ⟺  X∈−B-X\in B \iff X\in -B), and since ∣X∣>c|X|>c is a symmetric event (ϕ\phi even) and −B-B has the same ϕ\phi-measure structure as BB reflected, a direct computation using evenness of ϕ\phi shows this equals P(X∈B,∣X∣>c)P(X\in B,|X|>c). Hence

P(Y∈B)=P(X∈B,∣X∣≤c)+P(X∈B,∣X∣>c)=P(X∈B),P(Y\in B) = P(X\in B,|X|\le c)+P(X\in B,|X|>c) = P(X\in B),

so Y∼N(0,1)Y\sim N(0,1), matching XX's marginal exactly. Zero correlation, for the right choice of cc. We have Cov(X,Y)=E[XY]\mathrm{Cov}(X,Y)=E[XY] (both means are 00), and

E[XY]=E[X21∣X∣≤c]−E[X21∣X∣>c]=E[X2]−2E[X21∣X∣>c]=1−2E[X21∣X∣>c].E[XY] = E[X^2 \mathbf 1_{|X|\le c}] - E[X^2\mathbf 1_{|X|>c}] = E[X^2] - 2E[X^2\mathbf 1_{|X|>c}] = 1 - 2E[X^2\mathbf 1_{|X|>c}].

As cc ranges over (0,∞)(0,\infty), E[X21∣X∣>c]E[X^2\mathbf{1}_{|X|>c}] decreases continuously from E[X2]=1E[X^2]=1 (at c=0c=0) to 00 (as c→∞c\to\infty), so by the intermediate value theorem there exists c∗>0c^*>0 with E[X21∣X∣>c∗]=1/2E[X^2\mathbf{1}_{|X|>c^*}] = 1/2, giving E[XY]=0E[XY]=0, i.e. Corr(X,Y)=0\mathrm{Corr}(X,Y)=0. But X,YX,Y are not independent. Indeed ∣Y∣=∣X∣|Y| = |X| always, so Y2=X2Y^2 = X^2 almost surely — a deterministic, highly dependent relationship. For instance,

P(Y>c∗+1∣X>c∗+1)=P(−X>c∗+1∣X>c∗+1)=0,P(Y > c^*+1 \mid X > c^*+1) = P(-X>c^*+1\mid X>c^*+1) = 0,

(since X>c∗+1>c∗X>c^*+1>c^* forces Y=−X<0Y=-X<0), whereas P(Y>c∗+1)>0P(Y>c^*+1) > 0. So P(Y>c∗+1∣X>c∗+1)≠P(Y>c∗+1)P(Y>c^*+1\mid X>c^*+1)\ne P(Y>c^*+1), which is exactly a failure of independence. Why joint normality fails here. Consider the linear combination X+YX+Y. On the event ∣X∣≤c∗|X|\le c^*, X+Y=2XX+Y = 2X; on ∣X∣>c∗|X|>c^*, X+Y=0X+Y = 0. So X+YX+Y has a point mass at 00 (probability P(∣X∣>c∗)>0P(|X|>c^*)>0) combined with a continuous part on {∣X∣≤c∗}\{|X|\le c^*\} — this is not a normal distribution (normal distributions have no atoms). Hence (X,Y)(X,Y) is not jointly normal, even though each marginal is N(0,1)N(0,1). This is precisely why the theorem's hypothesis must be "jointly normal," not "each coordinate normal": the equivalence independence   ⟺  ρ=0\iff \rho=0 genuinely requires joint (not merely marginal) normality.

Scope, edge cases & common traps

SituationWhat happensCommon error
ρ=0\rho = 0, jointly normalX⊥YX\perp Y (Theorem part 4)Assuming this without checking joint normality
ρ=0\rho = 0, normal marginals but not jointly normalX,YX,Y can be dependent (see counterexample)Concluding independence from uncorrelated normal-looking marginals
ρ=±1\rho = \pm 1Distribution is degenerate: Y=μY±σYσX(X−μX)Y = \mu_Y \pm \frac{\sigma_Y}{\sigma_X}(X-\mu_X) a.s., no density on R2\mathbb R^2Plugging ρ=±1\rho=\pm1 into the density formula (division by 1−ρ2=0\sqrt{1-\rho^2}=0)
Non-linear transforms of jointly normal variablesNeed not be normal (e.g. X2X^2)Assuming normality is preserved under all functions, not just linear ones
Conditional variance σY2(1−ρ2)\sigma_Y^2(1-\rho^2)Does not depend on the conditioning value xxBelieving the spread of Y∣X=xY\mid X=x narrows near μX\mu_X and widens far away
Sums aX+bYaX+bYAlways normal when (X,Y)(X,Y) jointly normalAssuming this holds whenever X,YX,Y are separately normal

The mathematician behind it

Origins · 1 minCarl Friedrich Gauss and how this was discovered
CF
Carl Friedrich Gauss
1777–1855 · German mathematician, astronomer, and physicist

Gauss developed the normal law of errors while working on astronomical observations and geodesy, formalizing it in Theoria Motus Corporum Coelestium (1809) as the distribution governing measurement error under the method of least squares. The bivariate and multivariate extensions, needed to handle several correlated measurements simultaneously (such as latitude and longitude errors in a survey), emerged from the broader 19th-century development of the theory of errors, with the correlation coefficient itself crystallized later by Francis Galton and Karl Pearson in the context of biometric regression — Galton's studies of heights of parents and children are the classical motivating example for the conditional-mean (regression-line) formula proved above.

History
- 1733 — Abraham de Moivre derives the normal density as a limiting approximation to the binomial.
- 1809 — Gauss formalizes the law of errors and least-squares estimation in Theoria Motus.
- 1885 — Francis Galton introduces regression toward the mean, studying joint distributions of parent and offspring heights.
- 1896 — Karl Pearson formalizes the correlation coefficient and the bivariate normal surface in his biometric work.
- 1922–1930s — R. A. Fisher and others place the multivariate normal at the foundation of modern mathematical statistics (regression, MANOVA, discriminant analysis).
Why does ρ=±1\rho=\pm1 have to be excluded from the density formula?

When ρ=±1\rho = \pm 1, the quadratic form in the exponent becomes a perfect square, (u∓v)2(u \mp v)^2 after standardizing, meaning the joint distribution places all its probability mass on the line y=μY±σYσX(x−μX)y = \mu_Y \pm \frac{\sigma_Y}{\sigma_X}(x-\mu_X) rather than spreading over the whole plane. Such a distribution is singular with respect to two-dimensional Lebesgue measure — it has no density on R2\mathbb{R}^2, only a one-dimensional density along the line. The formula in the definition literally divides by 1−ρ2=0\sqrt{1-\rho^2}=0 at ρ=±1\rho=\pm1, confirming it is undefined there. This case is still "jointly normal" under the linear-combination definition, just degenerate.

Is it enough for XX and YY to individually be normal for the independence-iff-uncorrelated theorem to apply?

No. The theorem requires joint normality of the pair (X,Y)(X,Y), meaning every linear combination aX+bYaX+bY is normal — a strictly stronger condition than each marginal separately being normal. The counterexample in this article exhibits X,YX,Y each exactly N(0,1)N(0,1), uncorrelated, yet dependent (in fact Y2=X2Y^2=X^2 always), because their joint distribution is not bivariate normal. Always check joint normality, not just marginal shapes, before invoking the equivalence.

How is the conditional distribution Y∣X=xY\mid X=x actually derived, intuitively?

The joint density's exponent is a quadratic form in (x,y)(x,y). Completing the square in yy (holding xx fixed) splits the joint density into a factor depending only on xx (which becomes the marginal density of XX) times a factor that, as a function of yy for fixed xx, is itself exactly a normal density with mean linear in xx and a fixed variance. Dividing the joint density by the marginal density of XX then isolates that second factor as the conditional density — this is the completing-the-square technique used in the proof above.

Why is the correlation coefficient in the density formula exactly equal to Pearson's correlation coefficient?

This is proved directly in part (3) of the theorem: using the conditional mean formula from part (2) and the tower property of conditional expectation, one computes Cov(X,Y)=ρσXσY\mathrm{Cov}(X,Y) = \rho\sigma_X\sigma_Y exactly, so dividing by σXσY\sigma_X\sigma_Y recovers ρ\rho. The parameter labeled "ρ\rho" in the density is not an arbitrary shape parameter — it is forced, by the internal structure of the distribution, to coincide with the usual covariance-based correlation coefficient.

Does the bivariate normal generalize to more than two variables?

Yes — the multivariate normal distribution in nn dimensions is defined analogously, either via an explicit density involving a mean vector and a positive-definite covariance matrix, or (more robustly, covering degenerate cases) by requiring every linear combination of the coordinates to be univariate normal. All the qualitative facts here generalize: marginals of any subset of coordinates are (multivariate) normal, conditional distributions given other coordinates are normal with linear conditional means, and, crucially, pairwise (or full) uncorrelatedness among jointly normal coordinates implies full independence.

What role does the bivariate normal play in the Central Limit Theorem?

The Central Limit Theorem shows that suitably normalized sums of many independent (or weakly dependent) random contributions converge to a normal distribution; when one tracks two correlated sums simultaneously (for instance, sums of paired observations), their joint limiting distribution is bivariate normal, with the limiting correlation determined by the covariance structure of the summands. The two-dimensional theory developed here — completing the square, deriving conditionals, and the independence-iff-uncorrelated result — is the exact template used to state and prove the multivariate Central Limit Theorem.

Can two normal random variables with nonzero correlation ever be independent?

No, and this follows immediately from part (4) of the theorem (for jointly normal pairs): independence is equivalent to ρ=0\rho=0, so if ρ≠0\rho \ne 0 then XX and YY cannot be independent. Intuitively, a nonzero ρ\rho means knowing XX shifts the conditional mean of YY away from its unconditional mean (see part (2)), which directly contradicts the definition of independence, under which conditioning should never change the distribution of YY.

Before this

Where this leads