| ISSN 1683-3414 (Print) • ISSN 1814-0807 (Online) | |||
![]() |
![]() |
![]() |
|
| Log in | |||
ContactsAddress: Vatutina st. 53, Vladikavkaz,
|
DOI: 10.23671/VNC.2019.21.44621 Lexicographic Structures on Vector Spaces
Abstract:
Basic properties are described of the Archimedean equivalence and dominance in a totally ordered vector space. The notion of (pre)lexicographic structure on a vector space is introduced and studied. A lexicographic structure is a duality between vectors and points which makes it possible to represent an abstract ordered vector space as an isomorphic space of real-valued functions endowed with a lexicographic order. The notions of function and basic lexicographic structures are introduced. Interrelations are clarified between an ordered vector space and its function lexicographic representation. A new proof is presented for the theorem on isomorphic embedding of a totally ordered vector space into a lexicographically ordered space of real-valued functions with well-ordered supports. A criterion is obtained for denseness of a maximal cone with respect to the strongest locally convex topology. Basic maximal cones are described in terms of sets constituted by pairwise nonequivalent vectors. The class is characterized of vector spaces in which there exist nonbasic maximal cones.
Keywords: maximal cone, dense cone, totally ordered vector space, Archimedean equivalence, Archimedean dominance, lexicographic order, Hamel basis, locally convex space.
Language: Russian
For citation: Gutman, A. E. and Emelyanenkov, I. A. Lexicographic Structures on Vector Spaces,Vladikavkaz Math. J., 2019, vol. 21, no. 4, pp. 42-55 (in Russian). DOI 10.23671/VNC.2019.21.44621
The sole copyright holder of the published work is the Founder of the Vladikavkaz Mathematical Journal. The terms of use of this work are governed by an open license (Creative Commons Attribution-NonCommercial 4.0 International). The use of metadata of the scientific article, including the title, abstract, author information, references, identifiers, and other bibliographic description elements for subsequent unrestricted use, is carried out under the terms of the CC BY or CC0 open licenses. ← Contents of issue |
|
| |
|||
| © 1999-2026 Южный математический институт | |||