A moment [generating function](/page/Generating%20Function) answers a practical question: how much of a distribution can be recovered from the exponential averages $\mathbb E[e^{tX}]$? Ordinary moments $\mathbb E[X^n]$ are useful, but they arrive one at a time and can be hard to assemble into a recognizable distribution. The exponential function packages them into a single analytic object when the expectation exists near $0$, and that package turns sums of independent random variables into products.

The central tension is that this package is powerful only when it exists on a genuine interval around $0$. Some random variables have every ordinary moment but no moment generating function away from $0$; others have a moment generating function on one side but not the other. The theory is therefore not just about a formula. It is about the domain of finiteness, the analytic information carried near the origin, and the way independence turns convolution into multiplication.

[example: A Random Variable with No Positive Exponential Moment] Let $X \sim \operatorname{Exp}(\lambda)$ with $\lambda>0$, so its density is $f_X(x)=\lambda e^{-\lambda x}$ on $[0,\infty)$. Throughout this example, $d\mathcal L^1(x)$ means integration with respect to one-dimensional [Lebesgue measure](/page/Lebesgue%20Measure) on the real line. We write $M_X(t):=\mathbb E[e^{tX}]$ whenever this expectation is finite, and $D_X:=\{t\in\mathbb R:\mathbb E[e^{tX}]<\infty\}$ for the set of such parameters. For $t \in \mathbb R$, the expectation formula for a [random variable](/page/Random%20Variable) with density gives \begin{align*} \mathbb E[e^{tX}]=\int_0^\infty e^{tx}\lambda e^{-\lambda x}\,d\mathcal L^1(x). \end{align*} Since $e^{tx}e^{-\lambda x}=e^{(t-\lambda)x}=e^{-(\lambda-t)x}$, this becomes \begin{align*} \mathbb E[e^{tX}]=\lambda\int_0^\infty e^{-(\lambda-t)x}\,d\mathcal L^1(x). \end{align*} If $t<\lambda$, then $\lambda-t>0$, and for each $R>0$, \begin{align*} \lambda\int_0^R e^{-(\lambda-t)x}\,d\mathcal L^1(x)=\lambda\left[\frac{-e^{-(\lambda-t)x}}{\lambda-t}\right]_{0}^{R}. \end{align*} Evaluating the endpoints gives \begin{align*} \lambda\left[\frac{-e^{-(\lambda-t)x}}{\lambda-t}\right]_{0}^{R}=\frac{\lambda}{\lambda-t}\left(1-e^{-(\lambda-t)R}\right). \end{align*} Letting $R\to\infty$ and using $e^{-(\lambda-t)R}\to 0$ gives \begin{align*} \mathbb E[e^{tX}]=\frac{\lambda}{\lambda-t}. \end{align*} If $t=\lambda$, then the integrand is $\lambda e^0=\lambda$, so \begin{align*} \lambda\int_0^R 1\,d\mathcal L^1(x)=\lambda R, \end{align*} which tends to $\infty$ as $R\to\infty$. If $t>\lambda$, then $t-\lambda>0$, and \begin{align*} \lambda\int_0^R e^{(t-\lambda)x}\,d\mathcal L^1(x)=\frac{\lambda}{t-\lambda}\left(e^{(t-\lambda)R}-1\right), \end{align*} which also tends to $\infty$ as $R\to\infty$. Hence \begin{align*} D_X=(-\infty,\lambda) \end{align*} and \begin{align*} M_X(t)=\frac{\lambda}{\lambda-t} \end{align*} for $t<\lambda$. This example shows that the formula for $M_X(t)$ is inseparable from its domain: the same expression that is finite near $0$ reaches a boundary at $t=\lambda$, where the positive exponential weight overwhelms the exponential tail of $X$. [/example]

The exponential example already contains the main theme. An mgf is not a decorative transform; it measures the ability of the distribution to absorb exponential weights. Positive $t$ probes the right tail of $X$, negative $t$ probes the left tail, and a neighbourhood of $0$ gives enough two-sided control to unlock uniqueness, moments, and convergence theorems.

