Result 300, Operator algebras

Approximation and quadratic strong-operator paving

Proves that every self-adjoint element of a complex von Neumann algebra admits strong-operator paving relative to any maximal abelian subalgebra with O(ε−2)O(\varepsilon^{-2}) blocks. The norm bound holds after compression by a projection arbitrarily close to the identity in the strong topology, resolving the Popa–Vaes quadratic paving conjecture.

Proof

The bigger picture

Why it matters

Paving asks whether an operator can be split into blocks whose errors are small. The reported result gives a uniform bound on the number of blocks needed, even in infinite-dimensional settings, provided a controlled compression is allowed.

What changes?

The manuscript reports that every self-adjoint operator in a complex von Neumann algebra admits paving over every maximal abelian subalgebra, a largest commuting subalgebra. For any relative error tolerance epsilon between zero and one, at most 500 million times epsilon to the power minus two block-defining projections suffice. The norm bound holds after compression by a projection arbitrarily close to the identity on each fixed vector. The bound is representation-independent and requires neither separability nor a conditional expectation.

What does that help mathematicians do?

The estimate gives researchers a quantitative decomposition guarantee: halving the error tolerance multiplies the stated block budget by four, regardless of the algebra or chosen maximal commuting subalgebra. Its scope removes separability and conditional-expectation assumptions as prerequisites for this guarantee. The compression remains essential to the claim: closeness on each fixed vector does not mean closeness in operator norm, so this is not an unrestricted norm-paving theorem.

Are there practical applications?

The immediate value is foundational for operator algebras. The result supplies controlled block decompositions for studying how noncommuting operators relate to maximal commuting subalgebras, including settings without the additional hypotheses named above. The supplied material establishes no computational procedure or practical performance claim; the explicit block bound is a mathematical guarantee rather than an implementation benchmark.

This section was generated by GPT-6 Astra Medium. This explanation is based on the result summary and manuscript abstracts below. This context is separate from OpenAI's source text.

2 manuscripts

Approximation Paving over Arbitrary Maximal Abelian Subalgebras

September 25, 2026 48 pages

We prove the approximation-paving conjecture of Popa and Vaes for every maximal abelian subalgebra of a complex von Neumann algebra. For each 0<ε<10\lt \varepsilon\lt 1, every self-adjoint operator is a strong limit of self-adjoint operators of norm at most three times its norm, each admitting a norm paving with error at most ε times the approximant's own norm. The number of projections is at most Cε−6C\varepsilon^{-6} for a universal constant C. No separability or conditional-expectation hypothesis is required.

PDF LaTeX source
Cite (BibTeX) 
@misc{OAI:Approximation-Paving-over-Arbitrary-Maximal-Abelian-Subalgebras-September-25-2026,
  author = {{OpenAI}},
  title = {{Approximation Paving over Arbitrary Maximal Abelian Subalgebras}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Approximation-Paving-over-Arbitrary-Maximal-Abelian-Subalgebras-September-25-2026/Approximation-Paving-over-Arbitrary-Maximal-Abelian-Subalgebras-September-25-2026.pdf}{OAI:Approximation-Paving-over-Arbitrary-Maximal-Abelian-Subalgebras-September-25-2026}},
  year = {2026}
}

Quadratic Strong-Operator Paving over Arbitrary Maximal Abelian Subalgebras

September 25, 2026 54 pages

We prove the quadratic strong-operator paving conjecture of Popa and Vaes. For every 0<ε<10\lt \varepsilon \lt 1, every self-adjoint element of a von Neumann algebra admits strong-operator paving over each maximal abelian subalgebra with at most 5×108ε−25\times10^8\varepsilon ^{-2} projections. The bound is uniform over representations and requires no separability or conditional-expectation assumption.

PDF LaTeX source
Cite (BibTeX) 
@misc{OAI:Quadratic-Strong-Operator-Paving-over-Arbitrary-Maximal-Abelian-Subalgebras-September-25-2026,
  author = {{OpenAI}},
  title = {{Quadratic Strong-Operator Paving over Arbitrary Maximal Abelian Subalgebras}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Quadratic-Strong-Operator-Paving-over-Arbitrary-Maximal-Abelian-Subalgebras-September-25-2026/Quadratic-Strong-Operator-Paving-over-Arbitrary-Maximal-Abelian-Subalgebras-September-25-2026.pdf}{OAI:Quadratic-Strong-Operator-Paving-over-Arbitrary-Maximal-Abelian-Subalgebras-September-25-2026}},
  year = {2026}
}

Data from github.com/openai/math at commit adc7f12, committed October 6, 2026 at 21:58 UTC, last checked for changes about 8 hours ago. Titles, subjects, summaries, abstracts and Lean notes are OpenAI's; page counts are read from the PDFs. The map, related results, search, kinds of results and the named-problem index are Emergent Mind's, built with text embeddings and an LLM, and may contain errors.

An Emergent Mind Labs project. Emergent Mind is not affiliated with OpenAI. None of these results has been peer reviewed. Cite the manuscripts themselves, using the BibTeX on each result's page.