PreprintCC BY 4.0arXiv
A short proof of the Bernoulli decomposition theorem
Abstract
We give a construction of admissible partitions that yields the Bernoulli decomposition theorem
Related
- A very short proof of the subgaussian convex-order comparison theorem
- A short proof of Ball's plank theorem
- A Short Proof of a Theorem of Pan and Zhang
- A short proof of Bernstein's theorem via the Omori--Yau maximum principle
- A Short Proof and Generalization of the Rainbow Cycle Theorem and Improved Bounds for Binary Even-Query LCCs
BibTeX
@misc{martynek2026short,
title = {{A short proof of the Bernoulli decomposition theorem}},
author = {Witold Bednorz Rafal Martynek and Rafal Meller},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.21476},
eprint = {2609.21476},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.21476},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - A short proof of the Bernoulli decomposition theorem
AU - Witold Bednorz Rafal Martynek
AU - Rafal Meller
PY - 2026
DA - 2026/09/18
PB - arXiv
DO - 10.48550/arxiv.2609.21476
UR - https://arxiv.org/abs/2609.21476
AB - We give a construction of admissible partitions that yields the Bernoulli decomposition theorem
ER -