• No results found

Weak factorization systems and fibrewise regular injectivity for actions of pomonoids on posets

N/A
N/A
Protected

Academic year: 2020

Share "Weak factorization systems and fibrewise regular injectivity for actions of pomonoids on posets"

Copied!
15
0
0

Loading.... (view fulltext now)

Full text

(1)

Algebra and Discrete Mathematics RESEARCH ARTICLE Volume24(2017). Number 2, pp. 235–249

© Journal “Algebra and Discrete Mathematics”

Weak factorization systems and fibrewise regular

injectivity for actions of pomonoids on posets

Farideh Farsad and Ali Madanshekaf

Communicated by R. Wisbauer

A b s t r ac t . Let S be a pomonoid. In this paper, Pos-S, the category ofS-posets andS-poset maps, is considered. One of the main aims of this paper is to draw attention to the notion of weak factorization systems in Pos-S. We show that ifS is a pogroup, or the identity element ofSis the bottom (or top) element, then (DU, SplitEpi) is a weak factorization system inPos-S,where DU and SplitEpi are the class of du-closed embedding S-poset maps and the class of all split S-poset epimorphisms, respectively. Among other things, we use a fibrewise notion of complete posets in the categoryPos-S/B under a particular case thatB has trivial action. We show that every regular injective object in Pos-S/B is topological functor. Finally, we characterize them under a special case, whereS is a pogroup.

1. Introduction

A comma category (a special case being a slice category) is a construc-tion in category theory. It provides another way of looking at morphisms: instead of simply relating objects of a category to one another, morphisms become objects in their own right. This notion was introduced in 1963 by F. W. Lawvere, although the technique did not become generally known until many years later.

2010 MSC:06F05, 18A32, 18G05, 20M30, 20M50.

(2)

Injective objects with respect to a class Hof morphisms have been investigated for a long time in various categories. Recently, injective objects in slice categories (C/B) have been investigated in detail (see [1, 6]), especially in relationship with weak factorization systems, a concept used in homotopy theory, in particular for model categories. More precisely,

H-injective objects inC/B, for anyB inC, form the right part of a weak factorization system that has morphisms of Has the left part (see [1, 2]). In this paper, the notion of weak factorization system in Pos-S is investigated. After some introductory notions in section 1, we recall in section 2, the notion of weak factorization system and state some related basic theorems. Also, we give the guarantee about the existence of (Emb, Emb) as a weak factorization system inPos-S, whereEmb is the class of all order-embeddingS-act maps. We then find that everyEmb -injective object in Pos-S/B is split epimorphism inPos-S. In section 3, we continue studyingEmb-injectivity using a fibrewise notion of complete posets in the category Pos-S/B in a particular case where B has the trivial action.

For the rest of this section, we give some preliminaries which we will need in the sequel.

Given a categoryCand an objectB ofC, one can construct theslice categoryC/B(read:CoverB): objects ofC/B are morphisms ofCwith codomain B, and morphisms in C/B from one such object f :AB to anotherg:CB are commutative triangles in C

A h //

f

C

g

~

~

B

i.e, gh = f. The composition in C/B is defined from the composition inC, in the obvious way (paste triangles side by side).

Let Cbe a category and Ha class of its morphisms. An objectI ofC

is called H-injective if for each H-morphism h:UV and morphism

u:UI there exists a morphism s:VI such thatsh=u. That is, the following diagram is commutative:

U

h

u / /I

V

s

?

(3)

In particular, in the slice categoryC/B, whereB is an object ofC,this means that, an objectf :XB is H-injective if, for any commutative square

U u //

h

X

f

V v //B

withh∈ H, there exists a diagonal morphisms:VX U u //

h

X

f

V

s

>

>

v //B

such thatsh = u and f s = υ. The category C is said to have enough

H-injectives if for every objectA of Cthere exists a morphismAC

inHwhereC is anH-injective object inC.

Let S be a monoid with identity 1. A (right) S-act or S-set is a setA

equipped with an actionµ:A×SA,(a, s)7→as,such thata1 =aand

