arXiv:1608.00959v2 [math.GR] 10 Nov 2017 atsae ar pc,dsrt space. discrete space, Baire space, pact ffrany for if hc aseeyelement every maps which omttv eiru fidempotents. of commutative a then y ,β α, h olwn eiru operation: semigroup following the ymti nes eiru a nrdcdb anr[4 n tpla it and [44] Wagner by introduced . was semigroup inverse symmetric q eiru scmltl 0)sml fadol fi osntcnanteb the contain [35]. not semigroups does stable it into if sem embed only of and not theory if r does simple Andersen’s algebraic (0–) O. the completely well-known in is the semigroup role example For important an semigroups. plays topological it and semigroup order a n subset Any nyif only group · ujce nyt h condition the to only subjected in NSMTPLGCLBCCI XESOSO IERYORDERE LINEARLY OF EXTENSIONS BICYCLIC SEMITOPOLOGICAL ON esalflo h emnlg f[4 8 0 4 3 0 41]. 40, 33, 24, 20, 18, [14, of terminology A the follow shall We e od n phrases. and words Key 2010 Date o semigroup a For Let h iylcmonoid bicyclic The eal[4 hta that [24] Recall ae by Later g ∈ 6 semigroup S E 6 coe ,2018. 8, October : G I I ahmtc ujc Classification. Subject Mathematics iceesbpc fayHudr eioooia eiru whic semigroup semitopological Hausdorff any of subspace discrete o-mt shift-set non-empty a rv htfra rirr ierynndneyodrdgroup ordered non-densely linearly arbitrary an for that prove semigroup Abstract. vr hf-otnosHudr topology Hausdorff shift-continuous every feutoso h semigroup the on equations of ,y z y, x, 1) ( x b scle the called is nohrwrs h iayrelation binary the words, other in ; S − X X · scle the called is scoe ne utpiainadw hl ee to refer shall we and multiplication under closed is ) 1 G g x h semigroup The . eoetesto l ata n-ooetasomtoso nin an of transformations one-to-one partial all of set the denote · e + P and ∈ y ∈ ednt h dniyo group a of identity the denote we · fagroup a of ∈ S G A sannepystwt iayascaieoeain semigroup A operation. associative binary a with set non-empty a is g P B + hr xssaunique a exists there with · o ieryodrdgroup ordered linearly a For o which for ) ( ⊆ A a atal ree group ordered partially S inverse .I atclr eso htfra rirr onal ieryor linearly countable arbitrary an for that show we particular, In ). 6 G oiiecone positive x < y by + eiru,smtplgclsmgop oooia eiru,bicy semigroup, topological semigroup, semitopological Semigroup, g C 2) ; G · E ( A b ,q p, x I . htstse h odtos1–)idcsaprilodron order partial a induces 1)–3) conditions the satisfies that ( of S of eget we of X stesmgopwt h dniy1gnrtdb w elements two by generated 1 identity the with semigroup the is ) P ednt h e fieptnsin idempotents of set the denote we ) LGGTKADKTRN MAKSYMYK KATERYNA AND GUTIK OLEG G G 1. x scle the called is S + stepstv oe lmnso h set the of Elements cone. positive the is vr ar shift-continuous Baire every n sdntdby denoted is and nrdcinadpreliminaries and Introduction B oisinverse its to ∩ rthe or , pq x ( ( x A · G ( y .Tebcci oodi obntra bisimple combinatorial a is monoid bicyclic The 1. = 21,2M8 20M20. 20M18, 22A15, fsit fpstv oe of cones positive of shifts of ) αβ y − + 1 ) ∈ − ( = ) · 1 z sagop( group a is nerlpart integral S τ G ymti nes semigroup inverse symmetric = ∈ ntesemigroup the on uhthat such 6 GROUPS e sdfieasubset a define us let { xα A G e x a h rpryta,frall for that, property the has edsrb h aua ata re n solutions and order partial natural the describe We . } − h set The . ) n 3) and ; 1 β 1 scle the called is x if − G, x of , 1 x h a endo nivresemigroup inverse an on defined map The . · ∈ qipdwt rnlto-nain partial translation-invariant a with equipped ) · T y G 1 G dom( -topology B · + n tstse h properties: the satisfies it and x ( x A E = G − = sdsrt,adhne( hence and discrete, is ) contains h αβ 1 ( inversion A n o-mt shift-set non-empty a and { S A · x esuytplgztoso the of topologizations study We . x sthe as ) G = ) ⊆ and ∈ τ + sl 1 ttsta 0)simple (0–) a that states [1] esult S G on G · If . samjrrl nteter of theory the in role major a ys { x ob a be to y : y B G vrteset the over B gop n nteter of theory the in and igroups . ⊆ e · cci ood h bicyclic The monoid. icyclic ∈ ( + ( adof band x A S 6 A nt set finite G { \ sdsrt.As we Also discrete. is ) dom · sasubsemigroup. a as ) ,b g b, a, sa nes semigroup, inverse an is + x y ee group dered } shift-set e lcetnin oal com- locally extension, clic o each for = } naprilyordered partially a in α r called are y : S ∈ uha element an Such . B S yα X A . X G ( scalled is A G ffrany for if se[8) The [18]). (see if , ) ∈ A oehrwith together x τ , semilattice ( G x ∈ dom of sa is ) a and 6 G. positive F G 6 , -inverse y inverse β b p fand if } then for , D and . S is 2 OLEG GUTIK AND KATERYNA MAKSYMYK

