Fall 2021 - MATH 1101 Discrete Structures

Lecture 1
• Part 1. Introduction to the Course.
• Part 2. Sets, Functions, Cartesian Products, Multivariable Functions.
• Part 3. Set Operations. Algebra of Sets. Duality.
• Part 4. Equivalence of Sets. The Power of a Set. (Mandatory for Math students)
Exercises. Set 1 (Solved Problems)
Exercises. Set 2 (Supplementary Problems)

PART 1. Introduction to the Course.

Discrete Structures arise both within mathematics itself and in its applications such as:
computer sciences; electronics and electricity; all kinds of devices that form the basis for the
functioning of computing systems; information converters; Internet of things; information coding
and security issues and so on. Almost any research or application in information systems and
technologies uses, by some way, discrete mathematical structures.
Examples of discrete structures are various finite algebraic systems, such as finite groups, finite
graphs, Boolean algebras in various interpretations; some mathematical models of information
converters; finite state machines, Turing machines, and so on.
The branch of mathematics that studies discrete structures is called Discrete Mathematics.
Therefore, another equivalent name for our course is Discrete Mathematics.
So, discrete mathematics is a part of mathematics devoted to the study of discrete objects.
There is a huge variety of problems solved using discrete mathematics, for instance:
• How many ways are there to choose a valid password on a computer system?
• Is there a link between two computers in a network?
• How to detect spam in email messages?
• How to encrypt a message so that a random recipient cannot read it?
• What is the shortest path between two cities using a transportation system?
• How can a list of integers be sorted so that the integers are in increasing order?
• How many steps are required to do such a sorting?
• How can it be proved that a sorting algorithm correctly sorts a list?
• How many valid Internet addresses are there?
• etc.
In the proposed course, we will study the discrete structures and methods necessary to solve
the above and many other problems.
More generally, discrete mathematics is used whenever objects are counted, when relationships
between finite (or countable) sets are studied, and when processes involving a finite number of
steps are analyzed. The main reason for the growing importance of discrete mathematics is that
information is stored and processed by computers in a discrete fashion.
What the study of discrete structures (discrete mathematics) yields?
Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.1
1. Through this course, you can develop your mathematical maturity, that is, the ability to
understand and create mathematical arguments and reasoning. Without these skills, we
cannot advance in the study of mathematical sciences.
2. Discrete mathematics is the gateway to more advanced mathematical courses, in particular:
mathematical logic, set theory, number theory, advanced chapters of linear algebra, abstract
algebra, combinatorics, graph theory, probability theory (the discrete part of the subject), etc.
Discrete mathematics provides the mathematical background for most computer science
courses, including data structures, algorithms, databases, automata theory and formal
languages, compiler theory, computer security, and operating systems. It is difficult to master
such courses without having the appropriate mathematical foundations from discrete
mathematics.
3. Discrete mathematics contains the necessary mathematical background for solving problems
in operations research (including many discrete optimization methods), chemistry,
engineering, biology, and so on.
One of the primary goals of this course is to teach mathematical reasoning and problem
solving. The exercises in this lecture notes are intended to reflect this goal. The material
discussed in the lecture text provides the tools needed to solve these exercises, but the student’s
job is to successfully apply these tools using your own creativity.
Another goal of the course is to learn to analyze and develop approaches to solving
problems. Unfortunately, learning how to solve only certain types of exercises is not enough to
succeed in developing problem-solving skills needed in subsequent courses and professional
work. One of the objectives of the course is to help develop the skills necessary to master the
additional material that will be needed in future courses.

PART 2. Sets, Functions, Cartesian Products, Multivariable Functions.

Sets: definitions and basic terminology.
In Part 2, we study the fundamental discrete structure on which all other discrete structures are
built, namely, the set. Sets are used to group objects together. Often, but not always, the objects
in a set have similar properties. Indeed, our considerations in Part 2 are a brief introduction to the
well-known terminology and definitions of naïve set theory to provide students with minimal
tuple of tools and concepts.
We now provide a definition of a set. This definition is an intuitive one, which is not part of a
formal (axiomatic) theory of sets. However, it will be enough for the purposes of our course.
Definition 1. A set is an unordered collection of objects, called elements (or members) of the
set. A set is said to contain its elements. Synonyms for “set” are “class”, “collection”, and “family”.
We write a∈A to denote that a is an element of the set A. The notation a∉A denotes that a is not
an element of the set A. ∎
Specifying Sets
There are essentially two ways to specify a set. One way is to list, if possible, its members
separated by commas and contained in braces { }. Another way to describe a set is to use set
builder notation which is the vertical line | and is read as “such that”. We characterize all those
elements in the set by stating the property or properties they must have to be members. And write

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.2
down a property after set builder, |, as P(x), which means that element x has a property P.
Examples illustrating these two ways are:
A={2, 3, -1, 0, 15} and
B={x | x is an odd integer, x > 0} or B=={x | P(x)},
here P means the property to be odd integer and positive one.
That is, A consists of the numbers 2, 3, -1, 0, 15. The second set, which reads: B is the set of x
such that (builder notation=vertical line) x is an odd integer and x is greater than 0, denotes the
set B whose elements are the positive odd integers. Note that a letter, usually x, is used to denote
a typical member of the set; and the comma after builder notation is read as “and”.
EXAMPLE 1.
(a). We cannot list all the elements of the above set B although frequently we specify the set by
B={1, 3, 5, . . .} where we assume that everyone knows what we mean. Observe that 1∈B,
but 4∉B.
(b). Let E={x | x2−3x+2=0}, F={2, 1} and G={1, 2, 2, 1}. Then E=F=G. ∎
We emphasize that a set does not depend on the way in which its elements are displayed. A set
remains the same if its elements are repeated or rearranged.
Even if we can list the elements of a set, it may not be practical to do so. That is, we describe a
set by listing its elements only if the set contains a few elements; otherwise we describe a set by
the property which characterizes its elements.
Naive Set Theory
Note that the term object has been used in the definition of a set, Definition 1, without specifying
what an object is. This description of a set as a collection of objects, based on the intuitive notion
of an object, was first stated in 1895 by the German mathematician Georg Cantor. The theory
that follows from this intuitive definition of a set (Definition 1), and the use of the intuitive idea
that for any property there is a set consisting of objects with this property, leads to paradoxes or
logical inconsistencies. This was shown by the English philosopher Bertrand Russell in 1902.
These logical inconsistencies can be avoided by building set theory beginning with axioms.
However, in our lecture notes we will use Cantor’s original version of set theory, known as naive
set theory, because all sets considered in here can be treated consistently using Cantor’s original
theory.
Subsets
Suppose every element in a set A is also an element of a set B, that is, suppose a∈A implies a∈B.
Then A is called a subset of B. We also say that A is contained in B or that B contains A. This
relationship is written A⊆B or B⊇A.
Two sets are equal if they consist of the same elements or, equivalently, if each of them is
contained in the other. Clear that if A=B then A⊆B and B⊆A. Inverse statement is also true (see
Theorem 1 (ii)).
If A is not a subset of B, that is, if at least one element of A does not belong to B, we write AB.
Property 1: The statement A⊆B does not exclude the possibility that A=B. In fact, for every set
A we have A⊆A since, trivially, every element in A belongs to A. However, if A⊆B and A≠B, then
we say A is a proper subset of B (sometimes written A⊂B).
Property 2: Suppose every element of a set A belongs to a set B and every element of B belongs
to C, then A⊆C.
The above remarks yield the following theorem.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.3
Theorem 1. Let A, B, C be any sets. Then:
(i) A⊆A
(ii) If A⊆B and B⊆A, then A=B
(iii) If A⊆B and B⊆C, then A⊆C
Proof. Clear. ∎
Special symbols
Some sets will occur frequently in our notes, and so we use special symbols for them. Some such
symbols are:
Z+ (or N) = the set of natural numbers or positive integers: 1, 2, 3, …
Z = the set of all integers: ..., −2, −1, 0, 1, 2, ...
Q = the set of all rational numbers (= irreducible fractions p/q, where pZ, qN). Equivalently,
Q is the set of all finite decimal fractions or infinite periodic decimal fractions.
R = the set of real numbers
C = the set of complex numbers
Below we bring a light to the structure some of them.
About Q. We say that Q is the set of irreducible fractions p/q, where pZ, qN to avoid
1
repetitions. For instance, under such definition we choose the irreducible fraction 2 (p=1, q=2) as
1 2 3
rational number which represents the infinite family consisting of the equal numbers {2 , 4 , 6 , … }.
1 −1 −2 −3
Similarly, (− 2) represents the infinite family consisting of equal numbers { 2 , , , … }. By
4 6
the way, all fractions of the first family have a unique decimal representation, namely, 0.5.
Regarding the second family, all elements are equal to the (-0.5).
2 2 4 6
On the other hand, the irreducible fraction which represents the family {3 , , , … } can be
3 6 9
written uniquely as infinite but periodic decimal fraction 0,666… (period equal 6).
Starting with finite decimal fraction we can find uniquely defined irreducible fraction, for
28 7 7
instance, 0.28=100 = 25, that is, irreducible fraction 25 represents the same rational number as
0.25. Regarding infinite but periodic decimal numbers. For instance, 06777…=0.6(7)=
6 7 7
=10 + 100 + 1000 + ⋯
Starting from the element 7/100 the infinite sum (S) is the sum of geometric series with ratio
𝑎1
r=(1/10)<1. From secondary school we know that S=1−𝑟 , here a1=(7/100).
7
6 7 7 6 100 6 7 61
Hence 0.6(7)= 10 + 100 + 1000 + ⋯= )= 10 + 1 = 10 + 90 = 90.
1−
10

