scholarly journals On the lattice of weak topologies on the bicyclic monoid with adjoined zero

2020 ◽  
Vol 30 (1) ◽  
pp. 26-43
Author(s):  
S. Bardyla ◽  
◽  
O. Gutik ◽  
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Order Type ◽  
Hausdorff Topology ◽  
Cardinal Characteristics ◽  
Bicyclic Monoid ◽  
Weak Topologies

A Hausdorff topology τ on the bicyclic monoid with adjoined zero C0 is called weak if it is contained in the coarsest inverse semigroup topology on C0. We show that the lattice W of all weak shift-continuous topologies on C0 is isomorphic to the lattice SIF1×SIF1 where SIF1 is the set of all shift-invariant filters on ω with an attached element 1 endowed with the following partial order: F≤G if and only if G=1 or F⊂G. Also, we investigate cardinal characteristics of the lattice W. In particular, we prove that W contains an antichain of cardinality 2c and a well-ordered chain of cardinality c. Moreover, there exists a well-ordered chain of first-countable weak topologies of order type t.

scholarly journals Inverse semigroups and their natural order

1978 ◽  
Vol 19 (1) ◽  
pp. 59-65 ◽  
Author(s):  
H. Mitsch
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Homomorphic Image ◽  
Point Of View ◽  
Inverse Semigroups ◽  
Natural Order ◽  
Theoretical Point ◽  
Trivial Group

The natural order of an inverse semigroup defined by a ≤ b ⇔ a′b = a′a has turned out to be of great importance in describing the structure of it. In this paper an order-theoretical point of view is adopted to characterise inverse semigroups. A complete description is given according to the type of partial order an arbitrary inverse semigroup S can possibly admit: a least element of (S, ≤) is shown to be the zero of (S, ·); the existence of a greatest element is equivalent to the fact, that (S, ·) is a semilattice; (S, ≤) is directed downwards, if and only if S admits only the trivial group-homomorphic image; (S, ≤) is totally ordered, if and only if for all a, b ∈ S, either ab = ba = a or ab = ba = b; a finite inverse semigroup is a lattice, if and only if it admits a greatest element. Finally formulas concerning the inverse of a supremum or an infimum, if it exists, are derived, and right-distributivity and left-distributivity of multiplication with respect to union and intersection are shown to be equivalent.

scholarly journals PARTIAL ORDERS ON PARTIAL BAER–LEVI SEMIGROUPS

2010 ◽  
Vol 81 (2) ◽  
pp. 195-207 ◽  
Author(s):  
BOORAPA SINGHA ◽  
JINTANA SANWONG ◽  
R. P. SULLIVAN
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Partial Orders ◽  
The Other ◽  
Natural Order ◽  
Natural Partial Order ◽  
Transformation Semigroups ◽  
Minimal Elements ◽  
Symmetric Inverse Semigroup ◽  
Containment Order

AbstractMarques-Smith and Sullivan [‘Partial orders on transformation semigroups’, Monatsh. Math.140 (2003), 103–118] studied various properties of two partial orders on P(X), the semigroup (under composition) consisting of all partial transformations of an arbitrary set X. One partial order was the ‘containment order’: namely, if α,β∈P(X) then α⊆β means xα=xβ for all x∈dom α, the domain of α. The other order was the so-called ‘natural order’ defined by Mitsch [‘A natural partial order for semigroups’, Proc. Amer. Math. Soc.97(3) (1986), 384–388] for any semigroup. In this paper, we consider these and other orders defined on the symmetric inverse semigroup I(X) and the partial Baer–Levi semigroup PS(q). We show that there are surprising differences between the orders on these semigroups, concerned with their compatibility with respect to composition and the existence of maximal and minimal elements.

A ∗-prehomomorphism of a type B semigroup

2020 ◽  
pp. 2150222
Author(s):  
Chunhua Li ◽  
Zhi Pei ◽  
Baogen Xu
Keyword(s):  
New York ◽  
Inverse Semigroup ◽  
Partial Order ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Type B ◽  
Abundant Semigroup ◽  
Basic Properties ◽  
Structure Theorems

Type B semigroups are generalizations of inverse semigroups, and every inverse semigroup admits an [Formula: see text]-unitary cover (M. Petrich, Inverse Semigroups (Wiley, New York, 1984)). Motivated by studying [Formula: see text]-unitary cover for inverse semigroups, and as a continuation of Petrich’s works in inverse semigroups, in this paper, we first introduce the concept of ∗-prehomomorphism of a type B semigroup. After obtaining some basic properties, we get some structure theorems and give some conditions for a type B semigroup which is constructed by using the ∗-prehomomorphism to be proper. In particular, we introduce the notion of [Formula: see text]-unitary good cover for an abundant semigroup, and prove that every type B semigroup with compatible natural partial order admits an [Formula: see text]-unitary good cover.

