Fuzzy topological ordered vector spaces I

§1. Introduction.The motivation of this work comes from two different directions: infinite abelian groups, and ordered algebraic structures. A challenging problem in both cases is that of classification. In the first case, it is known for example (cf. [KA]) that the classification of abelian torsion groups amounts to that of reducedp-groups by numerical invariants called theUlm invariants(given by Ulm in [U]). Ulm's theorem was later generalized by P. Hill to the class of totally projective groups. As to the second case, let us consider for instance the class of divisible ordered abelian groups. These may be viewed as ordered ℚ-vector spaces. Their theory being unstable, we cannot hope to classify them by numerical invariants. On the other hand, being o-minimal, the theory enjoys several good model theoretic properties (cf. [P-S]), so the search for some reasonable invariants is well motivated. The common denominator of the two cases, as well as of many others, is valuation theory. Indeed given an ordered vector space, one can consider it as a valued vector space, endowed with the natural valuation. Also, the socleG[p] of a reduced abelianp-groupG, endowed with the height functionhG, is a valued vector space over(the prime field of characteristicp) with values in the ordinals (cf. [F]).

In this closing chapter we will be engaged again with notions and techniques typical for the field of Linear Algebra, but here our attention will also be focused on the abstract structure of vector spaces and linear mappings (or linear transformations) between them. Vectors—the elements of a vector space—do not need to be ordered lists of numbers, polynomials can also be viewed as vectors. Of course, matrices continue to play a prominent role, namely as representations of linear mappings between vector spaces with predetermined bases.KeywordsVector SpaceSingular Value DecompositionMatrix RepresentationCharacteristic PolynomialNull SpaceThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

In a partly ordered space the orthogonality relation is defined by incomparability. We define integrally open and integrally semi-open ordered real vector spaces. We prove: if an ordered real vector space is integrally semi-open, then a complete lattice of double orthoclosed sets is orthomodular. An integrally open concept is closely related to an open set in the Euclidean topology in a finite dimensional ordered vector space. We prove: if V is an ordered Euclidean space, then V is integrally open and directed (and is also Archimedean) if and only if its positive cone, without vertex 0, is an open set in the Euclidean topology (and also the family of all order segments \( \{ z \in V:a < z < b\} \), a < b, is a base for the Euclidean topology).

The main point of this paper is a further development of some aspects of the recent theory of recursively enumerable (r.e.) algebraic structures. Initial work in this area is due to Frölich and Shepherdson [4] and Rabin [10]. Here we are only concerned with vector space structure. The previous work on r.e. vector spaces is due to Dekker [2], [3], Metakides and Nerode [8], Remmel [11], Retzlaff [13], and the author [5].Our object of study is V∞ a countably infinite dimensional fully effective vector space over a countable recursive field . By fully effective we mean that V∞. under a fixed Godel numbering has the following properties:(i) Operations of vector addition and scalar multiplication on V∞ are presented by partial recursive functions on the Gödel numbers of elements of V∞.(ii) V∞ has a dependence algorithm, i.e., there is a uniform effective procedure which applied to any n vectors of V∞ determines whether or not they are linearly independent.We also study , the lattice of r.e. subspaces of V∞ (under the operations of intersection, ⋂ and (weak) sum, +). We note that if is not distributive and is merely modular (see [1]). This fact indicates the essential difference between the lattice of r.e. sets and .

