Work

Quantitative norm paving over finite-index subfactors

Year: 2026
Type: preprint
Abstract: Let N ⊂ M be an inclusion of II₁ factors of finite Jones index, and let E be the trace-preserving conditional expectation onto N′ ∩ M. To ε-pave a finite family, we seek a single projection partition (pi) of 1 in N satisfying ‖∑i pi(x − E(x))pi‖ ≤ ε‖x − E(x)‖ for each member x. For 0 < ε < 1 we prove the bound ⌈9ε−2⌉ + ⌈3ε−1⌉ on the number of pieces, uniformly in the index and the family size. At each fixed inclusion, the supremum n∞(ε) of the least paving counts over finite families satisfies 2 ≤ lim infε↓0 ε²n∞(ε) ≤ lim supε↓0 ε²n∞(ε) ≤ 4. Finite families of trace-zero self-adjoint unitaries in N give the lower bound. This determines the optimal finite-family exponent in Sorin Popa’s paving-size question from his preprint of 10 October 2022. For a single self-adjoint operator the worst count has order ε−1 for N = M and at index two, settling those cases of Popa’s single-operator question. Across all finite-index inclusions the worst count has order ε−2 even for individual self-adjoint unitaries with E(x) = 0. For trace-zero self-adjoint contractions in a single factor, the worst infimum error with at most r ≥ 2 pieces is 1/(r − 1). At index two the same value holds for trace-zero self-adjoint contractions whose square lies in N, and for those with at most two spectral values. Each operator in the latter class admits an r-piece paving with strictly smaller error, giving the exact worst count ⌈1 + ε−1⌉ for 0 < ε < 1. At index two the worst count is asymptotic to ε−1 for trace-zero self-adjoint contractions commuting with their image under the involution of M with fixed algebra N. GitHub repository: eulogica/quantitative-norm-paving-finite-index-subfactors.
Language: English
Open Access status: green
OpenAlex ID: W7236584940
Cites:
Cited by:
Related to: 10