The last number (61/90) is the irreducible fraction which represents the same rational number as
0.6(7).
About R-Q. From the secondary school program, you know that there are numbers which are
not rational. For instance, √2, √3, √5 etc. Such numbers are called irrational numbers. An
irrational number cannot be written as a fraction or finite (or infinite but periodic) decimal
number. Any irrational number can be written as infinite nonperiodic decimal fraction. Set of
all irrational numbers we denote as IR. So, we have:
Q – set of all rational numbers = set of all finite or infinite but periodic decimal fractions;
Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.4
IR – set of all irrational numbers = set of all infinite NONperiodic decimal fractions.
From definition we have Q
We the set IR=R-Q≠∅.
About C (complex numbers). We specify C as a set of all ordered pairs (a, b) of real numbers
(geometrically set of all points in the plane) with standard rule of addition operation:
(a, b)+(c, d)=(a+c, b+d)
and surprising multiplication operation:
(a, b)(c, d)=(ac-bd, ad+bc)
Under such definition of C and operations it is easy to observe that each real number can be
viewed as a special case of complex number. Really, identify a real number a with pair (a, 0)∈C.
Then we have
a+b=(a, 0)+(b, 0)=(a+b, 0)=a+b.
(a, 0)(c, 0)=(ac-0, a0-0d)=(ac, 0)=ac
So, considering real numbers as a particular case of complex numbers we observe that operations
over real numbers come from operations over complex numbers (or, in other terminology, real
numbers, as a particular case of complex numbers, are closed with respect to addition and
multiplication of complex numbers). It is a reason why we say that R⊂C.
Finally, we have:
Z+⊂Z⊂Q⊂R⊂C.

Universal Set, Empty Set

All sets under investigation in any application of set theory are assumed to belong to some fixed
large set called the universal set which we denote by U unless otherwise stated or implied.
Given a universal set U and a property P, it may turn out that no element from U satisfies
property P. For example, let U=N then the following set S has no elements:
S={x | x∈U, 2x=5}={x | P(x)},
here P(x) is the property to be a positive integer satisfying the equation 2x= 5.
Such a set with no elements is called the empty set or null set and is denoted by ∅.
There is only one empty set. That is, if S and T are both empty, then S=T, since they have the
same elements, namely, none.
The empty set ∅ is also regarded as a subset of every other set. Thus, we have the following
simple result which we state formally.
Theorem 2. For any set A, we have ∅⊆A⊆U. ∎
A set with one element is called a singleton. A common error is to confuse the empty set ∅ with
the set {∅}, which is a singleton. The single element of the set {∅} is the empty set itself! A
useful analogy for remembering this difference is to think of folders in a computer file system.
The empty set can be thought of as an empty folder and the set consisting of just the empty set
can be thought of as a folder with exactly one folder inside, namely, the empty folder.
Disjoint Sets
Two sets A and B are said to be disjoint if they have no elements in common. For example,
suppose A = {1, 2}, B= {4, 5, 6}, and C = {5, 6, 7, 8}. Then A and B are disjoint, and A and C
are disjoint. But B and C are not disjoint since they have elements in common, e.g., 5 and 6. We
note that if A and B are disjoint, then neither is a subset of the other (unless one is the empty set).
Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.5
Classes of Sets
Given a set S, we might wish to talk about some of its subsets. Thus, we would be considering a
set of sets. Whenever such a situation occurs, to avoid confusion, we will talk of a class of sets
or collection of sets rather than a set of sets. If we wish to consider some of the sets in a given
class of sets, then we talk of subclass or subcollection.
EXAMPLE 2. Suppose S={1, 2, 3, 4}.
• Let A be the class of subsets of S which contain exactly three elements of S. Then
A={{1, 2, 3}, {1, 2, 4}, {1, 3, 4}, {2, 3, 4}}
That is, the elements of A are the sets {1, 2, 3}, {1, 2, 4}, {1, 3, 4}, and {2, 3, 4}. ∎
• Let B be the class of subsets of S, each of which contains 2 and two other elements of S.
Then B={{1, 2, 3}, {1, 2, 4}, {2, 3, 4}}
The elements of B are the sets {1, 2, 3}, {1, 2, 4}, and {2, 3, 4}. Thus, B is a subclass of A,
since every element of B is also an element of A. ∎
Finite and Infinite Sets.
The set of all vertices of a given polyhedron, the set of all prime numbers less than a given
number, and the set of all residents of Ganja City (at a given time) have a certain property in
common, namely, each set has a definite number of elements which can be found in principle, if
not in practice. Accordingly, these sets are all said to be finite. Clearly, we can be sure that a set
is finite without knowing the number of elements in it.
On the other hand, the set of all positive integers, the set of all points on the line, and the set
of all circles in the plane have a different property in common, namely, if we remove one element
from each set, then remove two elements, three elements, and so on, there will still be elements
left in the set at each stage. Accordingly, sets of this kind are said to be infnite.
Given two finite sets, we can always decide whether or not they have the same number of
elements, and if not, we can always determine which set has more elements than the other. It is
natural to ask whether the same is true of infinite sets. In other words, does it make sense to ask,
for example, whether there are more circles in the plane than rational points on the line, or more
functions defined in the interval [0, 1] than lines in space? As will soon be apparent, questions
of this kind can indeed be answered (see Part 4).
Power Sets (Case of Finite sets).
Given set S, we may introduce a class of all subsets of S. This class, denoted by P(S), is
called the power set of S. Note that the empty set ∅ and S itself belong to P(S) because both ∅
and S are subsets of S.
For a finite set S, let n(S) denotes number of elements in S.
Table below shows the pattern in the number of elements of power set, n(P(S)), related to the
number of elements of the set S itself, n(S).
S P(S) n(S) n(P(S))

∅ {∅} 0 1

{a} {∅, {a}} 1 2

{a, b} {∅, {a}, {b}, {a, b}} 2 4

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.6
 {a, b, c} {∅, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}} 3 8

… … … …

