Solid set

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics, specifically in order theory and functional analysis, a subset S of a vector lattice X is said to be solid and is called an ideal if for all sS and xX, if |x||s| then xS. An ordered vector space whose order is Archimedean is said to be Archimedean ordered.[1] If SX then the ideal generated by S is the smallest ideal in X containing S. An ideal generated by a singleton set is called a principal ideal in X.

Examples

[edit | edit source]

The intersection of an arbitrary collection of ideals in X is again an ideal and furthermore, X is clearly an ideal of itself; thus every subset of X is contained in a unique smallest ideal.

In a locally convex vector lattice X, the polar of every solid neighborhood of the origin is a solid subset of the continuous dual space X; moreover, the family of all solid equicontinuous subsets of X is a fundamental family of equicontinuous sets, the polars (in bidual X) form a neighborhood base of the origin for the natural topology on X (that is, the topology of uniform convergence on equicontinuous subset of X).[2]

Properties

[edit | edit source]
  • A solid subspace of a vector lattice X is necessarily a sublattice of X.[1]
  • If N is a solid subspace of a vector lattice X then the quotient X/N is a vector lattice (under the canonical order).[1]

See also

[edit | edit source]
  • Vector lattice – Partially ordered vector space, ordered as a lattice

References

[edit | edit source]
  1. ^ a b c Schaefer & Wolff 1999, pp. 204–214.
  2. ^ Schaefer & Wolff 1999, pp. 234–242.
  • 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).