Ideal Extensions of Ordered Semigroups

Abstract

The ideal extensions of semigroups -without order- have been first considered by Clifford (Clifford, A. H. (1950). Extension of semigroups. Trans. Amer. Math. Soc. 68: 165–173). The aim of this paper is to give the main theorem of the ideal extensions for ordered semigroups.     

Archimedean ordered semigroups as ideal extensions

The main result of the paper is a structure theorem concerning the ideal extensions of archimedean ordered semigroups. We prove that an archimedean ordered semigroup which contains an idempotent is an ideal extension of a simple ordered semigroup containing an idempotent by a nil ordered semigroup. Conversely, if an ordered semigroup S is an ideal extension of a simple ordered semigroup by a nil ordered semigroup, then S is archimedean. As a consequence, an ordered semigroup is archimedean and contains an idempotent if and only if it is an ideal extension of a simple ordered semigroup containing an idempotent by a nil ordered semigroup.     

Vector lattice covers of ideals and bands in Pre-Riesz spaces

Abstract

Pre-Riesz spaces are ordered vector spaces which can be order densely embedded into vector lattices, their so-called vector lattice covers. Given a vector lattice cover Y for a pre-Riesz space X, we address the question how to find vector lattice covers for subspaces of X, such as ideals and bands. We provide conditions such that for a directed ideal I in X its smallest extension ideal in Y is a vector lattice cover. We show a criterion for bands in X and their extension bands in Y as well. Moreover, we state properties of ideals and bands in X which are generated by sets, and of their extensions in Y.     

Extension theorems for linear lattices with positive algebraic basis

An ordered linear spaceV with positive wedgeK is said to satisfy extension property (E1) if for every subspaceL ₀ ofV such thatL ₀ ∩K is reproducing inL ₀, and every monotone linear functionalf ₀ defined onL ₀,f ₀ has a monotone linear extension to all ofV. A linear latticeX is said to satisfy extension property (E2) if for every sublatticeL ofX, and every linear functionalf defined onL which is a lattice homomorphism,f has an extensionf′ to all ofX which is also a linear functional and a lattice homomorphism. In this paper it is shown that a linear lattice with a positive algebraic basis has both extension property (E1) and (E2). In obtaining this result it is shown that the linear span of a lattice idealL and an extremal element not inL is again a lattice ideal. (HereX does not have to have a positive algebraic basis.) It is also shown that a linear lattice which possesses property (E2) must be linearly and lattice isomorphic to a functional lattice. An example is given of a function lattice which has property (E2) but does not have a positive algebraic basis. Yudin [12] has shown a reproducing cone in ann-dimensional linear lattice to be the intersection of exactlyn half-spaces. Here it is shown that the positive wedge in ann-dimensional archimedean ordered linear space satisfying the Riesz decomposition property must be the intersection ofn half-spaces, and hence the space must be a linear lattice with a positive algebraic basis. The proof differs from those given for the linear lattice case in that it uses no special techniques, only well known results from the theory of ordered linear space.     

弱可约序半群的理想扩张

NioviKehayopulu和Michael Tsingelis于2003年给出了关于序半群的理想扩张的一个定理,本文利用该定理进一步给出了弱可约序半群的理想扩张的构造．     

Extensions of regular polytopes with preassigned Schläfli symbol

We say that a (d+1)-polytope P is an extension of a polytope K if the facets or the vertex figures of P are isomorphic to K. The Schläfli symbol of any regular extension of a regular polytope is determined except for its first or last entry. For any regular polytope K we construct regular extensions with any even number as first entry of the Schläfli symbol. These extensions are lattices if K is a lattice. Moreover, using the so-called CPR graphs we provide a more general way of constructing extensions of polytopes.     

Lattice uniformities and modular functions on orthomodular lattices

It is shown that the lattice of all exhaustive lattice uniformities on an orthomodular latticeL is isomorphic to the centre of a natural completion (of a quotient) ofL, and is thus a complete Boolean algebra. This is applied to prove a decomposition theorem for exhaustive modular functions on orthomodular lattices, which generalizes Traynor's decomposition theorem [14].     

The lattice of pseudovarieties of idempotent semigroups and a non-regular analogue

We use classical results on the lattice of varieties of band (idempotent) semigroups to obtain information on the structure of the lattice Ps (DA) of subpseudovarieties of DA, – where DA is the largest pseudovariety of finite semigroups in which all regular semigroups are band semigroups. We bring forward a lattice congruence on Ps (DA), whose quotient is isomorphic to , and whose classes are intervals with effectively computable least and greatest members. Also we characterize the pro-identities satisfied by the members of an important family of subpseudovarieties of DA. Finally, letting V _k be the pseudovariety generated by the k-generated elements of DA (k≥ 1), we use all our results to compute the position of the congruence class of V _k in . Received April 24, 1996; accepted in final form April 3, 1997.     

Representing homomorphisms of distributive lattices as restrictions of congruences of rectangular lattices

Let be a {0, 1}-homomorphism of a finite distributive lattice D into the congruence lattice Con L of a rectangular (whence finite, planar, and semimodular) lattice L. We prove that L is a filter of an appropriate rectangular lattice K such that ConK is isomorphic with D and is represented by the restriction map from Con K to Con L. The particular case where is an embedding was proved by E.T. Schmidt. Our result implies that each {0, 1}-lattice homomorphism between two finite distributive lattices can be represented by the restriction of congruences of an appropriate rectangular lattice to a rectangular filter.     

Extension of positive functionals on certain ordered spaces

An ordered linear spaceL is said to satisfy extension property (E1) if for every directed subspaceM ofL and positive linear functional ϕ onM, ϕ can be extended toL. A Riesz spaceL is said to satisfy extension property (E2) if for every sub-Riesz spaceM ofL and every real valued Riesz homomorphism ϕ onM, ϕ can be extended toL as a Riesz homomorphism. These properties were introduced by Schmidt in [5]. In this paper, it is shown that an ordered linear space has extension property (E1) if and only if it is order isomorphic to a function spaceL′ defined on a setX′ such that iff andg belong toL′ there exists a finite disjoint subsetM of the set of functions onX′ such that each off andg is a linear combination of the points ofM. An analogous theorem is derived for Riesz spaces with extension property (E2).     

On a strong property of the weak subalgebra lattice

In the present paper, we apply results from [Pió1] to prove that for an arbitrary total and locally finite unary algebra A of finite unary type K, its weak subalgebra lattice uniquely determines its strong subalgebra lattice (recall that in the case of total algebras the strong subalgebra lattice is the well-known lattice of all (total) subalgebras). More precisely, we prove that for every unary partial algebra B of the same unary type K, if weak subalgebra lattices of A and B are isomorphic (with A as above), then the strong subalgebra lattices of A and B are isomorphic, and moreover B is also total and locally finite. At the end of this paper we also show the necessity of all the three conditions for A. Received September 5, 1997; accepted in final form October 7, 1998.     

Graph isomorphic discrete partially ordered sets and semimodularity

In [RATANAPRASERT, C.—DAVEY, B.: Semimodular lattices with isomorphic graphs, Order 4 (1987), 1–13], the authors found conditions under which an isomorphism of graphs of discrete lattices transfers semimodularity. The main theorem of the present paper generalizes their result for discrete partially ordered sets.     

Singularities of Toric Varieties Associated with Finite Distributive Lattices

With each finite lattice L we associate a projectively embedded scheme V(L); as Hibi has shown, the lattice D is distributive if and only if V(D) is irreducible, in which case it is a toric variety. We first apply Birkhoff's structure theorem for finite distributive lattices to show that the orbit decomposition of V(D) gives a lattice isomorphic to the lattice of contractions of the bounded poset of join-irreducibles of D. Then we describe the singular locus of V(D) by applying some general theory of toric varieties to the fan dual to the order polytope of P: V(D) is nonsingular along an orbit closure if and only if each fibre of the corresponding contraction is a tree. Finally, we examine the local rings and associated graded rings of orbit closures in V(D). This leads to a second (self-contained) proof that the singular locus is as described, and a similar combinatorial criterion for the normal link of an orbit closure to be irreducible.     

格的TL-模糊理想

本文研究了格的TL-模糊理想. 利用生成TL-模糊理想, 证明了一个模格的全体T_M-模糊理想形成一个完备的模格. 此外, 利用L-模糊集的投影和截影, 获得了将直积格的TL-模糊理想表示成分量格的TL-模糊理想的L-直积的一个充分必要条件. 所得结果进一步推广和发展了格的模糊理想的理论.     

N-free orders and minimal interval extensions

We investigate problems related to the set of minimal interval extensions of N-free orders. This leads us to a correspondence between this set for an arbitrary order and a certain set of its maximal N-free reductions. We also get a 1-1-correspondence between the set of linear extensions of an arbitrary order and the set of minimal interval extensions of the linegraph of that order. This has an algorithmic consequence, namely the problem of counting minimal interval extensions of an N-free order is #P-complete. Finally a characterization of all N-free orders with isomorphic root graph is given in terms of their lattice of maximal antichains; the lattices are isomorphic iff the root graphs agree.This work was supported by the PROCOPE Program. The first author is supported by the DFG.     

Lattices of Order-Convex Sets of Forests