A linearly ordered or totally ordered group is an ordered group G whose order relation 6 is total (see [13] and [17]). From now on we shall assume that G is a non-trivial linearly ordered group. For every g ∈ G the set G+(g)= {x ∈ G: g 6 x}. The set G+(g) is called a positive cone on element g in G. g For arbitrary elements g, h ∈ G we consider a partial map αh : G⇀G defined by the formula g −1 + (x)αh = x · g · h, for x ∈ G (g). g We observe that Lemma XIII.1 from [13] implies that for such partial map αh : G⇀G the restriction g + + αh : G (g) → G (h) is a bijective map. We consider the semigroups B g B+ g + (G)= {αh : G⇀G: g, h ∈ G} and (G)= {αh : G⇀G: g, h ∈ G }, endowed with the operation of the composition of partial maps. Simple verifications show that g k a −1 −1 (1) αh · αl = αb , where a =(h ∨ k) · h · g and b =(h ∨ k) · k · l, for g,h,k,l ∈ G, and by h∨k we denote the join of h and k in the linearly ordered set (G, 6). Therefore, property 1) of the positive cone and condition (1) imply that B(G) and B+(G) are subsemigroups of IG. By Proposition 1.2 in [28] for a linearly ordered group G the following assertions hold: g h B B+ (i) elements αh and αg are inverses of each other in (G) for all g, h ∈ G (resp., (G) for all g, h ∈ G+); g B B+ (ii) an element αh of the semigroup (G) (resp., (G)) is an idempotent if and only if g = h; + (iii) B(G) and B (G) are inverse subsemigroups of IG; B B+ + + + (iv) the semigroup (G) (resp., (G)) is isomorphic to the set SG = G×G (resp., SG = G ×G ) with the following semigroup operation: (c · b−1 · a, d), if b c,  where a,b,c,d ∈ G (resp., a,b,c,d ∈ G+). It is obvious that: (1) if G is isomorphic to the additive group of integers (Z, +) with usual linear order 6 then the semigroup B+(G) is isomorphic to the bicyclic monoid C (p, q) and the semigroup B(G) is isomorphic to the extended bicyclic semigroup CZ (see [21]); (2) if G is the additive group of real numbers (R, +) with usual linear order 6 then the semigroup B 2 B+ 1 (G) is isomorphic to B(−∞,∞) (see [36, 37]) and the semigroup (G) is isomorphic to B[0,∞) (see [2, 3, 4, 5, 6]), and (3) the semigroup B(G) is isomorphic to the semigroup S(G) which is defined in [22, 23]. In the paper [28] semigroups B(G) and B+(G) are studied for a linearly ordered group G. That paper describes Green’s relations on B(G) and B+(G) and their bands, and shows that these are bisimple. Also in [28] it is proved that for a commutative linearly ordered group G all non-trivial congruences on the semigroups B(G) and B+(G) are group congruences if and only if the group G is Archimedean; and the structure of group congruences on the semigroups B(G) and B+(G) is described. In this paper we present more general construction than the semigroups B(G) and B+(G). Namely, for a linearly ordered group G let us define a subset A ⊆ G to be a shift-set if for any x, y, z ∈ A with y < x we get x · y−1 · z ∈ A. For any shift-set A ⊆ G let B(A)= αa : G+(a) → G+(b): a, b ∈ A  b ON SEMITOPOLOGICAL BICYCLIC EXTENSIONS OF LINEARLY ORDERED GROUPS 3 be the semigroup of partial bijections defined by the formula a −1 + (x)αb = x · a · b, for x ∈ G (a).

