An equivalence functor between local vector lattices and vector lattices
author
Abstract:
We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-trivial components. Nevertheless, our main purpose is to prove, via what we call the radical functor, that the category of all vector lattices and lattice homomorphisms is equivalent to the category of local vectors lattices and unital (i.e., unit preserving) lattice homomorphisms.
similar resources
Truncated Vector Lattices
In analysis, truncation is the operation of replacing a nonnegative real-valued function a (x) by its pointwise meet a (x) ∧ 1 with the constant 1 function. A vector lattice A is said to be closed under truncation if a ∧ 1 ∈ A for all a ∈ A. Note that A need not contain 1 itself. Truncation is fundamental to analysis. To give only one example, Lebesgue integration generalizes beautifully to any...
full textOn finite elements in vector lattices and Banach lattices
In Archimedean vector lattices we show that each element of the band generated by a finite element is also finite. In vector lattices with the (PPP) and in Banach lattices we obtain some characterizations of finite elements by using the generalized order units for principal bands. In the case of Banach lattices with order continuous norm the ideal of all finite elements coincides with the linea...
full textFinite Vector Spaces and Certain Lattices
The Galois number Gn(q) is defined to be the number of subspaces of the n-dimensional vector space over the finite field GF (q). When q is prime, we prove that Gn(q) is equal to the number Ln(q) of n-dimensional mod q lattices, which are defined to be lattices (that is, discrete additive subgroups of n-space) contained in the integer lattice Z and having the property that given any point P in t...
full textVector Encoding over Lattices and Its Applications
In this work, we design a new lattice encoding structure for vectors. Our encoding can be used to achieve a packed FHE scheme that allows some SIMD operations and can be used to improve all the prior IBE schemes and signatures in the series. In particular, with respect to FHE setting, our method improves over the prior packed GSW structure of Hiromasa et al. (PKC ’15), as we do not rely on a ci...
full textThe Closest Vector Problem on Some Lattices
The closest vector problem for general lattices is NP-hard. However, we can efficiently find the closest lattice points for some special lattices, such as root lattices (An, Dn and some En). In this paper, we discuss the closest vector problem on more general lattices than root lattices.
full textLower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices
Finding the shortest vector of a lattice is one of the most important problems in computational lattice theory. For a random lattice, one can estimate the length of the shortest vector using the Gaussian heuristic. However, no rigorous proof can be provided for some classes of lattices, as the Gaussian heuristic may not hold for them. In the paper we study two types of random lattices in crypto...
full textMy Resources
Journal title
volume 10 issue 1
pages 1- 15
publication date 2018-05-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023