Z-Semicontinuous Posets

Z-semicontinuous posets include semicontinuous lattices and Z-continuous posets as special cases. We characterized when the associated Z-waybelow relation is multiplicative and also make a topological connection.     

Topological representation of posets

There is a canonical imbedding of a poset into a complete Boolean lattice and hence into a Boolean lattice. This gives it a representation as a collection of clopen sets of a Boolean space. There are reflective functions from a category of distributive posets to the subcategories of distributive and Boolean lattices and consequently a topological dual equivalence that extends the Stone duality of Boolean lattices.Presented by B. Jonsson.     

φ-连续格的刻划与完全分配格的拓扑表示定理

本文在完备格中引入φ Ｓ集的概念，并在讨论φ Ｓ集族性质的基础上给出φ 连续格的一族拓扑及格论刻划，用局部超紧的Ｓｏｂｅｒ空间范畴给出完全分配格的拓扑表示定理     

A duality theory for bilattices

Recent studies of the algebraic properties of bilattices have provided insight into their internal strucutres, and have led to practical results, especially in reducing the computational complexity of bilattice-based multi-valued logic programs. In this paper the representation theorem for interlaced bilattices without negation found in [19] and extended to arbitrary interlaced bilattices without negation in [2] is presented. A natural equivalence is then established between the category of interlaced bilattices and the cartesian square of the category of bounded lattices. As a consequence a dual natural equivalence is obtained between the category of distributive bilattices and the coproduct of the category of bounded Priestley spaces with itself. Some applications of these equivalences are given. The subdirectly irreducible interlaced bilattices are characterized in terms of subdirectly irreducible lattices. A known characterization of the join-irreducible elements of the "knowledge" lattice of an interlaced bilattice is used to establish a natural equivalence between the category of finite, distributive bilattices and the category of posets of the form . Received February 2, 1998; accepted in final form September 2, 1999.     

Z-连通集系统及其范畴特征

本文引入了Z-连通集系统的概念,讨论了Z-连通连续偏序集的一系列性 质,证明了Z-连通连续偏序集范畴对偶等价于完全分配格范畴的一个满子范畴.     

Z-Continuous Posets and Their Topological Manifestation

A subset selection Z assigns to each partially ordered set P a certain collection Z P of subsets. The theory of topological and of algebraic (i.e. finitary) closure spaces extends to the general Z-level, by replacing finite or directed sets, respectively, with arbitrary Z-sets. This leads to a theory of Z-union completeness, Z-arity, Z-soberness etc. Order-theoretical notions such as complete distributivity and continuity of lattices or posets extend to the general Z-setting as well. For example, we characterize Z-distributive posets and Z-continuous posets by certain homomorphism properties and adjunctions. It turns out that for arbitrary subset selections Z, a poset P is strongly Z-continuous iff its Z-join ideal completion Z P is Z-ary and completely distributive. Using that characterization, we show that the category of strongly Z-continuous posets (with interpolation) is concretely isomorphic to the category of Z-ary Z-complete core spaces. For suitable subset selections Y and Z, these are precisely the Y-sober core spaces.     

ORDER EXTENSIONS AS ADJOINT FUNCTORS

Abstract

A standard extension (resp. standard completion) is a function Z assigning to each poset P a (closure) system ZP of subsets such that x ? y iff x belongs to every Z ε ZP with y ε Z. A poset P is Z -complete if each Z ε 2P has a join in P. A map f: P → P′ is Z—continuous if f^?1 [Z′] ε ZP for all Z′ ε ZP′, and a Z—morphism if, in addition, for all Z ε ZP there is a least Z′ ε ZP′ with f[Z] ? Z′. The standard extension Z is compositive if every map f: P → P′ with {x ε P: f(x) ? y′} ε ZP for all y′ ε P′ is Z -continuous. We show that any compositive standard extension Z is the object part of a reflector from IP_Z, the category of posets and Z -morphisms, to IR_Z, the category of Z -complete posets and residuated maps. In case of a standard completion Z, every Z -continuous map is a Z -morphism, and IR2 is simply the category of complete lattices and join—preserving maps. Defining in a suitable way so-called Z -embeddings and morphisms between them, we obtain for arbitrary standard extensions Z an adjunction between IP_Z and the category of Z -embeddings. Many related adjunctions, equivalences and dualities are studied and compared with each other. Suitable specializations of the function 2 provide a broad spectrum of old and new applications.     

Lawson-Hoffmann对偶定理的推广

本文讨论了Z－连续偏序集的一系列性质，主要证明了Z－连续偏序集范畴对偶等价于完全分配格范畴的一个满子范畴．     

Z-mappings and a classification theorem

In this short paper, we first introduce the concept ofZ-mappings under which the image of aZ-continuous poset (respectivelyZ-algebraic poset,Z-inductive poset) is still aZ-continuous poset (respectivelyZ-algebraic poset,Z-inductive poset). We then give a classification theorem ofZ-continuous posets which generalizes an earlier work of R.-E. Hoffmann in [3]. Communicated by J. Lawson The first author thanks Professor Lawson for his help.     

A Convenient Subcategory of Tych