{a1, a2, …, ak} {∅, {a1}, {a2},…, {ak}, k 2k

{(ai, aj)|i, j=1, 2, …n; i<j},
{(ai, aj, ak, | i, j, k=1, 2, …, n; i<j<k}, …, }

Statement 1. If S is finite, then so is P(S) and n(P(S))=2n(S)

For this reason, the power set of S is sometimes denoted by 2S, instead of P(S).
Proof. Two distinct proofs of the statement will be suggested later in this course (by
Mathematical Induction and by combinatorial method).
Functions
Considering sets we face two questions:
1. How to establish a relationship between them.
2. How to formalize “equivalence” of sets.
Relationship between sets.
Processes in nature, in everyday life, in biological, physical, and other systems describe certain
relationships between sets of inputs and outputs.
In mathematical language such relationships are called a functional relationship or simply
functions.
A technical definition of a function is: a relation from a set of inputs to a set of possible outputs
where each input is related to exactly one output.
Definition 2. Let X and Y be sets. A function (mapping) from X to Y is a rule, (say f) that assigns
to every element xX exactly one element yY. The set X is called the domain (or set of inputs)
of the function, and the set Y is called the codomain (or set of outputs). ∎
The notion of a function is easily understood using the metaphor of a function machine
that takes in an object for its input and based on that input, spits out another object as its output.
Denotations and terminology.
Functions are ordinarily denoted by symbols. For a function, say f, from X to Y we write
f: X→Y which is read: “f is a function from X to Y,” or “f takes (or maps) X to Y.”
If x∈X, then f(x) (read: “f of x”) denotes the unique element of Y which f assigns to x; it
is called the image of x under f, or the value of f at x. The set X is also called domain of function
f. The set of all image values (for all x∈X) is called the range or image of f. The image of f : X→
Y is denoted by Range(f), Im(f) or f(X).

Figure 1. Yellow region is the range (or image) of the domain X (red region) under f.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.7
 For every y∈Y the set {x∈X  f(x)=y}, denoted as f-1(y), that is, f-1(y)={x∈X  f(x)=y}, is
called preimage of y. Clear that f-1(y)=∅ if and only if y∉Im(f).
The function idx: X→X defined by formula idx(x)=x is called identity function on X.
If f: X→Y and g:Y→Z are arbitrary functions then the function (gf): X→Z defined by
(gf)(x)=g(f(x)) is called composite or superposition of f and g.
A function f: X→Y is called mono or injective function if it maps distinct elements to
distinct elements; that is, x1≠x2 implies f(x1)≠f(x2) or, equivalently, (logically is called
contrapositive) f(x1)=f(x2) implies x1=x2, or, equivalently, f is injective if for any y∈Y the
preimage f-1(y) contains at most one element.
For an injective function f: X→Y define the function f -1: f(X)→X (here f(X)⊆Y) which is
called inverse of f, as following: for every y∈f(X) there exist only one x, such that f(x)=y. We
define f -1(y)=x. It is easy to see that (f -1f)=idx: X→X and (ff -1)=idf(X): f(X)→f(X).
If f(X)=Y then f is called onto or surjective function. In other words, the preimage f-1(y)
of every y∈Y is nonempty.
The function f is called a bijective function (or bijection, or one-to-one correspondence)
if it is injective and surjective at the same time. That is, f: X→Y is bijective if any y∈Y the
preimage f-1(y) contains exactly one element.

Figure 2. Different types of functions.

(a) An injective non-surjective function (b) An injective surjective function

(injection, not a bijection) (bijection)

(c) A non-injective surjective function (d) A non-injective non-surjective

(surjection, not a bijection) function (also not a bijection)
Equivalences of sets.
Definition 3. Two sets X and Y are called equivalent, XY, if there is a bijection f: X→Y. ∎
• Clear that XX (idx:X→X is the bijection). Such a property is called reflexivity.
• If f: X→Y is a bijection then f -1:Y→X is also the bijection, that is, if XY, then YX.
(symmetry property).
• If XY (f:X→Y is a bijection) and YZ (g:Y→Z is a bijection) then XZ (composition
gf:X→Z is a bijection) – transitivity property.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.8
EXAMPLE 3. Let X and Y consist of five chairs and five students, respectively. Then in the set
theory X and Y are considered as equivalent sets XY, because we can obviously build up a
bijective mapping from X to Y.
EXAMPLE 4. Let X be the open interval, X=(-/2, /2), and Y=R. Define f : X→Y as f(x)=tan(x).
Clear that f is a bijection (this fact is known from the high school program), because for each
a∈R the horizontal line y=a intersects the curve y=tan(x) exactly in one point, that is, for each
a∈R the preimage f-1(y) contains exactly one element.
This example is a surprising one because it establishes equivalences (the same “number” of
elements) between infinite set Y=R and its proper subset X=(-/2, /2). This unexpectable result
will be discussed later in Part 4 (additional readings) as a special property of “infinite” sets. ∎
EXAMPLE 5. Let f: R→R, f(x)=sinx. Clear that f is not injective (0≠ but sin 0=sin). f is not onto
because f -1(2) is empty. ∎
EXAMPLE 6. Let f(x)=sinx is considered as a mapping: R→[-1, 1]. Then f is onto. It means that
property of a function f:X→Y to be “onto” properly depends on Y. ∎
In mathematics, mostly in logic and different branches of discrete mathematics, a special kind
of functions which are called propositional functions are frequently used for many reasons. A
propositional function P with domain X is defined as rule P which assigns to each xX some
statement, say P(x), which is true or false but not both.
We will discuss this type of functions in details later in Lecture Notes dedicated to Logic.
It is easy to check that a function f : X→Y is bijective if and only if it admits an inverse
function, that is, a function g:Y→X such that gf=idx: and fg=idY.
Cartesian Product
The Cartesian product X1×…×Xn o f sets X1, …, Xn is the set of all n-tuples (x1, …, xn) such
that xi∈Xi for every i with 1≤i≤n. That is:
X1×…×Xn={(x1, …, xn) | xi∈Xi, 1≤i≤n}.
EXAMPLE 7.
• Let X={1, 2, 3}, Y={a, b}. Then X×Y={(1, a), (1, b), (2, a), (2, b), (3, a), (3, b)}. ∎
• Let X=[0, 1], Y=[0,1], here [0, 1] is the unit closed interval on the set R of real numbers, ,
that is, [0, 1]={aR | 0a1}. Then X×Y=[0, 1]×[0, 1] geometrically is the square S on the
plane R2. S={(a, b) R2 | 0a1, 0b1}. ∎
• Let X=[0, 1], Y=[-1, 5], Z=[-2, 3]. Then X×Y×Z=[0, 1]×[-1, 5]×[-2, 3] geometrically is the
rectangular box S in R3, S={(a, b, c)R2 | 0a1, -1b5, -2c3}. ∎
Any subset of the Cartesian product X×Y is called a relation from X to Y. We will discuss
relations later in details. Now we provide an equivalent definition of a function as a special case
of a relation. A relation (subset) f⊂X×Y is called a function from X to Y if for each х∈X there
exist exactly one element y∈Y of the form (x, y)∈f. Frequently we use the form y=f(x) instead
of (x, y)∈f. Sometimes we use another terminology for a function defined as a relation (=subset
of X×Y), namely, instead of function we use “graph of function”, denoted as grf, to denote the
same subset: grf={(x, y)∈X×Y | y=f(x)}.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.9
Multivariable functions and operations.
A function from Definition 2 is also called as a single-variable function. Any function
F:X1×…×Xn→Y is called multivariable function or function of n variables, or n-variable function.
Let X1=…=Xn=X. Then any function F:X×…×X→X is called n-ary operation on X. For n=1, 2,
3 operation is called unary, binary, and ternary, respectively.
If f:X1×…×Xn→Y is a function of n variables then “graph of function”, denoted as grf, is defined
as a following subset of X1×…×Xn×Y
grf={(x1, x2, …, xn, y)∈ X1×…×Xn×Y | y=f(x1, x2, …, xn,)}.
Below we provide simple examples of multivariable functions.
EXAMPLE.

• Consider the function f: R×R→R given by formula f(x, y)=x2+y2.

grf is the blue paraboloid in R3

• Let f: (0, ∞)×R→R is defined as f(x, y)=log(x)+y2.

Then grf is the presented below

EXAMPLE 8.
Below we provide an example of function which will be intensively used as a tool in each
exam.
Let a be an integer, (aZ) and m is a positive integer (mN). From high school algebra it is
known (Euclidean algorithm) that there exist uniquely defined integers q and r, 0r<m such that
a=qm+r (#1)
The number q is called the quotient while r is called the remainder.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.10
For instance,
If a=13, m=3, then q=4, r=1
If a=-13, m=3, then q=-5, r=2
We say m divides a if r=0.
Given positive integer m define a binary function F: Z×Z→{0, 1, 2, …, m-1} as follows. We
know that for any pair (s, t)Z×Z there exist uniquely defined integers q and r, 0r<m such
that,
s-t=qm+r (#2)
(here (s-t) plays the role of the integer a from formula (#1)).
Set F(s, t)=r.
Definition 4. Integers s and t are called equal by mod m, denotation st mod m, if r=0 in (#2)
or equivalently, (s-t)=qm for some qZ.
In some sources (mod m) equality is also called as (mod m) congruence.
Clear that
• if m=1 then all integers are equal each other by mod 1.
• If m=2 then two even numbers are equal each other by mod 2 as well as two odd numbers
also are equal each other by mod 2. However no even number is equal to odd number by
mod 2.
We will use (mod m) relation in forthcoming lectures. ∎
Venn Diagrams
A Venn diagram is a pictorial representation of sets in which sets are represented by enclosed
areas in the plane. The universal set U is represented by the interior of a rectangle, and the other
sets are represented by ellipses (circles) lying within the rectangle.
The interior of the circle symbolically represents the elements of the set, while the exterior
represents elements that are not members of the set. For instance, in a two-set Venn diagram, one
circle may represent the group of all wooden objects, while the other circle may represent the set
of all tables. The overlapping region, or intersection, would then represent the set of all wooden
tables. Shapes other than circles can be employed.
If A⊆B, then the ellipse representing A will be entirely within the ellipse representing B as in
Figure 3(a). If A and B are disjoint, then the ellipse representing A will be separated from the
ellipse representing B as in Figure 3(b).

U U U
B B B
A A
A

(a) A ⊆ B (b) A and B are disjoint (c)

Figure 3

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.11
However, if A and B are two arbitrary sets, it is possible that some objects are in A but not in B,
some are in B but not in A, some are in both A and B, and some are in neither A nor B; hence in
general we represent A and B as in Figure 3(c).
Arguments and Venn Diagrams
Many verbal statements are essentially statements about sets and can therefore be described by
Venn diagrams. Hence Venn diagrams can sometimes be used to determine whether an argument
is valid.
EXAMPLE 9. Determine the validity of the following argument:
S1: All my friends are musicians.
S2: Akif is my friend.
S3: None of my neighbors are musicians.
S : Akif is not my neighbor.
The premises S1 and S3 lead to the Venn diagram in Figure 4. By S2, Akif belongs to the set of
friends which is disjoint from the set of neighbors. Thus, S is a valid conclusion and so the
argument is valid.

Figure 4

PART 3. Set Operations. Algebra of Sets. Duality

Set Operations.
This section introduces the basic operations of union, intersection, and complement.
1. Union and Intersection
Both union and intersection operations are so-called binary operations on the collection of
subsets of U. These operations assign new sets, denoted by A∪B and A∩B respectively to each
pair of sets, say (A, B) according to the definitions:
(A, B) ⟼A∪B={x∈U |x∈A or x∈B} - union
(A, B)⟼A∩B={x∈U |x∈A and x∈B} - intersection
Here “or” in A∪B is used in the sense of and/or (at least one of sets A or B).
Using the definition of intersection, sets A and B are said to be disjoint or nonintersecting if
A∩B=∅.
Suppose S=A∪B and A∩B=∅. Then S is called the disjoint union of A and B.
Both operations can be visualized by Venn diagrams as below

Figure 5.

(a) Union of two sets A∪B (b) Intersection of two sets A∩B
Theorem 3. For any sets A and B, we have:
(i) A∩B⊆A⊆A∪B

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.12
 (ii) A∩B⊆B⊆A∪B.
Proof. Every element x in A∩B belongs to both A and B; hence x belongs to A and x belongs to
B. Thus A∩B is a subset of A and of B; namely A∩B⊆A and A∩B⊆B therefore A∩B⊆A∪B.
The operation of set inclusion is closely related to the operations of union and intersection, as
shown by the following theorem. ∎
Theorem 4. The following are equivalent:
(1) A⊆B, (2) A∩B=A, (3) A∪B=B.
Proof.
(1)(2). Suppose A⊆B and let x∈A. Then x∈B, hence x∈A∩B and A⊆A∩B. By Theorem 1.3,
(A∩B)⊆A. Therefore A∩B=A.
(2)(1). Suppose A∩B=A and let x∈A. Then x∈(A∩B); hence x∈A and x∈B. Therefore, A⊆B.
(1)(3). Suppose again that A⊆B. Let x∈(A∪B). Then x∈A or x∈B. If x∈A, then x∈B because
A⊆B. In either case, x∈B. Therefore A∪B⊆B. By Theorem 1.3, B⊆A∪B. Therefore A∪B = B.
(3)(1). Now suppose A∪B=B and let x∈A. Then x∈A∪B by definition of the union of sets.
Hence x∈B=A∪B. Therefore A⊆B.
Finally, from (3)(1) and (1)(2) it follows (3)(2). And from (2)(1) and (1)(3) it
follows (2)(1).
Thus A⊆B, A∪B=A and A∪B=B are equivalent. ∎
2. Complement
The absolute complement operation or, simply, complement operation, is so-called unary
operation on the collection of subsets of U. This operation assigns a new set, denoted by A, to
each set A, according to the following definition:
A={x | x∈U, x∉A}=U-A.
Some texts denote the complement of A by Ac or 𝐴̅.
Next two binary operations can be expressed in terms of operations above.
The relative complement of a set A with respect to a set B or, simply, the difference of B
and A, denoted by B\A (in that order), is the set of elements which belong to B but which do not
belong to A; that is
B\A={x | x∈B, x∉A}
The set B\A is read “B minus A.” Many texts denote B\A by B–A
The symmetric difference of sets A and B, denoted by A⊕B, (or AB in some texts)
consists of those elements which belong to A or B but not both (it means exclusive “or”).
A⊕B=(A∪B)\(A∩B) or A⊕B=(A\B)∪(B\A)
Note. Because of exclusive or property sometimes symmetric difference A⊕B is called also
union of sets A and B by modulo 2 (we take union of A and B and delete from the union
elements belonging both A and B.
We use Venn diagrams for the visualization of the last three operations (results of
operations are presented by red color).

Absolute complement Relative Complement of A (left) Symmetric difference of two

of A (white) in U, A=U-A in B (right) B-A=A∩B sets A⊕B=(A\B)∪(B\A)

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.13
Generalized Set Operations
The set operations of union and intersection can be extended to any number of sets as follows.
Consider first a finite number of sets, say, A1, A2, ..., Am. The union and intersection of these sets
are denoted and defined, respectively, by
A1∪A2∪ ... ∪Am=⋃𝑚 𝑖=1 𝐴𝑖 ={x | x∈Ai for some Ai}
A1∩A2∩ ... ∩Am=⋂𝑚 𝑖=1 𝐴𝑖 ={x | x∈Ai for every Ai }
EXAMPLE.
• Find 𝐵 = ⋂10 𝑖=1 𝐴𝑖 where 𝐴𝑖 is a circle on the plane R with radius i (i=1, 2, …, 10) that
2

is, 𝐴𝑖 ={(x, y)R2|x2+y2=i}.

Solution. Since circles 𝐴𝑖 and 𝐴𝑗 are mutually disjoint if i≠j (𝐴𝑖 ∩𝐴𝑗 = ∅) hence B= ∅.
• Find 𝐶 = ⋂5𝑖=1 𝐷𝑖 where 𝐷𝑖 is an interval [4, i+2].
Solution. Under i=1 𝐷𝑖 =[4, 3]=∅ (right endpoint must be not less than left endpoint to
avoid empty set). Since one of sets in intersection is empty so result is also empty.
Now let  be any collection of sets. The union and the intersection of the sets in the collection
 is denoted and defined, respectively, by
∪(A|A∈)={x | x∈A for some A∈}
∩(A|A∈)={x | x∈A for every A∈}
That is, the union consists of those elements which belong to at least one of the sets in the
collection  and the intersection consists of those elements which belong to every set in the
collection . ∎
Fundamental Products
Consider n distinct sets A1, A2, ..., An. A fundamental product of the sets is a set of the form
A1*∩A2*∩ ... ∩An* where Ai*=A or Ai*=A
Theorem 5.
(i) There are m=2n such fundamental products.
(ii) Any two such fundamental products are disjoint.
(iii) The universal set U is the disjoint union of all fundamental products.
Proof. Exercise. (Check the result for n=3). ∎
Partitions
Let S be a nonempty set. A partition of S is a subdivision of S into nonoverlapping, nonempty
subsets. Precisely, a partition of S is a collection {Ai}i∈I of nonempty subsets of S such that:
(i) Each a in S belongs to one of the Ai (or equivalently, S=⋃𝑖 𝐴𝑖 )
(ii) The sets of {Ai} are mutually disjoint; that is, if
Aj≠Ak then Aj∩Ak=∅
A partition concept is intensively used in different branches of mathematics.
There is an intimate connection between mappings and partitions into classes, as shown by
the following examples:
EXAMPLE 10. Let f be a mapping of a set A into a set B and partition A into sets, each
consisting
of all elements with the same image b=f(a)∈B. This gives a partition of A into classes. For
example, suppose f projects the xy-plane onto the x-axis, by mapping the point (x, y) into the

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.14
point (x, 0). Then the preimages of the points of the x-axis are vertical lines, and the
representation of the plane as the union of these lines is the decomposition into classes
corresponding to f. ∎
EXAMPLE 11. Given any partition of a set A into classes, let B be the set of these classes and
associate each element a∈A with the class (i.e., element of B) to which it belongs. This gives a
mapping of A into B. For example, suppose we partition three-dimensional space into classes by
assigning to the same class all points which are equidistant from the origin of coordinates.
Then every class is a sphere of a certain radius. The set of all these classes can be identified with
the set of points on the half-line [0, ∞), each point corresponding to a possible value of the
radius. In this sense, the decomposition of space into concentric spheres corresponds to the
mapping of space into the half-line [0, ∞). Note that, this mapping is not a bijection, because all
points on a sphere are mapped to a single point on [0, ∞). ∎
Let x be any real number. Then x lies between two integers called the floor and ceiling of
x. Specifically,
⌊𝑥⌋, called floor of x (or integral part of x), denotes the greatest integer that does not
exceed x.
⌈𝑥⌉, called ceiling of x, denotes the least integer that is not less than x.
x-⌊𝑥⌋ called the fractional part of x.
If x is itself an integer, then ⌊𝑥⌋=⌈𝑥⌉; otherwise ⌊𝑥⌋+1=⌈𝑥⌉;
EXAMPLE 12.
⌊3.14⌋=3, ⌊√5⌋=2, ⌊−3.14⌋=-4, ⌊−4⌋=-4, ⌊4⌋=4
⌈3.14⌉=4, ⌈√5⌉=3, ⌈−3.14⌉=-3, ⌈−4⌉=-4, ⌈4⌉=4
Fractional part of:
3.14 is: 3.14-⌊3.14⌋=3.14-3=0.14
(-3.14) is: (-3.14)- ⌊−3.14⌋=(-3.14)-(-4)=0.86 ∎
EXAMPLE 13. Suppose we assign all real numbers with the same fractional part to the same
class. Then the mapping corresponding to this partition has the effect of "winding" the real line
onto a circle of unit circumference.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.15
 Algebra of Sets. Duality
Definition 5. Algebra of sets is an algebraic structure which contains:
a) A family, say F, of subsets of the universal set U, including the empty set, ∅, and
universal set U itself;
and three operations
b) Two binary operations F×F→F
a. Union. (A, B) ⟼ (A∪B) , and
b. Intersection (A, B) ⟼ (A∩B)
c) Unary operation: Complement A ⟼A=U-A
Denotation for Algebra of Sets A =<F, , U, ∪, ∩,  > ∎
Algebra A satisfies various laws (identities) which are listed in Table 1 below. In fact, we
formally state this as:
Theorem 6. Algebra A satisfies the laws in Table 1.
Table 1. Laws of the Algebra of Sets
Idempotent laws: (1a) A∪A=A (1b) A∩A=A
Associative laws: (2a) (A∪B)∪C=A∪(B∪C) (2b) (A∩B)∩C=A∩(B∩C)
Commutative laws: (3a) A∪B=B∪A (3b) A∩B=B∩A
Distributive laws: (4a) A∪(B∩C)=(A∪B)∩(A∪C) (4b) A∩(B∪C)=(A∩B)∪(A∩C)
(5a) A∪∅=A (5b) A∩U=A
Identity laws:
(6a) A∪U=U (6b) A∩∅=∅
Involution laws: (7) (A)=A
(8a) A∪A=U (8b) A∩A=∅
Complement laws:
(9a) U=∅ (9b) ∅=U
DeMorgan’s laws: (10a) (A∪B)=A∩B (10b) (A∩B)=A∪B
Proof. We prove here, as example, two identities (Distributive law 4a and DeMorgan law 10a)
and left all others to readers as exercises.
(4a). Let x∈A∪(B∩C)  (x∈A or x∈(B∩C))  (x∈A or (x∈B and x∈C))  (x∈(A∪B) and
x∈(A∪C))  x∈(A∪B)∩(A∪C).
(10a). Let x∈(A∪B)  x∈ U-(A∪B)  x(A∪B)  xA and xB  x∈A and x∈B 
x∈(A∩B) ∎
Duality
The identities in Table 1 are arranged in pairs, as, for example, (2a) and (2b). We now consider
the principle behind this arrangement. Suppose E is an equation of set algebra. The dual E of E
is the equation obtained by replacing each occurrence of ∪, ∩, U and ∅ in E by ∩, ∪, ∅, and U,
respectively. For example,
the dual of (U∩A)∪(B∩A)=A is (∅∪A)∩(B∪A)=A
Observe that the pairs of laws in Table 1 are duals of each other. It is a property of set algebra,
called the principle of duality: if an equation E is an identity, then its dual E is also an identity.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.16
 Relationship between Set Operations and Functions
In this section we present fundamental relationship between union and intersection
operations in one side and functions in other side. Specifically, we propose the following three
theorems. We prove only one of them (Theorem 7). Proofs of remaining two theorems are
exercises.
Theorem 7. The preimage of the union of two sets is the union of the preimages of the sets:
f -l (A∪B)=f -l (A)∪f -l (B).
Theorem 8. The preimage of the intersection of two sets is the intersection of the preimages of
the sets:
f -l (A∩B)=f -l (A)∩f -l (B).
Theorem 9. The image of the union of two sets equals the union of the images of the sets :
f (A∪B)=f (A)∪f (B).
Note. The common way how to prove all three theorems is
Step 1 Show that left-hand side (LHS) is the subset of right-hand side (RHS)
Step 2. Conversely, RHS is the subset of LHS.
Remark 1. Surprisingly enough, the image of the intersection of two sets does not necessarily
equal the intersection of the images of the sets. For example, suppose the mapping f projects the
xy-plane onto the x-axis, carrying the point (x, y) into the (x, 0). Then the segments 0≤x≤1, y=0
and 0≤x≤1, y=1 do not intersect, although their images coincide.
Remark 2. Theorems 7-9 continue to hold for unions and intersections of an arbitrary number
(finite or infinite) of sets.
Proof (Theorem 7).
Check that f -l (A∪B)f -l (A)∪f -l (B). Really, let xf -l (A∪B)  f(x)A∪B  f(x) belongs to
A or B or both. Without losing generality, let f(x) A  xf -l (A)  xf -l (A)∪f -l (B). Hence
the relation f -1 (A∪B)f -l (A)∪f -l (B) is proved.
Now we check the relation f -l (A)∪f -l (B)f -l (A∪B). Really, let xf -l (A)∪f -l (B)  x belongs
to f -l (A) or f -l (B) or both B. Without losing generality, let xf -l (A)  f(x)A  f(x)A∪B
 xf -l (A∪B). Theorem is proved. ∎

Part 4. Equivalence of Sets. The Power (Cardinality) of a Set

(Additional Reading (optional; mandatory for math students)
From Part 2 we know that two sets are called equivalent if there exist a bijection between
them. The next question seems very natural: given two sets X and Y how to understand (or to
predict) whether a bijection exist?
To compare two finite sets A and B we can apply two methods.
Method 1. We can count the number of elements in each set and then compare the two
numbers. Alternatively,
Method 2. We can try to establish a bijection between A and B. It is clear that a bijection
between two finite sets can be set up if and only if the two sets have the same number of elements.
For example, to ascertain whether or not the number of students in an assembly is the same as
the number of seats in the auditorium, there is no need to count the number of students and the
number of seats. We need merely observe whether or not there are empty seats or students with
Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.17
no place to sit down (see also Example 3 in Part 2 above). If the students can all be seated with
no empty seats left, i.e., if there is a bijection between the set of students and the set of seats, then
these two sets obviously have the same number of elements.
The important point here is that the Method 1 (counting elements) works only for finite sets,
while the Method 2 (setting up a bijection) works for infinite sets as well as for finite sets.
Infinite sets: Countable and Uncountable sets.
The simplest infinite set is the set Z+ of all positive integers.
Definition 6. An infinite set is called countable if its elements can be put in bijection with those
of Z+. In other words, a countable set is a set whose elements can be numbered a1, a2, ..., an. By
an uncountable set we mean, of course, an infinite set which is not countable. ∎
From transitivity property of a bijection we immediately conclude that all countable sets are
equivalent (because each of them are equivalent to Z+).
We now give examples of countable sets and discover an unexpected property (Examples 14-
16) of them: countable set is equivalent to its proper subset. Later (Theorem 13) it will be
proved in general case: any infinite set is equivalent to its proper subset. Clear that such a
property is impossible for a finite set and therefore this property is a characteristic property of all
infinite sets.
EXAMPLE 14. The set Z of all integers (positive, negative and zero) is countable. In fact, we can
set up the following bijection between Z and the set Z+ of all positive integers:
0, -1, 1, -2, 2, ... Z
1, 2, 3, 4, 5, ... Z+
More explicitly, we associate the nonnegative integer n≥0 with the odd number 2n+1, and the
negative integer n<0 with the even number 2|n|, that is,
n  2n+1 if n>0,
n  2|n| if n<0
(the symbol  denotes a bijection). ∎
EXAMPLE 15. The set of all positive even numbers is countable, as shown by the obvious
correspondence n  2n. ∎
EXAMPLE 16. The set 2, 4, 8, ..., 2n, ... of powers of 2 is countable, as shown by the obvious
correspondence n  2n. ∎
EXAMPLE 17. The set Q of all rational numbers is countable.
Proof. We first note that every rational number r can be written uniquely as an irreducible
fraction p/q, q>0. Call the sum |p|+q the "height" of the rational number r. Clear that number of
irreducible fractions with given height n>0 is fintie. For example,
if n=1 we have only one fraction, namely 0/1
if n=2 we have two fractions, -1/1 and 1/1
if n=3 we have four fractions, -2/1, -1/2, 1/2, 2/1,

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.18
We can now arrange all rational numbers in order of increasing height (with the numerators
increasing in each set of rational numbers of the same height). In other words, we first count the
rational numbers of height 1, then those of height 2 (suitably arranged), those of height 3, and so
on. In this way, we assign every rational number a unique positive integer, i.e., we set up a
bijection between the set Q of all rational numbers and the set Z+ of all positive integers. ∎
Elementary properties of countable sets.
Below we prove two important properties of countable sets.
Theorem 10. Every subset of a countable set is finite or countable.
Proof. Let A be countable, with elements a1, a2, ..., and let B be a subset of A. Among the
elements a1, a2, ..., let anl, an2, ... be those in the set B. If the set of numbers n1, n2, ... has a largest
number, then B is finite. Otherwise B is countable (consider the correspondence i  ani). ∎
Next statement asserts that a family of countable sets is closed with respect to union
operation.
Theorem 11. The union of finite or countable number of countable sets is itself countable.
Proof. We can assume that no two of the sets A1, A2, ... have elements in common, since
otherwise we could consider the sets
A1, A2-A1, A3-(A1∪A2), ...
instead, which are countable by Theorem 10 and have the same union as the original sets.
Suppose we write the elements of A1, A2, ... in the form of an infinite table
a11, a12, a13, a14, ...
a21, a22, a23, a24, ... (4.1)
a31, a32, a33, a34, ...
a41, a42, a43, a44, ...
..................................
where the elements of the set A1, appear in the first row, the elements of the set A2, appear in the
second row, and so on.
We now count all the elements in (4.1) "diagonally," i.e., first we choose a11, then a12, then a21,
and so on, moving in the way shown in the following table

(4.2)

It is clear that this procedure associates a unique positive integer to each element in each of the
sets A1, A2, ... thereby establishing a bijection between the union of the sets A1, A2, ... and the
set Z+ of all positive integers. ∎
Two important properties of infinite sets.
First result says that among the infinite sets countable set is the smallest one.
Theorem 12. Every infinite set has a countable subset.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.19
Proof. Let M be an infinite set and a1, any element of M. Being infinite, M contains an element
a2, distinct from a1, an element a3, distinct from both a1 and a2, and so on. Continuing this process
(which can never terminate due to a "shortage" of elements, since M is infinite), we get a
countable subset A={a1, a2, .... an, ... } of the set M. ∎
Remark 1. Theorem 12 shows that countable sets are the "smallest" infinite sets. The question
of whether there exist uncountable (infinite) sets will be considered later in this Part.
In Part 2 Definition 3 we noticed that two sets X and Y are equivalent if there is a bijection
f:X→Y between them. We also demonstrated there very surprising Example 4 which establishes
equivalences (the same “number” of elements) between infinite set Y=R and its proper subset
X=(-/2, /2) and mentioned that this unexpectable result is a special property of “infinite” sets.
We demonstrate two interesting examples of equivalent sets more.
EXAMPLE 18. Define the unit sphere S2 in the space R3 as following
S2={(x, y, z)R3| x2+y2+(z-1)2=1} - sphere in R3 with radius 1 centerred at (0, 0, 1).
Then the (north) pole point of S2 is the point P(0, 0, 2).
Statement. The plane R2 is equivalent to the set S2-{P}.
In fact, a bijection between the points of the two sets can be established by using stereographic
projection : S2-{P}→ R2

P(0, 0, 2)

Q
 Plane z=0 (or R2)

S(x, y, 0)

A stereographic projection from the north pole P onto the plane z=0.
We take any point QS2-{P} and take the uniquely defined line L through P and Q. Then the
intersection of L and the plane z=0 (say point S) is the inuquely defined image of Q under the
mapping , (Q)=S. Geometrically, it is clear that  is the bijection. ∎
EXAMPLE 19. Any closed intervals [a, b], a<b, and [c, d], c<d are equivalent (they contain the
“same” number of points).
Proof. Figure below shows how to set up a one-to-one correspondence between them. Here two
points p and q correspond to each other if and only if they lie on the same ray emanating from
the point 0 in which the extensions of the line segments ac and bd intersect.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.20
 ∎
Note. In Particular, if c<a<b<d, then we find that closed interval [c, d] is equivalent to its proper
subinterval [a, b]. This result is similar to the Examples 4, 14-17 which establish an equivalence
between infinite set and its proper subset. This fact is characteristic of all infinite sets as shown
by the next theorem 13 and can be used to define such sets.
The second important result about infinite sets which can be considered as characteristic
property (definition) of them is the Theorem 13 below.
Theorem 13. Every infinite set is equivalent to one of its proper subsets.
Proof. According to Theorem 12, any infinite set M contains a countable subset, say:
A={al, a2, ..., an, ...}.
Partition A into two countable subsets
A1={al, a3, a5, ...}, A2={a2, a4, a6, ...}.
Obviously, we can establish a bijection between the countable sets A and A1, say, ana2n-1. This
bijection can be extended to a one-to-one correspondence between the sets A∪(M-A)=M and
A1∪(M-A)=M–A2, by simply assigning x itself to each element xM-A. But M-A2 is a proper
subset of M. ∎
Uncountable sets.
In considerations above we demonstarted examples of countable sets. Now the question
arises: do there exist infinite uncountable sets? The existence of such sets is shown by the
following theorem 14.
Theorem 14. The set of real numbers in the closed unit interval [0, 1] is uncountable.
Proof. Assume the contrary. Suppose we have somehow managed to count some or all of the
real numbers in [0, 1], arranging them in a list
1=0, a11a12...a1n...,
2=0, a21a22...a2n...,
3=0, a31a32...a3n..., (4.3)
...............................
n=0, an1an2...ann...,
where aik, is the k-th digit in the decimal expansion of the number i.
Consider the decimal
=0, b1b2...bn... (4.4)

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.21
constructed by Cantor diagonalization process as follows:
for b1, choose any digit (from 0 to 9) different from a11,
for b2, any digit different from a22, and so on, and in general
for bn, any digit different from ann.
Then the decimal (4.4) cannot coincide with any decimal in the list (4.3). In fact,  differs from
1, in at least the first digit, from 2, in at least the second digit, and so on, since in general,
bn≠ann for all n. Thus no list of countable real numbers in the interval [0, 1] can include all the
real numbers in [0, 1].
The above argument must be refined slightly since certain numbers, namely those of the
form p/10q, can be written as decimals in two ways,
1 5
= = 0.5000 … . = 0.4999 …
2 10
9 9
Really, 0.499.....=0.4+(100 + 1000 + ⋯ ). The term in paranthesis is the sum (S) of geometric
9 9
series 100 , 1000 , …. with ratio r=(1/10). From secondary school program it is known that
9
𝑎
1 100 10 1 1
S=1−𝑟 = 1 = 100 = 10. Hence, 0.499...=0.4+0.1=0.500...= 2
1−
10

Thus, the fact that two decimals are distinct does not necessarily mean that they represent distinct
real numbers. However, this difficulty disappears if in constructing , we require that  contain
neither zeros nor nines, for example by setting bnn=2 if ann=1 and bn=1 if ann≠1. ∎
Thus the set [0, 1] is uncountable. Other examples of uncountable sets equivalent to [0,1] are
1) The set of points in any closed interval [a, b];
2) The set of points on the real line;
3) The set of points in any open interval (a, b);
4) The set of all points in the plane or in space;
5) The set of all points on a sphere or inside a sphere;
6) The set of all lines in the plane;
7) The set of all continuous real functions of one or several variables.
Power (=Cardinality) of a Set.
Definition 7. Given any two sets M and N, suppose M and N are equivalent, M. Then M and N
are said to have the same power (cardinality). ∎
Thus, a cardinality is something shared by equivalent sets. We use symbol |∙| to denote
cardinality. Hence if M~N then we write |M|=|N|.
If M and N are equivalent finite sets, then M and N have the same number of elements,
and the concept of the cardinality of a set reduces to the usual notion of the number of elements
in a set, that is, |M|=|N|=k, here k=0, 1, 2, 3, …
Definition 8. The power of the set Z+ of all positive integers, and hence the cardinality of any
countable set, is denoted by the symbol 0, read "aleph null." A set equivalent to the set of real
Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.22
numbers in the interval [0, 1], and hence to the set of all real numbers, is said to have the
cardinality of the continuum, denoted by c (first letter of the word “continuum”). ∎
For the cardinalities of finite sets (that is, for the positive integers), we have the notions
of "greater than" and "less than," as well as the notion of equality (ordering property). We now
show how these concepts are extended to the case of infinite sets.
Let A and B be any two sets, with cardinalities |A| and |B|, respectively. If A is equivalent
to B, then |A|=|B| by the Definition 7.
Below we a bit extend Definition 7 in the form of Definition 9.
Definition 9. Given two sets A and B we say
• |A|=|B| if there is a bijection f from A to B
• |A|≤|B| if there is an injection f from A to B
• |A|<|B| if there is an injection f from A to B but no bijective function from A to B (that is, no
surjective function from A to B). ∎
Logically, we have one more case:
-) A and B are not equivalent, and neither has a subset equivalent to the other.
Last case would obviously show the existence of powers that cannot be compared, but it can be
proved (based on so-called well-ordering theorem) that this case is impossible. We use this fact
without proof.
If |A|≤|B| and |B|≤|A|, then A and B are equivalent and hence have the same cardinality,
as shown by the Cantor-Bernstein theorem (Theorem 16, next section).
Therefore, we see that any two sets A and B:
either have the same cardinality: |A|=|B|
or else satisfy one of the relations: |A|<|B| or |A|>|B|.
For example, it is clear that, 0<c (why?).
Remark 3. A very deep problem of the existence of powers between 0 and c is called
continuum hypothesis (abbreviated as CH). It states, there is no set whose cardinality is strictly
between that of the integers and the real numbers, that is, there is no D, such that 0<|D|<c. This
problem has been solved in 1963 by Paul Cohen.
As a rule, however, the infinite sets encountered in Calculus are either countable or else
have the cardinality of the continuum. The infinite sets encountered in Discrete Structure are
mainly countable.
So far, we established that
• countable sets (with cardinality 0) are the "smallest" infinite sets;
• there are infinite sets of cardinalities greater than that of a countable set, namely sets with the
cardinality of the continuum.
It is natural to ask whether there are infinite sets of cardinalities greater than that of the
continuum or, more generally, whether there is a "largest" cardinality. This question is answered
by the following Theorem 15.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.23
Theorem 15. Given any set M, let M be the set whose elements are all possible subsets of M.
Then the power of M is greater than the power of the original set M.
Proof. Clearly, the power  of the set M cannot be less than the power m of the original set M,
since the "single-element subsets" (or "singletons") of M form a subset of M equivalent to M.
Thus, we need only show that m and  do not coincide, that is, m≠.
Assume the contrary. Suppose a bijection f:M→M
aA, bB, …
has been established between the elements a, b, … of M and certain elements A, B, … of M (i.e.,
certain subsets of M). We assert that A, B, … do not exhaust all the elements of M, i.e., all the
subsets of M. To see this, let X be the set of elements of M which do not belong to their
"associated subsets". More exactly, if aA we assign a to X if aA, but not if aA.
Clearly, X is a subset of M and hence an element of M. Since f is a bijection then there exists
xM such that f(x)=X, that is, xX. Question: whether x belongs to X. Suppose xX. Then
xX, since, by definition, X contains every element not contained in its associated subset. On
the other hand, suppose xX. Then xX , since X consists precisely of those elements which do
not belong to their associated subsets. In any event, the element x corresponding to the subset X
must simultaneously belong to X and not belong to X. But this is impossible!
It follows that there is no such element x. Therefore, no bijection can be established between the
sets M and M, i.e., m≠ and we obtain that <m. Theorem is proved. ∎
Thus, given any set M, there is a set M of larger power, a set M* (set of all possible
subsets of M) of still larger power, and so on indefinitely. In particular, there is no set of "largest"
power.
Cantor-Bernstein Theorem (optional reading).
The Cantor-Bernstein (sometimes in literature Cantor–Schröder–Bernstein or Schröder–
Bernstein) Theorem is one of the important facts in the set theory and asserts that two sets are
equivalent if each of them contains a subset which is equivalent to another set.
Below we provide two different proofs of this Theorem.
Theorem 16. (Cantor-Bernstein). Given any two sets A and B, suppose A contains a subset A1,
equivalent to B, while B contains a subset B1, equivalent to A. Then A and B are equivalent.
Proof 1. (Cantor-Bernstein Theorem). The following proof is attributed to Julius König (J. König
(1906). "Sur la théorie des ensembles". Comptes Rendus Hebdomadaires des Séances de
l'Académie des Sciences. 143: 110–112.)
Since A is equivalent to B1B then there exist an injective function f :A→B, such that
f(A)=B1. (f is the bijection between A and B1). By the similar arguments there exist an injective
function g:B→A, such that g(B)=A1 (g is the bijection between B and A1).
Assume without loss of generality that A and B are disjoint and imagine (for this part of
proof) we work with set A∪B. For any aA and bB we can form a unique two-sided sequences
(#1) and (#2) of elements that are alternately in A and B, by repeatedly applying
f and g-1 to go from A to B (where defined) and

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.24
g and f-1 to go from B to A (where defined);
Sa: ... →f-1(g-1(a))→g-1(a)→a→f(a)→g(f(a))→... (#1)
Sb: ... →g-1(f-1(b))→f-1(b)→b→g(b)→f(g(b))→... (#2)
The inverses f-1 and g-1 are understood as partial functions at this stage of the proof, that is,
domain of f-1 is a subset of B and domain of g-1 is a subset of A.
For any particular aA and bB, this sequence may terminate to the left or not, at a
point where f-1 or g-1 is not defined.
Proposition 1. For distinct points c and d from A∪B the sequences Sc and Sd are disjoint or
completely the same, that is, Sc∩Sd=∅ or Sc=Sd.
Proof. Exercise. (Immediately follows from the fact that f and g are injective). ∎
Thus, each point cA∪B belongs to only sequence Sc and such sequences form the
partition of A∪B:
• Sc≠∅
• ⋃c∈A∪B Sc = A ∪ B
• If Sc∩Sd≠∅ then Sc∩Sd=∅
Regarding structure of a sequence Sc, no matter, case (#1) or (#1). We introduce the definitions.
Call a sequence Sc, an A-stopper if it stops (under moving to the left) at an element of A, or a B-
stopper if it stops at an element of B. Otherwise, call it doubly infinite if all the elements are
distinct or cyclic if it repeats.
Finally, we can define a bijection h:A→B at least by two different ways:
Method 1:
f(a), if Sa is A − stopper
−1 (a),
ℎ(𝑎) = {g if Sa is B − stopper
−1 (a),
g if Sa is double infinite or cyclic
Method 2
f(a), if Sa is A − stopper
−1 (a),
ℎ(𝑎) = {g if Sa is B − stopper
f(a), if Sa is double infinite or cyclic
Proposition. 2. h:A→B is a surjective.
Clear, since f and g both injective. ∎
Proposition 3. h:A→B is a surjective.
Proof. Exercise. ∎
Thus, h is a bijection. Theorem is proved. ∎
EXAMPLE 20. Below we provide an example to demonstrate König's definition of a bijection
h:A→ B (see picture and explanation below).

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.25
 König's definition of a bijection h:A→B from given
example injections f:A→B and g:B→A. An element in A
and B is denoted by a number and a letter, respectively.
We use Method 1 to define h.
The sequence 3→e→6→... is an A-stopper, leading to the
definitions h(3)=f(3)=e, h(6)=f(6), ....
The sequence d→5→f→... is a B-stopper, leading to
h(5)=g−1(5)=d, ....
The sequence ... →a→1→c→4→... is doubly infinite,
leading to h(1)=g−1(1)=a, h(4)=g−1(4)=c, .... The sequence
b→2→b is cyclic, leading to h(2)=g−1(2)=b.

Proof 2. (Cantor-Bernstein Theorem). The proof presented here belongs to Leo Goldmakher
(https://web.williams.edu/Mathematics/lg5/CanBer.pdf ) and it is modeled on the argument
given in A. N. Kolmogorov and S. V. Fomin, Introductory Real Analysis, translated by R. A.
Silverman, Dover Publications, New York, 1975.
We use several lemmas within the Proof 2.
For the simplicity denote A0=A and B0=B. By hypothesis, there is a bijections f:A0→Bl and g:
B0→A1, so that
f(A0)=Bl B0 (4.5) g(B0)=A1A0 (4.6)
Consider the following Table 1.

Left Column Right Column

0 A0 = A B0 = B
1 A1 = g(B0) B1 = f(A0)
2 A2 = g(B1) B2 = f(A1)
... ...................... ...........................
n An = g(Bn−1) Bn = f(An−1)
...................... ...........................
Rule. To obtain the n-th set Bn, n=0, 1, 2, ..., in the right column we apply the bijection f to the
(n-1)-th set An-1 in left column. Similarly, to get the n-th set An in left column we apply the
bijection g to the (n-1)-th set Bn-1 in right column.
Since f and g are both bijections so we obtain the following chains of equivalences
A=A0B1A2B3A4... (4.7)
B=B0A1B2A3B4... (4.8)
Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.26
 Since Bl B0 so A2=g(B1) g(B0)A1. Similarly, since Al A0 so B2=f(B1)f(B0)B1
In general, by the similar aruments it can be shown that
A=A0⊇A1⊇A2⊇... (4.9)
B=B0⊇B1⊇B2⊇... (4.10)
Remark 2. If An=An+1 for some n, then (4.7) and (4.8) immediately imply that A∼B and theorem
is proved. Therefore, we assume that the inclusions in (4.9) and (4.10) are all strict. That is,
A=A0A1A2... (4.9)
B=B0B1B2... (4.10)
The following Lemma 1 is almost clear and we use it to continue the proof of the theorem.
Lemma 1. Suppose we have sets {Xi} and {Yi} satisfying Xi∼Yi for all i. If all the Xi are pairwise
disjoint, and all the Yi are pairwise disjoint, then
⋃𝑖 𝑋𝑖 ~ ⋃𝑖 𝑌𝑖 (4.11)
Proof. Exercise. ∎
Thus, to continue our line of argument, we require analogues of the sets Ai which are
pairwise disjoint. For each n, set
𝐴∗𝑛 = 𝐴𝑛 − 𝐴𝑛+1 (4.12)
If 𝐴∗𝑛 =  for some n, then An=An+1 and, by Remark above, we obtain that A∼B and the theorem
is proved. Therefore, we assume that 𝐴∗𝑛 ≠  for all n.
Clear that 𝐴∗𝑛 ≠  for all n because of (4.9)
Lemma 2. All 𝐴∗𝑛 are are pairwise disjoint.
Proof. Let n<k. We prove that 𝐴∗𝑛 ∩ 𝐴∗𝑘 = ∅. Assume the contrary. Let x𝐴∗𝑛 ∩ 𝐴∗𝑘 = (𝐴𝑛 −
𝐴𝑛+1 ) ∩ (𝐴𝑘 − 𝐴𝑘+1 ), n+1≤k. Hence xAn, x An+1 and xAk, x Ak+1. But two conditions
x An+1 and xAk, contradict each other because of (4.9) [since n+1≤k, so Ak  An+1 and last
implies that if xAk then xAn+1 which is impossible because x An+1 ]. Hence 𝐴∗𝑛 ∩ 𝐴∗𝑘 = ∅. ∎
Similarly, for each n we set
𝐵𝑛∗ = 𝐵𝑛 − 𝐵𝑛+1 (4.13)
Again 𝐵𝑛∗ ≠  for all n and all
Lemma 2. All 𝐵𝑛∗ are are pairwise disjoint. ∎
Lemma 3. FollowingThe following equavalences are true
𝐴∗0 𝐵1∗ 𝐴∗2 𝐵3∗ 𝐴∗4 ... (4.14)
𝐵0∗ 𝐴1∗ 𝐵2∗ 𝐴∗3 𝐵4∗ ... (4.15)
Proof. Trivially follows from definitions 𝐴∗𝑛 and 𝐵𝑘∗ . Really, let’s check, for example, 𝐴∗0 𝐵1∗ .
We have: 𝐴∗0 = 𝐴0 − 𝐴1 , 𝐵1∗ = 𝐵1 − 𝐵2 = 𝑓(𝐴0 ) − 𝑓(𝐴1 ) = 𝑓(𝐴0 − 𝐴1 ). Last equality follows
from A1A0 and the fact that f is a bijection. Finally, 𝑓(𝐴0 − 𝐴1 ) = 𝑓(𝐴∗0 ). Hence 𝐴∗0 𝐵1∗ . ∎

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.27
 Equivalences (4.14), (4.15) are dual or analogous to (4.7), (4.8) and presented in figure
below

We continue to proof the theorem. Since 𝐴∗0 𝐵1∗ (4.14) and 𝐴1∗ 𝐵0∗ (4.15), and because of Lemmas
(2) and (2) we apply Lemma 1 and obtain
(𝐴∗0 ∪ 𝐴1∗ )(𝐵0∗ ∪ 𝐵1∗ ).
More generally, we deduce that for all n
(𝐴∗2𝑛 ∪ 𝐴∗2𝑛+1 )(𝐵2𝑛
∗ ∗
∪ 𝐵2𝑛+1 ). (4.16)
Taking the union over all n and once again applying Lemma 1, we conclude that
(⋃𝑛≥0 𝐴∗𝑛 )~(⋃𝑛≥0 𝐵𝑛∗ ) (4.17)
Left hand side (LHS) and Right hand side (RHS) of (4.17), denoted by 𝐴̃ and 𝐵̃ respectively,
look a lot like A and B. But in general it is not true. Recall that
𝐴̃ =(A0-A1)∪(A1-A2)∪ ... ∪(An-An+1)∪ ... (4.18)
𝐵̃ =(B0-B1)∪(B1-B2)∪ ... ∪(Bn-Bn+1)∪ ... (4.19)
𝐴̃~𝐵̃ (4.17)
Clear that 𝐴̃ A and 𝐵̃B. For instance, if x𝐴̃ , then there exist n such that x(An-An+1) 
xAn  xA because of (4.9).
Now let us bring the light to the structure of A-𝐴̃ and B-𝐵̃. Let xA-𝐴̃. Last means that
xA=A0 (4.20)
and x𝐴̃. (18) implies that
xA0-A1 (4.201)
xA1-A2 (4.202)
....
xAn-An+1 (4.20n+1)
...
System of relations (4.20)-(4.201)–(4.20n+1) imples that xAn, n≥0. Hence x⋂n≥0 𝐴𝑛 . Denote
D=⋂n≥0 𝐴𝑛 . Therefore, A-𝐴̃D.

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.28
Conversly. Let xD  xAn, n≥0  xAn-An+1 for all n≥0  [because of (4.18)]  x𝐴̃
xA-𝐴̃. Hence, DA-𝐴̃. Therefore, ⋂n≥0 𝐴𝑛 =D=A-𝐴̃.
Thus, we proved that sets 𝐴̃ and D form a partition of the set A:
(i). 𝐴̃ ∩ D=
(ii) 𝐴̃ ∪ D=A
By similar arguments it can be proved that 𝐵̃ and E=⋂n≥0 𝐵𝑛 form a partition of B, that is:
(iii) 𝐵̃ ∩ E=
(iv) 𝐵̃ ∪ E=B
Ealier we proved that 𝐴̃~𝐵̃ (see 4.17). We show below that D~E.
Lemma 4. f(D)=E and g(E)=D.
Proof. We show that f(D)=E. Let xD  xAn, n≥0  f(x)Bn, n≥1  f(x)B0  f(x)Bn,
n≥0  f(x)E=⋂n≥0 𝐵𝑛 . Hence, f(D)E.
Conversly, Let yE  yBn, n≥0  ! xA0 such that f(x)=yB1 [since f is the bijection]. As
Bn=f(An-1) and yBn  xAn-1 , n≥1  x⋂n≥0 𝐴𝑛 =D  y=f(x)f(D). Hence, E f(D).
Therefore, f(D)=E.
By similar arguments we can prove that g(E)=D. ∎
Finally, we apply Lemma 1 to the pairs (𝐴̃, D) and (𝐵̃, E) and obtain that A~B. Theorem
15 is proved. ∎

EXERCISES. SET 1 (Solved Problems)

Sets, Operations, Duality
1.1. Which of these sets are equal: {x, y, z}, {z, y, z, x}, {y, x, y, z}, {y, z, x, y}?
Solution. They are all equal. Order and repetition do not change a set. ∎
1.2. List the elements of each set where N = {1, 2, 3, …}.
(a) A = {x ∈ N| 2<x<10}
(b) B = {x ∈ N| x is odd, x<9}
(c) C = {x ∈ N| (x-1.5)2=0}
Solution.
(a) A consists of the positive integers between 2 and 10; hence A={3, 4, 5, 6, 7, 8, 9}.
(b) B consists of the odd positive integers less than 9; hence B={1, 3, 5, 7}.
(c) No positive integer satisfies (x-1.5)2=0; hence C=∅, the empty set. ∎
1.3. Let U={1, 2, …, 9} be the universal set, and let
A={1, 2, 3, 4, 5}, C={5, 6, 7, 8, 9}, E={2, 4, 6, 8},
B={4, 5, 6, 7}, D={1, 3, 5, 7, 9}, F ={1, 5, 9}.
Find: (a) A∪B and A∩B; (b) A∪C and A∩C; (c) D∪F and D∩F.
Solution. Recall that the union X∪Y consists of those elements in either X or Y (or both), and
that the intersection X∩Y consists of those elements in both X and Y
(a) A∪B={1, 2, 3, 4, 5, 6, 7} and A∩B={4, 5}
(b) A∪C={1, 2, 3, 4, 5, 6, 7, 8, 9}=U and A∩C={5}
(c) D∪F={1, 3, 5, 7, 9}=D and D∩F=(1, 5, 9)=F
Observe that F⊆D, so by Theorem 4 we must have D∪F=D and D∩F=F. ∎
Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.29
1.4. Prove: B\A=B∩A. Thus, the set operation of difference can be written in terms of the
operations of intersection and complement.
Solution. B\A = {x | x ∈ B, x∉A}={x | x∈B, x∈A}=B∩A. ∎
1.5. Prove: (A∪B)\(A∩B)=(A\B)∪(B\A). (Thus either one may be used to define A⊕B.)
Solution. Using X\Y=X∩Y and the laws in Table 1, including DeMorgan’s Law, we obtain:
(A∪B)\(A∩B)=(A∪B)∩(A∩B)=(A∪B)∩(A∪B)
= (A∩A)∪(A∩B)∪(B∩A)∪(B∩B)
= ∅∪(A∩B)∪(B∩A)∪∅
= (A∩B)∪(B∩A)=(A\B)∪(B\A) ∎
1.6. Let N={1, 2, 3,…} and, for each n∈N, Let An ={n, 2n, 3n,…}. Find:
(a) A3∩A5; (b) A4∩A6;
(c) ⋃𝑖∈𝑃 𝐴𝑖 where P={2, 3, 5, 7, 11, …} is the set of prime numbers.
Solution.
(a) Those numbers which are multiples of both 3 and 5 are the multiples of 15; hence
A3∩A5=A15.
(b) The multiples of 12 and no other numbers belong to both A4 and A6, hence A4∩A6=A12.
(c) Every positive integer except 1 is a multiple of at least one prime number; hence
⋃𝑖∈𝑃 𝐴𝑖 ={2, 3, 4, ...}=N\{1} ∎
1.7. Write the dual of: (a) (U∩A)∪(B∩A)=A; (b) (A∩U)∩(∅∪AC)=∅.
Solution. Interchange ∪ and ∩ and also U and ∅ in each set equation:
(a) (∅∪A)∩(B∪A)=A; (b) (A∪∅)∪(U∩AC)=U. ∎

Partitions
1.8. Let S={a, b, c, d, e, f, g}. Determine which of the following are partitions of S:
(a) P1=[{a, c, e}, {b}, {d, g}], (c) P3=[{a, b, e, g}, {c}, {d, f}],
(b) P2=[{a, e, g}, {c, d}, {b, e, f}], (d) P4=[{a, b, c, d, e, f, g}].
Solution.
(a) P1 is not a partition of S since f∈S does not belong to any of the cells.
(b) P2 is not a partition of S since e∈S belongs to two of the cells.
(c) P3 is a partition of S since each element in S belongs to exactly one cell.
(d) P4 is a partition of S into one cell, S itself. ∎

EXERCISES. SET 2.
Sets, Operations
2.1. Which of the following sets are equal?
A={x | x2−4x+3=0}, C={x | x∈N, x<3}, E={1, 2}, G={3, 1},
B={x | x2−3x+2=0}, D={x | x∈N, x is odd, x<5}, F={1, 2, 1}, H={1, 1, 3}.
2.2. Prove that if A∪B=A and A∩B=A, then A=B.
2.3. Let A and B be any sets. Prove:
(a) A is the disjoint union of A\B and A∩B.
(b) A∪B is the disjoint union of A\B, A∩B, and B\A.
2.4. Prove the Absorption Laws: (a) A∪(A∩B)=A; (b) A∩(A∪B)=A.
2.5. Show that in general (A-B)∪B≠A. if A∪B=A and A∩B=A, then A=B.
2.6. Let A={2, 4, …, 2n, …) and B={3, 6, …, 3n, … }.
Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.30
 Find A∩B and A-B.
2.7. Prove theorems 7-9:
2.8. Let f: X→Y, and B⊆Y. Prove that f -1(Y-B)=X-f -1(B), that is, pre-image of the complement
is equal to the complement of pre-image.
Whether the similar statement is true for the image of the complement? If yes, then prove.
Otherwise provide a counterexample.
2.9. Let An be the set of all positive integers divisible by n. Find the sets
(a) ⋃∞𝑛=2 𝐴𝑛 (b) ⋂∞ 𝑛=2 𝐴𝑛
*
2.10 . (Familiarity with sup and inf from Calculus 1 is required). Let b≥a+2. Find
1 1 1 1
(a) ⋃∞
𝑛=1[𝑎 + 𝑛 , 𝑏 − 𝑛] (b) ⋂∞
𝑛=1(𝑎 − 𝑛 , 𝑏 + 𝑛)

Use Theorem 11 from Part 4 for the exercises 2.11-2.14.

2.11*. Prove that the set A of all polynomials with rational coefficients is countable (use the
Theorem 11).
2.12 . A number  is called an algebraic one if it is a root of a polynomial P(t) with rational
*

coefficients. Prove that the set of all algebraic numbers is countable.

*
2.13 . Prove that the set of all rational intervals on the straight-line R is countable. (An interval
IR is called rational if its end points are rational numbers).
*
2.14 . Prove that set of all points of the plane with rational coordinates is countable.
2.15*. Let M be any infinite set and A any countable set. Prove that M is equivalent to M∪A.
2.16*. Prove the existence of uncountably many transcendental numbers, i.e., numbers which
are not algebraic. (Hint: Use Theorems 11 and 14).
*
2.17 . Prove that a set with an uncountable subset is itself uncountable.
2.18*. Prove that the set of all real functions (more generally, functions taking values in a set
containing at least two elements) defined on a set M is of power greater than the power
of M. In particular, prove that the power of the set of all real functions (continuous and
discontinuous) defined in the interval [0, 1] is greater than c.
Hint. Use the fact that the set of all characteristic functions (i.e., functions taking only
the values 0 and 1) on M is equivalent to the set of all subsets of M.
2.18*. Give an indirect proof of the equivalence of the closed interval [a, b], the open interval
(a, b) and the half-open interval [a, b) or (a, b].
Hint. Use Theorem 16.
*
2.19 . Prove that the union of a finite or countable number of sets each of power c is itself of
power c.
*
2.20 . Prove that each of the following sets has the power of the continuum:
a) The set of all infinite sequences of positive integers;
b) The set of all ordered n-tuples of real numbers;
c) The set of all infinite sequences of real numbers.
*
2.21 . Prove the Proposition 3 in Theorem 16:

Fuad Hajiyev - Lecture Notes on DS - Lecture 1 Basic Structures: Sets and Functions. p.31