If the vector space \({\mathcal{L}}^r(E, F)\) of all regular operators between the vector lattices E and F is ordered by the collection of its positive operators, then the Dedekind completeness of F is a sufficient condition for \({\mathcal{L}}^r(E, F)\) to be a vector lattice. \({\mathcal{L}}^r(E, F)\) and some of its subspaces might be vector lattices also in a more general situation. In the paper we deal with ordered vector spaces \({\mathcal{V}}(E, F)\) of linear operators and ask under which conditions are they vector lattices, lattice-subspaces of the ordered vector space \({\mathcal{L}}^r(E, F)\) or, in the case that \({\mathcal{L}}^r(E, F)\) is a vector lattice, sublattices or even Banach lattices when equipped with the regular norm. The answer is affirmative for many classes of operators such as compact, weakly compact, regular AM-compact, regular Dunford-Pettis operators and others if acting between appropriate Banach lattices. Then it is possible to study the finite elements in such vector lattices \({\mathcal{V}}(E, F)\), where F is not necessary Dedekind complete. In the last part of the paper there will be considered the question how the order structures of E, F and \({\mathcal{V}}(E, F)\) are mutually related. It is also shown that those rank one and finite rank operators, which are constructed by means of finite elements from E′ and F, are finite elements in \({\mathcal{V}}(E,F)\). The paper contains also some generalization of results obtained for the case \({\mathcal{V}}(E, F) = {\mathcal{L}}^r(E, F)\) in [10].

The problem of determining a representation of the state dynamics associated to a generator of formal language, which models a discrete event dynamical system, is addressed. A definition of independence between states of the generator is formulated, based on the languages generated starting from these states. A vector space structure is introduced, using the finite dimensional vector spaces with a finite number of elements. >

This paper proposes a modified Gram-Schmidt algorithm for dimension reduction of a document vector space in order to do classification. We also evaluate the performance of the proposed algorithm by comparing with commonly known algorithms such as the centroid-based algorithm and latent semantic indexing. Further, to measure efficiency, a modified Gram-Schmidt training set is applied in the centroid-based algorithm and latent semantic indexing as well. Performance measurement was based on two different parameters, viz., classification accuracy and closeness of similarity with the corresponding training set. The results shows that modified Gram-Schmidt algorithm is indeed an effective method for dimension reduction prior classification. Moreover, it is easy to code and computationally inexpensive.KeywordsCentroidDocument ClassificationDimension ReductionGram-SchmidtLSIVector Space Model

Learning bilingual sentiment lexicon for online reviews

Linear mappings on ordered vector spaces

Riesz homomorphisms between vector lattices are characterized by interval preserving order adjoints. Buskes, van Rooij, and van Haandel generalized the notion of a Riesz homomorphism to linear maps between general ordered vector spaces. In this paper, we discuss how far the characterization between vector lattices extends to directed ordered vector spaces and pre-Riesz spaces.

Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.

A general extended functional is a functional which is allowed to take on infinite values; in other words such functionals are similar to the Lebesgue integral on the space of all integrable functions. The problem of representing a general extended functional f on a vector lattice X as an operator with finite values only has been solved in [12]. In fact, this problem has been solved for a larger class of general extended operators on an ordered vector space. The solution of this problem was given by means of an extension of the range R of the functional f to some ultrapower of R. Notice, however, that it is not always the case that a functional f can be considered as a trace of some internal functional *f:*X→R. (We remark, without going into details, that such an internal functional exists exactly in the case when the results of the nonstandard analysis can be used for investigation of the given functional.) In [12] a ‘standard’ necessary and sufficient condition was given for solving this latter problem on the existence of *f. Namely, f is a trace of an internal *f if and only if it is finitely extendable. This result makes the finite extendability problem worthy of study. The present paper is a first attempt in this direction. Simultaneously we introduce and study a more general notion of weak finite extendability that coincides with finite extendability, for instance, for vector lattices with a strong unit.

Book Review: Barrelledness in topological and ordered vector spaces

A (partially) ordered vector space A (over ℝ) is said to be Archimedean if the negative elements a∈A− are the only ones for which {αa|α∈R+} has an upper bound. A vector subspace J of ordered vector space is said to be an order ideal if $$ a,b \in J,{\text{ }}c \in A,{\text{ }}a \leqq c \leqq b \Rightarrow c \in J. $$ (1.1)

Approximate solutions of vector optimization problems