Multidimensional Mean-Preserving Spreads

• The paper establishes a finite-support decomposition theorem showing that any mean-preserving contraction of an n-point atomic prior can be represented as a mixture of simpler contractions with support at most n.
• It employs a stochastic-matrix representation to collapse masses to their barycenters, illustrating the support-reduction principle within convex-order comparisons.
• The framework informs linear and competitive persuasion models by reducing the analysis of complex informational structures to extreme points with controlled support complexity.

Searching arXiv for the cited paper to ground the article in the primary source. arXiv search query: (Whitmeyer et al., 2019) Multidimensional mean-preserving spreads are naturally situated within convex-order comparisons of probability measures, but the most directly relevant result in the present context is formulated for one-dimensional, purely atomic laws. "Mixtures of Mean-Preserving Contractions" (Whitmeyer et al., 2019) studies mean-preserving contractions on $X=\mathbb R$ and establishes a finite-support decomposition theorem: if a purely atomic prior $P$ has support on $n$ points, then any mean-preserving contraction of $P$ can be represented as a mixture of simpler contractions, each with support on at most $n$ points. Although this is not a multivariate theorem on $\mathbb R^d$, it isolates a support-compression principle, a stochastic-matrix representation, and a convex-order duality that are conceptually informative for multidimensional and generalized formulations.

1. Order-theoretic setting

The paper is written in terms of mean-preserving contractions (mpcs) rather than mean-preserving spreads. In the standard Rothschild–Stiglitz language, a mean-preserving spread is the opposite order relation: if $Q$ is an mpc of $P$, then $P$ is a mean-preserving spread of $Q$, or equivalently $P$0 is less risky than $P$1 in convex order. The contraction interpretation is described as collapsing portions of mass to their barycenters, whereas the spread interpretation is the opposite operation, in which mass is spread out.

In convex-order terms, the relation is

$P$2

In martingale language, if $P$3 is a contraction of $P$4, there exists a coupling $P$5 with laws

$P$6

Reversing the roles yields the spread formulation

$P$7

The paper is not explicitly multidimensional. Its measures belong to $P$8, with $P$9 finitely supported and $n$0 purely atomic or weak limits thereof. Its relevance to multidimensional mean-preserving spreads is therefore indirect. It is best understood as a result on finite-support mean-preserving transformations represented by stochastic matrices, together with a decomposition principle that depends on atomic convex structure rather than on calculus specific to $n$1.

2. Atomic formulation and basic definitions

The formal setup is

$n$2

with $n$3 the Borel $n$4-algebra and $n$5 the set of Borel probability measures on $n$6. A purely atomic probability measure $n$7 with support on $n$8 points is written

$n$9

with masses $P$0, $P$1, and, without loss of generality,

$P$2

The notation

$P$3

is used. For a second purely atomic measure $P$4 with support on $P$5 points,

$P$6

with masses $P$7, $P$8, and

$P$9

A Simple Mean-Preserving Contraction (SMPC) of $n$0 is defined by the existence of a non-negative row-stochastic $n$1 matrix $n$2 such that

$n$3

and

$n$4

The set of all SMPCs of $n$5 is denoted $n$6 (Whitmeyer et al., 2019).

If $n$7, row $n$8 specifies how the mass $n$9 at atom $\mathbb R^d$0 is distributed among the output atoms $\mathbb R^d$1. Row-stochasticity means

$\mathbb R^d$2

The identity $\mathbb R^d$3 states that the mass arriving at $\mathbb R^d$4 is $\mathbb R^d$5, while

$\mathbb R^d$6

states that the first moment arriving at $\mathbb R^d$7 is $\mathbb R^d$8. Whenever $\mathbb R^d$9,

$Q$0

so each output atom is the barycenter of the mass assigned to it. This is the paper’s exact “collapse to barycenters” interpretation.

A general Mean-Preserving Contraction (MPC) is then defined by weak closure: $Q$1 Thus

$Q$2

The paper does not give a separate formal definition of mean-preserving spread, but it explicitly presents it as the equivalent and opposite notion. In standard notation,

$Q$3

subject to equality of means.

3. Mixtures, support size, and the principal decomposition theorem

Mixtures are defined at the level of the associated Markov matrices. If $Q$4 are SMPCs of $Q$5, then

$Q$6

if and only if

$Q$7

after inserting zero-columns in $Q$8 and $Q$9 for atoms absent from $P$0 or $P$1, while preserving within-column ratios. In this formulation, “mixture” is not merely an arbitrary convex combination of measures; it is a convex combination compatible with the SMPC matrix representation.

The support count is central. If $P$2 has support size $P$3 and $P$4 has support size $P$5, the main theorem states that support complexity beyond $P$6 is reducible. The principal result is:

$P$7

Let $P$8 be any SMPC of $P$9 with support on $P$0 points, $P$1. Then $P$2 is the convex combination of two purely atomic probability measures $P$3 and $P$4, with

$P$5

each with support on at most $P$6 points. Moreover, $P$7 and $P$8 are unique.

The paper’s main corollary extends this reduction to all mean-preserving contractions: $P$9 Any $Q$0 is a mixture of SMPCs with support on at most $Q$1 points.

