SET THEORY: In basic concepts of set theory, the set theory is a part of the mathematics learning which is called

gathering of objects. Any type of the object can be together into a set, set theory is useful most frequently to object that are associated to the mathematics. The set theory contains union, Intersection, complement operations etc. Set theory Operations In basic concepts of set theory, the Set theory contains some of the operations. Operations are union, intersection, complement, symmetric difference, Cartesian product and power set. Union: In basic concepts of set theory, the union of the sets A and B, It is denoted by A U B. The union operations define set of the all objects in A and B. Example of Union: A= {2, 3, 4} B= {2, 3, 4, 5} A U B = {2, 3, 4, 5} Intersection: In basic concepts of set theory, the intersection of the sets A and B, It is denote by the A B. This operations are defines set of all objects of the both A and B. Example of Intersection: A= {2, 3, 4} B= {2, 3, 4, 5} A B = {2, 3, 4} Complement: In math, the complete operation is the different operation. It describes complement of set A relative to set U. This operation is denoted by Ac. It means, the set all object of U is not a members of A. This operation is also known as set difference. Example of complement: U= {1, 2, 3, 4, 5, 6) A= {1, 2, 3 4, 5} The complement is Answer is=6.

Cartesian product The Cartesian product is also one of the basic geometry concepts operations. In set theory, a new set can be build by associating any element of the single element with the every component of the other set. The Cartesian product of two sets A and B and it is indicate by A x B. The A x B is the set of the all ordered pairs. Example of Cartesian product: {3,4}x{blue, red}={(3,blue), (3,red), (4,blue),(4, red)}. Types of Sets There are different types in sets. They are listed below: Empty set Singleton set Finite and Infinite set Union of sets Intersection of sets Difference of sets Subset of a set Disjoint sets Explanation for different types of sets Empty set: A set that has no element should be called as Empty set. Another name for Empty set could be Null set and Void set. Number of element in set X is represented as n(X). The empty set is denoted as . Singleton set: A set that having one and only element should be called as Singleton set. Example: Set A = {5} is a singleton set. Finite and Infinite set: A set that having predetermined numbers of elements are said to be Finite set. Otherwise, it is called as infinite set. Example: Set of all the days in a week -> Finite set. The set of all the integers -> Infinite set. Union of sets: Union of two or else most numbers of sets could be the set of all elements that belonging to every element of all sets. That is denoted as U. Example: A = {1,2,3} B = {1,4,5} AUB = {1,2,3,4,5} Intersection of sets: It should be the set of elements that are common to all the sets. The symbol should be denoted as . Example: A = {1,2,3,4,5} B = {2,3,7} A B = {2,3}

Difference of sets: The difference of set A to B should be denoted as A B. That is the set of element that are in set A not in set B. Example: A = {1,2,3,4,5} B = {2,4,6,7,8} AB = {1,3,5} BA = {6,7,8} Subset of a set: A set P could be the subset of Q set, when every element of set P is also the element of Q. Example: A = {1,2,3,4,5} B = {1,2,3,4,5,7,8} Here, A is said to be the subset of B. Disjoint sets: If two sets A and B should have common of no elements. That means, When this condition n (A B) = 0 is true, then the sets are disjoint sets. Example: A = {1,2,3} B = {4,5} n (A B) = 0. Therefore these sets A and B are disjoint sets. That's all about the different types of sets.

Definition of Subset: A set A is said to be a subset of a set B if every element of A is also an elemnt of B. In other words, A B if whenever a A, then a B. It is often convenient to use the symbol " " which means implies. Using this symbol, we can write the definition of subset as follows: A B if a A a B We read it as " A is a subset of B if a is an element of A which implies that a is also an element of B. If A is not a subset of B, we write A is not a subset of B. Set Operations Properties In set theory each and every operation should be based on sets. The operations of sets are Union, Intersection, Difference and Complement. We should have many properties for the set operations. Identity properties Domination properties Idempotent properties Commutative properties Associative properties Distributive properties De morgan's properties

Explanation for properties Here we will see about the explanation of proeprties of set operations. Let consider, A, B and C should be the sets. Identity properties: i) A =A ii) A U = A Domination properties: i) A U=U ii) A = Idempotent properties: i) A A = A ii) A A=A Commutative properties: i) A B = B A ii) A B=B A Example: Let, A = {1,2,3} and B = {4,3,2,7} A B = {1,2,3,4,7} B A = {4,3,2,7,1} = {1,2,3,4,7} Thus, A B=B A We can prove A B=B A in the same way. Associative properties: i) A (B C) = (A B) C ii) A (B C) = (A B) C Example: Let, A = {1,2,3}, B = {4,3,7} and c = {1,7,5,6} Finding of A (B C): B C = {1,3,4,5,6,7} A (B C) = {1,2,3,4,5,6,7} Finding of (A B) C: A B = {1,2,3,4,7} (A B) C = {1,2,3,4,5,6,7} Thus, A (B C) = (A B) C We can also prove, A (B C) = (A B) C in this same way.

Distributive properties: i) A (B C) = (A B) (A C) ii) A (B C) = (A B) (A C) Example: Let, A = {1,2,3}, B = {4,3,7} and c = {1,7,5,6} Finding A (B C): B C = {7} A (B C) = {1,2,3,7} Finding (A B) (A C): A B = {1,2,3,4,7} A C = {1,2,3,5,6,7} (A B) (A C) = {1,2,3,7} Thus, A (B C) = (A B) (A C) We can also prove A (B C) = (A B) (A C) in the same way. De Morgans properties: i) = ii) = Example: Let, U = {1,2,3,4,5,6,7,8}, A = {1,2,3} and B = {4,3,6} Finding of : A B = {3} = {1,2,4,5,6,7,8} Finding of : = {4,5,6,7,8} = {1,2,5,7,8} = {1,2,4,5,6,7,8} Thus, = We can also prove, = in the same way.