Home  /  Proyecciones  /  Vol: 31 Núm: 2 Par: 0 (2012)  /  Article
ARTICLE
TITLE

Uniform Convergence and the Hahn-Schur Theorem

SUMMARY

Let E be a vector space, F aset, G be a locally convex space, b : E X F — G a map such that ò(-,y): E — G is linear for every y G F; we write b(x, y) = x · y for brevity. Let ? be a scalar sequence space and w(E,F) the weakest topology on E such that the linear maps b(-,y): E — G are continuous for all y G F .A series Xj in X is ? multiplier convergent with respect to w(E, F) if for each t = {tj} G ? ,the series Xj=! tj Xj is w(E,F) convergent in E. For multiplier spaces ? satisfying certain gliding hump properties we establish the following uniform convergence result: Suppose j XX ij is ? multiplier convergent with respect to w(E, F) for each i G N and for each t G ? the set {Xj=! tj Xj : i} is uniformly bounded on any subset B C F such that {x · y : y G B} is bounded for x G E.Then for each t G ? the series ^jjLi tj xj · y converge uniformly for y G B,i G N. This result is used to prove a Hahn-Schur Theorem for series such that lim¿ Xj=! tj xj · y exists for t G ?,y G F. Applications of these abstract results are given to spaces of linear operators, vector spaces in duality, spaces of continuous functions and spaces with Schauder bases.

 Articles related

Claudio Sacerdoti Coen,Enrico Tassi    

We present a formalisation of a constructive proof of Lebesgue’s Dominated Convergence Theorem given by the Sacerdoti Coen and Zoli in [CSCZ]. The proof is done in the abstract setting of ordered uniformities, also introduced by the two authors as a simp... see more


Fernando Andrés Gallego,John Jairo Quintero,Juan Carlos Riano    

In this paper, we present some algorithms for unconstrained convex optimization problems. The development and analysis of these methods is carried out in a Banach space setting. We begin by introducing a general framework for achieving global convergence... see more


Péter L. Erdos, Ervin Gyori, Tama´s Róbert Mezei, István Miklós, Dániel Soltész    

One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain converges to the uniform distribution, but generally the rate of convergence ... see more


Gabriel Berzunza, Xing Shi Cai, Cecilia Holmgren    

The kk-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical cutting model by Meir and Moon. In this paper, we show that all moments of the kk-cut number of conditioned Galton-Watson trees converge after proper res... see more


Thai Anh Nhan,Vinh Quang Mai    

For singularly perturbed two-dimensional linear convection-diffusion problems, although optimal error estimates of an upwind finite difference scheme on Bakhvalov-type meshes are widely known, the analysis remains unanswered (Roos and Stynes in Comput. M... see more