Pokémon Theorem: Fairness, Automata & Graphs

• Pokémon theorem is a term applied to three distinct results: RKHS fairness impossibility, synchronizing words in finite-state games, and biclique partitions in graphs.
• In fairness research, it demonstrates that any finite linear mean-fairness criteria leave a residual group discrepancy due to unequal base rates in RKHS embeddings.
• In automata theory and graph theory, it guarantees a disjunctive input eventually wins a deterministic game and that a complete graph’s edge partition requires at least n–1 bicliques.

The expression Pokémon theorem is used for several unrelated results in contemporary mathematical and theoretical-computer-science literature. In fairness research, it denotes an RKHS impossibility theorem showing that, under unequal base rates, any finite collection of linear mean-fairness criteria leaves a residual group discrepancy witnessed by the maximum mean discrepancy (MMD) (Smola et al., 9 May 2026). In automata theory, it denotes the statement that a disjunctive input stream eventually wins any deterministic finite-state game with a single absorbing win state reachable from every state (Hedges, 29 Dec 2025). In graph theory and combinatorics, it is also used as a nickname for the Graham–Pollak theorem, which states that the biclique partition number of the complete graph $K_n$ is $n-1$ (Vishwanathan, 2010).

1. Terminological scope

The three principal uses of the term are distinct in content, assumptions, and mathematical apparatus.

Usage	Core statement	Source
Fairness impossibility	Finite linear mean-fairness audits cannot exhaust group discrepancy under unequal base rates	(Smola et al., 9 May 2026)
Finite-state games	A disjunctive input eventually contains a synchronizing win word	(Hedges, 29 Dec 2025)
Biclique partitions	Any edge-partition of $K_n$ into complete bipartite graphs needs at least $n-1$ parts	(Vishwanathan, 2010)

A recurrent source of confusion is that the term does not designate a single canonical theorem. The fairness result is formulated in RKHS geometry; the automata result concerns synchronizing words and disjunctive sequences; the graph-theoretic usage is a popular nickname for a theorem about biclique partitions. The common label is therefore historical or expository rather than structural.

2. RKHS fairness impossibility and the modern Pokémon theorem

In the fairness literature, the setup is as follows. The protected attribute is $A \in \mathcal{G}$, typically $\mathcal{G}=\{a,b\}$; the outcome is $Y\in\{0,1\}$; the features are $X\in\mathcal{X}$; and a score takes the form $S=s(X)=\langle w,\phi(X)\rangle$ for some $w\in\mathcal{H}$, where $n-1$0 is a positive-definite kernel on $n-1$1 with RKHS $n-1$2 and feature map $n-1$3. Base rates are $n-1$4, and unequal base rates mean $n-1$5. The kernel mean embedding of a distribution $n-1$6 is

$n-1$7

The relevant conditional mean embeddings are

$n-1$8

with group-difference vectors

$n-1$9

If $K_n$0 is characteristic, then

$K_n$1

and equality of mean embeddings implies equality of distributions (Smola et al., 9 May 2026).

The central observation is that several scalar fairness criteria become linear constraints on conditional mean embeddings. For $K_n$2, demographic parity is

$K_n$3

Equalized odds, or class-conditional balance within groups, is

$K_n$4

Group-conditional unbiasedness,

$K_n$5

is likewise a first-moment condition. By contrast, calibration or sufficiency, $K_n$6, is distributional rather than a single linear CME constraint, and therefore lies outside the paper’s “linear mean-fairness” scope.

The geometric source of incompatibility is the law of total expectation in CME form: $K_n$7 If one imposes both group-level parity and class-conditional equality while $K_n$8, the different coefficients $K_n$9 overdetermine the mean constraints. This suggests that the impossibility is not merely a collection of ad hoc scalar incompatibilities, but a single Hilbert-space phenomenon induced by unequal base rates.

3. Residual witnesses, Kolmogorov widths, and the strengthened KMR dichotomy

The qualitative Pokémon theorem is formulated for a characteristic kernel with $n-1$0, hence $n-1$1, and a finite audit subspace

$n-1$2

satisfying $n-1$3 for $n-1$4. Its conclusion is that a residual violation always survives outside $n-1$5. A canonical witness is the normalized MMD direction

$n-1$6

Thus, satisfying any finite collection of linear mean-fairness criteria does not exhaust the discrepancy between distinct groups.

The quantitative theorem introduces the pooled covariance operator

$n-1$7

with Mercer decomposition $n-1$8. Under polynomial eigendecay $n-1$9 for some $A \in \mathcal{G}$0, and a source condition $A \in \mathcal{G}$1 with $A \in \mathcal{G}$2, the worst-case residual over the source ellipsoid