## Definition

### The Transform

The ordinary moments of $X$ are coefficients one would expect to see in the expansion of $e^{tX}$. To make that idea legitimate, the transform must remember where the expectation is finite. This prevents the notation $M_X(t)$ from hiding an infinite quantity.

[definition: Moment Generating Function] Let $X: (\Omega, \mathcal F, \mathbb P) \to (\mathbb R, \mathcal B(\mathbb R))$ be a real-valued random variable, and set \begin{align*} D_X := \{t \in \mathbb R : \mathbb E[e^{tX}] < \infty\}. \end{align*} The moment generating function of $X$ is the map \begin{align*} M_X: D_X \to (0,\infty). \end{align*} For $t \in D_X$, it is defined by \begin{align*} M_X(t):=\mathbb E[e^{tX}]. \end{align*} [/definition]

This definition matches the undergraduate convention $M_X(t)=\mathbb E[e^{tX}]$, but it makes the hidden qualifier explicit: the expression is part of the mgf only for those $t \in \mathbb R$ where the expectation is finite.

### Domain of Finiteness

The set $D_X$ always contains $0$, because $e^{0X}=1$. What matters is whether $D_X$ contains more than that single point. Since this set controls which exponential tilts are legitimate, it is useful to name it separately.

[definition: Domain of the Moment Generating Function] Let $X: (\Omega, \mathcal F, \mathbb P) \to (\mathbb R, \mathcal B(\mathbb R))$ be a real-valued random variable. The domain of the moment generating function of $X$ is \begin{align*} D_X := \{t \in \mathbb R : \mathbb E[e^{tX}] < \infty\}. \end{align*} [/definition]

The domain records the exponential weights that the distribution can absorb. A wide domain signals strong tail decay; a one-sided domain signals asymmetry; and the absence of any open interval around $0$ blocks the strongest mgf theorems.

A common habit is to calculate a formula and then forget where it is valid. The basic finite-distribution case shows why bounded random variables create no domain restriction.

[example: Bernoulli Moment Generating Function] Let $X \sim \operatorname{Ber}(p)$ with $p \in [0,1]$, so $\mathbb P(X=0)=1-p$ and $\mathbb P(X=1)=p$. For any $t \in \mathbb R$, the expectation of the function $x \mapsto e^{tx}$ is the finite weighted sum over the two possible values of $X$: \begin{align*} M_X(t)=\mathbb E[e^{tX}]=(1-p)e^{t\cdot 0}+p e^{t\cdot 1}. \end{align*} Since $t\cdot 0=0$, $t\cdot 1=t$, and $e^0=1$, this gives \begin{align*} M_X(t)=(1-p)\cdot 1+pe^t. \end{align*} Therefore \begin{align*} M_X(t)=1-p+pe^t. \end{align*} Both $1-p$ and $p$ are finite constants, and $e^t<\infty$ for every real $t$, so $M_X(t)<\infty$ for every $t \in \mathbb R$. Hence $D_X=\mathbb R$. This example shows why finite-valued random variables are analytically simple: their mgfs are finite sums of exponential functions. [/example]

The transform is especially natural in probability because it reacts well to independence. Before reaching that, we need to understand what the domain looks like and why a small interval around $0$ is a much stronger assumption than mere existence at isolated points.

## Finiteness and Exponential Tails

### Convexity of the Domain

The parameter $t$ is not a formal symbol. It changes the distribution by weighting outcomes according to $e^{tX}$. Large positive values of $X$ are magnified when $t>0$, while large negative values are magnified when $t<0$. Thus the domain of the mgf records two-sided tail information.

The domain is not an arbitrary subset of $\mathbb R$. Convexity is the structural fact that makes the theory stable: if two exponential moments are finite, then all exponential moments between them are finite. This is the first reason the interval around $0$ becomes the natural object.