The semigroup B(A) is isomorphic to the semigroup SA = A × A endowed with the binary operation defined by formula (2). For A = G the semigroup B(A) coincides with B(G) and for A = G+ it coincides with the semigroup B+(G). Later in this paper for a non-empty shift-set A ⊆ G we identify the semigroup B(A) with the semigroup SA endowed with the multiplication defined by formula (2). We observe that B(A) is an inverse subsemigroup of B(G) for any non-empty shift-set A of a linearly ordered group G. Moreover, the results of [28] imply that an element (a, b) of B(A) is an idempotent iff a = b, and (b, a) is inverse of (a, b) in B(G). We recall that a topological space X is said to be • locally compact, if every point x ∈ X has an open neighbourhood with the compact closure; • Cech-completeˇ , if X is Tychonoff and X is a Gδ-set in its the Cech-Stoneˇ compactification; ∞ • Baire, if for each sequence A1, A2,...,Ai,... of open dense subsets of X the intersection i=1 Ai is dense in X. T Every Hausdorff locally compact space is Cech-complete,ˇ and every Cech-completeˇ space is Baire (see [20]). A semitopological (topological) semigroup is a topological space with a separately continuous (jointly continuous) semigroup operation. A topology τ on a semigroup S is called: • semigroup if (S, τ) is a topological semigroup; • shift-continuous if (S, τ) is a semitopological semigroup. The bicyclic monoid admits only the discrete semigroup Hausdorff topology and if a topological semigroup S contains it as a dense subsemigroup then C (p, q) is an open subset of S [19]. We observe that the openness of C (p, q) in its closure easily follows from the non-topologizability of the bicyclic monoid, because the discrete subspace D is open in its closure D in any T1-space containing D. Bertman and West in [12] extended this result for the case of Hausdorff semitopological semigroups. Stable and Γ-compact topological semigroups do not contain the bicyclic monoid [7, 34]. The problem of embedding the bicyclic monoid into compact-like topological semigroups was studied in [8, 9, 30]. Independently Taimanov in [42] constructed a semigroup Aκ of cardinality κ which admits only the discrete semigroup topology. Also, Taimanov [43] gave sufficient conditions on a commutative semigroup to have a non-discrete semigroup topology. In the paper [26] it was showed that for the Taimanov semigroup Aκ from [42] the following conditions hold: every T1-topology τ on the semigroup Aκ such that (Aκ, τ) is a topological semigroup is discrete; for every T1-topological semigroup which contains Aκ as a subsemigroup, Aκ is a closed subsemigroup of S; and every homomorphic non-isomorphic image of Aκ is a zero-semigroup. Also, in the paper [21] it is proved that the discrete topology is the unique shift-continuous Hausdorff topology on the extended bicyclic semigroup CZ. Also, for many (0-) bisimple semigroups of transformations S the following statement holds: every shift-continuous Hausdorff Baire (in particular locally compact) topology on S is discrete (see [15, 16, 29, 31, 32]). In the paper [39] Mesyan, Mitchell, Morayne and P´eresse showed that if E is a finite graph, then the only locally compact Hausdorff semigroup topology on the graph G(E) is the discrete topology. In [11] it was proved that the conclusion of this statement also holds for graphs E consisting of one vertex and infinitely many loops (i.e., infinitely generated polycyclic ). Amazing dichotomy for the bicyclic monoid with adjoined zero C 0 = C (p, q) ⊔{0} was proved in [25]: every Hausdorff locally compact semitopological bicyclic monoid C 0 with adjoined zero is either compact or discrete. The above dichotomy was extended by Bardyla in [10] to locally compact λ-polycyclic semitopological monoids and to locally compact semitopological interassociates of the bicyclic monoid [27]. For a linearly ordered group G and a non-empty shift-set A of G, the natural partial order and solutions of equations on the semigroup B(A) are described. We study topologizations of the semigroup 4 OLEG GUTIK AND KATERYNA MAKSYMYK

