Let be the Schur multiplier with symbol . We characterize the boundedness of by approximation of weighted columns in a common finite-dimensional subspace. If is the weak bound and is the column approximation constant, then . These estimates hold uniformly under amplification. Our second main result is the one-dimensional Hörmander–Mikhlin–Schur weak estimate. This settles the one-dimensional case of the weak problem stated in Parcet’s ICM 2026 survey. The proof uses two adjacent dyadic grids and block decompositions indexed by finite binary trees. We apply Cuculescu’s projections to the associated block-diagonal filtration. The resulting tree estimate is independent of the depth and grows as with the descendant complexity .

生成讲解博客的中文版本

生成AI智能校验的中文版本