A map f:XY between Hausdorff topological spaces is k-continuous if its restriction f| _K to every compact subspace K of X is continuous. X is called a k _R -space if every k-continuous function from X to a Tychonoff space is continuous. In this paper we investigate the category of Tychonoff k _R -spaces, and show that it is Cartesian closed (thus convenient in the sense of Wyler).     

Representation of merotopic and nearness spaces

The category of merotopic spaces and uniformly continuous functions is shown to be adjoint to a category of completely distributive lattices with distinguished bases and grills and complete homomorphisms preserving these structure-sets. Suitable (co-)restrictions yield a lattice-theoretical representation of nearness spaces.     

F-Continuous Graphs

For a nontrivial connected graph F, the F-degree of a vertex in a graph G is the number of copies of F in G containing . A graph G is F-continuous (or F-degree continuous) if the F-degrees of every two adjacent vertices of G differ by at most 1. All P₃-continuous graphs are determined. It is observed that if G is a nontrivial connected graph that is F-continuous for all nontrivial connected graphs F, then either G is regular or G is a path. In the case of a 2-connected graph F, however, there always exists a regular graph that is not F-continuous. It is also shown that for every graph H and every 2-connected graph F, there exists an F-continuous graph G containing H as an induced subgraph.     

The Stone-Čech compactification of a partial frame via ideals and cozero elements

A partial frame is a meet-semilattice in which certain designated subsets are required to have joins, and finite meets distribute over these. The designated subsets are specified by means of a so-called selection function, denoted by S ; these partial frames are called S-frames.

We construct free frames over S-frames using appropriate ideals, called S-ideals. Taking S-ideals gives a functor from S-frames to frames. Coupled with the functor from frames to S-frames that takes S-Lindelöf elements, it provides a category equivalence between S-frames and a non-full subcategory of frames. In the setting of complete regularity, we provide the functor taking S-cozero elements which is right adjoint to the functor taking S-ideals. This adjunction restricts to an equivalence of the category of completely regular S-frames and a full subcategory of completely regular frames. As an application of the latter equivalence, we construct the Stone-? ech compactification of a completely regular S-frame, that is, its compact coreflection in the category of completely regular S-frames.

A distinguishing feature of the study of partial frames is that a small collection of axioms of an elementary nature allows one to do much that is traditional at the level of frames or locales and of uniform or nearness frames. The axioms are sufficiently general to include as examples of partial frames bounded distributive lattices, σ-frames, κ-frames and frames.     

Equivalence of Equilibrium Problems and Least Element Problems

In this paper, we introduce the concept of feasible set for an equilibrium problem with a convex cone and generalize the notion of a Z-function for bifunctions. Under suitable assumptions, we derive some equivalence results of equilibrium problems, least element problems, and nonlinear programming problems. The results presented extend some results of [Riddell, R.C.: Equivalence of nonlinear complementarity problems and least element problems in Banach lattices. Math. Oper. Res. 6, 462–474 (1981)] to equilibrium problems. This work was supported by the National Natural Science Foundation of China (10671135) and Specialized Research Fund for the Doctoral Program of Higher Education (20060610005) and the Educational Science Foundation of Chongqing (KJ051307).     

Finite Intervals in the Lattice of Topologies

We discuss the question whether every finite interval in the lattice of all topologies on some set is isomorphic to an interval in the lattice of all topologies on a finite set – or, equivalently, whether the finite intervals in lattices of topologies are, up to isomorphism, exactly the duals of finite intervals in lattices of quasiorders. The answer to this question is in the affirmative at least for finite atomistic lattices. Applying recent results about intervals in lattices of quasiorders, we see that, for example, the five-element modular but non-distributive lattice cannot be an interval in the lattice of topologies. We show that a finite lattice whose greatest element is the join of two atoms is an interval of T ₀-topologies iff it is the four-element Boolean lattice or the five-element non-modular lattice. But only the first of these two selfdual lattices is an interval of orders because order intervals are known to be dually locally distributive.     

Strongly continuous posets and the local Scott topology

In this paper, the concept of strongly continuous posets (SC-posets, for short) is introduced. A new intrinsic topology—the local Scott topology is defined and used to characterize SC-posets and weak monotone convergence spaces. Four notions of continuity on posets are compared in detail and some subtle counterexamples are constructed. Main results are: (1) A poset is an SC-poset iff its local Scott topology is equal to its Scott topology and is completely distributive iff it is a continuous precup; (2) For precups, PI-continuity, LC-continuity, SC-continuity and the usual continuity are equal, whereas they are mutually different for general posets; (3) A T₀-space is an SC-poset equipped with the Scott topology iff the space is a weak monotone convergence space with a completely distributive topology contained in the local Scott topology of the specialization order.     

Coalgebraic representations of distributive lattices with operators

We present a framework for extending Stone's representation theorem for distributive lattices to representation theorems for distributive lattices with operators. We proceed by introducing the definition of algebraic theory of operators over distributive lattices. Each such theory induces a functor on the category of distributive lattices such that its algebras are exactly the distributive lattices with operators in the original theory. We characterize the topological counterpart of these algebras in terms of suitable coalgebras on spectral spaces. We work out some of these coalgebraic representations, including a new representation theorem for distributive lattices with monotone operators.