Normed vector lattice

In mathematics, specifically in order theory and functional analysis, a normed lattice is a topological vector lattice that is also a normed space whose unit ball is a solid set.^[1] Normed lattices are important in the theory of topological vector lattices. They are closely related to Banach vector lattices, which are normed vector lattices that are also Banach spaces.

Properties

Every normed lattice is a locally convex vector lattice.^[1]

The strong dual of a normed lattice is a Banach lattice with respect to the dual norm and canonical order. If it is also a Banach space then its continuous dual space is equal to its order dual.^[1]

Examples

Every Banach lattice is a normed lattice.

References

^ ^a ^b ^c Schaefer & Wolff 1999, pp. 234–242.

Bibliography

Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

[FOOTNOTESchaeferWolff1999234–242-1] Schaefer & Wolff 1999, pp. 234–242.

[1]

v t e Ordered topological vector spaces
Basic concepts	Ordered vector space Partially ordered space Riesz space Order topology Order unit Positive linear operator Topological vector lattice Vector lattice
Types of orders/spaces	AL-space AM-space Archimedean Banach lattice Fréchet lattice Locally convex vector lattice Normed lattice Order bound dual Order dual Order complete Regularly ordered
Types of elements/subsets	Band Cone-saturated Lattice disjoint Dual/Polar cone Normal cone Order complete Order summable Order unit Quasi-interior point Solid set Weak order unit
Topologies/Convergence	Order convergence Order topology
Operators	Positive State
Main results	Freudenthal spectral

v t e Order theory
Topics Glossary Category
Key concepts	Binary relation Boolean algebra Cyclic order Lattice Partial order Preorder Total order Weak ordering
Results	Boolean prime ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle Knaster–Tarski theorem Kruskal's tree theorem Laver's theorem Mirsky's theorem Szpilrajn extension theorem Zorn's lemma
Properties & Types (list)	Antisymmetric Asymmetric Boolean algebra topics Completeness Connected Covering Dense Directed (Partial) Equivalence Foundational Heyting algebra Homogeneous Idempotent Lattice Bounded Complemented Complete Distributive Join and meet Reflexive Partial order Chain-complete Graded Eulerian Strict Prefix order Preorder Total Semilattice Semiorder Symmetric Total Tolerance Transitive Well-founded Well-quasi-ordering (Better) (Pre) Well-order
Constructions	Composition Converse/Transpose Lexicographic order Linear extension Product order Reflexive closure Series-parallel partial order Star product Symmetric closure Transitive closure
Topology & Orders	Alexandrov topology & Specialization preorder Ordered topological vector space Normal cone Order topology Order topology Topological vector lattice Banach Fréchet Locally convex Normed
Related	Antichain Cofinal Cofinality Comparability Graph Duality Filter Hasse diagram Ideal Net Subnet Order morphism Embedding Isomorphism Order type Ordered field Positive cone of an ordered field Ordered vector space Partially ordered Positive cone of an ordered vector space Riesz space Partially ordered group Positive cone of a partially ordered group Upper set Young's lattice

Normed vector lattice

Contents

Properties

Examples

See also

References

Bibliography

Navigation menu

Normed vector lattice

Properties

Examples

See also

References

Bibliography

Navigation menu

Search