We give a characterization of the class Co(F)\mathbf{Co}(\mathcal{F}) [Co(F_n)\mathrm{\mathbf{Co}}(\mathcal{F}_n), n < ω, respectively] of lattices isomorphic to convexity lattices of posets which are forests [forests of length at most n, respectively], as well as of the class Co(L)\mathbf{Co}(\mathcal{L}) of lattices isomorphic to convexity lattices of linearly ordered posets. This characterization yields that the class of finite members from Co(F)\mathbf{Co}(\mathcal{F}) [from Co(F_n)\mathbf{Co}(\mathcal{F}_n), n < ω, or from Co(L)\mathbf{Co}(\mathcal{L})] is finitely axiomatizable within the class of finite lattices.     

Distinguished extensions of a lattice-ordered group

Any lattice-ordered group (l-group for short) is essentially extended by its lexicographic product with a totally ordered group. That is, anl-homomorphism (i.e., a group and lattice homomorphism) on the extension which is injective on thel-group must be injective on the extension as well. Thus nol-group has a maximal essential extension in the categoryIGp ofl-groups withl-homomorphisms. However, anl-group is a distributive lattice, and so has a maximal essential extension in the categoryD of distributive lattices with lattice homomorphisms. Adistinguished extension of onel-group by another is one which is essential inD. We characterize such extensions, and show that everyl-groupG has a maximal distinguished extensionE(G) which is unique up to anl-isomorphism overG.E(G) contains most other known completions in whichG is order dense, and has mostl-group completeness properties as a result. Finally, we show that ifG is projectable then E(G) is the -completion of the projectable hull ofG.Presented by M. Henriksen.     

Tertiary decompositions in lattice modules

The theory of associated prime ideals of anR-module, and of tertiary decompositions, generalizes toL-modules, whereL is a complete modular lattice and anL-moduleM is a complete modular lattice together with an appropriate module actionp:L×MM. Given appropriate chain conditions onL andM, the theory of associated prime ideals, existence and uniqueness properties for tertiary decompositions, and a form of the Krull intersection theorem all hold in generalized form. If more stringent conditions apply, the theory reduces to a generalized theory of primary decompositions and a second uniqueness theorem holds. The theory can be applied to congruence lattices of algebras in congruence-modular varieties of algebras, using the generalized commutator operation. An important special case is the theory of finite groups, where the descending chain condition allows a natural choice of a distinguished tertiary decomposition and this yields a canonical decomposition of any finite group as a subdirect product of cotertiary finite groups. The group-theoretic application of the tertiary theory yields elementary structure theorems about Galois extensions of fields, where the tertiary decomposition of the Galois group transforms into a representation of a Galois extension as a compositum. For example, given a fieldF, there are distinguished tertiary field extensions ofF, of which all other finite Galois extensions ofF are compositums.Presented by Bjarni Jónsson.     

Structure of lattices of varieties and lattices of quasivarieties: similarity and difference. III

We give representations for lattices of varieties and lattices of quasivarieties in terms of inverse limits of lattices satisfying a number of additional conditions. Specifically, it is proved that, for any locally finite variety (quasivariety) of algebras V, L _v(V)[resp., L _q(V)] is isomorphic to an inverse limit of a family of finite join semidistributive at 0 (resp., finite lower bounded) lattices. A similar statement is shown to hold for lattices of pseudo-quasivarieties. Various applications are offered; in particular, we solve the problem of Lampe on comparing lattices of varieties with lattices of locally finite ones. Translated fromAlgebra i Logika, Vol. 34, No. 6, pp. 646-666, November-December, 1995.     

The M3[D] construction and n-modularity

In 1968, Schmidt introduced the M ₃[D] construction, an extension of the five-element modular nondistributive lattice M ₃ by a bounded distributive lattice D, defined as the lattice of all triples satisfying . The lattice M ₃[D] is a modular congruence-preserving extension of D.? In this paper, we investigate this construction for an arbitrary lattice L. For every n > 0, we exhibit an identity such that is modularity and is properly weaker than . Let M _n denote the variety defined by , the variety of n-modular lattices. If L is n-modular, then M ₃[L] is a lattice, in fact, a congruence-preserving extension of L; we also prove that, in this case, Id M ₃[L] M ₃[Id L]. ? We provide an example of a lattice L such that M ₃[L] is not a lattice. This example also provides a negative solution to a problem of Quackenbush: Is the tensor product of two lattices A and B with zero always a lattice. We complement this result by generalizing the M ₃[L] construction to an M ₄[L] construction. This yields, in particular, a bounded modular lattice L such that M ₄ L is not a lattice, thus providing a negative solution to Quackenbush’s problem in the variety M of modular lattices.? Finally, we sharpen a result of Dilworth: Every finite distributive lattice can be represented as the congruence lattice of a finite 3-modular lattice. We do this by verifying that a construction of Gr?tzer, Lakser, and Schmidt yields a 3-modular lattice. Received May 26, 1998; accepted in final form October 7, 1998.