Advertisement

Upper and Lower Bounds

  • Bernd Schröder
Chapter
  • 1.1k Downloads

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 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Abian, A. (1971). Fixed point theorems of the mappings of partially ordered sets. Rendiconti del Circolo Mathematico di Palermo, 20, 139–142.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Abian, S., & Brown, A. B. (1961). A theorem on partially ordered sets with applications to fixed point theorems. Canadian Journal of Mathematics, 13, 78–82.MathSciNetCrossRefzbMATHGoogle Scholar
  3. 40.
    Carl, S., & Heikkilä, S. (1992). An existence result for elliptic differential inclusions with discontinuous nonlinearity. Nonlinear Analysis, 18, 471–479.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 41.
    Carl, S., & Heikkilä, S. (2011). Fixed point theory in ordered sets and applications; from differential and integral equations to game theory. New York: Springer.CrossRefzbMATHGoogle Scholar
  5. 47.
    Cohn, D. L. (1980). Measure theory. Boston: Birkhäuser.CrossRefzbMATHGoogle Scholar
  6. 56.
    Davey, B., & Priestley, H. (1990). Introduction to lattices and order. Cambridge: Cambridge University Press.zbMATHGoogle Scholar
  7. 62.
    Dieudonné, J. (1960). Foundations of modern analysis. New York/London: Academic.zbMATHGoogle Scholar
  8. 85.
    Farley, J. D. (1993). The uniqueness of the core. Order, 10, 129–131.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 129.
    Heikkilä, S. (1990). On fixed points through a generalized iteration method with applications to differential and integral equations involving discontinuities. Nonlinear Analysis, 14, 413–426.MathSciNetCrossRefzbMATHGoogle Scholar
  10. 130.
    Heikkilä, S. (1990). On differential equations in ordered Banach spaces with applications to differential systems and random equations. Differential Integral Equations, 3, 589–600.MathSciNetzbMATHGoogle Scholar
  11. 131.
    Heikkilä, S., & Lakhshmikantham, V. (1994). Monotone iterative techniques for discontinuous nonlinear differential equations. New York: Marcel Dekker.Google Scholar
  12. 132.
    Heikkilä, S., & Lakhshmikantham, V. (1995). On mild solutions of first order discontinuous semilinear differential equations in Banach spaces. Applicable Analysis, 56, 131–146.MathSciNetCrossRefzbMATHGoogle Scholar
  13. 133.
    Heikkilä, S., Lakhshmikantham, V., & Sun, Y. (1992). Fixed point results in ordered normed spaces with applications to abstract and differential equations. Journal of Mathematical Analysis and Applications, 163, 422–437.MathSciNetCrossRefzbMATHGoogle Scholar
  14. 136.
    Heuser, H. (1983). Lehrbuch der analysis, Teil 2. Stuttgart: B. G. Teubner.zbMATHGoogle Scholar
  15. 137.
    Hewitt, E., & Stromberg, K. R. (1965). Real and abstract analysis. Springer graduate texts in mathematics (Vol. 25). Berlin/Heidelberg: Springer.Google Scholar
  16. 147.
    Jachymski, J. (2007). The contraction principle for mappings on a metric space with a graph. Proceedings of the American Mathematical Society, 136, 1359–1373.Google Scholar
  17. 173.
    Kratsch, D., & Rampon, J.-X. (1994). A counterexample about poset reconstruction. Order, 11, 95–96.MathSciNetCrossRefzbMATHGoogle Scholar
  18. 174.
    Kratsch, D., & Rampon, J.-X. (1994). Towards the reconstruction of posets. Order, 11, 317–341.MathSciNetCrossRefzbMATHGoogle Scholar
  19. 175.
    Kratsch, D., & Rampon, J.-X. (1996). Width two posets are reconstructible. Discrete Mathematics, 162, 305–310.MathSciNetCrossRefzbMATHGoogle Scholar
  20. 191.
    Lindenstrauss, J., & Tzafriri, L. (1973). Classical Banach spaces. Springer lecture notes in mathematics (Vol. 338). New York: SpringerzbMATHGoogle Scholar
  21. 219.
    Pelczar, A. (1961). On the invariant points of a transformation. Annales Polonici Mathematici, XI, 199–202.Google Scholar
  22. 239.
    Ramachandran, S. (1981). On a new digraph reconstruction conjecture. Journal of Combinatorial Theory Series B, 31, 143–149.MathSciNetCrossRefzbMATHGoogle Scholar
  23. 275.
    Schröder, B. (2000). Reconstruction of the neighborhood deck of ordered sets. Order, 17, 255–269.MathSciNetCrossRefzbMATHGoogle Scholar
  24. 277.
    Schröder, B. (2002). Examples on ordered set reconstruction. Order, 19, 283–294.MathSciNetCrossRefzbMATHGoogle Scholar
  25. 279.
    Schröder, B. (2004). More examples on ordered set reconstruction. Discrete Mathematics, 280, 149–163.MathSciNetCrossRefzbMATHGoogle Scholar
  26. 282.
    Schröder, B. (2007). Mathematical analysis – A concise introduction. Hoboken: Wiley.CrossRefzbMATHGoogle Scholar
  27. 283.
    Schröder, B. (2010). Fundamentals of mathematics – An introduction to proofs, logic, sets and numbers. Hoboken: Wiley.zbMATHGoogle Scholar
  28. 284.
    Schröder, B. (2010). Pseudo-similar points in ordered sets. Discrete Mathematics, 310, 2815–2823.MathSciNetCrossRefzbMATHGoogle Scholar
  29. 298.
    Stockmeyer, P. K. (1977). The falsity of the reconstruction conjecture for tournaments. Journal of Graph Theory, 1, 19–25. Erratum: Journal of Graph Theory, 62, 199–200 (2009).Google Scholar
  30. 299.
    Stockmeyer, P. K. (1981). A census of non-reconstructible digraphs. I: Six related families. Journal of Combinatorial Theory (B), 31, 232–239.MathSciNetCrossRefzbMATHGoogle Scholar
  31. 300.
    Stockmeyer, P. K. (1988). Tilting at windmills, or My quest for nonreconstructible graphs; 250th anniversary conference on graph theory (Fort Wayne, IN, 1986). Congressus Numerantium, 63, 188–200.MathSciNetGoogle Scholar

Copyright information

© Springer International Publishing 2016

Authors and Affiliations

  • Bernd Schröder
    • 1
  1. 1.Department of MathematicsUniversity of Southern MississippiHattiesburgUSA

Personalised recommendations