---
title: Excluding Multiplicities in Mathematics
url: https://www.emergentmind.com/topics/exclude-multiplicities
type: topic
---

# Excluding Multiplicities in Mathematics

“Excluding multiplicities” denotes the imposition, characterization, or verification of zero–one behavior in settings where objects ordinarily appear with nontrivial repetition. Depending on context, this can mean that every monomial occurs with coefficient \(0\) or \(1\) in a polynomial expansion, every irreducible constituent occurs with multiplicity at most \(1\) in a restriction problem, every symplectic reduction is \(0\)-dimensional, or every fiber counted with intrinsic local weights has a fixed total that cannot be recovered by naive set-theoretic counting. The common formal pattern is a passage from raw occurrence to a refined multiplicity datum, followed either by a classification of when all multiplicities are trivial or by a proof that multiplicities are essential and cannot be discarded without loss of invariance [2007.09229] [1612.03843] [2204.05079] [1112.0804].

## 1. Core meanings of multiplicity-freeness

In algebraic combinatorics, multiplicity-free means that an expansion has coefficients in \(\{0,1\}\). For key polynomials, the monomial expansion
\[
\kappa_{\alpha} \;=\; \sum_{\gamma\in{\sf Comp}_n} c_\gamma\,x^\gamma
\]
is multiplicity-free if and only if \(c_\gamma\in\{0,1\}\) for all \(\gamma\); equivalently, every weight occurs with multiplicity \(0\) or \(1\) in the associated type \(A\) Demazure character [2007.09229]. For Schur, skew Schur, and quasisymmetric Schur functions, the analogous notion is \(F\)-multiplicity freeness in the fundamental quasisymmetric basis, again meaning all coefficients lie in \(\{0,1\}\) [1105.4212]. For skew Schur polynomials, multiplicity-free refers to Littlewood–Richardson coefficients \(c^\lambda_{\mu,\nu}\in\{0,1\}\) in the Schur expansion, either in the stable function setting or after specialization to \(n\) variables [2010.14645] [1009.4170].

In representation theory, multiplicity-free and multiplicity one are distinct but related notions. For restrictions of minimal representations to reductive symmetric subgroups, the central invariant is
\[
m_H(\pi,\sigma)=\dim\operatorname{Hom}_H\bigl(\pi\big|_H,\sigma\bigr),
\]
and multiplicity-free means \(m_H(\pi,\sigma)\le 1\) for all \(\sigma\), whereas bounded multiplicity requires only \(\sup_\sigma m_H(\pi,\sigma)<\infty\) [2204.05079]. For classical groups over local fields of positive odd characteristic, the multiplicity one theorems assert
\[
\dim \operatorname{Hom}_{G_n}(\pi,\sigma)\le 1
\]
for the pairs \((GL_{n+1},GL_n)\), \((O_{n+1},O_n)\), \((SO_{n+1},SO_n)\), and \((U_{n+1},U_n)\), so restrictions are multiplicity-free in the strong sense [2010.16112]. By contrast, for the restriction of genuine representations of \(\widetilde{\mathrm{GL}_2(E)}\) to \(\widetilde{\mathrm{SL}_2(E)}\), the multiplicity may not be one; the exact multiplicity is controlled by quadratic self-twists of the theta lift [1405.6023].

In quasi-Hamiltonian geometry, a Hamiltonian \(L_\tau(K)\)-space or quasi-Hamiltonian \(K^\tau\)-manifold is multiplicity-free if all symplectic reductions are \(0\)-dimensional, equivalently if the complexity \(c(M)\) is \(0\) [1612.03843]. In difference geometry, the emphasis is reversed: multiplicities are not to be excluded, because the preserved invariant for a \(\sigma\)-finite morphism of non-singular difference curves is the multiplicity-weighted fiber size, not the raw cardinality [1112.0804]. In geometric complexity theory, multiplicity data are again strictly finer than mere occurrence data: multiplicity obstructions can separate varieties even when occurrence obstructions provably cannot [1901.04576].

## 2. Combinatorial classification in polynomial and symmetric-function settings