a(st) = (as)t, for allaA ands, tS.LetAct-S denote the category of allS-acts with action-preserving maps orS-maps. ClearlyS itself is an

S-act with its operation as the action. For instance, take any monoidS

and a non-empty setA. ThenAbecomes a rightS-act by definingas=a

for allaA,sS, we call thatA an S-act withtrivial action (see [10] or [11]).

Recall that a pomonoidS is a monoid with a partial order 6which is compatible with the monoid operation: fors, t, s, tS,s6t,s6t′ imply ss6

tt

. A (right) S-poset is a poset A which is also an S-act whose actionµ:A×SAis order-preserving, whereA×S is considered as a poset with componentwise order. The category of allS-posets with action preserving monotone maps is denoted byPos-S. ClearlyS itself is anS-poset with its operation as the action. Also, ifB is a non-empty subposet ofA,then B is called a subS-posetofAif bsB,for allsS

and bB. Throughout this paper we deal with the pomonoid S and the category Pos-S, unless otherwise stated. For more information on

S-posets see [5] or [8].

2. Weak factorization system

(4)

factor-ization systems by weakening the unique diagonalfactor-ization property to the diagonalization property without uniqueness. However, the basic examples of weak factorization systems are fundamentally different from the basic examples of factorization systems.

Here, we introduce from [1] the notion which we deal with in the paper.

Notation. We denote by the relationdiagonalization propertyon the

class of all morphisms of a category C: given morphisms l:AB and

r:CDthen

lr

means that in every commutative square

A //

l

C

r

B

d

>

>

/

/D

there exists a diagonald:BC rendering both triangles commutative. In this case, l is also said to have the left lifting propertywith respect to

r (and r to have the right lifting propertywith respect tol). Let Hbe a class of morphisms. We denote by

H ={r|r has the right lifting property with respect to each l∈ H}

and

H={l|lhas the left lifting property with respect to each r∈ H}. LetDbe an object inCandHD be the class of those morphisms inC/D

whose underlying morphism inClies in H. Now, r:CD∈ H if and only ifr is anHD-injective object in C/D. Dually, all morphisms in H are characterized by a projectivity condition inHD.

Recall from [1] that aweak factorization systemin a category is a pair (L,R) of morphism classes such that:

(1) every morphism has a factorization as an L-morphism followed by an

R-morphism,

(2) R=L and L= R.

Remark 2.1. If we replace “” by “⊥” where “⊥” is defined via the

(5)

one diagonal), we arrive at the familiar notion of a factorization system in a category. Factorization systems are weak factorization systems. For instance, letE be the class of allS-poset epimorphisms. Then, by Theo-rem 1 of [5] one can easily seen that (E, Emb) inPos-S is a factorization system.

Now, consider a functor G :AX. Recall from [1] that a source (A fi

Ai)iI inAis called G-initial provided that for each source (B gi

Ai)iI in A and each X-morphism h : GBGA with Ggi = Gfih

for eachiI, there exists a uniqueA-morphism ¯h:BA in A with

Gh¯=h andgi =fi◦¯hfor each iI.

Also, a source (Af¯i Ai)iI lifts a G-structured source (X fi

GAi)iI

provided thatGf¯i =fi for eachiI.

Definition 2.2. (cf. [1]) A functor G:AX in the category Cat(of

all categories and functors) is topological if every G-structured source (Xfi GAi)iI has a uniqueG-initial lift (A

¯

fi

Ai)iI.

Example 2.3. (1) In the categorySet(of all sets and functions between

them) pair(M ono, Epi) is a weak factorization system. But(Epi, M ono) is a factorization system in this category, whereM ono is the class of all one-to-one maps andEpi is the class of all surjective maps.

(2) The pair(F ull, T op) is a weak factorization system in the category

Cat, whereF ull is the class of those morphisms in Catthat are full and

T opis the class of those morphisms inCat that are topological.

(3) In the category Pos of all posets with monotone maps, the pair (Emb, T op)is a weak factorization system, where Emb is the class of all order-embeddings; that is, maps f : AB for which f(a) 6 f(a) if and only ifa6a

, for alla, a

A andT op is the class of all topological monotone maps. For more details of the proof see [1].