scholarly journals JOINS AND COVERS IN INVERSE SEMIGROUPS AND TIGHT -ALGEBRAS

2014 ◽  
Vol 90 (1) ◽  
pp. 121-133 ◽  
Author(s):  
ALLAN P. DONSIG ◽  
DAVID MILAN
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Higher Rank ◽  
Special Case

AbstractWe show Exel’s tight representation of an inverse semigroup can be described in terms of joins and covers in the natural partial order. Using this, we show that the ${C}^{\ast } $-algebra of a finitely aligned category of paths, developed by Spielberg, is the tight ${C}^{\ast } $-algebra of a natural inverse semigroup. This includes as a special case finitely aligned higher-rank graphs: that is, for such a higher-rank graph $\Lambda $, the tight ${C}^{\ast } $-algebra of the inverse semigroup associated to $\Lambda $ is the same as the ${C}^{\ast } $-algebra of $\Lambda $.

scholarly journals A rank for right congruences on inverse semigroups

2007 ◽  
Vol 76 (1) ◽  
pp. 55-68 ◽  
Author(s):  
Victoria Gould
Keyword(s):  
Inverse Semigroup ◽  
Maximal Subgroup ◽  
Inverse Semigroups ◽  
The Other ◽  
Brandt Semigroup ◽  
Group Congruence ◽  
Existentially Closed ◽  
Bicyclic Monoid ◽  
A Chain ◽  
Lattice Of Congruences

The S-rank (where ‘S’ abbreviates ‘sandwich’) of a right congruence ρ on a semigroup S is the Cantor-Bendixson rank of ρ in the lattice of right congruences ℛ of S with respect to a topology we call the finite type topology. If every ρ ϵ ℛ possesses S-rank, then S is ranked. It is known that every right Noetherian semigroup is ranked and every ranked inverse semigroup is weakly right Noetherian. Moreover, if S is ranked, then so is every maximal subgroup of S. We show that a Brandt semigroup 0(G, I) is ranked if and only if G is ranked and I is finite.We establish a correspondence between the lattice of congruences on a chain E, and the lattice of right congruences contained within the least group congruence on any inverse semigroup S with semilattice of idempotents E(S) ≅ E. Consequently we argue that the (inverse) bicyclic monoid B is not ranked; moreover, a ranked semigroup cannot contain a bicyclic -class. On the other hand, B is weakly right Noetherian, and possesses trivial (hence ranked) subgroups.Our notion of rank arose from considering stability properties of the theory Ts of existentially closed (right) S-sets over a right coherent monoid S. The property of right coherence guarantees that the existentially closed S-sets form an axiomatisable class. We argue that B is right coherent. As a consequence, it follows from known results that TB is a theory of B-sets that is superstable but not totally transcendental.

scholarly journals A metrizable semitopological semilattice with non-closed partial order

2020 ◽  
Vol 8 (1) ◽  
pp. 67-75
Author(s):  
Taras Banakh ◽  
Serhii Bardyla ◽  
Alex Ravsky
Keyword(s):  
Partial Order ◽  
Dense Subset ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Countable Family ◽  
Hausdorff Topology ◽  
Necessary And Sufficient ◽  
Convergent Sequences

AbstractWe construct a metrizable semitopological semilattice X whose partial order P = {(x, y) ∈ X × X : xy = x} is a non-closed dense subset of X × X. As a by-product we find necessary and sufficient conditions for the existence of a (metrizable) Hausdorff topology on a set, act, semigroup or semilattice, having a prescribed countable family of convergent sequences.

scholarly journals The natural partial order on a regular semigroup

1980 ◽  
Vol 23 (3) ◽  
pp. 249-260 ◽  
Author(s):  
K. S. Subramonian Nambooripad
Keyword(s):  
Inverse Semigroup ◽  
Regular Semigroup ◽  
Partial Order ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Simple Description ◽  
Regular Semigroups ◽  
Simple Congruence ◽  
Pseudo Inverse ◽  
Completely Simple

It is well-known that on an inverse semigroup S the relation ≦ defined by a ≦ b if and only if aa−1 = ab−1 is a partial order (called the natural partial order) on S and that this relation is closely related to the global structure of S (cf. (1, §7.1), (10)). Our purpose here is to study a partial order on regular semigroups that coincides with the relation defined above on inverse semigroups. It is found that this relation has properties very similar to the properties of the natural partial order on inverse semigroups. However, this relation is not, in general, compatible with the multiplication in the semigroup. We show that this is true if and only if the semigroup is pseudo-inverse (cf. (8)). We also show how this relation may be used to obtain a simple description of the finest primitive congruence and the finest completely simple congruence on a regular semigroup.