A particularly explicit instance of excluding multiplicities appears in the classification of multiplicity-free key polynomials by Hodges–Yong. The key polynomial \(\kappa_\alpha\) is defined recursively using Demazure operators
\[
\pi_i(f) \;=\; \frac{x_i\,f - x_{i+1}\,s_i(f)}{x_i-x_{i+1}}
\]
and satisfies Kohnert’s rule
\[
\kappa_\alpha(\mathbf{x}) \;=\; \sum_{D\in{\sf KD}(\alpha)} {\sf Kohwt}(D).
\]
The classification is given by avoidance of the finite forbidden pattern set
\[
{\sf KM} \;=\; \{\, (0,1,2),\ (0,0,2,2),\ (0,0,2,1),\ (1,0,3,2),\ (1,0,2,2)\, \},
\]
with
\[
\kappa_\alpha \text{ multiplicity-free } \Longleftrightarrow \alpha\in\overline{\sf KM}_n
\]
[2007.09229]. This yields, as a corollary, that the corresponding type \(A\) Demazure module has every weight space of dimension at most \(1\) exactly for those \(\alpha\) avoiding \({\sf KM}\) [2007.09229].

The same paper places quasi-key polynomials into the picture through the positive Assaf–Searles expansion
\[
\kappa_\alpha \;=\; \sum_{\beta\in {\sf Qlswap}(\alpha)} \mathfrak{D}_\beta.
\]
A sufficient condition is proved for quasi-key multiplicity-freeness:
\[
\alpha\in \overline{\sf KM}_n^{\ge 1},\ \beta\in{\sf Qlswap}(\alpha)
\Longrightarrow
\mathfrak{D}_\beta \text{ multiplicity-free}.
\]
The hypothesis \(\alpha_i\ge 1\) for all \(i\) is explicitly presented as sufficient rather than necessary, and the precise characterization of multiplicity-free quasi-key polynomials remains open [2007.09229].

For Schur and skew Schur functions in the fundamental quasisymmetric basis, Bessenrodt–van Willigenburg classify all \(F\)-multiplicity-free cases. For partitions \(\lambda\), \(s_\lambda\) is \(F\)-multiplicity free if and only if \(\lambda\) or \(\lambda^t\) is one of \((3,3)\), \((4,4)\), \((n-2,2)\), or \((n-k,1^k)\); for skew shapes, the classification extends up to transpose and antipodal rotation by adding the disjoint union family \((n-k)+(1^k)\) [1105.4212]. The combinatorial reformulation is exact: \(s_D\) is \(F\)-multiplicity free if and only if all standard Young tableaux of shape \(D\) have distinct descent sets, and \(S_\alpha\) is \(F\)-multiplicity free if and only if all standard composition tableaux of shape \(\alpha\) have distinct descent sets [1105.4212].

Multiplicity-free skew Schur functions with full interval support form a narrower class. For a skew diagram \(A=\lambda/\mu\), the support is constrained to the Schur interval \([w,n]\), where \(w={\rm cols}(A)\) and \(n={\rm rows}(A)'\). The classification in [1009.4170] identifies exactly those basic skew diagrams for which
\[
s_{\lambda/\mu}=\sum_{\nu:\, w\unrhd \nu \unrhd n} s_\nu
\]
with all Littlewood–Richardson coefficients equal to \(1\). Up to adding a block of maximal width or maximal depth, \(180^\circ\) rotation, and conjugation, the allowed cases are the seven configurations listed there: straight shapes, two-row or two-column shapes, and the families \(A2,A3,A4,A6,A7\) with their stated parameter inequalities [1009.4170].

For skew Schur polynomials in \(n\) variables, the classification becomes \(n\)-dependent. After applying the basic, \(n\)-sharp, tight, and ordinary demolitions, multiplicity-freeness is decided by the inequality
\[
p(\lambda/\mu) < n < p(\lambda/\mu)+r_1(\lambda/\mu)+r_2(\lambda/\mu),
\]
where \(p\) is the maximum column height and \(r_1,r_2\) are shape invariants defined case-by-case [2010.14645]. The stable multiplicity-free skew Schur function classification appears as the subcollection of families I–IV in that paper, while families V–XI capture the additional polynomial-level multiplicity-free regimes [2010.14645].

## 3. Restriction problems and multiplicity one

For minimal representations of real reductive Lie groups, the paper on bounded multiplicity proves that if \(G\) is noncompact, connected, simple, and without complex structure, and \(\pi\in\operatorname{Irr}(G)\) satisfies \(\mathrm{DIM}(\pi)=n(\mathfrak g_{\mathbb C})\), then for any reductive symmetric pair \((G,H)\),
\[
\sup_{\sigma\in\widehat H} m_H(\pi,\sigma)<\infty
\]
[2204.05079]. Since minimal representations satisfy \(\mathrm{DIM}(\pi)=n(\mathfrak g_{\mathbb C})\), this gives bounded multiplicity for all symmetric restrictions of minimal representations [2204.05079]. The mechanism is geometric: if the \(H\)-action on the associated variety \(\mathrm{AV}(\pi)=\overline{\mathcal O_{\min,c}}\) is coisotropic, then \(\pi|_H\) has uniformly bounded multiplicities [2204.05079].

Multiplicity-free behavior is stronger and only partially established. For Riemannian symmetric pairs \((G,K)\), the restriction of a minimal representation is multiplicity-free, \(m(\pi|_K)=1\) [2204.05079]. More generally, Conjecture 12 in that paper states that for any symmetric pair \((G,H)\), one should have \(m(\pi|_H)=1\) for minimal \(\pi\), and similarly multiplicity one for tensor products of minimal representations, but these statements are not proved in full generality [2204.05079]. The paper also records specific branching examples where multiplicity one holds in the continuous or discrete spectrum, as well as a case for \(SL(n,\mathbb R)\) restricted to \(SO(p,q)\) where the continuous spectrum may have multiplicity two, showing that bounded multiplicity does not imply multiplicity-free restriction [2204.05079].

For classical groups over non-archimedean local fields of characteristic \(p>0\), \(p\neq 2\), the multiplicity-one theorems are exact. If \(V\subset W\) is the standard codimension-one inclusion in the orthogonal, special orthogonal, or unitary setting, then for irreducible smooth representations \(\pi\) of \(G(W)\) and \(\rho\) of \(G(V)\),
\[
\dim\operatorname{Hom}_{G(V)}(\pi,\rho)\le 1
\]
for \(G=O,SO,U\), and the analogous statement is already known for \(GL\) [2010.16112]. The proof uses the Gelfand–Kazhdan criterion: multiplicity one follows once every \(H\)-conjugation-invariant distribution on \(G\) is invariant under a suitable anti-involution preserving \(H\) [2010.16112]. A notable limitation is that the analogous statement fails for \(SU\); when \(\dim V=1\), \(SU(V)=\{1\}\) while \(SU(W)\) is non-commutative [2010.16112].

The metaplectic restriction \(\widetilde{\mathrm{GL}_2(E)}\to \widetilde{\mathrm{SL}_2(E)}\) exhibits the opposite phenomenon. If
\[
\widetilde{\Pi}\big|_{\widetilde{\mathrm{SL}_{2}(E)}} \cong \bigoplus_{a\in E^\times/(E^\times)^2}\tau^a,
\]
then the multiplicity of \(\tau\) is
\[
m(\widetilde{\Pi},\tau)
=
\#\{\, a\in E^\times/(E^\times)^2:\tau\cong \tau^a\,\}.
\]
Using Waldspurger’s theta correspondence, this becomes
\[
m(\widetilde{\Pi},\tau)
=
\#\Big\{\, a\in E^\times/(E^\times)^2:
\theta(\tau)\otimes\chi_a\cong\theta(\tau)
\ \text{and}\ 
\chi_a(-1)=1
\,\Big\},
\]
so multiplicity one can fail whenever the theta lift admits nontrivial quadratic self-twists of the required parity [1405.6023]. The paper states explicitly that the multiplicity may not be one [1405.6023].

## 4. Geometric meanings: zero-dimensional reductions and conserved weighted fibers

In quasi-Hamiltonian geometry, multiplicity-free means the complete collapse of symplectic reductions to discrete orbifolds. For a compact, connected, simply connected group \(K\) with twist \(\tau\), a quasi-Hamiltonian \(K^\tau\)-manifold is multiplicity-free if all reductions are \(0\)-dimensional, equivalently \(c(M)=0\) [1612.03843]. The invariant moment map image \(P_M\subset A\), where \(A\) is the twisted Weyl alcove, is then a convex polytope, and in the multiplicity-free case the quotient map
\[
m_+/K:M/K\to P_M
\]
is a homeomorphism [1612.03843]. Locally, via the cross-section theorem, multiplicity-free quasi-Hamiltonian geometry is modeled on smooth affine spherical varieties, with tangent cones matching weight monoids:
\[
C_aP_M = \Lambda_X^+\cap C_aP_M
\]
in the notation of the paper [1612.03843]. The classification theorem states that convex multiplicity-free quasi-Hamiltonian \(K^\tau\)-manifolds are classified by spherical pairs \((P,\Lambda)\) satisfying the local sphericality condition at every point of the moment polytope [1612.03843].