$A \in \mathcal{G}$3

obeys

$A \in \mathcal{G}$4

The optimal $A \in \mathcal{G}$5-dimensional audit is the top-$A \in \mathcal{G}$6 Mercer eigenspace $A \in \mathcal{G}$7. In the approximate case, if an orthonormal family $A \in \mathcal{G}$8 satisfies $A \in \mathcal{G}$9, then

$\mathcal{G}=\{a,b\}$0

Accordingly, the residual fairness violation decays only at the Kolmogorov $\mathcal{G}=\{a,b\}$1-width rate permitted by the pooled spectrum (Smola et al., 9 May 2026).

The same framework strengthens the Kleinberg–Mullainathan–Raghavan dichotomy. If $\mathcal{G}=\{a,b\}$2 satisfies group-conditional unbiasedness,

$\mathcal{G}=\{a,b\}$3

together with positive-class balance and negative-class balance,

$\mathcal{G}=\{a,b\}$4

then either $\mathcal{G}=\{a,b\}$5 or $\mathcal{G}=\{a,b\}$6 almost surely. The decisive identity is

$\mathcal{G}=\{a,b\}$7

This replaces full calibration with the weaker first-moment condition of group-conditional unbiasedness. The paper also gives a bridge from directional class-balance control to near-perfection: if class-balance holds on an audited subspace $\mathcal{G}=\{a,b\}$8, $\mathcal{G}=\{a,b\}$9 with $Y\in\{0,1\}$0, and $Y\in\{0,1\}$1, then for all $Y\in\{0,1\}$2,

$Y\in\{0,1\}$3

where

$Y\in\{0,1\}$4

Under the same spectral regularity, $Y\in\{0,1\}$5 inherits the $Y\in\{0,1\}$6 decay.

4. Fair representation learning, approximate frontiers, and empirical patterns

The representation-level impossibility theorem considers a measurable encoder $Y\in\{0,1\}$7, a characteristic kernel $Y\in\{0,1\}$8 on $Y\in\{0,1\}$9, and the representation embeddings

$X\in\mathcal{X}$0

Parity in representation space is $X\in\mathcal{X}$1, and class-conditional separation is $X\in\mathcal{X}$2 for $X\in\mathcal{X}$3. If $X\in\mathcal{X}$4 and both properties hold, then

$X\in\mathcal{X}$5

The CME identity

$X\in\mathcal{X}$6

forces class collapse when the base rates differ. The approximate relaxation gives the signal frontier: if

$X\in\mathcal{X}$7

then for $X\in\mathcal{X}$8,

$X\in\mathcal{X}$9

For binary classifiers under exact separation, with

$S=s(X)=\langle w,\phi(X)\rangle$0

the paper derives

$S=s(X)=\langle w,\phi(X)\rangle$1

and

$S=s(X)=\langle w,\phi(X)\rangle$2

The empirical study uses Adult Income (sex groups), $S=s(X)=\langle w,\phi(X)\rangle$3, estimated $S=s(X)=\langle w,\phi(X)\rangle$4; COMPAS (race restricted to African-American vs. Caucasian), $S=s(X)=\langle w,\phi(X)\rangle$5, $S=s(X)=\langle w,\phi(X)\rangle$6; and an ACS PUMS subsample (California 2018, race/sex), $S=s(X)=\langle w,\phi(X)\rangle$7, $S=s(X)=\langle w,\phi(X)\rangle$8. The residual fraction

$S=s(X)=\langle w,\phi(X)\rangle$9

decays roughly polynomially on log–log axes when $w\in\mathcal{H}$0 is the top-$w\in\mathcal{H}$1 eigenspace of the empirical pooled covariance. The reported numbers of criteria needed to reach approximately $w\in\mathcal{H}$2 residual are Adult $w\in\mathcal{H}$3, COMPAS $w\in\mathcal{H}$4, and ACS $w\in\mathcal{H}$5. For separation-enforcing methods, specifically Hardt post-processing and ExponentiatedGradient with equalized-odds, the scatter of $w\in\mathcal{H}$6 lies on or above the Pareto bound within bootstrap uncertainty. For representational methods, specifically LFR, Fair-VAE, and adversarial debiasing, the plane

$w\in\mathcal{H}$7

respects the linear constraint suggested by the signal frontier, and the upper-left corner—small parity gap but large class signal—is empirically empty (Smola et al., 9 May 2026).

