Riesz space | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

In mathematics, a Riesz space, lattice-ordered vector space or vector lattice is a partially ordered vector space where the order structure is a lattice. Riesz spaces are named after Frigyes Riesz who first defined them in his 1928 paper Sur la décomposition des opérations fonctionelles linéaires. Riesz spaces have wide-ranging applications. They are important in measure theory, in that important results are special cases of results for Riesz spaces. For example, the Radon–Nikodym theorem follows as a special case of the Freudenthal spectral theorem. Riesz spaces have also seen application in mathematical economics through the work of Greek-American economist and mathematician Charalambos D. Aliprantis. If is an ordered vector space (which by definition is a vector space over the reals) and if is a subset of then an element is an upper bound (resp. lower bound) of if (resp. ) for all An element in is the least upper bound or supremum (resp. greater lower bound or infimum) of if it is an upper bound (resp. a lower bound) of and if for any upper bound (resp. any lower bound) of (resp. ). A preordered vector lattice is a preordered vector space in which every pair of elements has a supremum. More explicitly, a preordered vector lattice is vector space endowed with a preorder, such that for any : Translation Invariance: implies Positive Homogeneity: For any scalar implies For any pair of vectors there exists a supremum (denoted ) in with respect to the order The preorder, together with items 1 and 2, which make it "compatible with the vector space structure", make a preordered vector space. Item 3 says that the preorder is a join semilattice. Because the preorder is compatible with the vector space structure, one can show that any pair also have an infimum, making also a meet semilattice, hence a lattice. A preordered vector space is a preordered vector lattice if and only if it satisfies any of the following equivalent properties: For any their supremum exists in For any their infimum exists in For any their infimum and their supremum exist in For any exists in A Riesz space or a vector lattice is a preordered vector lattice whose preorder is a partial order.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (1)

Related concepts (10)

Related lectures (22)

Ordered vector space

In mathematics, an ordered vector space or partially ordered vector space is a vector space equipped with a partial order that is compatible with the vector space operations. Given a vector space over the real numbers and a preorder on the set the pair is called a preordered vector space and we say that the preorder is compatible with the vector space structure of and call a vector preorder on if for all and with the following two axioms are satisfied implies implies If is a partial order compatible with the vector space structure of then is called an ordered vector space and is called a vector partial order on The two axioms imply that translations and positive homotheties are automorphisms of the order structure and the mapping is an isomorphism to the dual order structure.

Riesz space

Order dual (functional analysis)

In mathematics, specifically in order theory and functional analysis, the order dual of an ordered vector space is the set where denotes the set of all positive linear functionals on , where a linear function on is called positive if for all implies The order dual of is denoted by . Along with the related concept of the order bound dual, this space plays an important role in the theory of ordered topological vector spaces.

Invariant integrals on topological groups

Vasco Schiavo

We generalize the fixed-point property for discrete groups acting on convex cones given by Monod in [23] to topological groups. At first, we focus on describing this fixed-point property from a functional point of view, and then we look at the class of groups that have it. Finally, we go through some applications of this fixed-point property. To accomplish these tasks, we introduce a new class of normed Riesz spaces that depend on group representation. (c) 2022 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Properties of Real Numbers MATH-101(g): Analysis I

Explains the properties of subsets of real numbers, including Supremum, Infimum, intervals, open sets, and closed sets.

Real Numbers: Sets and Operations MATH-101(e): Analysis I

Covers the fundamental concepts related to real numbers, including sets, notations, and operations.

Exemple: Infimum and Supremum MOOC: Analyse I

Illustrates the calculation of infimum and supremum for a set of elements.