2000 character limit reached
The Projection Problem in Commutative, Positively Ordered Monoids
Published 24 Jul 2019 in math.AC and math.LO | (1907.10400v6)
Abstract: We examine the problem of projecting subsets of a commutative, positively ordered monoid into an $o$-ideal. We prove that to this end one may restrict to a sufficient subset, for whose cardinality we provide an explicit upper bound. Several applications to set functions, vector lattices and other more explicit structures are provided.
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.