|
< ><FONT face="Times New Roman"><FONT size=3> <p></p></FONT></FONT></P>
< ><FONT face="Times New Roman" size=3>In discussing any branch of mathematics, be it analysis, algebra, or geometry, it is helpful to use the notation and terminology of set theory. This subject, which was developed by Boole and Cantor in the latter part of the 19<SUP>th </SUP>century, has had a profound influence on the development of mathematics in the 20<SUP>th</SUP> century. It has unified many seemingly disconnected ideas and has helped to reduce many mathematical concepts to their logical foundations in an elegant and systematic way. A thorough treatment of theory of sets would require a lengthy discussion which we regard as outside the scope of this book. Fortunately, the basic noticns are few in number, and it is possible to develop a working knowledge of the methods and ideas of set theory through an informal discussion . Actually, we shall discuss not so much a new theory as an agreement about the precise terminology that we wish to apply to more or less familiar ideas.</FONT></P>
< ><FONT face="Times New Roman" size=3>In mathematics, the word “set” is used to represent a collection of objects viewed as a single entity</FONT></P>
<P ><FONT face="Times New Roman" size=3>The collections called to mind by such nouns as “flock”, “tribe”, ‘crowd”, “team’, are all examples of sets, The individual objects in the collection are called elements or members of the set, and they are said to belong to or to be contained in the set. The set in turn ,is said to contain or be composed of its elements.</FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> We shall be interested primarily in sets of mathematical objects: sets of numbers, sets of curves, sets of geometric figures, and so on. In many applications it is convenient to deal with sets in which nothing special is assumed about the nature of the individual objects in the collection. These are called abstract sets. Abstract set theory has been developed to deal with such collections of arbitrary objects, and from this generality the theory derives its power.</FONT></FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> NOTATIONS. Sets usually are denoted by capital letters: A,B,C,….X,Y,Z ; elements are designated by lower-case letters: a, b, c,….x, y, z. We use the special notation </FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman">X</FONT>∈<FONT face="Times New Roman">S</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman">To mean that “x is an element of S “or” x belongs to S”. If x does not belong to S, we write x</FONT>∈<FONT face="Times New Roman">S. When convenient ,we shall designate sets by displaying the elements in braces; for example </FONT>,<FONT face="Times New Roman">the set of positive even integers less than 10 is denoted by the symbol{2,4,6,8}whereas the set of all positive even integers is displayed as {2,4,6,…},the dots taking the place of “and so on”.</FONT></FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> The first basic concept that relates one set to another is equality of sets:</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman"> <B> DEFINITION OF SET EQUALITY</B> Two sets A and B are said to be equal(or identical)if they consist of exactly the same elements, in which case we write A=B. If one of the sets contains an element not in the other ,we say the sets are unequal and we write A</FONT>≠<FONT face="Times New Roman">B.</FONT></FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> SUBSETS. From a given set S we may form new sets, called subsets of S. For example, the set consisting of those positive integers less than 10 which are divisible by 4(the set{4,8})is a subset of the set of all even integers less than 10.In general, we have the following definition.</FONT></FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> <B> DEFINITION OF A SUBSET.</B>A set A is said to be a subset of a set B, and we write </FONT></FONT></P>
<P ><FONT face="Times New Roman" size=3>A</FONT><v:shapetype><FONT face="Times New Roman"><FONT size=3> <v:stroke joinstyle="miter"></v:stroke><v:formulas><v:f eqn="if lineDrawn pixelLineWidth 0"></v:f><v:f eqn="sum @0 1 0"></v:f><v:f eqn="sum 0 0 @1"></v:f><v:f eqn="prod @2 1 2"></v:f><v:f eqn="prod @3 21600 pixelWidth"></v:f><v:f eqn="prod @3 21600 pixelHeight"></v:f><v:f eqn="sum @0 0 1"></v:f><v:f eqn="prod @6 1 2"></v:f><v:f eqn="prod @7 21600 pixelWidth"></v:f><v:f eqn="sum @8 21600 0"></v:f><v:f eqn="prod @7 21600 pixelHeight"></v:f><v:f eqn="sum @10 21600 0"></v:f></v:formulas><v:path connecttype="rect" gradientshapeok="t" extrusionok="f"></v:path><lock aspectratio="t" v:ext="edit"></lock></FONT></FONT></v:shapetype><v:shape><v:imagedata></v:imagedata></v:shape><FONT face="Times New Roman" size=3>B</FONT></P>
<P ><FONT face="Times New Roman" size=3>Whenever every element of A also belongs to B. We also say that A is contained in B or B contains A. The relation is referred to as set inclusion.</FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> The statement A</FONT></FONT><v:shape><FONT face="Times New Roman"><FONT size=3> <v:imagedata></v:imagedata></FONT></FONT></v:shape><FONT face="Times New Roman" size=3>B does not rule out the possibility that B</FONT><v:shape><FONT face="Times New Roman"><FONT size=3> <v:imagedata></v:imagedata></FONT></FONT></v:shape><FONT face="Times New Roman" size=3>A. In fact, we may have both A</FONT><v:shape><FONT face="Times New Roman"><FONT size=3> <v:imagedata></v:imagedata></FONT></FONT></v:shape><FONT face="Times New Roman" size=3>B and B</FONT><v:shape><FONT face="Times New Roman"><FONT size=3> <v:imagedata></v:imagedata></FONT></FONT></v:shape><FONT face="Times New Roman" size=3>A, but this happens only if A and B have the same elements. In other words, A=B if and only if A</FONT><v:shape><FONT face="Times New Roman"><FONT size=3> <v:imagedata></v:imagedata></FONT></FONT></v:shape><FONT face="Times New Roman" size=3>B and B</FONT><v:shape><FONT face="Times New Roman"><FONT size=3> <v:imagedata></v:imagedata></FONT></FONT></v:shape><FONT face="Times New Roman" size=3>A .</FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> This theorem is an immediate consequence of the foregoing definitions of equality and inclusion. If A</FONT></FONT><v:shape><FONT face="Times New Roman"><FONT size=3> <v:imagedata></v:imagedata></FONT></FONT></v:shape><FONT face="Times New Roman" size=3>B but A</FONT><FONT size=3>≠</FONT><FONT face="Times New Roman" size=3>B, then we say that A is a proper subset of B: we indicate this by writing A</FONT><v:shape><FONT face="Times New Roman"><FONT size=3> <v:imagedata></v:imagedata></FONT></FONT></v:shape><FONT face="Times New Roman" size=3>B.</FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> In all our applications of set theory, we have a fixed set S given in advance, and we are concerned only with subsets of this given set. The underlying set S may vary from one application to another; it will be referred to as the universal set of each particular discourse.</FONT></FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> The notation </FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman"> {X</FONT>∣<FONT face="Times New Roman">X</FONT>∈<FONT face="Times New Roman">S. and X satisfies P}</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman">will designate the set of all elements X in S which satisfy the property P. When the universal set to which we are referring id understood, we omit the reference to S and we simply write{X</FONT>∣<FONT face="Times New Roman">X satisfies P}.This is read “the set of all x such that x satisfies p.” Sets designated in this way are said to be described by a defining property For example, the set of all positive real numbers could be designated as {X</FONT>∣<FONT face="Times New Roman">X>0};the universal set S in this case is understood to be the set of all real numbers. Of course, the letter x is a dummy and may be replaced by any other convenient symbol. Thus we may write </FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman">{x</FONT>∣<FONT face="Times New Roman">x>0}={y</FONT>∣<FONT face="Times New Roman">y>0}={t</FONT>∣<FONT face="Times New Roman">t>0}</FONT></FONT></P>
<P ><FONT face="Times New Roman" size=3>and so on .</FONT></P>
<P ><FONT size=3><FONT face="Times New Roman"> It is possible for a set to contain no elements whatever. This set is called the empty set or the void set, and will be denoted by the symbol</FONT>φ<FONT face="Times New Roman">.We will consider </FONT>φ<FONT face="Times New Roman">to be a subset of every set. Some people find it helpful to think of a set as analogous to a container(such as a bag or a box)containing certain objects, its elements. The empty set is then analogous to an empty container.</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman"> To avoid logical difficulties, we must distinguish between the element x and the set {x} whose only element is x ,(A box with a hat in it is conceptually distinct from the hat itself.)In particular, the empty set</FONT>φ<FONT face="Times New Roman">is not the same as the set {</FONT>φ<FONT face="Times New Roman">}.In fact, the empty set </FONT>φ<FONT face="Times New Roman">contains no elements whereas the set {</FONT>φ<FONT face="Times New Roman">} has one element </FONT>φ<FONT face="Times New Roman">(A box which contains an empty box is not empty).Sets consisting of exactly one element are sometimes called one-element sets.</FONT></FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> <B>UNIONS,INTERSECTIONS</B>, COMPLEMENTS. From two given sets A and B, we can form a new set called the union of A and B. This new set is denoted by the symbol</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman">A</FONT>∪<FONT face="Times New Roman">B(read: “A union B”)</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman">And is defined as the set of those elements which are in A, in B, or in both. That is to say, A</FONT>∪<FONT face="Times New Roman">B is the set of all elements which belong to at least one of the sets A,B.</FONT></FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3> Similarly, the intersection of A and B, denoted by</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman">A</FONT>∩<FONT face="Times New Roman">B(read: “A intersection B”)</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman">Is defined as the set of those elements common to both A and B. Two sets A and B are said to be disjoint if A</FONT>∩<FONT face="Times New Roman">B=</FONT>φ<FONT face="Times New Roman">.</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman"> If A and B are sets, the difference A-B (also called the complement of B relative to A)is defined to be the set of all elements of A which are not in B. Thus, by definition,</FONT></FONT></P>
<P ><FONT face="Times New Roman"><FONT size=3>A-</FONT> <FONT size=3>B={X|X</FONT></FONT><FONT size=3>∈</FONT><FONT face="Times New Roman" size=3>A and X</FONT><v:shape><FONT face="Times New Roman"><FONT size=3> <v:imagedata></v:imagedata></FONT></FONT></v:shape><FONT face="Times New Roman" size=3>B}</FONT></P>
<P ><FONT size=3><FONT face="Times New Roman"> The operations of union and intersection have many formal similarities with (as well as differences from) ordinary addition and multiplications of union and intersection, it follows that A</FONT>∪<FONT face="Times New Roman">B=B</FONT>∪<FONT face="Times New Roman">A and A</FONT>∩<FONT face="Times New Roman">B=B</FONT>∩<FONT face="Times New Roman">A. That is to say, union and intersection are commutative operations. The definitions are also phrased in such a way that the operations are associative:</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman">(A</FONT>∪<FONT face="Times New Roman">B)</FONT>∪<FONT face="Times New Roman">C=A</FONT>∪<FONT face="Times New Roman">(B</FONT>∪<FONT face="Times New Roman">C)and(A</FONT>∩<FONT face="Times New Roman">B)</FONT>∩<FONT face="Times New Roman">C=A=</FONT>∩<FONT face="Times New Roman">(B</FONT>∩<FONT face="Times New Roman">C).</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman"> The operations of union and intersection can be extended to finite or infinite collections of sets.</FONT></FONT></P>
<P ><FONT size=3><FONT face="Times New Roman"> <p></p></FONT></FONT></P> |
|