We record the following two results from [1], that will be used later on.

Proposition 2.4. LetCbe a category andHa class of morphisms closed

under retracts in arrow-category C

. Then the following conditions are equivalent:

(1) (H,H) is a weak factorization system;

(2) for all objects B of C, the slice category C/B has enough HB -injectives.

Proposition 2.5. Let Cbe a category. Then (L,R) is a weak

(6)

(1) Any morphism hC has a factorization h =gf with f ∈ L and

g∈ R.

(2) For all f ∈ L andg∈ R, f has the left lifting property with respect tog.

(3) If f :AB and f

:XY are such that there exist morphisms

α:BY and β:AX then

(a) If αf ∈ L and ifα is a split monomorphism then f ∈ L. (b) If f

β ∈ R and if β is split epimorphism thenf

∈ R.

Iff :AB andg:ACare morphisms in a categoryCsuch that there exist morphisms α:CB andβ :BC withβα= 1C,αg =f

andβf =g then we say that g is aretractof f. In categorical terms,g

is a retract of f in the coslice categoryA/C.

Notice that in 3(a) above, f is a retract of αf and that all retracts can be written in this way. So this result is simply saying that L is closed under retracts. Similarly3(b)is equivalent toRbeing closed under retracts.

Recently, Bailey and Renshaw in [2], provide a number of examples of weak factorization systems for S-acts such as the following theorem. But first we need a definition. Following [2] anS-act (S-poset) monomorphism

f : XY is unitary if y ∈ im(f) whenever ys ∈ im(f) and sS. Notice that in the case ofS-acts, it is clear this is equivalent to saying that there exists anS-actZ such thatY ∼=X∪˙Z (the disjoint union of

X andZ) or in other words, im(f) is a direct summand ofY, while in the other case this is not true (see Remark 3.3 below).

Theorem 2.6. Let S be a monoid and let U be the class of all unitary

S-monomorphisms and SplitEpi be the class of all splitS-epimorphisms. Then (U, SplitEpi) is a weak factorization system in Act-S.

3. Weak factorization systems via down and up-closed embeddings

Now, consider Emb as the class of all embeddingS-poset maps. We try to provide a weak factorization system forPos-S withEmbas the left part. In this section, we consider down and up-closed embeddings, briefly du-closed embeddings, as a subclass ofEmband find a weak factorization system inPos-S with some conditions on pomonoid S.

(7)

Proposition 3.1. If Sum is stable under pullback in C, then (Sum, SplitEpi) is a weak factorization system inC.

Proposition 3.2. Let S be an arbitrary pomonoid. Then the class of all

unitary monomorphisms in Pos-S is stable under pullback in Pos-S.

Proof. Let

Z f′ //

g

Y

g

X

f //Y

be a pullback inPos-S, where f :XY is unitary andg:YY is anS-poset map. Suppose thatyYis such thatysim(f) for some

sS. Then there is an elementzZ withf

(z) =y

s, and we have:

f(g

(z)) = (f g

)(z) = (gf

)(z) =g(f

(z)) =g(y

s) =g(y′ )s.

Thusg(y

)s∈imf and sincef is assumed to be unitary, one concludes thatg(y) imf. Thus g(y) = f(x) for some x X and since Z is a pullback of f and g, it follows that there is a unique element z0 ∈ Z

such thatf

(z0) =y′ and g′(z0) =x. In particular, y′∈imf′. Thus f′ is

unitary.

Remark 3.3. Note that the assertion ‘any unitary monomorphism in

Pos-S is just coproduct injection’ is not true, in general. For instance, consider the trivial caseS ={1}, then we have Pos-S=Pos and so any injective monotone map trivially is unitary. Next, let A = {0,1} be a poset with two elements 0 and 1 and with061and let{0}be a discrete poset with only one element 0. Then the map{0} →Athat takes 0 to 0 is monotone and injective. ButA={061}is not a coproduct of{0}and

{1}, since {0}∪{˙ 1} ={0,1} with discrete ordering, while A ={061}

has a nontrivial ordering on it.

Definition 3.4. A possibly empty subS-posetAof anS-posetB is said

