نتایج جستجو برای: bounded weak approximate identity

تعداد نتایج: 389411  

2009
Y. Choi F. Ghahramani Y. Zhang

We continue the investigation of notions of approximate amenability that were introduced in work of the second and third authors together with R. J. Loy. It is shown that every boundedly approximately contractible Banach algebra has a bounded approximate identity, and that the Fourier algebra of the free group on two generators is not operator approximately amenable. Further examples are obtain...

2010
BRUCE A. BARNES B. A. BARNES

Let A be a Banach algebra with a bounded left approximate identity. The Cohen Factorization Theorem is used to prove several results concerning the representation theory of A.

In this paper we get some results and applications for duals and approximate duals of g-frames in Hilbert spaces. In particular, we consider the stability of duals and approximate duals under bounded operators and we study duals and approximate duals of g-frames in the direct sum of Hilbert spaces. We also obtain some results for perturbations of approximate duals.

Journal: :Journal of Mathematical Analysis and Applications 2015

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه لرستان - دانشکده علوم پایه 1392

‎in this article‎, ‎we have focused one some basic and productive information about the properties of spectrum and singular values related to compact operators which are ideals in a c*-algebra of bounded operators‎. ‎considering a two-sided connection between the family of symmetric gauge functions on sequence of singular values of compact operators and symmetric norms on finite dimensional ope...

Journal: :J. Symb. Log. 2009
Emil Jerábek

We show how to formalize approximate counting via hash functions in subsystems of bounded arithmetic, using variants of the weak pigeonhole principle. We discuss several applications, including a proof of the tournament principle, and an improvement on the known relationship of the collapse of the bounded arithmetic hierarchy to the collapse of the polynomial-time hierarchy.

2011
Klaus Ambos-Spies

Preface In this course we survey some recent work on the strongly bounded Turing re-ducibilities on the computably enumerable sets. Bounded Turing reducibilities are obtained from classical Turing reducibility by imposing upper bounds on the use functions (i.e., on the size of the oracle queries) of the reductions. The most popular bounded Turing reducibility which has been intensively studied ...

2008
S. E. Morris J. F. Feinstein

We give a counterexample to a conjecture of S.E. Morris by showing that there is a compact plane set X such that R(X) has no non-zero, bounded point derivations but such that R(X) is not weakly amenable. We also give an example of a separable uniform algebra A such that every maximal ideal of A has a bounded approximate identity but such that A is not weakly amenable.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید