Metraipolis › archive › dc_e2ff4cecadd8

A Hierarchical Online-Compression Approach to Proportional Subsets of Bounded Orthonormal Systems — arXiv:2610.39025

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39025
License (as archived)
CC0-1.0
Archived
2026-11-01T02:35:40.549Z
SHA-256 of the archived text
42fba2a1e669c5e2a73e1d3542bc1803244a70608b2233762f710e5fe1b1934d
Stable URL of this page
https://metraipolis.com/documento/dc_e2ff4cecadd8

How to cite

A Hierarchical Online-Compression Approach to Proportional Subsets of Bounded Orthonormal Systems — arXiv:2610.39025 — arXiv (en), https://arxiv.org/abs/2610.39025 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e2ff4cecadd8 (Metraipolis archive dc_e2ff4cecadd8, sha256 42fba2a1e669c5e2a73e1d3542bc1803244a70608b2233762f710e5fe1b1934d)
BibTeX
@misc{dce2ff4cecadd8,
  title = {A Hierarchical Online-Compression Approach to Proportional Subsets of Bounded Orthonormal Systems — arXiv:2610.39025},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39025},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e2ff4cecadd8; sha256 42fba2a1e669c5e2a73e1d3542bc1803244a70608b2233762f710e5fe1b1934d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39025. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $(\phi_i)_{i=1}^n$ be an orthonormal system on a probability space with $\|\phi_i\|_\infty\leq L$. We prove that, for every $2\leq k<n$, there is a set $I$ of at least $n-k$ indices such that $$ \|f\|_2\leq CM_k\sqrt{\log(e+M_k)}\|f\|_1 $$ for every $f$ in the span of $(\phi_i)_{i\in I}$, where $M_k=L\sqrt{\frac{n}{k}\log(2k)}$. This replaces the logarithmic exponent $\frac{5}{2}$ in the corresponding theorem of Guédon, Mendelson, Pajor, and Tomczak-Jaegermann by $\frac{1}{2}$. We also obtain a partition into two sets of cardinality $\frac{n}{2}+O(\sqrt n)$ for which both spans satisfy the resulting norm comparison, and for uniformly bounded systems the proportional estimate is $C\sqrt{\log n\log\log n}$ for sufficiently large $n$. This is the third paper in a series systematically using gradient descent as a proof mechanism in harmonic analysis, following the $\Lambda(p)$ and Bernoulli restricted isometry papers of Burstein, Iosevich, and Krause, and the descent here is entropic mirror descent. We represent each function in an $L_1$ ball by a probability measure of controlled relative entropy, and this entropy pays for the corrections to the predictions of its coefficients. Processing the thresholds from large to small, we obtain a single weighted bound for all the corrections, which we turn into a finite description of approximate coefficient squares and then into a conditional Rademacher estimate, and symmetrization completes the argument directly on the $L_1$ ball. We also record consequences for concentration and for recovery from coefficient measurements.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Classical Analysis and ODEs (math.CA) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2610.39025 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:14:58.668Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).