In this chapter, we introduce basic notions such as sets, functions, relations and order which are very fundamental and used, or assumed, later in the course of the book. Readers may already be familiar with most of these topics. Here we give a quick and brief overview of these concepts. The preliminaries covered in this chapter are to make the readers familiar with the notations and terminologies and for their quick handy reference, but these cannot replace a course in the theory of sets and functions.
1.1 Sets and Set Operations
Sets and elements
If an object x is in a set A, we say that “x belongs to A” or “x is an element of A” or “x is a member of A”, and we write x ∈ A. The negation of x ∈ A is written as x 6∈ A. There are two ways of writing a set. One is the list form, which is also called the roster form. For instances, {1, 2, 3, 4, 5, 6, 7, 8, 9} and {1, 2, . . . , 1000} are finite sets written in the roster form, while the set of natural numbers N = {1, 2, 3, . . .} and the set of even integers 2Z = {. . . , −4, −2, 0, 2, 4, . . .} are infinite sets written in the roster form. It is not always convenient or possible to write a set in the roster form by listing all its elements, for example, the set of real numbers. The other way of writing a set is the set-builder form, which is of the form {x : x satisfies property P}, where P is some property used to describe the set. For example, the set 2Z, of even integers we wrote above in the list form, can be written in the set-builder form as 2Z = {x | x is an even integer}, or using the set of integers in set builder form, it can be written as 2Z = {x | x = 2n for some integer n}. The same set in the set-builder form can be written using quantifiers as 2Z = {x | ∃ n ∈ Z such that x = 2n} or {x | ∃ n ∈ Z (x = 2n)}, where ∃ is the notation for the existential quantifier, which means “there is” or “there exists”.