to bedown-closed(up-closed) inB if for eachaA andbB withb6a

(a6b) we have bA. By adu-closed embedding, we mean an embedding

S-poset mapf :AB such that imf is both down-closed and up-closed subS-poset ofB.

Proposition 3.5. Let S be an arbitrary pomonoid. Then the class D

(8)

Proof. Let

Z f′ //

g

Y

g

X

f //Y

be a pullback in Pos-S, where f ∈ D (resp. f ∈ U) and g : Y

Y

is an S-poset map. Suppose that yYis such that y6f(x) (resp.

y> f(x)) for some x imf. Then g(y) 6 gf(x) = f g(x) (resp.

g(y

)>gf

(x) =f g

(x)), and since f is assumed to be down-closed (resp. up-closed), we conclude thatg(y

)∈imf.Thus there is an elementx

X

with f(x) =g(y). But since Z is a pullback of f andg, it follows that there is a unique element zZ such that f

(z) =y

andg

(z) =x. In particular,y

∈imf

. Thus f

is down-closed (resp. up-closed). A corollary follows immediately:

Corollary 3.6. LetS be an arbitrary pomonoid. Then the class DU of

all du-closed embeddings is stable under pullback inPos-S.

Now, we prove the following crucial lemma in the category Pos-S.

Lemma 3.7. Letf :AB be a du-closed S-poset embedding. Then f

is a unitary if and only ifimf is a direct summand of B.

Proof. Let f be a unitary monomorphism. First we show thatimf and

B\imf are twoS-posets. These areS-acts because of the unitary property of f. Now, consider a, bB with a6b. Ifa∈imf, since imf is an up-closed subset in B sob∈imf. This givesa6b inimf. Also, if a /∈imf

then we have b /∈imf; in fact b ∈imf implies that a∈ imf as imf is down-closed, which is a contradiction. Soa6bin B\imf. Hence ifa6b

in B, thena6bin imf∪˙(B\imf). Now ifa6b inimf∪˙(B\imf), then by definition of order on the coproduct, we havea6b inimf ora6bin

B\imf. Since the order on imf and B\imf is inherent from B, then

a6binB. Consequently we get

a6binB ⇐⇒ a6binimf∪˙(B\imf).

Hence B = imf∪˙(B\imf). The converse is trivially true by definition of unitary monomorphism.

(9)

Proposition 3.8. Let S be an arbitrary pomonoid. Then DUU =Sum.

Combining Propositions 3.2, 3.8 and Corollary 3.6 gives

Proposition 3.9. LetS be an arbitrary pomonoid. Then Sumis stable

under pullback in Pos-S.

It then follows from Propositions 3.1 and 3.9 that

Theorem 3.10. Let S be a pomonoid. Then(Sum, SplitEpi) is a weak

factorization system in Pos-S.

Next we state two useful results.

Lemma 3.11. Let S be a pomonoid whose identity element e is the

bottom element (resp. the top element) andf :XY be an S-poset map. If imf is a down-closed (resp. up-closed) subset ofY, then f is unitary.

Proof. Supposeeis the bottom element of S. We show that if y∈imf

wheneverys∈imf andsS. In fact, by hypothesis we havee6s and we get y 6ys, for everyyY andsS. Now, as imf is down-closed andys∈imf then havey∈imf. The other case is similar.

By Proposition 3.8 and Lemma 3.11, we deduce

Proposition 3.12. Let S be a pomonoid such that its identity element

is either the bottom or top element. Then DU =DUU, and henceSum=

DU.

Proposition 3.13. If S is a pogroup, then any morphism in Pos-S is

unitary.

Proof. Consider any morphism f :XY inPos-S and suppose that

yY is such thatys ∈imf for some sS. Thenys =f(x) for some

xX and we have:

y = (ys)s−1 =f(x)s−1=f(xs−1)

proving thaty∈imf. Thusf is unitary.

Proposition 3.14. If S is a pogroup, then DU = DUU, and hence

Sum=DU.

(10)

Next, combining Propositions 3.12 and 3.14 with Theorem 3.10, we get the following result.

