THE DIMENSION-3 NYQUIST THEOREM: WHY THREE IS THE UNIVERSAL THRESHOLD FOR AGGREGATION PARADOXES

We prove that dimension three is the minimal dimension at which lossy aggregation can produce adversarial exploitation, unifying three classical phenomena under a single algebraic invariant. The Gradient Opposition Lemma establishes that no partition of the binary cube {0,1}^n with n <= 2 supports reversal of an association upon aggregation, while partitions at n >= 3 do. The Angular Channel Capacity Theorem identifies the mechanism: the shrinkage Jacobian I_n - 2xx^T is a Householder reflector whose trace gives net exploitable capacity n - 2. We generalize to L^p geometry, where the shrinkage divergence is (n - p)/||x||^p, yielding an exploitation threshold of n >= p + 1. The Central Limit Theorem selects p = 2 as the universal attractor for systems governed by aggregation of independent components with finite variance, locking the threshold at n = 3. We confirm the predictive power of the framework by proving the L^1 Stein Paradox: under Laplace noise with L^1 loss, the coordinate-wise maximum likelihood estimator is inadmissible for n >= 2, exactly as the general threshold n >= p + 1 predicts at p = 1. The paper includes a self-contained proof of the Enrichment-Corruption Duality conservation identity from the adversarial aggregation channel framework, and connects the Simpson corollary to the causal inference literature, showing that the n = 3 threshold governs the minimal confounding dimension for collider bias and backdoor non-identification. We establish a nine-way equivalence among conditions that all transition at dimension three, spanning gradient opposition, the discrete Laplacian, continuous divergence positivity, pivotal integral finiteness, James-Stein domination, MLE inadmissibility, Brownian transience, Green's function finiteness, and Simpson reversal. The Banach-Tarski paradox, which shares the n = 3 threshold, is shown to be structurally distinct (a measure-theoretic pathology lacking Decision-Channel-Corruption structure) and is treated as a parallel rather than an equivalence.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-03-26
DOI
https://doi.org/10.5281/zenodo.19236535
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

THE DIMENSION-3 NYQUIST THEOREM: WHY THREE IS THE UNIVERSAL THRESHOLD FOR AGGREGATION PARADOXES

Kevin Fathi
Zenodo (CERN European Organization for Nuclear Research)
Quantum Information and Cryptography
article

THE DIMENSION-3 NYQUIST THEOREM: WHY THREE IS THE UNIVERSAL THRESHOLD FOR AGGREGATION PARADOXES

Kevin Fathi
article en

Abstract

We prove that dimension three is the minimal dimension at which lossy aggregation can produce adversarial exploitation, unifying three classical phenomena under a single algebraic invariant. The Gradient Opposition Lemma establishes that no partition of the binary cube {0,1}^n with n <= 2 supports reversal of an association upon aggregation, while partitions at n >= 3 do. The Angular Channel Capacity Theorem identifies the mechanism: the shrinkage Jacobian I_n - 2xx^T is a Householder reflector whose trace gives net exploitable capacity n - 2. We generalize to L^p geometry, where the shrinkage divergence is (n - p)/||x||^p, yielding an exploitation threshold of n >= p + 1. The Central Limit Theorem selects p = 2 as the universal attractor for systems governed by aggregation of independent components with finite variance, locking the threshold at n = 3. We confirm the predictive power of the framework by proving the L^1 Stein Paradox: under Laplace noise with L^1 loss, the coordinate-wise maximum likelihood estimator is inadmissible for n >= 2, exactly as the general threshold n >= p + 1 predicts at p = 1. The paper includes a self-contained proof of the Enrichment-Corruption Duality conservation identity from the adversarial aggregation channel framework, and connects the Simpson corollary to the causal inference literature, showing that the n = 3 threshold governs the minimal confounding dimension for collider bias and backdoor non-identification. We establish a nine-way equivalence among conditions that all transition at dimension three, spanning gradient opposition, the discrete Laplacian, continuous divergence positivity, pivotal integral finiteness, James-Stein domination, MLE inadmissibility, Brownian transience, Green's function finiteness, and Simpson reversal. The Banach-Tarski paradox, which shares the n = 3 threshold, is shown to be structurally distinct (a measure-theoretic pathology lacking Decision-Channel-Corruption structure) and is treated as a parallel rather than an equivalence.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Openalex Percentile: Top 7%
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.