Maharam’s problem
By Michel Talagrand. 2006
64 citations recorded by the source corpus.
We construct an exhaustive submeasure that is not equivalent to a measure. This solves problems of J. von Neumann (1937) and D. Maharam (1947).
Subfields: Computational Theory and Mathematics, Mathematical Physics, Theoretical Computer Science
View Paper: https://www.semanticscholar.org/paper/bc7acfcb594b2da0588794b4163c0c2a12054c9c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Mathematical Physics
In Theoretical Computer Science
Citations in the corpus
- Measures on Boolean algebras (2017, background): “In 2008 he solved the Control Measure Problem (see [10]) by constructing an exhaustive submeasure on a countable Boolean algebra that is not uniformly exhaustive.”