These results motivate a specific interpretation of fairness auditing. Finite checklists of moment-style criteria, including demographic parity and equalized odds, do not certify group equality when $w\in\mathcal{H}$8. The paper therefore treats MMD as a data-dependent fairness “budget,” with top-eigen allocations optimizing worst-case audit coverage. A plausible implication is that the practical question is less whether one can eliminate all residual mean-level discrepancy and more how rapidly the residual decays under increasing audit dimension.

5. The automata-theoretic Pokémon theorem

In automata theory, a game is modeled as a deterministic finite-state, edge-labeled digraph $w\in\mathcal{H}$9, or equivalently as a DFA or finite-state transducer

$n-1$00

where $n-1$01 is the finite alphabet of button inputs, $n-1$02 is the transition function, and $n-1$03 is a single absorbing winning state. Determinism is preserved even for games using a pseudorandom number generator by including the internal seed or pRNG state in $n-1$04. The key assumption is win-reducibility: from every state $n-1$05, there exists some finite word $n-1$06 with $n-1$07 (Hedges, 29 Dec 2025).

The core lemma is a synchronizing-to-win statement: there exists a synchronizing word $n-1$08 mapping every state to the absorbing win state, with

$n-1$09

The construction concatenates shortest state-specific winning words. Once such a $n-1$10 exists, the Pokémon theorem follows immediately from disjunctiveness. If

$n-1$11

is disjunctive in base $n-1$12, meaning that every finite word over $n-1$13 appears somewhere as a contiguous block in the digit expansion of $n-1$14, then $n-1$15 appears somewhere in the input stream generated by $n-1$16. At that moment the game reaches the absorbing win state and remains there. Formally, for any deterministic finite-state game with one absorbing win state $n-1$17 such that every state can reach $n-1$18, any disjunctive $n-1$19 eventually wins.

The measure-theoretic consequence is that, for any fixed base $n-1$20, Lebesgue almost every real number is normal in base $n-1$21, hence disjunctive in base $n-1$22, and therefore almost every $n-1$23 eventually wins any such game. The theorem does not show that $n-1$24 wins: the normality or disjunctiveness of $n-1$25 is unknown. This corrects a common overstatement sometimes associated with “$n-1$26 plays Pokémon.”

The paper also records a true-RNG variant: if the RNG has full support over finite words and $n-1$27 is disjunctive, then $n-1$28 wins with probability $n-1$29. Quantitatively, a universal worst-case sequence can be obtained by concatenating all words of length $n-1$30, implying a coarse upper bound of

$n-1$31

button presses before a synchronizing win word must appear. For Pokémon Sapphire, using $n-1$32 and $n-1$33, the resulting estimate is

$n-1$34

button presses. The theorem is therefore existential rather than practically algorithmic. The paper further notes that finding a shortest synchronizing word is NP-hard.

6. The graph-theoretic Pokémon theorem and the Graham–Pollak result

In combinatorics, “Pokémon theorem” is used as a nickname for the Graham–Pollak theorem. Let $n-1$35 be the complete graph on $n-1$36 labeled vertices. An edge-partition of $n-1$37 into complete bipartite graphs is a family of bicliques $n-1$38 whose edge sets are pairwise disjoint and whose union is $n-1$39. The theorem states that the biclique partition number of $n-1$40 equals $n-1$41; equivalently,

$n-1$42

This lower bound is tight. A star decomposition with

$n-1$43

partitions $n-1$44 into $n-1$45 bicliques.

The counting proof in (Vishwanathan, 2010) replaces the usual linear-algebraic argument by a pigeonhole argument on vertex labelings. Assuming $n-1$46, one considers all labelings $n-1$47 and the corresponding pattern vector $n-1$48, where the first $n-1$49 coordinates are the sums over the left sides $n-1$50 and the last coordinate is the total sum over all vertices. For sufficiently large $n-1$51, two distinct labelings $n-1$52 must have the same pattern. Writing $n-1$53, one obtains

$n-1$54

The identity

$n-1$55

then forces

$n-1$56

because $n-1$57 is nonzero. But the edge partition permits a reorganization

$n-1$58

a contradiction. Hence $n-1$59.

The paper also situates this proof relative to matrix methods. Naive rank subadditivity applied to adjacency matrices gives only $n-1$60, whereas the exact $n-1$61 bound traditionally requires more refined real-field arguments, such as those related to Sylvester’s law of inertia. The counting proof avoids those spectral tools while preserving the same extremal conclusion. The nickname “Pokémon theorem” arises in popular exposition from a classification metaphor: pairwise interactions are to be partitioned into “types,” each type corresponding to the crossing edges of a bipartition (Vishwanathan, 2010).