๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Factorization Problem for Normal Completely Bounded Mappings

โœ Scribed by Christian Le Merdy; Bojan Magajna


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
245 KB
Volume
181
Category
Article
ISSN
0022-1236

No coin nor oath required. For personal study only.

โœฆ Synopsis


Given an operator space X and a von Neumann algebra A, we consider a contractive mapping q: A eh X eh A ร„ NCB(X*, A) formally defined by q( a j x jk b k )= x jk a j b k , from the extended Haagerup tensor product A eh X eh A into the space of w*-continuous completely bounded maps from X* into A. We characterize elements of the range space Im(q) by a factorization property involving decomposable operators and investigate various properties of that space. In the case when X=B * is the predual of a von Neumann algebra B, Im(q) is included in the space DEC(B, A) of decomposable operators from B into A. Regarding q as having values in that space, we show that q is a quotient map onto its range. Then we prove that DEC(B, A) is a normal dual operator A-bimodule and that Im(q)/ DEC(B, A) is a strong operator A-bimodule.


๐Ÿ“œ SIMILAR VOLUMES


A Selection Principle for Mappings of Bo
โœ S.A. Belov; V.V. Chistyakov ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 141 KB

E. Helly's selection principle states that an infinite bounded family of real functions on the closed interยจal, which is bounded in ยจariation, contains a pointwise conยจergent sequence whose limit is a function of bounded ยจariation. We extend this theorem to metric space valued mappings of bounded va

Bounds on chromatic numbers of multiple
โœ Jรกn Plesnรญk ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 306 KB ๐Ÿ‘ 1 views

## Abstract Bounds on the sum and product of the chromatic numbers of __n__ factors of a complete graph of order __p__ are shown to exist. The wellโ€known theorem of Nordhaus and Gaddum solves the problem for __n__ = 2. Strict lower and some upper bounds for any __n__ and strict upper bounds for __n

Branch and bound methods for a search pr
โœ Alan R. Washburn ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 116 KB

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch

A new upper bound for the bipartite Rams
โœ David Conlon ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 89 KB ๐Ÿ‘ 1 views

## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any twoโ€coloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__โ€‰โ‰ฅ 2^_