scholarly journals Inverse semigroups determined by their partial automorphism monoids

2006 ◽  
Vol 81 (2) ◽  
pp. 185-198 ◽  
Author(s):  
Simon M. Goberstein
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Inverse Monoid ◽  
Inverse Monoids ◽  
Inverse Subsemigroups

AbstractThe partial automorphism monoid of an inverse semigroup is an inverse monoid consisting of all isomorphisms between its inverse subsemigroups. We prove that a tightly connected fundamental inverse semigroup S with no isolated nontrivial subgroups is lattice determined ‘modulo semilattices’ and if T is an inverse semigroup whose partial automorphism monoid is isomorphic to that of S, then either S and T are isomorphic or they are dually isomorphic chains relative to the natural partial order; a similar result holds if T is any semigroup and the inverse monoids consisting of all isomorphisms between subsemigroups of S and T, respectively, are isomorphic. Moreover, for these results to hold, the conditions that S be tightly connected and have no isolated nontrivial subgroups are essential.

Chang's Conjecture and the Non-Stationary Ideal

2001 ◽  
Vol 66 (1) ◽  
pp. 144-170 ◽  
Author(s):  
Daniel Evan Seabold
Keyword(s):  
Partial Order ◽  
Order Type ◽  
Generic Extension ◽  
Forcing Axioms ◽  
Axiom Of Determinacy ◽  
Woodin Cardinals ◽  
Chang’S Conjecture ◽  
Nonstationary Ideal ◽  
Chang's Conjecture ◽  
Central Result

In The Axiom of Determinacy, Forcing Axioms and the Nonstationary Ideal [W1], Woodin constructs the partial order ℙmax, which in the presence of large cardinals yields a forcing extension of L(ℝ) where ZFC holds and the non-stationary ideal on ω1 (hereafter denoted NSω1) is ω2-saturated. The basic analysis of ℙmax forcing over L(ℝ) can be carried out assuming only the Axiom of Determinacy (AD). In the central result of this paper, we show that if one increases slightly the strength of the determinacy assumptions, then Chang's Conjecture—the assertion that every finitary algebra on ω2 has a subalgebra of order type ω1—holds in this extension as well. Specifically, we obtain:Corollary 4.6. Assume AD + V = L(ℝ, μ) + μ is a normal, fine measure on. Chang's Conjecture holds in any ℙmax-generic extension of L(ℝ).This technique for obtaining Chang's Conjecture is fairly general. We [Se] have adapted it to obtain Chang's Conjecture in the model presented by Steel and Van Wesep [SVW] and Woodin [Wl] has adapted it to his ℚmax forcing notion. In each of these models, as in the ℙmax extension, one forces over L(ℝ) assuming AD to obtain ZFC and NSω1 is ω2-saturated.By unpublished results of Woodin, the assumption for Corollary 4.6 is equiconsistent with the existence of ω2 many Woodin cardinals, and hence strictly stronger than ADL(ℝ). One would like to reduce this assumption to ADL(ℝ). Curiously, this reduction is not possible in the arguments for ℚmax or the Steel and Van Wesep model, and the following argument of Woodin suggests why it may not be possible for ℙmax either.

scholarly journals Inverse semigroups with isomorphic partial automorphism semigroups

1989 ◽  
Vol 47 (3) ◽  
pp. 399-417 ◽  
Author(s):  
Simon M. Goberstein
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Modular Lattice ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Dual Isomorphism ◽  
Combinatorial Inverse Semigroup ◽  
Inverse Subsemigroups

AbstractIt is shown that a so-called shortly connected combinatorial inverse semigroup is strongly lattice-determined “modulo semilattices”. One of the consequences of this theorem is the known fact that a simple inverse semigroup with modular lattice of full inverse subsemigroups is strongly lattice-determined [7]. The partial automorphism semigroup of an inverse semigroup S consists of all isomorphisms between inverse subsemigroups of S. It is proved that if S is a shortly connected combinatorial inverse semigroup, T an inverse semigroup and the partial automorphism semigroups of S and T are isomorphic, then either S and T are isomorphic or they are dually isomorphic chains (with respect to the natural partial order); moreover, any isomorphism between the partial automorphism semigroups of S and T is induced either by an isomorphism or, if S and T are dually isomorphic chains, by a dual isomorphism between S and T. Counter-examples are constructed to demonstrate that the assumptions about S being shortly connected and combinatorial are essential.

Sign in / Sign up

Export Citation Format

Share Document