This geometric use of “exclude multiplicities” is not a statement about coefficients in an expansion, but about the dimension of reductions and the local sphericality of models. The paper also gives a practical certification procedure: compute the alcove, the invariant moment image \(P_M\), the lattice \(\Lambda_M\), and check at the vertices that the tangent cones \(C_aP_M\cap\Lambda_M\) are weight monoids of smooth affine spherical \(L_{\mathbb C}\)-varieties [1612.03843]. The local-to-global step is controlled by the vanishing
\[
H^i(P,L_{P,\Lambda})=0 \qquad (i\ge 1),
\]
which guarantees existence and uniqueness of the global multiplicity-free manifold from the local data [1612.03843].

Difference geometry reaches an opposite conclusion: multiplicities are indispensable. For a strongly \(\sigma\)-finite morphism \(f:(X,\sigma)\to (Y,\sigma)\) of non-singular difference curves and a point \(y\in Y\) with fiber \(\{x_1,\dots,x_r\}\), the preservation theorem gives
\[
\sum_{i=1}^{r} e(x_i\mid y)\,\mathrm{dl}\!\left(\frac{k(x_i)}{k(y)}\right)
=
\mathrm{dl}(X/Y),
\]
where \(e(x_i\mid y)\) is the ramification index and \(\mathrm{dl}\) is the limit degree [1112.0804]. In divisor form,
\[
\deg(f^*(y))=\mathrm{dl}(X/Y).
\]
The paper explicitly argues that set-theoretic fiber cardinalities vary with \(y\), while the multiplicity-weighted fiber size is constant; in this sense multiplicities cannot be excluded without destroying the conserved quantity [1112.0804]. A plausible implication is that “excluding multiplicities” is sometimes mathematically coherent only after one identifies the correct invariant: in difference geometry, the relevant invariant is not cardinality but weighted degree.

## 5. Multiplicity as a finer invariant than occurrence

Geometric complexity theory provides a setting where excluding multiplicities is provably too coarse. For a \(GL(V)\)-variety \(X\subset \operatorname{Sym}^d(V)\), the coordinate ring decomposes as
\[
\mathbb C[X]_e \cong \bigoplus_\lambda m_\lambda(X,e)\, S_\lambda(V),
\]
and one may compare two varieties \(X,Y\) either by occurrence obstructions, which require vanishing of some multiplicity, or by multiplicity obstructions, which merely require a strict inequality \(m_\lambda(X,e)\ne m_\lambda(Y,e)\) [1901.04576]. The paper proves, for the Chow variety and secant varieties of the Veronese, that multiplicity obstructions are stronger than occurrence obstructions: there are explicit settings where multiplicity separation exists while occurrence separation is impossible [1901.04576].

The central comparison is between secant multiplicities and plethysm coefficients. When \(k\ge d\),
\[
m_\lambda(\sigma_k(\operatorname{Ver}_n),d)=a_\lambda(d[n]),
\]
while for the Chow variety,
\[
m_\lambda(\operatorname{Chow}_n(V),d)\le a_\lambda(n[d]).
\]
Hence any strict inequality \(a_\lambda(d[n])>a_\lambda(n[d])\) yields a multiplicity obstruction [1901.04576]. The paper produces an infinite family with \(k=d=n+1\) and
\[
\lambda=(n^2-2,n,2),
\]
for which
\[
m_\lambda(\operatorname{Chow}_n(V),d)<m_\lambda(\sigma_d(\operatorname{Ver}_n),d)
\]
for all \(m\ge 3\), \(n\ge 2\) [1901.04576]. In finite explicit cases, it also proves that no occurrence obstructions exist even though multiplicity obstructions do [1901.04576]. This is an exact formulation of the principle that multiplicity information may encode structure that mere support cannot detect.

