2000 character limit reached
On cleanness of von Neumann algebras
Published 9 Apr 2021 in math.OA and math.RA | (2104.04350v3)
Abstract: A unital ring is called clean (resp. strongly clean) if every element can be written as the sum of an invertible element and an idempotent (resp. an invertible element and an idempotent that commutes). T.Y. Lam proposed a question: which von Neumann algebras are clean as rings? In this paper, we characterize strongly clean von Neumann algebras and prove that all finite von Neumann algebras and all separable infinite factors are clean.
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.