Upper and Lower Bounds

Bernd Schröder
Additional contact information
Bernd Schröder: University of Southern Mississippi, Department of Mathematics

Chapter Chapter 3 in Ordered Sets, 2016, pp 53-76 from Springer

Abstract: Abstract Upper and lower bounds have already been defined in Definitions 2.16 and 2.17 From their use in the proof of Dilworth’s Chain Decomposition Theorem 2.26 and in the proof of Proposition 2.36 , where, in each case, sets were defined in terms of their upper bounds, as well as from their role in Zorn’s Lemma, we can infer that bounds of sets play an important role in ordered sets. In this chapter, we consider various types of bounds and relate them to open problems and to each other.

Keywords: Maximal Element; Minimal Element; Reconstruction Problem; Fixed Point Property; Extremal Element (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-29788-0_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319297880

DOI: 10.1007/978-3-319-29788-0_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().