Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Set-Valued Analysisarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Set-Valued Analysis
Article . 2008 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2008
Data sources: zbMATH Open
versions View all 2 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

On Partially Ordered Semigroups and an Abstract Set-Difference

On partially ordered semigroups and an abstract set-difference
Authors: Pallaschke, Diethard; Przybycien, Hubert; Urbanski, Ryszard;

On Partially Ordered Semigroups and an Abstract Set-Difference

Abstract

By an \(F\)-semigroup \((S,+,\leq)\) the authors mean a commutative (additive) semigroup with an order on it satisfying the following five properties: (S1) For each \(a,b,s\in S\), \(a+s\leq b+s\) implies \(a\leq b\). (S2) If \(a\leq b\), then \(a+s\leq b+s\) for each \(s\in S\). (S3) If \(a\leq s\) and \(b\leq s\), then the supremum \(\sup\{a,b\}\), denoted by \(a\vee b\), exists. (S4) If \(s\leq a\) and \(s\leq b\), then \(\inf \{a,b\}:=a\wedge b\) exists. (S5) If for some \(a,b,s\in S\), \(a\vee b\) and \((a+s)\vee (b+s)\) exist, then \((a\vee b)+s\leq (a+s)\vee (b+s)\). That is, a commutative partially ordered semigroup, in the usual sense, which satisfies conditions (S1), (S3)--(S5). The most interesting example of an \(F\)-semigroup is the nonempty compact convex sets of a topological vector space endowed with the Minkowski sum as operation and the inclusion relation as the order. In the present paper, the authors prove that there are commutative semigroups \(S\) with an order on \(S\) satisfying the axioms (S2)--(S5) but not (S1); those satisfying (S1) and (S3)--(S5) but not (S2); those satisfying (S1), (S2), (S4) and (S5) but not (S3); those satisfying (S1)--(S3) and (S5) but not (S4); and those satisfying (S1)--(S4) but not (S5). Let now \((S,+,\leq)\) be an \(F\)-semigroup. For \((a,b)\in S\times S:=S^2\) they call the pair \((a,b)\) a fraction. They define an equivalence relation and an order relation on the set of fractions as \((a,b)\sim (c,d)\) if and only if \(a+d=b+c\), and \((a,b)\prec (c,d)\) if and only if \(a\leq c\) and \(b\leq d\), respectively. The authors define a fraction \((a,b)\) to be minimal if for any fraction \((c,d)\) such that \((c,d)\prec (a,b)\) and \((c,d)\sim (a,b)\), we have \((c,d)=(a,b)\). If \(S\) is an \(F\)-semigroup, they define the abstract difference of two elements \(a,b\in S\) as the greatest element (if it exists) of the set \(\{x\in S \mid x+b\leq a\}\) and they apply the abstract difference to characterize the minimal convex fractions.

Keywords

ddc:620, abstract difference, Minkowski-Pontryagin difference for convex sets, Nonsmooth analysis, commutative semigroup with an order, 620, \(F\)-semigroup, convex fraction, Ordered semigroups and monoids, minimal fraction, Convex sets in topological vector spaces (aspects of convex geometry), Engineering & allied operations, info:eu-repo/classification/ddc/620

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!