B(A). In particular, we show that for an arbitrary countable linearly ordered group G and a non-empty shift-set A of G, every Baire shift-continuous T1-topology τ on B(A) is discrete. Also we prove that for an arbitrary linearly non-densely ordered group G and a non-empty shift-set A of G, every shift- continuous Hausdorff topology τ on the semigroup B(A) is discrete, and hence (B(A), τ) is a discrete subspace of any Hausdorff semitopological semigroup which contains B(A) as a subsemigroup. 2. Solutions of some equations and the natural partial order on the semigroup B(A) It is well known that every inverse semigroup S admits the natural partial order: s 4 t if and only if s = et for some e ∈ E(S). This order induces the natural partial order on the semilattice E(S), and for arbitrary s, t ∈ S the following conditions are equivalent: (3) (α) s 4 t; (β) s = ss−1t; (γ) s = ts−1s, (see [38, Chapter 3].) Proposition 2.1. Let G be a linearly ordered group and A be a non-empty shift-set in G. Then the following assertions hold: (i) if (g,g), (h, h) ∈ E(B(A)) then (g,g) 4 (h, h) if and only if g > h in A; (ii) the semilattice E(B(A)) is isomorphic to A, considered as a ∨-semilattice under the isomor- phisms i: E(B(A)) → A, i: (g,g) 7→ g; (iii) (g, h)R(k,l) in B(A) if and only if g = k in A; (iv) (g, h)L (k,l) in B(A) if and only if h = l in A; (v) (g, h)H (k,l) in B(A) if and only if g = k and h = l in A, and hence every H -class in B(A) is a singleton; (vi) B(A) is a bisimple semigroup and hence it is simple. Proof. Assertions (i) and (ii) are trivial, (iii) − (v) follow from Proposition 2.1 of [28] and Proposi- tion 3.2.11 of [38] and (vi) follows from Proposition 3.2.5 of [38].  Later we need the following lemma, which describes the natural partial order on the semigroup B(A): Lemma 2.2. Let G be a linearly ordered group and A be a non-empty shift-set in G. Then for arbitrary elements (a, b), (c,d) ∈ B(A) the following conditions are equivalent: (i) (a, b) 4 (c,d) in B(A); (ii) a−1 · b = c−1 · d and a > c in A; (iii) b−1 · a = d−1 · b and b > d in A. Proof. (i) ⇒ (ii) The equivalence of conditions (α) and (β) in (3) implies that (a, b) 4 (c,d) in B(A) if and only if (a, b)=(a, b)(a, b)−1(c,d). Therefore we have that (c · a−1 · a, d), if a c.  This implies that (c,d), if a c, and hence the condition (a, b) 4 (c,d) in B(A) implies that a−1 · b = c−1 · d and a > c in A. (ii) ⇒ (i) Fix arbitrary (a, b), (c,d) ∈ B(A) such that a−1 · b = c−1 · d and a > c in A. Then we have that (a, b)(a, b)−1(c,d)=(a, b)(b, a)(c,d)=(a, a)(c,d)=(a, a · c−1 · d)=(a, b), and hence (a, b) 4 (c,d) in B(A). The proof of the equivalence (ii) ⇔ (iii) is trivial.  ON SEMITOPOLOGICAL BICYCLIC EXTENSIONS OF LINEARLY ORDERED GROUPS 5

The definition of the semigroup operation in B(A) implies that (a, b)=(a, c)(c,d)(d, b) for arbitrary elements a,b,c,d of A. The following two propositions give amazing descriptions of solutions of some equations in the semigroup B(A). Proposition 2.3. Let G be a linearly ordered group, A be a non-empty shift-set in G and a,b,c,d be arbitrary elements of A. Then the following conditions hold: (i) (a, b)=(a, c)(x, y) for (x, y) ∈ B(A) if and only if (c, b) 4 (x, y) in B(A); (ii) (a, b)=(x, y)(d, b) for (x, y) ∈ B(A) if and only if (a, d) 4 (x, y) in B(A); (iii) (a, b)=(a, c)(x, y)(d, b) for (x, y) ∈ B(A) if and only if (c,d) 4 (x, y) in B(A). Proof. (i) (⇒) Suppose that (a, b)=(a, c)(x, y) for some (x, y) ∈ B(A). Then we have that (a, c · x−1 · y), if c > x;  (a, c)(x, y)=  (a, y), if c = x; (x · c−1 · a, y), if c < x.  Then in the case when c > x we get that b = c · x−1 · y and hence Lemma 2.2 implies that (c, b) 4 (x, y) in B(A). Also, in the case when c = x we have that b = y, which implies the inequality (c, b) 4 (x, y) in B(A). The case c < x does not hold because the group operation on G implies that x · c−1 · a < a. (⇐) Suppose that the relation (c, b) 4 (x, y) holds in B(A). Then by Lemma 2.2 we have that c−1 · b = x−1 · y and c > x in A, and hence the semigroup operation of B(A) implies that (a, c)(x, y)=(a, c · x−1 · y)=(a, c · c−1 · b)=(a, b). The proof of statement (ii) is similar to statement (i). (iii) (⇒) Suppose that (a, b)=(a, c)(x, y)(d, b) for some (x, y) ∈ B(A). Then we have that (a, c · x−1 · y), if c > x;  (a, c)(x, y)=  (a, y), if c = x; (x · c−1 · a, y), if c < x.  Therefore, (a) if c > x then (a, c · x−1 · y · d−1 · b), if c · x−1 · y>d; −1  −1 (a, c)(x, y)(d, b)=(a, c · x · y)(d, b)=  (a, b), if c · x · y = d; (d · y−1 · x · c−1 · a, b), if c · x−1 · y < d,  (b) if c = x then (a, y · d−1 · b), if y>d;  (a, c)(x, y)(d, b)=(a, y)(d, b)=  (a, b), if y = d; (d · y−1 · a, b), if y < d,  (c) if c < x then (x · c−1 · a, y · d−1 · b), if y>d; −1  −1 (a, c)(x, y)(d, b)=(x · c · a, y)(d, b)=  (x · c · a, b), if y = d; (d · y−1 · x · c−1 · a, b), if y < d.  Then the equality (a, b)=(a, c)(x, y)(d, b) implies that (a) if c > x then c · x−1 · y · d−1 = e in G; (b) if c = x then y = d; and case (c) does not hold. Hence by Lemma 2.2 we get that (c,d) 4 (x, y) in B(A). 6 OLEG GUTIK AND KATERYNA MAKSYMYK