Theorem 3.15. Suppose that

(i) S is a pogroup, or

(ii) the identity element of S is the bottom element, or (iii) the identity element of S is the top element,

Then (DU, SplitEpi) is a weak factorization system in Pos-S.

Recall that each poset can be embedded (via an order-embedding) into a complete poset, called the Dedekind-MacNeille completion. In fact, given a posetP, its MacNeille completion is the poset P¯ consisting of all subsets Aof P for which LU(A) =A,where

U(A) ={xP :x>a,aA}

and

LU(A) ={yP :y6x,xU(A)},

and the embedding ↓(−) :PP¯ is given by

a7→↓a={xP :x6a}

for everyaP (see [3]).

Notice that in the category Pos-S/B, regular monomorphisms corre-spond to regular monomorphisms inPos-S and these are exactly order-embeddings (inPos-S) (see [5, 9]). We state the following theorem which gives us enough Emb-injectivity property in Pos-S/B. For details of the proof see [9].

Theorem 3.16. For an arbitraryS-poset B, the category Pos-S/B has

enough regular injectives. More precisely, each object f : AB in

Pos-S/B can be regularly embedded into a regular injective object πBA¯(S) : ¯

A(S)×B B in Pos-S/B in which A¯(S) is the set of all monotone

maps from S into A¯, with pointwise order and the action is given by (f s)(t) = f(st) for s, tS and fA¯(S) and πBA¯(S) : ¯A(SBB is the second projection.

It is easy to show that the class Emb is closed under retracts in

(11)

Up to now, we can not succeed to determine if there is a classRsuch that(Emb,R) is a weak factorization system inPos-S. However we do have:

Proposition 3.17. LetS be a pomonoid. Suppose (Emb,R) is a weak

factorization system in Pos-S. ThenR ⊆SplitEpi.

Proof. Since SumEmb, it follows that Emb Sum. But since (Sum, SplitEpi)is a weak factorization system inPos-Sby Theorem 3.10,

one has thatSum=SplitEpi. Thus

R=EmbSplitEpi.

4. Fibrewise regular injectivity of S-poset maps

In the previous section, we deduced that every Emb-injective object inPos-S/B is a split epimorphism in Pos-S (see Proposition 3.17). In this section, we are going to characterize them using a fibrewise notion of complete posets. (A poset is said to becompleteif each of its subsets has an infimum and a supremum.)

We recall [14] that in the category Posof partially ordered sets and monotone maps, anEmb-injective monotone map can be characterized as follows:

Theorem 4.1. A monotone mapf :XB is Emb-injective inPos/B

if and only if it satisfies the following conditions: (I) f−1(b) is a complete poset, for every bB;

(II) f is a fibration (that is, for every xX and bB withf(x)6b,

{xf−1(b) |x6x} has a minimum element) and a cofibration (=dual of fibration).

By [6, Theorem 1.2] we have:

Theorem 4.2. Let S be a pomonoid. Then f : XB is a regular

injective object in Pos-S/B if and only if the following two conditions hold:

(1) h1X, fi:fπXB is a section in Pos-S/B where πBX :X×BB

is the second projection;

(2) the objectS(f)of sections off is a regular injective object inPos-S.

Remark 4.3([9]). For a pomonoidS, the category Pos-S is cartesian

(12)

BA is given by BA= HomPos-S(S×A, B), the set of all S-poset maps

from the productS-poset S×A to B. (Note that the action on S×A

operates on both components.) This set is an S-poset, with pointwise order and the action is given by (f·s)(t, a) =f(st, a) forfBA, aA

and s, tS (see [5, 11]). Now, givenf :XB inPos-S/B we have

S(f) ={h∈HomPos-S(S×B, X) | f h=πBS}.

Moreover, ifB has the trivial action, then we get the following embedding induced by fibres off:

m:S(f)֌ Y

bB

f−1(b) given by m(h) = (h(s, b))

sS,bB

Now, we supply a partial answer to the characterization of regular injectivity in the category Pos-S/B in a special case, when theS-poset

B has the trivial action.

First recall the following result from [9].

Proposition 4.4. Let S be a pomonoid. If f : XB is a regular

injective object in the category Pos-S/B, then: (1) h1X, fi:fπBX is a section inPos-S/B.

(2) for every bB, the sub S-posetf−1(b) of X is a regular injective

object inPos-S, so it is a complete poset.

In this section, we are going to give a new characterization of injective objects inPos-S/B that removes condition (1) of the above proposition.

Proposition 4.5. Let S be a pomonoid and f : XB be a S-poset

map. Ifh1X, fi:fπXB is a section in Pos-S/B then for everyxX

andbB withf(x)6b, the poset{xf−1(b)|x6x}has a minimum element.

Proof. Let r :X×BX be a retraction of h1X, fi over B. For every

xX and bB with f(x)6b, let r(x, b) =xb.Then we have

x=r(x, f(x))6r(x, b) =xb,

soxb ∈ {x′ ∈f−1(b)|x6x′}.Also, take x′ inf−1(b) withx6x′ then

xb =r(x, b)6r(x, b) =x.

(13)

Corollary 4.6. LetSbe a pomonoid andf :XB be a regular injective

S-poset map. Then

(i) for every bB, the sub S-poset f−1(b) of X is regular injective

object in Pos-S, so it is a complete poset;

(ii) for xX and bB with f(x) 6b, {xf−1(b) | x 6x} has a minimum element xb (also we have the dual of this fact).

Proof. Applying Proposition 4.4 and the above proposition we get the result.

Now, we consider the categoryPos-S as a sub category of Cat. On the other words, every S-poset is a category as a poset and all action-preserving monotone maps are functors. Further, by atopologicalS-poset functorwe mean anS-poset map which is topological as a functor. So we get the following result.

Theorem 4.7. Every regular injective object in Pos-S/B is a topological

S-poset functor.

Proof. First by Corollary 4.6 and Theorem 4.1, one concludes that every regular injective object inPos-S/Bis a regular injective object inPos/B. Then, part (3) of Example 2.3, implies that inPos, (Emb) =T op, and we get the result.

Our next goal is to prove the converse of the above fact in a special case whereS is a pogroup. But first we record a well known result.

Theorem 4.8. Let A F //B

U

o

o with FU be an adjunction. Then for

anyB ∈ B, one has an adjunctionFBUB,whereFB:A/U(B)→ B/B,

and UB :B/B→ A/U(B),are such that

UB(f :XB) = (U(f) :U(X)→U(B)),and

FB(g:YU(B)) = (F(Y) F(g)

F U(B)ǫB

B)

In light of [5, Theorem 12], the following result is a particular case of Theorem 4.8, but for the convenient of the reader we give a proof here.

Theorem 4.9. The functor GB : Pos/BPos-S/B which assigns

(14)

Proof. Define the functor HB :Pos-S/BPos/B given byHB(h) =

¯

h :A/θAB with ¯h([a]) = h(a) for every object h : AB in Pos

-S/B, where the poset A/θA was introduced in [5, Theorem 12] and ¯h

is a monotone map. If g : AC is an S-poset map over B, then

HB(g) :A/θAC/θC defined byHB(g)([a]) = [g(a)],is a well-defined

monotone map over B. The unit of this adjunction

A ηf //

f

A/θA

GBHB(f)

|

|

B

for an objectf :AB inPos-S/B, is the canonical S-poset map over

B, i.e, ηf =π. It is a universal arrow toGB because for a given S-poset

maph such that the diagram

A h //

f

P

GB(l)=l





B

commutes, wherel:PB is a monotone map, we have a uniqueS-poset maph¯ as in the following diagram

A/θA

¯

h /

/

HB(f)

"

"

P

l





B

(4.1)

given by h¯([a]) = h(a). By a similar proof as in [5, Theorem 12] one can prove that ¯h is a well-defined S-poset map. The diagram (4.1) is commutative, since for every [a]∈A/θAwe have:

lh[a]) =l(h(a)) =f(a) = ¯f[a] =HB(f)[a].

