2000 character limit reached
Almost disjointness preservers
Published 17 Aug 2015 in math.FA | (1508.04074v1)
Abstract: We study the stability of disjointness preservers on Banach lattices. In many cases, we prove that an "almost disjointness preserving" operator is well approximable by a disjointess preserving one. However, this approximation is not always possible, as our examples show.
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.