(⇐) Suppose that the relation (c,d) 4 (x, y) holds in B(A). Then by Lemma 2.2 we have that c−1 · d = x−1 · y and c > x in A, and hence the semigroup operation of B(A) implies (a, c)(x, y)(d, b)=(a, c)(x, y)(c · x−1 · y, b)= =(a, c)(c · x−1 · y · y−1 · x, b)= =(a, c)(c · x−1 · x, b)= =(a, c)(c, b)= =(a, b), because c · x−1 · y > y in A.  Proposition 2.4. Let G be a linearly ordered group, A be a non-empty shift-set in G and a,b,c,d be arbitrary elements of A. Then the following statements hold: (i) if ac in A then the equation (a, b)=(c,d)(x, y) has the unique solution (x, y)=(a · c−1 · d, b) in B(A); (iii) (a, b)=(a, d)(x, y) has the unique solution (x, y)=(d, b) in B(A); (iv) if bd in A then the equation (a, b)=(x, y)(c,d) has the unique solution (x, y)=(a, b · d−1 · c) in B(A); (v) the equation (a, b)=(x, y)(c, b) has the unique solution (x, y)=(a, c) in B(A). Proof. (i) Assume that ac, which contradicts the assumption of statement (i). (ii) Assume that a>c. Then formula (2) implies that d < x in A and hence we have that (a, b) = (x · d−1 · c,y). This implies the equalities x = a · c−1 · d and y = b. (iii) follows from formula (2). The proofs of statements (iv), (v) and (vi) are dual to the proofs of (i), (ii) and (iii), respectively. 

Later we need the following proposition which follows from formula (2) and describes right and left principal ideals in the semigroup B(A) for a non-empty shift-set A in G. Proposition 2.5. Let G be a linearly ordered group and A be a non-empty shift-set in G. Then the following conditions hold: (i) (a, a)B(A)= {(x, y) ∈ B(A): x > a in A}; (ii) B(A)(a, a)= {(x, y) ∈ B(A): y > a in A}.

3. On topologizations of the semigroup B(A) It is obvious that every left (right) topological group G with an isolated point is discrete. This implies that every countable T1-Baire left (right) topological group is a discrete space, too. Later we shall show that the similar statement holds for a Baire semitopological semigroup B(A) over a non-empty shift-set A of a countable linearly ordered group G. For an arbitrary element (a, b) of the semigroup B(A) we denote

↑4(a, b)= {(x, y) ∈ B(A): (a, b) 4 (x, y)} . Lemma 3.1. Let G be a linearly ordered group, A be a non-empty shift-set in G, and τ be a shift- continuous topology on B(A) such that (B(A), τ) contains an isolated point. Then the space (B(A), τ) is discrete. ON SEMITOPOLOGICAL BICYCLIC EXTENSIONS OF LINEARLY ORDERED GROUPS 7