Theorem 4.10. LetS be a pogroup. Then all topologicalS-poset functors

are regular injective as S-poset maps with trivial action.

Proof. By an analogue proof as in [7, Theorem 4.6], we can show that the functor HB :Pos-S/BPos/B preserves order-embeddings, these

are the regular monomorphisms in two categories Pos-S/B and Pos-S. Therefore, by [9, Lemma 3.2] and the adjunction as mentioned in Proposi-tion 4.9, the functor GB : Pos/BPos-S/B preserves regular injective

(15)

Acknowledgments

The authors are very grateful to the anonymous referee for reading the paper at least twice and giving very helpful suggestions.

References

[1] Adamek, J., Herrlich, H., Rosicky, J., Tholen, W.:Weak factorization systems and topological functors, Appl. Categ. Structures, Vol. 10, no. 1, (2002), 237-249. [2] Bailey, A., Renshaw, J.:Weak factorization system forS-acts, Semigroup Forum

89, (2014), 52-67.

[3] Banaschewski, B., Bruns, G.:Categorical characterization of the MacNeille com-pletion, Arch. Math. XVIII 18, (1967), 369-377.

[4] Banaschewski, B.: Injectivity and essential extensions in equational classes of algebras.Queen’s Pap. Pure Appl. Math. 25, (1970),131-147.

