Metraipolis › archive › dc_190cfa43cb17

Aligning Information Theory and Formal Verification: A Lean Formalization of Rate-Distortion Theory — arXiv:2610.22404

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.22404
License (as archived)
CC0-1.0
Archived
2026-10-19T09:39:50.091Z
SHA-256 of the archived text
b44dc1bd78b66012ba2d9e62de2d1a583b1f5666bb720131ff2449ab5e431c37
Stable URL of this page
https://metraipolis.com/documento/dc_190cfa43cb17

How to cite

Aligning Information Theory and Formal Verification: A Lean Formalization of Rate-Distortion Theory — arXiv:2610.22404 — arXiv (en), https://arxiv.org/abs/2610.22404 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_190cfa43cb17 (Metraipolis archive dc_190cfa43cb17, sha256 b44dc1bd78b66012ba2d9e62de2d1a583b1f5666bb720131ff2449ab5e431c37)
BibTeX
@misc{dc190cfa43cb17,
  title = {Aligning Information Theory and Formal Verification: A Lean Formalization of Rate-Distortion Theory — arXiv:2610.22404},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.22404},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_190cfa43cb17; sha256 b44dc1bd78b66012ba2d9e62de2d1a583b1f5666bb720131ff2449ab5e431c37},
  year = {2026}
}

Archived text

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

Large language models have recently demonstrated an ability to generate substantial mathematical proofs and formalizations, including machine-checked arguments for major open problems and classical theorems. These developments highlight a growing workflow in which AI systems search for proofs while proof assistants certify their correctness. Within information theory, however, formalized libraries remain limited, and existing formalized theorems focus almost exclusively on Shannon's foundational lossless theorems. This paper presents the first Lean formalization of core components of rate-distortion theory, a central framework for lossy compression and modern machine-learning analysis. We identify the alignment challenges that arise when translating information-theoretic definitions, such as distortion measures, typicality and achievability, into a proof-assistant setting, and we develop a reusable library of definitions and lemmas faithful to textbook conventions. Our formalization provides a foundation for future AI-assisted proofs in information theory and enables subsequent mechanized developments to build on a coherent, verified infrastructure rather than generating long proofs from scratch.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.22404 — 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-19T09:35:29.690Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).