Proof. Suppose that (a, b) is an isolated point of the topological space (B(A), τ). Assume that for an arbitrary u ∈ A there exists c ∈ A such that u>c. Since A is a shift-set, d = c · u−1 · b < b in A. By Proposition 2.4(v), the equation (a, b)=(x, y)(c,d) has the unique solution (x, y)= a, b · d−1 · c = a, b · (c · u−1 · b)−1 · c = a, b · b−1 · u · c−1 · c =(a, u)    in B(A). If u is the smallest element of A, then By Proposition 2.4(vi) the equation (a, b)=(x, y)(u, b) has the unique solution (x, y)=(a, u). In both cases the continuity of right translations in (B(A), τ) implies that for arbitrary u ∈ A the pair (a, u) is an isolated point of the topological space (B(A), τ) for arbitrary u ∈ A. Fix an arbitrary element v of A. Assume that there exists d ∈ A such that d < v. Since A is a shift-set, c = d · v−1 · a < a in A. Then by Proposition 2.4(ii), the equation (a, u)=(c,d)(x, y) has the unique solution (x, y)= a · c−1 · d,u = a · (d · v−1 · a)−1 · d,u = a · a−1 · v · d−1 · d,u =(v,u)    in B(A). If v is the smallest element of A, then by Proposition 2.4(iii), the equation (a, u)=(a, v)(x, y) has the unique solution (x, y)=(v,u). Since (a, u) is an isolated point of (B(G), τ), in both cases the continuity of left translations in B(G) implies that for arbitrary u ∈ A the pair (v,u) is an isolated point of the topological space (B(G), τ) for arbitrary u ∈ G. This completes the proof of the lemma.  Theorem 3.2. Let A be a countable non-empty shift-set in a linearly ordered group G, and τ be a T1-Baire shift-continuous topology on B(A). Then the topological space (B(A), τ) is discrete.

Proof. By Proposition 1.30 of [33] every countable Baire T1-space contains a dense subspace of isolated points, and hence the space (B(A), τ) contains an isolated point. Then we apply Lemma 3.1.  Theorem 3.2 implies the following corollary: Corollary 3.3. Let A be a countable non-empty shift-set in a linearly ordered group G, and τ be a shift-continuous Cechˇ complete (or locally compact) T1-topology on B(A). Then the topological space (B(A), τ) is discrete.

Remark 3.4. Let R be the set of reals with usual topology. It is obvious that SR = R × R with the semigroup operation (a − b + c,d), if b c, is isomorphic to the semigroup B(R), whereR is the additive group of reals with usual linear order. Then simple verifications show that S with the product topology τp is a topological inverse semigroup (also, see [36, 37]). Then the subspace SQ = {(x, y) ∈ SR : x and y are rational} with the induced semigroup operation from S is a countable non-discrete non-Baire topological inverse subsemigroup of + (S, τp). Also, the same we get in the case of subsemigroup SQ = {(x, y) ∈ SQ : x > 0 and y > 0} of (S, τp) (see [2, 3, 4, 5, 6]). The above arguments show that the condition in Theorem 3.2 that τ is a T1-Baire topology is essential. Recall that a linearly ordered group G is said to be densely ordered if for every positive element g ∈ G there exists a positive element h ∈ G such that h

Theorem 3.6. Let G be a linearly ordered group which is not densely ordered and A be a non-empty shift-set in G. Then every shift-continuous Hausdorff topology τ on the semigroup B(A) is discrete, and hence B(A) is a discrete subspace of any semitopological semigroup which contains B(A) as a subsemigroup. Proof. We fix an arbitrary idempotent (a, a) of the semigroup B(A) and suppose that (a, a) is a non-isolated point of the topological space (B(A), τ). Since the maps λ(a,a) : B(A) → B(A) and ρ(a,a) : B(A) → B(A) defined by the formulae ((x, y)) λ(a,a) =(a, a)(x, y) and ((x, y)) ρ(a,a) =(x, y)(a, a) are continuous retractions, we conclude that (a, a)B(A) and B(A)(a, a) are closed subsets in the topo- logical space (B(A), τ) (see [20, Exercise 1.5.C]). For an arbitrary element b of the shift-set A in the linearly ordered group G we put

DL(b,b) [(b, b)] = {(x, y) ∈ B(A): (x, y)(b, b)=(b, b)} . Lemma 2.2 and Proposition 2.3 imply that DL (b,b) [(b, b)] = ↑4(b, b)= {(x, x) ∈ B(A): x 6 b in A} , and since right translations are continuous maps in (B(A), τ) we get that DL(b,b) [(b, b)] is a closed subset of the topological space (B(A), τ) for every b ∈ A. Then there exists an open neighbourhood W(a,a) of the point (a, a) in the topological space (B(A), τ) such that + + + + − − W(a,a) ⊆ B(A) \ (a , a )B(A) ∪ B(A)(a , a ) ∪ DL(a , a ) .  Since (B(A), τ) is a semitopological semigroup, we conclude that there exists an open neighbourhood V(a,a) of the idempotent (a, a) in the topological space (B(A), τ) such that the following conditions hold:

V(a,a) ⊆ W(a,a), (a, a) · V(a,a) ⊆ W(a,a) and V(a,a) · (a, a) ⊆ W(a,a). Hence at least one of the following conditions holds:

(a) the neighbourhood V(a,a) contains infinitely many points (x, y) ∈ B(A) such that x e in G, and in case (b) by Proposition 2.3 we have that −1 (x, y)(a, a)= a · y · x, a ∈/ W(a,a)  because y−1 · x > e in G which contradicts the separate continuity of the semigroup operation in (B(A), τ). The obtained contradiction implies that the set V(a,a) is a singleton, and hence the idempotent (a, a) is an isolated point of the topological space (B(A), τ). Now, we apply Lemma 3.1 and get that the topological space (B(A), τ) is discrete.  Theorem 3.6 implies the following three corollaries: Corollary 3.7. Let G be a linearly ordered group which is not densely ordered and A be a non-empty shift-set in G. Then every semigroup Hausdorff topology τ on the semigroup B(A) is discrete. Corollary 3.8 ([21]). Every shift-continuous Hausdorff topology τ on the bicyclic extended semigroup CZ is discrete. Corollary 3.9 ([12, 19]). Every shift-continuous Hausdorff topology τ on the bicyclic monoid C (p, q) is discrete.

Acknowledgements The author acknowledges Taras Banakh and the referee for their important comments and suggestions. ON SEMITOPOLOGICAL BICYCLIC EXTENSIONS OF LINEARLY ORDERED GROUPS 9