The significance of the theorem, viewed through the dual spread relation, is structural. An apparently complicated mean-preserving transformation with many output atoms is not irreducible. It belongs to the convex hull of simpler transformations whose support size is bounded by the support size of the original law. This identifies support size of the source distribution, rather than ambient Euclidean dimension, as the controlling parameter in the theorem’s decomposition logic.

4. Proof architecture and the support-compression mechanism

The proof operates directly on the $Q$2 Markov matrix $Q$3 associated with an SMPC $Q$4. Writing the columns of $Q$5 as vectors

$Q$6

there are $Q$7 vectors in $Q$8, hence linear dependence: $Q$9 for some nonzero coefficients $P$00.

Because the columns are nonnegative, the coefficients must include both positive and negative signs. After reindexing,

$P$01

Then one selects the maximal coefficients on each side,

$P$02

The proof’s central device is the zeroing of one of these maximal-coefficient columns. If $P$03 is zeroed, it is rewritten using the dependence relation, and a new matrix $P$04 is defined by scaling the remaining columns: $P$05 Because $P$06 is maximal on its side, the coefficients $P$07 lie in $P$08. The row sums remain $P$09, all entries remain in $P$10, and $P$11 is again a valid row-stochastic nonnegative matrix. Hence it defines another SMPC $P$12 with one fewer nonzero column. The same construction applied to $P$13 yields $P$14 and $P$15, and then

$P$16

for some $P$17, which implies

$P$18

The support bound follows immediately: each zeroing removes one nonzero column, so an $P$19 matrix becomes one with at most $P$20 nonzero columns. The uniqueness of $P$21 and $P$22 is proved by showing that no third independently zeroable column can appear unless it reproduces one of the same two outcomes (Whitmeyer et al., 2019).

The proof is presented as linear algebra on supports and convex geometry of stochastic matrices. It is not formulated via Strassen’s theorem, explicit martingale couplings, Choquet theory, or Carathéodory’s theorem, even though the overall reduction has an evident convex-analytic character.

5. Interpretation for multidimensional mean-preserving spreads

The paper does not furnish a multivariate theorem for distributions on $P$23. Its state space is one-dimensional, and its proof relies on a matrix representation specialized to scalar atomic supports. Accordingly, it does not establish that any multidimensional mean-preserving spread admits an analogous decomposition with the same support bound $P$24.

Its relevance to multidimensional mean-preserving spreads is conceptual rather than direct. The theorem suggests that when a finitely supported prior has $P$25 support points, a contraction producing more than $P$26 posterior means is not fundamentally new: it is representable as a mixture of simpler contractions, each involving at most $P$27 support points. Reversing the order relation gives the corresponding intuition for spreads. This suggests that complicated spread–contraction relations may often be analyzed through mixtures of simpler atomic transformations with controlled support complexity.

A plausible implication is that finite-dimensional convex decomposition, rather than ambient-space geometry alone, is central to understanding generalized spread phenomena. The paper’s “dimension” is the number of support points of the source measure, not the Euclidean dimension of the state space. That distinction is especially important in multidimensional discussions, where support complexity and ambient dimension need not coincide.

At the same time, the limitations are explicit. New work would be required for a full multidimensional theory, because barycenters become vector-valued, convex-order structure in higher dimensions is subtler, and the present proof depends on a stochastic-matrix argument tailored to the one-dimensional atomic case.

6. Example, applications, and connections

The paper includes a concrete example with a 3-point prior and a 4-point contraction. The prior is

$P$28

A 4-point SMPC is

$P$29

with Markov matrix

$P$30

The theorem decomposes this $P$31 into two 3-point SMPCs $P$32 and $P$33 such that

$P$34

This example exhibits the support-reduction mechanism in explicit finite form.

The principal application is to linear persuasion. When sender and receiver utilities depend only on posterior means, the sender’s choice of information structure can be reduced to

$P$35

Because $P$36 is convex and compact, Bauer’s Maximum Principle implies that a linear objective attains its maximum at an extreme point of $P$37. The decomposition theorem yields a necessary condition for extremality: support size at most $P$38. The paper states the resulting proposition as follows: if the prior $P$39 has support on $P$40 points, an optimal signal requires at most $P$41 messages.

The paper also treats competitive persuasion. Since each pure strategy corresponds to an mpc of the prior, the decomposition result implies that profitable deviations need only be checked among mpcs with support on at most $P$42 points, and that an equilibrium continuous distribution over posterior means can be implemented as a mixed strategy over support-$P$43 mpcs. These applications concern information structures and decision under uncertainty rather than a direct multivariate risk-comparison theorem (Whitmeyer et al., 2019).

The broader connections identified in the paper include Rothschild–Stiglitz, majorization, statistical experiments, Blackwell comparisons, Strassen, and Hill and Joe’s notion of fusion. In the one-dimensional finite-first-moment setting discussed there, fusion is identified with mean-preserving contraction. The set of mpcs of a discrete measure is described as compact and convex, so by Krein–Milman it is the closed convex hull of its extreme points. Within that literature, the paper contributes a finite-support convex-analytic representation result: every contraction of an $P$44-atom prior is a mixture of simpler contractions supported on at most $P$45 points.