[5] Bulman-Fleming, S., Mahmoudi, M.:The category ofS-posets, Semigroup Forum 71(3), (2005), 443-461.

[6] Cagliari, F., Mantovani, S.:Injectivity and sections, J. Pure Appl. Algebra 204, (2006), 79-89.

[7] Ebrahimi, M.M., Mahmoudi, M., Rasouli, H.:Banaschewski’s theorem forS-posets: regular injectivity and completeness. Semigroup Forum, (2010), 313-324.

[8] Fakhruddin, S.M.:On the category ofS-posets, Acta Sci. Math. (Szeged) 52, (1988), 85-92.

[9] Farsad, F., Madanshekaf, A.:Regular Injectivity and Exponentiability in the Slice Categories of Actions of Pomonoids on Posets, J. Korean Math. Soc. 52 (2015),

No. 1, 67-80.

[10] Kilp, M., Knauer, U., Mikhalev, A.:Monoids, Acts and Categories, de Gruyter, Berlin (2000)

[11] Madanshekaf, A., Tavakoli, J.:Tiny objects in the category ofM-Sets, Ital. J. Pure Appl. Math. (2001), 10, 153-162.

[12] Rosicky, J.:Flat covers and factorizations, J. of Alg., (2002) 253, 1-13.

[13] Rosický, J., Tholen,W.:Factorization, fibration and torsion.J. Homotopy Relat. Struct. 2(2), (2007), 295–314.

[14] Tholen, W.:Injectives, exponentials, and model categories.In: Abstracts of the Int. Conf. on Category Theory, Como, Italy, (2000), 183-190.

C o n tac t i n f o r m at i o n

F. Farsad, A. Madanshekaf

Department of Mathematics, Faculty of Mathe-matics, Statistics and Computer Science, Semnan University, P. O. Box 35131-19111, Semnan, Iran

E-Mail(s):[email protected], [email protected]

References

Related documents

David (1999) was amazed at the change in roles she experienced when she switched from her role as a reading specialist to that of a literacy coach. For the past 15 years, I have

As long as the table space is in backup mode Oracle will write the entire block is dumped to redo when the ALTER TABLESPACE TBSNAME BEGIN BACKUP MODE is entered but later

1 Spatial planning of public charging points using multi-dimensional analysis of early adopters of electric vehicles for a city region..

NIST defines cloud computing as [1] “a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, servers,

With liquid on the surface, a developing atmosphere, warm but cooling crust and continents starting to materialise, by the mid-Archean (approximately 3.5 billion years

The present study investi- gated spoken word learning with and without signs in two groups of children without sign language knowledge: one group of DHH children, for whom

The college administrators and business leaders need to understand five main strategies influencing their success in reducing employee turnover: (a) transformational leadership,

chdir — changes Scilab current directory Files : Input/Output functions find — find indices of boolean vector or matrix true elements Boolean. bool2s — convert boolean matrix to a