Searcharxiv⌕ Search

arXiv · 2611.07930

The Approximation Property without the Bounded Approximation Property in a Separable Banach Space and Its Dual

Abstract

We investigate whether a dual Banach space with the approximation property (AP) must necessarily have the bounded approximation property (BAP). Using a quantitative renorming theorem for the space of absolutely summable sequences, we establish a direct-sum construction yielding a negative answer. More precisely, we construct a separable Banach space (X) such that both (X) and its dual (X^*) have the approximation property, while neither space has the bounded approximation property. The construction uses a sequence of equivalent renormings of (\ell_1) with increasingly restrictive finite-dimensional approximation bounds. By assembling these spaces through a (c_0)-direct sum, we obtain a dual space whose approximation property is preserved, but whose approximation constants cannot be uniformly bounded. We establish the required transfer principles, including the preservation of approximation bounds under complemented coordinate projections and the descent of the bounded approximation property from a dual space to its predual. We also provide an explicit complex-scalar version of the construction. The argument separates the external quantitative renorming input from the direct-sum construction and its functional-analytic consequences. In particular, the resulting example demonstrates that the approximation property of a dual space does not imply its bounded approximation property, even when the predual is separable and both spaces possess the approximation property.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ma Yicen. 2026-11-05. The Approximation Property without the Bounded Approximation Property in a Separable Banach Space and Its Dual. https://arxiv.org/abs/2611.07930

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↗