Band (order theory)

In mathematics, specifically in order theory and functional analysis, a band in a vector lattice X is a subspace M of X that is solid and such that for all SM such that x = sup S exists in X, we have xM.[1] The smallest band containing a subset S of X is called the band generated by S in X.[1] A band generated by a singleton set is called a principal band.

Examples

For any subset S of a vector lattice X, the set of all elements of X disjoint from S is a band in X.[1]

If () is the usual space of real valued functions used to define Lps, then is countably order complete (i.e. each subset that is bounded above has a supremum) but in general is not order complete. If N is the vector subspace of all -null functions then N is a solid subset of that is not a band.[1]

Properties

The intersection of an arbitrary family of bands in a vector lattice X is a band in X.[1]

gollark: Any modern CPU, at least, will automatically downclock to save power. RAM not so much, but the very high RAM use is making me wary of it OOMing.
gollark: Modded Minecraft: because who *needs* free RAM?(netdata gave me another low RAM alert)
gollark: Oh, right. Adding neutrons, then, which would make it unstable, should also work.
gollark: And neutrons.
gollark: Or just adding protons.

See also

References

  1. Schaefer 1999, pp. 204–214.
  • Schaefer, Helmut H. (1999). Topological Vector Spaces. GTM. 3. New York, NY: Springer New York Imprint Springer. ISBN 978-1-4612-7155-0. OCLC 840278135.CS1 maint: ref=harv (link)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.