Author: Sergiu Rudeanu

Sets and Ordered Structures

eBook: US $34 Special Offer (PDF + Printed Copy): US $136
Printed Copy: US $119
Library License: US $136
ISBN: 978-1-60805-499-2 (Print)
ISBN: 978-1-60805-338-4 (Online)
Year of Publication: 2012
DOI: 10.2174/97816080533841120101


This e-book presents several basic methods and results of order theory that are currently used in various branches of mathematics. It presents topics that require a broad explanation in a concise and attractive way. Readers will easily identify problems/techniques/solutions without the frustration of long searches through previous notations, definitions and results. It begins with a sketch of axiomatic set theory and of the theory of categories. The fundamentals of the order relation are presented, including several properties equivalent to the axiom of choice, and culminating with well-ordered sets and transfinite numbers. This e-book also explains: (1) The complete existential theory of the various distinguished elements which a partially ordered set may possess, (2) The proof of the equivalence with the axiom of choice of 14 frequently used properties,(3) The fact that certain properties of ordinals are revealed as being just properties of well-ordered sets, and (4) The presentation of ordinals and cardinals both in axiomatic setting and following von Neumann’s construction. Proofs are given in detail along with numerous examples and exercises illustrating the theory and demonstrating applications. Several classes of lattices, closure operators and Galois connections include tools which serve as prerequisites to universal algebra. Other topics include embeddings and topological duality for distributive lattices. The e-book serves both as a textbook for undergraduate and graduate students and as a reference book for mathematicians working in fields different from set theory or algebra, to whom it provides a quick access to basic facts from order theory.


This eBook presents several basic methods and results of the theory of ordered sets which are currently used in various branches of mathematics. The first chapter includes, besides the usual introductory elements of set theory, a sketch of axiomatic set theory and of the theory of categories, which provides a useful language. Then the fundamentals of partially and totally ordered sets are presented, including a few properties equivalent to the axiom of choice and culminating with well-ordered sets. The next chapter deals with transfinite numbers and includes von Neumann’s construction of ordinals. An introduction to lattice theory presents modular, distributive, Boolean and complete lattices, as well as closure operators and Galois connections; these include tools which serve as prerequisites to universal algebra. Chapter 5 first deals with meet and join representations in a lattice, then comes back to the set-theoretical framework: set-theoretical embeddings and topological duality for distributive lattices. Chapter 6 sketches a few applications.

It is hoped that this volume may serve as a textbook for undergraduate and graduate mathematics students, as well as a reference book for mathematicians working in fields different from set theory or algebra. Perhaps a more appropriate title would have been “Sets and Ordered Structures for the Working Mathematician”. The interest of the eBook for an algebraist consists in implicit teaching suggestions.

Chapter 1 begins with a quite informal sketch of the Zermelo-Fraenkel axiomatic system for set theory, having in mind the idea that although the axiomatic line will not be followed in the sequel, the mathematician working within the framework of naive set theory cannot be allowed to ignore the existence of foundations. The next section gathers in a systematic presentation the most frequently used properties of correspondences, relations and functions; thus e.g. each of the concepts of injection, surjection and bijection is characterized by 6-8 equivalent conditions. Categories and functors are then introduced; although the book is not directed towards category theory, a few categorical ideas and facts will be explicitly illustrated within the concrete categories which constitute the object of this book. On the other hand, the book will sometimes gain in rigour and conciseness by making use of the categorical language, e.g. in the sections devoted to duality for posets and to the algebraic and order-theoretical aspects of lattices and representation theory.

Chapters 2 and 3 are devoted to those concepts and properties related to ordered sets which are of current use throughout the whole mathematics. The systematization offered here includes the complete existential theory of the distinguished elements which a partially ordered set may possess: least/greatest element, minimal/maximal elements, g.l.b./l.u.b. (i.e., the determination of all logical implications between these concepts). The general study of partially ordered sets, or posets for short, is then successively specialized to chains, or totally ordered sets, and well-ordered sets. Ordinals are introduced after as many of their properties as possible have been proved within the more elementary framework of well-ordered sets. The theory of ordinals and cardinals is based on the axiom stating that an abstract entity can be associated with each class of isomorphic well-ordered sets, such that to distinct classes correspond distinct entities. However in the end of chapter 3 we present von Neumann’s construction, in which every ordinal is obtained as the set of all lower ordinals.

Chapters 4 and 5 study a few topics from lattice theory, which is another specialization of the idea of order. The selection has been guided by the following three aims: to construct lattice-theoretical tools broadly used in various branches of mathematics, to sketch the lattice-theoretical background necessary to universal algebra, and to build up the representation theory for certain classes of lattices (and even of posets), thus returning, in a certain sense, to the purely set-theoretical framework. The presentation starts with semilattices, according to a general tendency of this eBook, namely to establish the results under no more hypotheses than are actually needed, whenever this does not complicate the proofs. Then lattices, modular and distributive lattices, Boolean algebras and complete lattices (in particular, compactly generated lattices) are successively studied. Closure operators and Galois connections are also investigated, in view of their numerous applications. Filters and ideals are studied both for their own interest and due to their rˆole in the representation theory of various types of posets and lattices. Under the general heading of representation are included, on the one hand, meet and join decompositions of elements in certain types of lattices, and on the other hand, set-theoretical embeddings for various types of posets and lattices, as well as the duality theory for distributive lattices with 0 and 1, in the general setting of H.A. Priestley.

Chapters 1-5 represent our selection of the fundamentals of ordered sets used in mathematics, while Chapter 6 actually sketches several applications.

Many examples and exercises are included. The book is self-contained with the slight exception of certain examples taken from other fields of mathematics. The bibliography contains items which we recommend to the reader desirous to have a deeper insight of the various topics presented in this eBook.


I began to write a draft of this eBook while I was a visiting professor at the University of Oran, Algeria, where I found excellent working conditions. Then I experimented in my courses at the University of Bucharest, with good results, several teaching ideas now included in the eBook.

I am grateful to Professor Cristian S. Calude for his invaluable help in the realization of this eBook

Sergiu Rudeanu
University of Bucharest, Romania


.Advanced Mathematical Applications in Data Science.
.Markov Chain Process (Theory and Cases).
.Advances in Special Functions of Fractional Calculus: Special Functions in Fractional Calculus and Their Applications in Engineering.
.On Generalized Growth rates of Integer Translated Entire and Meromorphic Functions.