-
Definition of Sets A set must be well defined; i.e., for any given object, it must be unambiguous whether or not the object is an element of the set. For example, if a set contains all the chairs in a designated room, then any chair can be determined either to be in or not in the set. If there were no chairs in the room, the set would be called the empty, or null, set, i.e., one containing no elements. A set is usually designated by a capital letter. If A is the set of even numbers between 1 and 9, then A={2, 4, 6, 8}. The braces, {}, are commonly used to enclose the listed elements of a set. The elements of a set may be described without actually being listed. If B is the set of real numbers that are solutions of the equation x2=9, then the set can be written as B={x:x2=9} or B={x|x2=9}, both of which are read: B is the set of all x such that x2=9; hence B is the set {3,-3}. A set is a collection of well defined and distinct objects, considered as an object in its own right. Sets are one of the most fundamental concepts in mathematics. Developed at the end of the 19th century, set theory is now a ubiquitous part of mathematics, and can be used as a foundation from which nearly all of mathematics can be derived. In mathematics education, elementary topics such as Venn diagrams are taught at a young age, while more advanced concepts are taught as part of a university degree. Set Operations
Subjects to be Learned union of sets intersection of sets difference of sets complement of set ordered pair, ordered n-tuple equality of ordered n-tuples Cartesian product of sets Contents Sets can be combined in a number of different ways to produce another set. Here four basic operations are introduced and their properties are discussed. Definition (Union): The union of sets A and B, denoted by A A B={x|x A x B} B = {1, 2, 3, 4, 5} . B = {1, 2, 3, 4, 5} . B , is the set defined as
Example 1: If A = {1, 2, 3} and B = {4, 5} , then A
Example 2: If A = {1, 2, 3} and B = {1, 2, 4, 5} , then A Note that elements are not repeated in a set.
Definition (Intersection): The intersection of sets A and B, denoted by A A B={x|x A x B} B = {1, 2} . .
B , is the set defined as
Example 3: If A = {1, 2, 3} and B = {1, 2, 4, 5} , then A Example 4: If A = {1, 2, 3} and B = {4, 5} , then A B=
Definition (Difference): The difference of sets A from B , denoted by A - B , is the set defined as
A-B={x|x
B}
Example 5: If A = {1, 2, 3} and B = {1, 2, 4, 5} , then A - B = {3} . Example 6: If A = {1, 2, 3} and B = {4, 5} , then A - B = {1, 2, 3} . Note that in general A - B B-A
Definition (Complement): For a set A, the difference U - A , where U is the universe, is called the complement of A and it is denoted by . Thus is the set of everything that is not in A. The fourth set operation is the Cartesian product We first define an ordered pair and Cartesian product of two sets using it. Then the Cartesian product of multiple sets is defined using the concept of n-tuple. Definition (ordered pair): An ordered pair is a pair of objects with an order associated with them. For more rigorous definition of ordered pair click here. If objects are represented by x and y, then we write the ordered pair as <x, y>. Two ordered pairs <a, b> and <c, d> are equal if and only if a = c and b = d. For example the ordered pair <1, 2> is not equal to the ordered pair <2, 1>. Definition (Cartesian product): The set of all ordered pairs <a, b>, where a is an element of A and b is an element of B, is called the Cartesian product of A and B and is denoted by A B. The concept of Cartesian product can be extended to that of more than two sets. First we are going to define the concept of ordered n-tuple. Definition (ordered n-tuple): An ordered n-tuple is a set of n objects with an order associated with them (rigorous definition to be filled in). If n objects are represented by x1, x2, ..., xn, then we write the ordered n-tuple as <x1, x2, ..., xn> . Definition (Cartesian product): Let A1, ..., An be n sets. Then the set of all ordered n-tuples <x1, ..., xn> , where xi Ai for all i, 1 i n , is called theCartesian product of A1, ..., An, and is denoted by A1
... An . Definition (equality of n-tuples): Two ordered n-tuples <x1, ..., xn> and <y1, ..., yn> are equal if and only if xi = yi for all i, 1 i n. For example the ordered 3-tuple <1, 2, 3> is not equal to the ordered n-tuple <2, 3, 1>.
