Searcharxiv⌕ Search

arXiv · math/0510609

Partial Unconditionality

Abstract

J. Elton proved that every normalized weakly null sequence in a Banach space admits a subsequence that is nearly unconditional which is a weak form of unconditionality. The notion of near-unconditionality is quantified by a constant $K(δ)$ depending on a parameter $δ\in (0,1]$. It is unknown if $\sup_{δ>0} K(δ) < \infty$. This problem turns out to be closely related to the question whether every infinite-dimensional Banach space contains a quasi-greedy basic sequence. The notion of a quasi-greedy basic sequence was introduced recently by S. V. Konyagin and V. N. Temlyakov. We present an extension of Elton's result which includes Schreier unconditionality. The proof involves a basic framework which we show can be also employed to prove other partial unconditionality results including that of convex unconditionality due to Argyros, Mercourakis and Tsarpalias. Various constants of partial unconditionality are defined and we investigate the relationships between them. We also explore the combinatorial problem underlying the $\sup_{δ>0} K(δ) < \infty$ problem and show that $\sup_{δ>0} K(δ) > 5/4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. J. Dilworth, E. Odell, Th. Schlumprecht, A. Zsak. 2005-10-27. Partial Unconditionality. https://arxiv.org/abs/math/0510609

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On a characterization of spaces satisfying open mapping and equivalent theorems

We study open-mapping, continuous-inverse and closed-graph properties for maps whose domain and range belong to the same class of Hausdorff topological vector spaces. Quotient and graph stability imply equivalence of these properties. In the locally convex setting, we characterize barrelled infra-Pták spaces and barrelled Pták spaces as largest classes determined by the closed-graph property, Banach test spaces and appropriate nearly-open image conditions.

math.FA↗

A family of matrix flows converging to normal matrices

The celebrated Antezana-Pujals-Stojanoff Theorem states that the iterated Aluthge transforms of an arbitrary matrix converge to a normal matrix. We introduce a family of matrix flows that share this convergence property by defining them through ordinary differential equations. The family includes a continuous analogue of the Aluthge transform, as well as a differential equation discussed by Haagerup in the context of II$_1$ factors. We also examine the same type of flows in the setting of Hilbert space operators equipped with unitarily invariant norms.

math.FA↗

A Novel Two-Parameter Penalty: Relaxation Degree Analysis and Sparse Signal Recovery

In this article, we introduce a nonconvex two-parameter penalty function $P_{a,p}$, parameterized by $a\in(0,\infty)$ and $p\in(0,1]$, and the relaxation degree RD$_P$ for a separable nonconvex penalty function $P$. Based on $P_{a,p}$, we further propose the $P_{a,p}$ minimization framework for sparse signal recovery. This framework generalizes the TL1 minimization model established by S. Zhang and J. Xin (corresponding to the special case $p=1$) and provides a unified family of nonconvex penalty functions for sparse signal recovery. Using the sparse convex-combination technique, we establish both exact and stable sparse signal recovery under the restricted isometry property (RIP). To efficiently solve the resulting nonconvex optimization problem, we apply a modified iteratively re-weighted least squares method and the difference of convex functions algorithm (DCA) to develop the IRLSTLp algorithm for unconstrained $P_{a,p}$ minimization and prove some convergence results. Finally, numerical experiments compare recovery and runtime against single- and double-loop baselines, examine sensitivity to $(a,p)$, and assess the empirical correlation between RD$_{P_{a,p}}$ and recovery within the proposed family.

math.FA↗