2000 character limit reached
Similarity problems, Folner sets and isometric representations of amenable semigroups
Published 24 Apr 2018 in math.FA, math.GR, math.OA, and math.SP | (1804.08960v2)
Abstract: We revisit Sz.-Nagy's criteria for similarity of Hilbert space bounded linear operators to isometries or unitaries and present new ones. We also discuss counterparts of the Dixmier-Day theorem concerning bounded representations of amenable groups and semigroups. We highlight the role of Folner sets in similarity problems in both settings of unimodular, $\sigma$-compact, amenable groups and in discrete semigroups possessing the Strong Folner condition (SFC).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.