Metraipolis › archive › dc_0bd1fa8f6bc6
Three Conjectures on Binary Channels for the Doubly Symmetric Binary Source — arXiv:2609.27991
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.27991
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:12:01.471Z
- SHA-256 of the archived text
13a49dac9f0e61adf08aa2abc3ee4cc2e159acbb15d06b4faf312e1796d420bb- Stable URL of this page
https://metraipolis.com/documento/dc_0bd1fa8f6bc6
How to cite
Three Conjectures on Binary Channels for the Doubly Symmetric Binary Source — arXiv:2609.27991 — arXiv (en), https://arxiv.org/abs/2609.27991 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0bd1fa8f6bc6 (Metraipolis archive dc_0bd1fa8f6bc6, sha256 13a49dac9f0e61adf08aa2abc3ee4cc2e159acbb15d06b4faf312e1796d420bb)
BibTeX
@misc{dc0bd1fa8f6bc6,
title = {Three Conjectures on Binary Channels for the Doubly Symmetric Binary Source — arXiv:2609.27991},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.27991},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0bd1fa8f6bc6; sha256 13a49dac9f0e61adf08aa2abc3ee4cc2e159acbb15d06b4faf312e1796d420bb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27991. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We settle three conjectures concerning a doubly symmetric binary source $(X,Y)$ with crossover $p$. Consider Markov chains $U - X - Y - V$ with $U,V$ binary, and let $\mathcal{A}$ be the set of rate triples $(I(U;V),I(U;X),I(Y;V))$ attainable with arbitrary binary channels $X\to U$, $Y\to V$, and $\mathcal{B}$ the subset attainable with binary symmetric channels. The averaged BSC conjecture, Conjecture 5.2 of Pichler, Piantanida and Matz (2022), asserts $\operatorname{conv}\mathcal{A}=\operatorname{conv}\mathcal{B}$. We prove this for every $p\in[0,1]$. Two conjectures of Dikshtein, Ordentlich and Shamai (2022) concern the double-sided information bottleneck at $p=0$, where $Y=X$ and the two channels see the same source: their Conjecture 1 identifies the exact maximum of $I(U;V)$ at prescribed rates $I(U;X)$ and $I(Y;V)$, and their Conjecture 2 the exact minimum. We prove both for binary $U,V$: the two extrema are attained by the same pair of Z/S-channels, in opposite orientation for the maximum and in the same orientation for the minimum. The proofs were found with substantial AI assistance, and all three theorems are formalised in Lean 4 with Mathlib, depending only on the standard axioms. The development is available at this https URL . The proof of Conjecture 1 of Dikshtein, Ordentlich and Shamai (2022) contains three certified computations, a polynomial bound, an interval sweep and a polynomial positivity certificate, all of which are checked in Lean.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.27991 — 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-08T12:10:03.933Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).