A forecast of an event and the payoff attached to that event answer different questions. Let be a real random variable with CDF and let be its payoff. We use for the transformation, reserving for the CDF as in the shared notation. An ordinary finite expected payoff requires .
The frequency of gains does not determine their mean¶
Consider this finite payoff table, in arbitrary payoff units:
| Outcome probability | Payoff A | Payoff B |
|---|---|---|
| 0.98 | 1 | -1 |
| 0.02 | -80 | 80 |
Direct summation gives and . The higher probability of a gain belongs to the lower expected payoff. Both payoffs are bounded; fat tails are unnecessary for this distinction. More generally, a payoff equal to with probability and to with probability has mean .
This is a one-period expectation calculation. A repeated strategy with a finite resource constraint needs a model of ruin as well.
Curvature and Jensen’s inequality¶
Suppose takes values in an open interval , its mean belongs to , and . If is differentiable and convex, and , then
We prove this differentiable case. Convexity gives the supporting-line inequality for every : the secant slopes on either side of bracket . Taking expectations of this integrable inequality proves the claim. Applying it to reverses the inequality for concave .
For a symmetric two-point perturbation , each with probability , the mean remains . With and ,
For the quadratic payoff , the gain in expectation is exactly ; for , it is . These are changes relative to the constant input . Comparing two arbitrary distributions requires a specified ordering of their spreads; variance alone does not order expectations of every convex function.
For example, compare the symmetric law at with the law assigning probability to zero and to each of . Both have mean zero and variance one. Their expectations of are 1 and , whereas their expectations of are 1 and 4. Both functions are convex, so neither law gives the larger expectation for every convex payoff.
A transformation changes the tail and its moment requirements¶
For exact Pareto with , , and a power payoff with , direct inversion of the event gives
The payoff exponent is . Its mean is finite exactly when , by the Pareto moment proof. For example, gives a finite mean for and an infinite mean for . The finite-expectation version of Jensen above cannot be applied to that quadratic payoff with both sides finite.
If instead on with , the payoff lies in , so for every real . For Pareto with , , and , integration of the survival gives
This cap bounds the realized payoff and changes its mean. It does not estimate the uncapped mean. The inference note shows why bounded payoffs have a different contamination sensitivity.
Convexity alone does not bound downside: has but tends to as . An explicit bound such as , for fixed and , is a separate property. Repetition, costs and the distribution of still matter.
Worked calculation and sources¶
Use finite_payoff_mean.
from xmath.incerto.lecture_risk import finite_payoff_mean
probabilities = [0.98, 0.02]
print(f"A: {finite_payoff_mean(probabilities, [1, -80]):.4g}")
print(f"B: {finite_payoff_mean(probabilities, [-1, 80]):.4g}")
print(f"Convex gap: {finite_payoff_mean([0.5, 0.5], [2**2, 6**2]) - 4**2:.4g}")Output
A: -0.62
B: 0.62
Convex gap: 4A’s higher gain frequency does not imply a higher expected payoff.
The lower panel of the shared figure
plots and its negative for
. Reproduce the figure and finite payoff table with
uv run python demos/incerto/lecture_risk.py. These are exact finite
sums on 121 spread values, without simulation or external data.
The source context is Taleb (2025), ch. 3, §3.4.1, pp. 41–43, and §3.10, pp. 60–63. The chapter motivates distinguishing state from exposure. The finite-table calculation, differentiable Jensen argument, power-tail transformation and capped-mean calculation are proved here.
- Taleb, N. N. (2025). Statistical Consequences of Fat Tails (3rd ed.). https://arxiv.org/abs/2001.10488v4