A different but related refinement occurs in additive combinatorics over \(\mathbb F_2\). For a Sidon set \(S\subset X\), the exclude multiplicity of \(x\in X\setminus S\) counts the number of unordered triples of distinct points of \(S\) summing to \(x\), and the exclude distribution is the function \(d_S:X\setminus S\to\mathbb Z_{\ge 0}\) [2407.11783]. For graphs \(\Gamma_F\subset (\mathbb F_2^n)^2\) of APN plateaued functions with all component functions unbalanced, the paper proves that \(d_{\Gamma_F}\) is uniform on the natural partition
\[
\mathcal Q(\mathbb F_2^n,F)=\{Q_a(F):a\in\mathbb F_2^n\}
\]
of the complement into \(2^n\) blocks [2407.11783]. The key formula is
\[
d_{\Gamma_F}(a,b)=\frac16\big|\{(x,y):F(x)+F(y)+F(a)=b\}\big|,
\]
from which the blockwise bijections preserving \(d_{\Gamma_F}\) follow [2407.11783]. For Gold and Kasami functions in even dimension, the paper determines exactly the two values attained by the exclude distribution and their frequencies per block and globally [2407.11783]. This is not multiplicity-free in the zero–one sense, but it is a precise control of multiplicity distribution.

## 6. Methods, criteria, and recurrent themes

Across these domains, two methodological patterns recur. The first is finite forbidden-configuration classification. Key polynomials are classified by avoidance of the finite pattern set \({\sf KM}\) [2007.09229]. \(F\)-multiplicity-free Schur and skew Schur functions are characterized by a finite list of partition or skew-shape families, with explicit local obstructions such as containment of \((3,2,1)\) or \((4,3)\) causing repeated descent sets [1105.4212]. Full-interval multiplicity-free skew Schur functions are likewise reduced to seven canonical shape families \(A1\)–\(A7\) after eliminating “bad configurations” [1009.4170]. For skew Schur polynomials, the reduction by demolitions and the explicit families I–XI furnish a non-recursive criterion [2010.14645].

The second pattern is geometric rigidity via local models or distributional invariance. In quasi-Hamiltonian geometry, local sphericality at the vertices of the moment polytope controls multiplicity-freeness globally [1612.03843]. For restrictions of minimal representations, coisotropicity of subgroup actions on minimal nilpotent orbits implies bounded multiplicity [2204.05079]. For classical groups over local fields of positive odd characteristic, the vanishing of \((\widetilde G,\chi)\)-equivariant distributions on \(G(V)\times V\) and on \(\mathfrak g(V)\times V\) yields the \(\sigma\)-invariance required by the Gelfand–Kazhdan criterion [2010.16112]. In the metaplectic setting, theta correspondence and quadratic self-twist analysis replace distribution theory and lead to an exact counting formula for multiplicities [1405.6023].

Several misconceptions are explicitly ruled out by the literature. Multiplicity-free is not the same as bounded multiplicity: the former means all multiplicities are at most \(1\), while the latter allows arbitrary finite bounds and is the strongest general theorem presently available for many symmetric-pair restrictions of minimal representations [2204.05079]. Occurrence data are not equivalent to multiplicity data: the Chow-versus-secant comparison provides natural cases where vanishing obstructions fail but multiplicity obstructions succeed [1901.04576]. Multiplicity one is not universal even in closely related settings: it holds for \((GL_{n+1},GL_n)\), \((O_{n+1},O_n)\), \((SO_{n+1},SO_n)\), and \((U_{n+1},U_n)\) over positive odd characteristic local fields, but fails for \(SU\) in the simplest case and may fail for \(\widetilde{\mathrm{GL}_2(E)}\to\widetilde{\mathrm{SL}_2(E)}\) [2010.16112] [1405.6023]. Finally, some programs require multiplicities rather than their elimination: difference geometry and geometric complexity theory both show that multiplicity data can be intrinsic to the preserved invariant or strictly stronger than support information [1112.0804] [1901.04576].

A plausible synthesis is that “exclude multiplicities” names not a single theorem but a family of structural regimes. In some of them, multiplicity-freeness admits exact combinatorial or geometric classification; in others, the sharp statement is only bounded multiplicity; and in still others, multiplicities themselves are the indispensable object of study. The papers surveyed here show all three possibilities with fully explicit criteria, formulas, and counterexamples [2007.09229] [1612.03843] [2204.05079] [2010.16112] [1901.04576] [1112.0804].

Source: https://www.emergentmind.com/topics/exclude-multiplicities