Metraipolis › archive › dc_7175faf5dd81

The Equality Cases of the Weak Simplex Conjecture — arXiv:2608.19093

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.19093
License (as archived)
CC0-1.0
Archived
2026-10-18T13:59:12.404Z
SHA-256 of the archived text
d5c710ca56229ca96035d23b9d6b1168eaf8620134fec5cf6661b621f01c05c5
Stable URL of this page
https://metraipolis.com/documento/dc_7175faf5dd81

How to cite

The Equality Cases of the Weak Simplex Conjecture — arXiv:2608.19093 — arXiv (en), https://arxiv.org/abs/2608.19093 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7175faf5dd81 (Metraipolis archive dc_7175faf5dd81, sha256 d5c710ca56229ca96035d23b9d6b1168eaf8620134fec5cf6661b621f01c05c5)
BibTeX
@misc{dc7175faf5dd81,
  title = {The Equality Cases of the Weak Simplex Conjecture — arXiv:2608.19093},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.19093},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7175faf5dd81; sha256 d5c710ca56229ca96035d23b9d6b1168eaf8620134fec5cf6661b621f01c05c5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.19093. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Among $n+1$ equiprobable equal-energy signals in $\R^n$ under additive white Gaussian noise with maximum-likelihood decoding, which arrangement maximizes the probability of correct decoding? The question is Shannon's, recorded by Rice in 1950. Mulgund proved in 2026 that the regular-simplex value bounds the correct-decoding probability of every signal set at every signal-to-noise ratio, leaving open whether the simplex is the only maximizer. This paper determines the equality cases in a form stronger than uniqueness. A signal set other than a regular simplex falls strictly below the bound at every positive signal-to-noise ratio. Hence a code meeting the bound at one positive operating point is already a regular simplex, up to vertex relabeling and an orthogonal map. In probabilistic form, among the correlation matrices that signal sets induce, any matrix other than the identity gives a lower-orthant probability strictly above its independent counterpart at every finite threshold, leaving no room for a nontrivial equality. No code of ambient dimension below $n$ attains the bound. Under an energy budget $E$ with unrestricted blocklength the optimal codebook is uniquely the regular simplex of circumradius $\sqrt{E}$. Every optimal codeword therefore exhausts its allowance. Equality in the Simplex Mean Width Conjecture likewise occurs only at the regular simplex. The proof strengthens the first self-convolution step of Mulgund's argument with Royen's correlation theorem. The single-parameter rigidity is machine-checked in Lean 4.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-20 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2608.19093 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T13:58:18.009Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).