Sets of multiplicity and closable multipliers on group algebras

V. S. Shulman, I. G. Todorov, L. Turowska

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

Abstract

We undertake a detailed study of the sets of multiplicity in a second countable locally compact group G and their operator versions. We establish a symbolic calculus for normal completely bounded maps from the space B(L-2(G)) of bounded linear operators on L-2 (G) into the von Neumann algebra VN(G) of G and use it to show that a closed subset E subset of G is a set of multiplicity if and only if the set E* = {(s,t) is an element of G x G : ts(-1) is an element of E} is a set of operator multiplicity. Analogous results are established for M-1-sets and M-0-sets. We show that the property of being a set of multiplicity is preserved under various operations, including taking direct products, and establish an Inverse Image Theorem for such sets. We characterise the sets of finite width that are also sets of operator multiplicity, and show that every compact operator supported on a set of finite width can be approximated by sums of rank one operators supported on the same set. We show that, if G satisfies a mild approximation condition, pointwise multiplication by a given measurable function psi : G -> C defines a closable multiplier on the reduced C*-algebra G(r)*(G) of G if and only if Schur multiplication by the function N(psi): G x G -> C, given by N(psi)(s, t) = psi(ts(-1)), is a closable operator when viewed as a densely defined linear map on the space of compact operators on L-2(G). Similar results are obtained for multipliers on VN(C).
Original languageEnglish
Pages (from-to)1454-1508
Number of pages55
JournalJournal of Functional Analysis
Volume268
Issue number6
Early online date06 Dec 2014
DOIs
Publication statusPublished - 15 Mar 2015

Keywords

  • math.OA

Fingerprint

Dive into the research topics of 'Sets of multiplicity and closable multipliers on group algebras'. Together they form a unique fingerprint.

Cite this