arXiv (All)
open access
A short proof of the Bernoulli decomposition theorem
We give a construction of admissible partitions that yields the Bernoulli decomposition theorem
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Riemann Hypothesis through the looking of partitions#819294
- The Riemann Hypothesis through the looking of partitions#809301
- Proof of Equivalence of Complexity Classes and Other Relations#76398
- An Improvement to the Upper Bound for Marton's Covering Conjecture#799548
- An Improvement to the Upper Bound for Marton's Covering Conjecture#798125
Record · ID 1035876
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive