The Projection Problem in Commutative, Positively Ordered Monoids
Gianluca Cassese

TL;DR
This paper investigates the projection problem in commutative, positively ordered monoids, providing bounds and applications to various mathematical structures such as set functions and vector lattices.
Contribution
It introduces explicit bounds for projecting subsets into $o$-ideals and explores applications across different mathematical frameworks.
Findings
Provided an explicit upper bound for the cardinality of the restricted subset.
Demonstrated applications to set functions and vector lattices.
Established theoretical foundations for the projection problem in ordered monoids.
Abstract
We examine the problem of projecting subsets of a commutative, positively ordered monoid into an -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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Rings, Modules, and Algebras · semigroups and automata theory
The Projection Problem in Commutative, Positively Ordered Monoids
Gianluca Cassese
Università Milano Bicocca
[email protected] Department of Economics, Statistics and Management Building U7, Room 2097, via Bicocca degli Arcimboldi 8, 20126 Milano - Italy
Abstract.
We examine the problem of projecting subsets of a commutative, positively ordered monoid into an -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.
Key words and phrases:
-domain, -ideal, Ordered monoid, Prime -ideal, Projection, Semilattice.
2010 Mathematics Subject Classification:
Primary: 06F05. Secondary: 20M14.
1. Introduction.
Several problems in analysis are greatly simplified by the possibility of reducing the cardinality of the set under scrutiny from arbitrary to finite – or at least countable – which follows from compactness or separability. In this paper we explore the possibility of a similar simplification arising from a notion of a purely set theoretic nature, -ideals, a concept originally introduced by Tarski [15] that we adapt to the study of commutative, positively ordered monoids (or semigroups). In the context of this mathematical structure we define, section 2, ideals and projections and investigate, in section 4, the projection problem, that is the problem of projecting a subset of a positively ordered monoid into a given ideal. We show in Theorem 1 that a set can be projected on an ideal if and only if the same is true for any of its subsets with cardinality less than some explicit bound – often just countable subsets. The proof is elementary and exploits some properties of cardinal numbers. Given the simple mathematical structure of positively ordered monoids, our result is quite general and abstract, although it has almost immediate applications to lattices, Boolean algebras and to families of set functions. The main applications of these results are developed in section 5 where we introduce the class of functions of finite variation defined on a p.o. monoid . As an application of Theorem 1, we obtain in Theorem 4 a necessary and sufficient condition for a subset to admit a strictly positive element. This problem is connected to Maharam problem in the theory of additive functions on Boolean algebras.
To simplify definitions, throughout the paper we assume the commutative property without explicit mentioning, so that a monoid or semigroup is always meant to be commutative.
For the rest of the paper, and without further mention, will be a positively ordered (p.o.) monoid, as defined by Clifford [6, p. 308]. That is, is a monoid (written multiplicatively and with designating its unit) endowed with a partial order that satisfies
[TABLE]
Every monoid is a p.o. monoid if we write whenever divides 111 A p.o. semigroup is defined likewise, but replacing (1a) with the condition: for all . Given that each p.o. semigroup may be embedded into a p.o. monoid, we shall mainly focus on the latter structure. .
Our results become significantly simpler if we assume, with no loss of generality, the existence of a least element . Two elements are disjoint if and a set is mutually disjoint if and for all distinct pairs . When we also use the lattice notation
[TABLE]
At times we shall require in addition that is normal, i.e. that [math] is the only nilpotent element of , or even that is idempotent (more precisely, that all elements of are idempotent222 Idempotent semigroups are often referred to as semilattices. See Birkhoff [3, p. 9], Leader [10] or Blyth [4, p. 19] ).
Many well known mathematical structures, such as lattices and Boolean algebras, are examples of a p.o. monoid or semigroup. If is a p.o. monoid for each , the product p.o. monoid is the set with order and composition defined coordinatewise. The space of all functions defined on some arbitrary set and with values in a p.o. monoid is then a product p.o. monoid. If is an arbitrary set and each is identified, via the evaluation map, with a function where , we obtain the abstract p.o. monoid associated with .
We denote by the cardinality of a set and refer to as an -set if is a cardinal number and . If , the image of under is written as and we let .
2. Preliminary notions: ideals and projections.
Given the interaction between algebraic and order properties, several concepts, including ideals and projections, may be given distinct definitions depending if considered in algebraic or in order terms. This section is of limited mathematical content, provides some rigorous definitions and proves some basic facts.
A monoid ideal (or simply an ideal, for short) in is a subset such that333 Our definition corresponds to that of a semigroup ideal, see e.g. Anderson and Johnson [2] or Rees [13]. We adopt the convention that the empty set is an ideal.
[TABLE]
an order ideal (-ideal) is a subset satisfying the more restrictive condition
[TABLE]
Given any monoid , even without a partial order, an ideal induces a reflexive and transitive binary relation defined by
[TABLE]
The associated equivalence relation (i.e. if and ), generates a quotient monoid , which we write more simply as . Defining multiplication of equivalence classes in the usual way and letting if and only if , we obtain a p.o. monoid444 The factor p.o. monoid should not be confused with other quotients, such as the factor semigroup defined by Rees [13, p. 389]. The latter need not posses an order structure and is induced by the equivalence relation or . Rees congruence implies but the converse need not be true. . The canonical map is a homomorphism of monoids but, if is a p.o. monoid, it preserves order if and only if is an -ideal. If we use the standard notation
[TABLE]
If and are disjoint we say that and are -disjoint and this is equivalent to . A set is mutually -disjoint if is mutually disjoint.
-ideals have special importance. Each set generates a corresponding -ideal defined as
[TABLE]
The map is clearly a closure operation which induces the order topology . A map between two p.o. monoids, each endowed with its own order topology, is continuous if and only if it preserves order. The composition operation is thus a continuous mapping of to and a topological p.o. monoid.
Further classes of ideals are of interest. is a radical ideal if whenever for some . We write . is radical if and only if is normal. We also define a -ideal to be an -ideal such that admits a greatest element for each .
Lemma 1**.**
* is a -ideal if and only if for some order preserving satisfying*
[TABLE]
Proof.
If satisfies (8b) its range is necessarily an -ideal; if, in addition, preserves order and satisfies (8a), then implies so that its range is a -ideal. Conversely, if is a -ideal and if is the greatest element in the set , then the map clearly preserves order and satisfies (8a). Moreover, if then so that , i.e. so that . Eventually, \mathcal{I}=\bigcup_{m\in\mathfrak{M}}\mathcal{I}\cap I(m)=\bigcup_{m\in\mathfrak{M}}I\big{(}p(m)\big{)}=I(p). ∎
By analogy with the theory of vector lattices, a map with the properties of Lemma 1 is called an -projection. The family of -projections forms a p.o., idempotent monoid if endowed with composition. The corresponding algebraic notion is that of a (monoid) projection i.e. an order preserving map which satisfies (8a) and
[TABLE]
Denoting by the family of projections we have 666 In fact, if then (8b) and imply while (8a) implies .
while the converse holds if and only if is idempotent. More interestingly, each corresponds with a projection on via the identity
[TABLE]
The main example of a projection is the translate by , defined as .
3. -ideals
The following is a generalisation of the classical notion of a prime ideal (due to Tarski [15, Definition 4.1]) and often used in set theory. e adapt the definition to p.o. monoids.
Definition 1**.**
Let be a cardinal. A -ideal in is an -ideal with the property that every mutually -disjoint subset of is a -set. A -ideal is referred to as a prime ideal777 In the terminology of [9], a -ideal is a -saturated -ideal. The restriction to -ideals is only for terminological convenience. .
Notice that if is a -ideal and is an -ideal contained in , then need not be a -ideal.
Some properties of prime ideals carry over unchanged from the theory of rings. The family of prime ideals contains and is closed with respect to arbitrary unions. Their complements form thus a base for a topology, . If and is a prime ideal, then is clearly an -ideal. Moreover, if are such that , then , by (8c) and (8a). We must then have either or . Thus is a prime ideal when is so.
Lemma 2**.**
(i) is a topological p.o. monoid in which each is continuous, (ii) if is prime, the annihilator of any is -closed and (iii) each radical -ideal is the intersection of all prime ideals containing it (and is thus closed).
Proof.
Radical, -ideals are closed with respect to arbitrary unions. If is such an ideal and if , by Zorn lemma we can form a maximal radical -ideal which includes but not . Suppose that are such that . If then the radical -ideals and both contain , by maximality. There exist then such that and and thus . But this implies , a contradiction. Thus is prime and . ∎
The well-ordering principle permits the following definition:
Definition 2**.**
Given a subset and an ideal in we define to be the least cardinal number for any mutually -disjoint subset . We write .
By definition, every -ideal is a -ideal. In applications, we shall mainly encounter the case . In general, computing may not be easy. We provide some explicit examples.
Example 1**.**
Let be the monoid of real valued, non negative, lower semicontinuous functions on some topological space with binary operation . If is separable, then ; if is compact and totally disconnected then .
Example 2**.**
Consider a commutative monoid with its natural order. Then, ideals and -ideals coincide. Let be distinct, irreducible elements of and let . The ideal is clearly seen to be a radical -ideal. Consider to be mutually -disjoint. Then, for each there must be an integer such that does not divide . At the same time, since when , for each there is at most one element in which is not divided by . It follows that .
Example 3**.**
Let be an -space ([1, p. 193]). Fix and consider endowed with the binary operation . If are mutually disjoint, then
[TABLE]
This implies that .
Erdős and Tarski [8] proved that the general conjecture that may be any cardinal number is false. In the next Lemma we adapt their result to the present setting.
Lemma 3** (Erdős and Tarski).**
Let be a radical -ideal in and fix . Then and cannot be a singular limit cardinal nor .
Proof.
The inequality is clear. Let be distinct, -disjoint elements such that . Then necessarily
[TABLE]
i.e. which is impossible if is radical.
The second claim follows from [8, Theorem 1] once we prove that two elements are mutually disjoint if and only if there is no such that and other than . One implication follows from the fact that is a p.o. monoid so that and . Conversely, if and for some with , we conclude
[TABLE]
i.e. that since is radical. This shows that when is a radical, -ideal a subset of is mutually disjoint in our definition if and only if it is so in the sense of [8, p. 316]. ∎
The simple properties of prime ideals listed in Lemma 2 need not be true in the case of -ideals.
Lemma 4**.**
If is a regular cardinal number then the intersection of a -family of -ideals is a -ideal and, if , so is their union.
Proof.
First of all, and are -ideals if is so for each index in the -set . Choose to be mutually -disjoint. Then, . Write . Of course, is mutually -disjoint. But then, given that ,
[TABLE]
However, if then is a singular, limit cardinal a contradiction. This proves that is a -ideal.
Concerning union, assume that is a finite set and choose to be mutually -disjoint. Suppose that . By passing to a subset, we can assume with no loss of generality that . Then, since for some , we conclude from a well known result of Ramsey [12, Theorem A] (see also Erdős and Rado [7, Theorem 1]) that there exists and a subset such that and that is -disjoint, which contrasts with the assumption that each is a -ideal. Thus necessarily . ∎
4. The projection problem
Each -ideal is the range of some -projection. In general, the question whether a projection maps a given subset of into some ideal is not trivial and we refer to it as the projection problem. More formally,
Definition 3** (Projection Problem).**
Given , and an ideal in is there such that ?
This problem has an interesting structure in the case in which is a radical, -ideal. Given the preceding remarks, there is no loss of generality in setting and assuming that is normal. The following result establishes the existence of sufficient subsets of bounded cardinality.
Theorem 1**.**
Assume that is normal and let . Each admits a \kappa\big{(}Q[M]\big{)}-subset which is sufficient for , i.e. such that
[TABLE]
Moreover, .
Proof.
Form the class of all subsets of which are mutually disjoint and choose, by virtue of Zorn lemma, a maximal set in this class. Write . Then, \mathfrak{c}(M_{0})\leq\mathfrak{c}(\mathfrak{A})<\kappa\big{(}Q[M]\big{)}. To prove the last claim first, let be such that for all . Given that is normal, the collection contains properly so that would contradict maximality. Let satisfy . By (8c),
[TABLE]
Then so that necessarily . ∎
A number of implications of Theorem 1 may be obtained right away.
Corollary 1**.**
(i) If is normal, then each set admits a -subset such that
[TABLE]
In particular, and have the same -upper bounds. (ii) Each admits a -subset such that
[TABLE]
Proof.
The first claim follows from Theorem 1 upon letting consist of all translates by some and noting that, in this case, . By definition (5) an element is an -upper bound for if and only if i.e, by (15), if and only if it is a -upper bound for . To prove (ii) recall that each acts as an -projection on the normal p.o. monoid . Then, is equivalent to and . ∎
For a set of positive elements in a vector lattice the condition implies then that for some .
The projection problem may also be studied locally, by looking at the sets
[TABLE]
which are open in the order topology of . Theorem 1 translates into a compactness statement: if covers it admits then a -subcover. But then, if is a “large” set and if , then one of such sets must be “large” as well. This version of the pigeonhole principle admits a rigorous formulation.
Theorem 2**.**
Let , and be as in Theorem 1. Let the cardinal be the greatest of and . If
[TABLE]
then the set has the same cardinality as .
Proof.
If is as in the statement it is then necessarily a regular cardinal number. Let be a -subset sufficient for . Define . Clearly, . Moreover, by basic cardinal arithmetic
[TABLE]
However, since is regular by [9, Lemma 3.10] we must have and . ∎
Theorem 2 applies, e.g., when (in fact, every successive cardinal is regular, see [9, Corollary 5.3]).
Eventually, Theorem 1 translates into a result on partitions.
Theorem 3**.**
Let , and be as in Theorem 1 and let be a regular cardinal number . Assume that decomposes as
[TABLE]
in which is a -set and for each . Then, admits the decomposition
[TABLE]
in which is a -set, while for each there exist and such that
[TABLE]
Proof.
Define . According to Theorem 1 we can extract a -set which is sufficient for . Then, if and only if there exists a pair such that . Let be the set of all such pairs and write each in the form . Given that and are -sets and that is regular . The decomposition (21) becomes obvious upon defining for all . ∎
5. Functions of Bounded Variation.
We provide some more explicit applications. If we define the group operation on by we obtain that is an idempotent, product p.o. monoid.
Corollary 2**.**
Let be a non empty set and let be an ideal in the p.o. product monoid . Assume that . Then there exist such that
[TABLE]
Proof.
Upon replacing with there is no loss of generality in assuming that . The map is an -projection for each . Let be the corresponding family. We have . The claim then follows from Theorem 1. ∎
More interesting conclusions may be obtained with additional structure.
Definition 4**.**
An increasing function is of finite variation, in symbols , if
[TABLE]
where ranges over all finite, mutually -disjoint subsets of .
is a p.o. sub semigroup in and for each the set is an -ideal. Thus, each set contains a countable subset such that for each
[TABLE]
Example 4**.**
Let be an idempotent, p.o. monoid and let the function satisfy and
[TABLE]
If is a system of sets then (26) corresponds to the definition of a supermodular capacity given by Choquet [5, p. 171]. If is mutually -disjoint, then so that .
Theorem 4**.**
Let be such that whenever and . The following properties are mutually equivalent:
- (a)
for every the set is an -ideal in ; 2. (b)
; 3. (c)
every admits some such that .
Proof.
(a)(b) If is mutually disjoint then any two elements have disjoint support. For each we can thus select such that . The family is mutually -disjoint and has the same cardinality as . If is an -ideal, then necessarily is countable. This proves that . (b)(c) For each consider the projection implicitly defined by and apply Theorem 1 with and . Observe that if and only if . By assumption, so that . We obtain a countable subset such that for any , if and only if . If is an enumeration of we can define by letting
[TABLE]
Notice that and that is equivalent to . (c)(a) If and if for some , then necessarily is certainly an -ideal by the finite variation property. ∎
Two final comments. First, the proof shows that if for given there exists satisfying (c) then it can always be taken to be of the form (27). This is important since if consists e.g. of supermodular capacities, so will be . Second, Theorem 4 may be useful to prove the existence of some which is positive on all , . This is an important and challenging problem (that goes much beyond the scope of this work). In the case in which is a Boolean algebra and consists of additive probabilities on , this is just the problem raised by Maharam in [11] (see [14] for a partial, negative answer). The problem makes however sense also in other classes of functions of finite variation e.g. not additive set functions on a given algebra of sets. In applying condition (b) of Theorem 4 one should recall that the disjointness condition formulated for need not coincide with the corresponding condition e.g. for additive set functions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Aliprantis, C. D., and Burkinshaw, O. Positive Operators . Springer, Dordrecht, 2006.
- 2[2] Anderson, D. D., and Johnson, E. W. Ideal theory in commutative semigroups. Semigroup Forum 30 (1984), 127–158.
- 3[3] Birkhoff, G. Lattice Theory . No. 25 in Amer. Math. Soc. Colloquium Publications. Providence RI, 1973.
- 4[4] Blyth, T. S. Lattices and Ordered Algebraic Structures . Springer, London, 2006.
- 5[5] Choquet, G. Theory of capacities. Ann. Inst. Fourier 5 (1954), 131–295.
- 6[6] Clifford, A. H. Totally ordered commutative semigroups. Bull. Amer. Math. Soc. 64 , 6 (1958), 305–316.
- 7[7] Erdős, P., and Rado, R. Intersection theorems for systems of sets. J. Lond. Math. Soc. 35 , 1 (1960), 85–90.
- 8[8] Erdős, P., and Tarski, A. On families of mutually exclusive sets. Ann. Math. 44 (1943), 315–329.
