A Representation for Topologically Separable Chains
✍ Scribed by I. Fleischer
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 118 KB
- Volume
- 162
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
✦ Synopsis
A characterization of chains which are separable and compact in their order topology is given in (A.J. Ostaszewski, J. London Math. Soc. 7 (1974), 758-760) as those which can be order-embedded into two horizontal segments of the lexicographic square so that the image meets the lower segment in a closed subset and the upper in points whose abscissas occur among those of the image in the lower (what this comes to is parallel projection of the upper on the lower segment sending the image into itself). The proof there is prepared for by a preliminary two-page section which introduces two equivalence relations and develops their properties in a sequence of four lemmas. A direct proof of a more general result, which also isolates the characteristics determining such a representation, is presented. 1993 Academic Press, Inc.
📜 SIMILAR VOLUMES
## Abstract Let __M__ be an MV‐algebra and Ω~__M__~ be the set of all __σ__ ‐valuations from __M__ into the MV‐unit interval. This paper focuses on the characterization of MV‐algebras using __σ__ ‐valuations of MV‐algebras and proves that a __σ__ ‐complete MV‐algebra is __σ__ ‐regular, which means
Let u be a unipotent element in a complex semisimple group G and let 3,, be the variety of Bore1 subgroups of G which contain u. In [4, 51, Springer has defined a representation of W, the Weyl group of G, on the homology of 2:, and showed how to decompose the Wrepresentation in the top homology of
This paper deals with topological properties of sets of tetrahedra ("tetrahedral representations" of three-dimensional objects). Classes of such representations which we call normal and strongly normal are defined and some of their basic properties are established. Computationally efficient methods
This paper presents a systematic approach, which is based on a new graph representation of geared kinematic chains, for the structural synthesis of geared kinematic chains. First, the new graph representation of geared kinematic chains is introduced. Next, a simple method is proposed to generate all