Many-to-One Transformations of Discrete Random Variables

Find the PMF and expected value of Y=g(X)Y = g(X) for a discrete random variable XX when gg is many-to-one. Apply the formula P(Y=y)=x:g(x)=yP(X=x)P(Y=y) = \sum_{x:\,g(x)=y} P(X=x) and the law of the unconscious statistician E[g(X)]=xg(x)P(X=x)E[g(X)] = \sum_x g(x)P(X=x).

Step 1 of 119%

Tutorial

Introduction

For a one-to-one transformation Y=g(X),Y = g(X), each value of YY corresponds to exactly one value of X,X, so P(Y=y)=P(X=g1(y)).P(Y=y) = P(X = g^{-1}(y)).

A transformation is many-to-one when two or more values of XX map to the same value of Y.Y. In this case, P(Y=y)P(Y=y) must accumulate the probability from every xx that lands on yy:

P(Y=y)=x:g(x)=yP(X=x).P(Y = y) = \sum_{x \,:\, g(x) = y} P(X = x).

For example, suppose XX has PMF

x101P(X=x)0.30.50.2\begin{array}{|c|c|c|c|}\hline x & -1 & 0 & 1 \\ \hline P(X=x) & 0.3 & 0.5 & 0.2 \\ \hline \end{array}

and let Y=X2.Y = X^2. The function xx2x \mapsto x^2 sends both 1-1 and 11 to 1,1, so

P(Y=0)=P(X=0)=0.5,P(Y=1)=P(X=1)+P(X=1)=0.3+0.2=0.5.\begin{align*} P(Y=0) &= P(X=0) = 0.5, \\ P(Y=1) &= P(X=-1) + P(X=1) = 0.3 + 0.2 = 0.5. \end{align*}

The PMF of YY is therefore

y01P(Y=y)0.50.5\begin{array}{|c|c|c|}\hline y & 0 & 1 \\ \hline P(Y=y) & 0.5 & 0.5 \\ \hline \end{array}
navigate · Enter open · Esc close · ⌘K/Ctrl K toggle