SETS and FUNCTIONS:
Reference: Introductory Real Analysis by A. N. Kolmogorov and S V Fomin, Dover books.
Operations on sets:
Let A and B be any two sets. Then, by the sum or union of A and B, denoted by , is meant the set consisting of all elements which belong to at least one of the sets A and B. More generally, by the sum or union of an arbitrary number (finite or infinite) of sets (indexed by some parameter ), we mean the set, denoted by of all elements belonging to at least one of the sets .
By the intersection of two given sets A and B, we mean the set consisting of all elements which belong to both A and B. For example, the intersection of the set of all even numbers and the set of all integers divisible by 3 is the set of all integers divisible by 6. By the intersection of an arbitrary number (finite or infinite) of sets , we mean the set, denoted by of all elements belonging to every one of the sets . Two sets A and B are said to be disjoint if , that is, if they have no elements in common. More generally, let be a family of sets such that for every pair of sets A, B in . Then, the sets in are said to be pairwise disjoint.
It is an immediate consequence of the above definitions that the operations and are commutative and associative, that is,
and ; ; and, .
Moreover, the operations and obey the following distributive laws:
….call this I
….call this II.
For example, suppose that , so that x belongs to the left-hand side of I. Then, x belongs to both C and , that is, x belongs to both C and at least one of the sets A and B. But then x belongs to at least one of the sets and , that is, , so that x belongs to the right hand side of I. Conversely, suppose that . Then, x belongs to at least one of the two sets and . It follows that x belongs to both C and at least one of the two sets A and B, that is, and , or equivalently . This proves I, and II is proved similarly.
By the difference of two sets, between two sets A and B (in that order), we mean the set of all elements of A which do not belong to B. Note that it is not assumed that . It is sometimes convenient (e.g., in measure theory) to consider the symmetric difference of two sets A and B, denoted by and defined as the union of the two differences and : .
We will often be concerned later with various sets which are all subsets of some underlying basic set R, for example, various sets of points on the real line. In this case, given a set A, the difference is called the complement of A, denoted by .
An important role is played in set theory and its applications by the following duality principle:
…call this III
…call this IV.
In words, the complement of a union equal the intersection of the complements; and, the complement of an intersection equals the union of the complements. According to the duality principle, any theorem involving a family of subsets of a fixed set R can be converted automatically into another, “dual” theorem by replacing all subsets by their complements, all unions by intersections and all intersections by unions. To prove III, suppose that ….call this V.
Then, x does not belong to the union . …call this VI.
That is, x does not belong to any of the sets . It follows that x belongs to each of the complements , and hence, ….call this VII.
Conversely, suppose that VII holds, so that x belongs to every set . Then, x does not belong to any of the sets , that is, x does not belong to the union VI, or equivalently V holds true. This proves 3.
Homework: Prove IV similarly.
The designation “symmetric difference” for the set is not too apt, since has much in common with the sum . In fact, in the two statements “x belongs to A” and “x belongs to B” are joined by the conjunction “or” used in the “either …or …or both…” sense, while in the same two statements are joined by “or” used in the ordinary “either…or…” sense (as in “to be or not to be”). In other words, x belongs to if and only if x belongs to either A or B or both, while x belongs to if and only if x belongs to either A or B but not both. The set can be regarded as a kind of “modulo-two sum” of the sets A and B, that is, a sum of the sets A and B in which elements are dropped if they are counted twice (once in A and once in B).
Functions and mappings. Images and preimages:
(Of course, we have dealt with this topic in quite detail so far in the earlier blog series; but as presented by Kolmgorov and Fomin here, the flavour is different; at any rate, it helps to revise. Revision refines the intellect.) 🙂 🙂 🙂
A rule associating a unique real number with each element of a set real numbers X is said to define a (real) function f on X. The set X is called the domain (of definition) of f, and the set Y of all numbers such that is called the range of f.
More generally, let M and N be two arbitrary sets. Then a rule associating a unique element with each element is again said to define a function f on M (or a function f with domain M). In this more general context, f is usually called a mapping of f M into N. By the same token, f is said to map M into N(and a into b).
If a is an element of M, the corresponding element is called the image of a (under the mapping f). Every element of M with a given element as its image is called a preimage of b. Note that in general b may have several pre-images. Moreover, N may contain elements with no pre-images at all. If b has a unique pre-image, we denote this pre-image by .
If A is a subset of M, the set of all elements such that is called the image of A, denoted by . The set of all elements of M whose images belong to a given set is called the preimage of B, denoted by . If no element of B has a preimage, then . A function f is said to map M into N if , as is always the case, and onto N if . Thus, every “onto” mapping is an “into” mapping, but converse is not true.
Suppose f maps M onto N. Then, f is said to be one-to-one if each element has a unique preimage . In this case, f is said to establish a one-to-one correspondence between M and N, and the mapping associating is called the inverse of f.
The preimage of the union of two sets is the union of the preimages of the sets .
Proof of Theorem I:
If , then so that belongs to at least one of the sets A and B. But, then x belongs to at least one of the sets and , that is, .
Conversely, if , then x belongs to at least one of the sets and . Therefore, belongs to at least one of the sets A and B, that is, . But, then .
The preimage of the intersection of two sets is the intersection of the preimages of the sets:
Proof of Theorem 2:
If , then , so that and (meaning, simultaneously) . But, then and , that is, .
Conversely, if , then and . Therefore, and , that is, . But, then .
The image of the union of two sets equals the union of the images of the sets .
Proof of theorem 3:
If , then where x belongs to at least one of the sets A and B. Therefore, belongs to at least one of the sets and . That is, .
Conversely, if , then . where x belongs to at least one of the sets A and B, that is, and hence, .
Surprisingly enough, the image of the intersection of two sets is not so “well-behaved”. 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 into the . Then, the segments with , and with do not intersect, although their images coincide.
In the light of above remark: consider the following: If a function is not specified on elements, it is important in general to check that f is well-defined. That is, unambiguously defined. For example, if the set A is the union of two subsets and , and we are considering a function , then one can try to specify a function from set A to the set B by declaring that f is to map everything in to 0 and is to map everything in to 1. This unambiguously defines f unless and have elements in common in which case it is not clear whether these elements should map to 0 or to 1. Checking that this f is well-defined therefore amounts to checking that and have no intersection.
Theorems 1-3 continue to hold for unions and intersections of an arbitrary number (finite or infinite) of sets :
Decomposition of a set into classes. Equivalence relations.
Decompositions of a given set into pairwise disjoint subsets play an important role in a great variety of problems. For example, the plane (regarded as a point set) can be decomposed into lines parallel to the x-axis, three dimensional space can be decomposed into concentric spheres, the inhabitants of a given city can be decomposed into different age groups, and so on. Any such representation of a given set M as the union of a family of pairwise disjoint subsets of M is called a decomposition or partition of M into classes.
A decomposition is usually made on the basis of a certain criterion, allowing us to assign the elements of M to one class or another. For example, the set of all triangles in the plane can be decomposed into classes of congruent triangles, or classes of triangles of equal area, the set of all functions of x can be decomposed into classes of functions all taking the same value at a given point x, and so on. Despite the great variety of such criteria, they are not completely arbitrary. For example, it is obviously impossible to partition all real numbers into classes by assigning the number b to the same class as number a if and only if . In fact, if , b must be assigned to same class as a but then a cannot be assigned to same class as b, since . Moreover, since a is not greater than itself, a cannot be assigned to the class containing itself!! As another example, it is impossible to partition the points of the plane into classes by assigning two points to the same class if and only if the distance between them is less than 1. In fact, if the distance between a and b is less than 1, and if the distance between b and c is less than 1, it does not follow that distance between a and c is less than 1. (Hint: Think of triangle inequality). Thus, by assigning a to the same class as b and b to the same class as c, we may well find that two points fall in the same class even though the distance between them is greater than 1!
These examples suggest conditions that which must be satisfied by any criterion it it is to be used as the basis for partitioning a given set into classes. Let M be a set, and let certain ordered pairs (a,b) of elements of M be called “labelled.” If is a labelled pair, we say that a is related to b by the binary relation R and we write it symbolically as aRb. For example, if a and b are real numbers, might mean , while if a and b are triangles, might mean that a and b have the same area. A relation between elements of M is called a relation on M, if there exists at least one labelled pair for every . A relation R on M is called an equivalence relation (on M) if it satisfies the following three conditions:
- Reflexivity: for every .
- Symmetry: If , then .
- Transititivity: If and , then .
🙂 🙂 🙂
Nalin Pithwa, more later
FINITE, COUNTABLE AND UNCOUNTABLE SETS:
(Reference: Principles of Mathematical Analysis, Third Edition, Walter Rudin:)
We begin with the function concept.
Definition: Consider two sets A and B whose elements may be any objects whatsoever, and suppose that with each element x of A there is associated in some manner, an element of B, which we denote by . Then, f is said to be a function from A to B (or a mapping of A into B). The set A is called the domain of f (we also say f is defined on A), and the elements f(x) are called the values of f. The set of all values of f is called the range of f.
Definition: Let A and B be two sets and let f be a mapping of A into B. If , then is defined to be the set of all elements f(x), for . We call the image of E under f. In this notation, is the range of f. It is clear that . If , we say that f maps A onto B. (Note that, according to this usage, onto is more specific than into).
If , denotes the set of all such that . We call the inverse image of E under f. If , then is the set of all $latex \in A$ such that . If, for each , consists of at most one element of A, then f is said to be a 1-1 (one-one) mapping of A into B. This may also be expressed as follows: f is a 1-1 mapping of A into B provided that whenever and and .
(The notation , means that and are distinct elements, otherwise we write ).
If there exists a 1-1 mapping A of onto B, we say that A and B can be put in 1-1 correspondence, or that A and B have the same cardinal number, or briefly, that A and B are equivalent, and we write . This relation clearly has the following properties:
It is reflexive:
It is symmetric: If , then .
It is transitive: If , and , then .
Any relation with these three properties is called an equivalence relation.
For any positive integer n, let be the set whose elements are the integers . And, let J be the set consisting of all positive integers. For any set A, we say:
(a) A is finite if for some n (the empty set is also considered to be finite).
(b) A is infinite, if A is not finite.
(c) A is countable if .
(d) A is uncountable if A is neither finite nor countable.
(e) A is at most countable if A is finite or countable.
Countable sets are sometimes called enumerable, or denumerable.
For two finite sets A and B, we evidently have if and only if A and B contain the same number of elements. For infinite sets, however, the idea of “having the same number of elements” becomes quite vague, whereas the notion of 1-1 correspondence retains its clarity.
Let A be the set of all integers. Then, A is countable. For, consider the following arrangement of the sets A and J:
We can, in this example, even give an explicit formula for a function f from J to A which sets up a 1-1 correspondence:
When n is even,
When n is odd,
A finite set cannot be equivalent to one of its proper subsets. That this is, however, possible for infinite sets, is shown by the above example, in which J is a proper subset of A.
In fact, we can define infinite sets as follows: A set A is infinite if A is equivalent to one of its proper subsets.
By a sequence, we mean a function f defined on the set J of all positive integers. If , for , it is customary to denote the sequence f by the symbol , or sometimes by . The values of f, that is, the elements are called the terms of the sequence. If A is a set and if , for all , then is said to be a sequence in A, or a sequence of elements of A.
Note that the terms of a sequence need not be distinct.
Since every countable set is the range of a 1-1 function defined on J, we may regard every countable set as the range of a sequence of distinct terms. Speaking more loosely, we may say that the elements of any countable set can be “arranged” in a sequence.
Sometimes, it is convenient to replace J in this definition by the set of all non-negative integers, that is, to start with 0 rather than with 1.
PS: the above exposition will be extremely useful to RMO, INMO and IITJEE advanced maths students and students preparing for Chennai Mathematics Institute Entrance Examination.
(These are the solutions from a student of mine, whose identity is private. I will call him, RI, Bengaluru.)
Solve as elegantly as possible:
Solution I (of RI, Bengaluru):
Find the necessary and sufficient conditions on the coefficients p, q, and r of the given cubic equation such that the roots of the cubic are in AP:
Solution II: (credit to RI, Bengaluru) :
Let the roots of the above cubic be .
By Viete’s relations: and and so that we get so that and from the second equation we get , that is, so that , and exploiting the third Viete’s relation we get , that is , which is the required necessary and sufficient condition, where .
Method II: For pedagogical purposes. The above solution to question 2 was quick and elegant because of the right choice of three quantities in AP as . Do you want to know how ugly and messy it can get if a standard assumption is made:
Let the roots of the cubic be . Let d be the common difference. So that the three roots in AP are , and
Then, applying Viete’s relations, we get so that and which changes to and the third viete’s relation gives us .
The second Viete’s relation is a quadratic in and the third Viete’s relation is a cubic in . This is how messy it can get…at least, you will agree RI’s judicious choice has rendered a clean, quick solution.