References [1] O. Andersen, Ein Bericht ¨uber die Struktur abstrakter Halbgruppen, PhD Thesis, Hamburg, 1952. [2] K. R. Ahre, Locally compact bisimple inverse semigroups, Semigroup Forum 22:4 (1981), 387–389. 1 ˙ ¨ 36 [3] K. R. Ahre, On the closure of B[0,∞), Istanbul Tek. Univ. B¨ul. :4 (1983), 553–562. ′ 28 [4] K. R. Ahre, On the closure of B[0,∞), Semigroup Forum :1–3 (1984), 377–378. 1 33 [5] K. R. Ahre, On the closure of B[0,∞), Semigroup Forum :2 (1986), 269–272. 2 ˙ ¨ 42 [6] K. R. Ahre, On the closure of B[0,∞), Istanbul Tek. Univ. B¨ul. :3 (1989), 387–390. [7] L. W. Anderson, R. P. Hunter, and R. J. Koch, Some results on stability in semigroups. Trans. Amer. Math. Soc. 117 (1965), 521–529. [8] T. O. Banakh, S. Dimitrova, and O. V. Gutik, The Rees-Suschkewitsch Theorem for simple topological semigroups, Mat. Stud. 31:2 (2009), 211–218. [9] T. Banakh, S. Dimitrova, and O. Gutik, Embedding the bicyclic semigroup into countably compact topological semi- groups, Topology Appl. 157:18 (2010), 2803–2814. [10] S. Bardyla, Classifying locally compact semitopological polycyclic monoids, Math. Bull. Shevchenko Sci. Soc. 13 (2016), 21–28. [11] S. Bardyla and O. Gutik, On a semitopological polycyclic monoid, Algebra Discrete Math. 21:2 (2016), 163–183. [12] M. O. Bertman and T. T. West, Conditionally compact bicyclic semitopological semigroups, Proc. Roy. Irish Acad. A76:21–23 (1976), 219–226. [13] G. Birkhoff, Theory, Colloq. Publ., 25, Amer. Math. Soc., 1973. [14] J. H. Carruth, J. A. Hildebrant, and R. J. Koch, The Theory of Topological Semigroups, Vol. I, Marcel Dekker, Inc., New York and Basel, 1983; Vol. II, Marcel Dekker, Inc., New York and Basel, 1986. [15] I. Chuchman and O. Gutik, Topological monoids of almost monotone injective co-finite partial selfmaps of the set of positive integers, Carpathian Math. Publ. 2:1 (2010), 119–132. [16] I. Chuchman and O. Gutik, On monoids of injective partial selfmaps almost everywhere the identity, Demonstr. Math. 44:4 (2011), 699–722. [17] A. Clay and D. Rolfsen, Ordered Groups and Topology, Providence, Amer. Math. Soc., 2016. [18] A. H. Clifford and G. B. Preston, The Algebraic Theory of Semigroups, Vols. I and II, Amer. Math. Soc. Surveys 7, Providence, R.I., 1961 and 1967. [19] C. Eberhart and J. Selden, On the closure of the bicyclic semigroup, Trans. Amer. Math. Soc. 144 (1969), 115–126. [20] R. Engelking, General Topology, 2nd ed., Heldermann, Berlin, 1989. [21] I. Fihel and O. Gutik, On the closure of the extended bicyclic semigroup, Carpathian Math. Publ. 3:2 (2011), 131–157. [22] G. L. Fotedar, On a semigroup associated with an ordered group, Math. Nachr. 60 (1974), 297–302. [23] G. L. Fotedar, On a class of bisimple inverse semigroups, Riv. Mat. Univ. Parma (4) 4 (1978), 49–53. [24] L. Fuchs, Partially Ordered Algebraic Systems, Pergamon Press, 1963. [25] O. Gutik, On the dichotomy of a locally compact semitopological bicyclic monoid with adjoined zero, Visn. L’viv. Univ., Ser. Mekh.-Mat. 80 (2015), 33–41. [26] O. Gutik, Topological properties of Taimanov semigroups, Math. Bull. Shevchenko Sci. Soc. 13 (2016), 29–34. [27] O. Gutik and K. Maksymyk, On semitopological interassociates of the bicyclic monoid, Visn. L’viv. Univ., Ser. Mekh.-Mat. 82 (2016), 98–108. [28] O. Gutik, D. Pagon, and K. Pavlyk, Congruences on bicyclic extensions of a linearly ordered group, Acta Comment. Univ. Tartu. Math. 15:2 (2011), 61–80. [29] O. Gutik and I. Pozdnyakova, On monoids of monotone injective partial selfmaps of Ln ×lex Z with co-finite domains and images, Algebra Discrete Math. 17:2 (2014), 256–279. [30] O. Gutik and D. Repovˇs, On countably compact 0-simple topological inverse semigroups, Semigroup Forum 75:2 (2007), 464–469. [31] O. Gutik and D. Repovˇs, Topological monoids of monotone injective partial selfmaps of N with cofinite domain and image, Stud. Sci. Math. Hungar. 48:3 (2011), 342–353. [32] O. Gutik and D. Repovˇs, On monoids of injective partial selfmaps of integers with cofinite domains and images, Georgian Math. J. 19:3 (2012), 511–532. [33] R. C. Haworth and R. A. McCoy, Baire spaces, Diss. Math. 141 (1977), 73 pp. [34] J. A. Hildebrant and R. J. Koch, Swelling actions of Γ-compact semigroups, Semigroup Forum 33 (1986), 65–85. [35] R. J. Koch and A. D. Wallace, Stability in semigroups, Duke Math. J. 24 (1957), 193–195. 2 54 [36] R. Korkmaz, On the closure of B(−∞,+∞), Semigroup Forum :2 (1997), 166–174. [37] R. Korkmaz, Dense inverse subsemigroups of a topological inverse semigroup, Semigroup Forum 78:3 (2009), 528–535. [38] M. Lawson, Inverse Semigroups. The Theory of Partial Symmetries, Singapore: World Scientific, 1998. [39] Z. Mesyan, J. D. Mitchell, M. Morayne, and Y. H. P´eresse, Topological graph inverse semigroups, Topology Appl. 208 (2016), 106–126. 10 OLEG GUTIK AND KATERYNA MAKSYMYK

[40] M. Petrich, Inverse Semigroups, John Wiley & Sons, New York, 1984. [41] W. Ruppert, Compact Semitopological Semigroups: An Intrinsic Theory, Lect. Notes Math., 1079, Springer, Berlin, 1984. [42] A. D. Taimanov, An example of a semigroup which admits only the discrete topology, Algebra i Logika 12:1 (1973), 114–116 (in Russian), English transl. in: Algebra and Logic 12:1 (1973), 64–65. [43] A. D. Taimanov, On the topologization of commutative semigroups, Mat. Zametki 17:5 (1975), 745–748 (in Russian), English transl. in: Math. Notes 17:5 (1975), 443–444. [44] V. V. Wagner, Generalized groups, Dokl. Akad. Nauk SSSR 84 (1952), 1119–1122 (in Russian).

Faculty of Mathematics, National University of Lviv, Universytetska 1, Lviv, 79000, Ukraine E-mail address: o [email protected], [email protected], [email protected]