ALGEBRA OF SETS

ALGEBRA OF SETS:
(1)Union of two sets: if A and B be the two sets then their union is denoted by AUB and defined
by AUB={x/ either x €A or x € B}

AUB

Example: if A={1,2,3,5,7,11} and B={2,4,6,8} then AUB={1,2,3,4,5,6,7,8,11}
(2)Intersection of two sets: if A and B be the two sets then their intersection is denoted by A∩B and defined by

A∩B={x/x€A and x € B}

Example: if A={1,2,3,5,7,11} and B={2,4,6,8} then A∩B={2}
(3) C0mpliment of a set:if A be any set then its compliment is denoted by A' and defined by
A'={x / x does not belongs to A}

(4) Difference of sets:if A and B be the sets then difference of set is denoted by A-B or B-A
and defined by
A – B ={ x / x€A and x doesnot belongs to B}
B - A ={x/ x € B and x does not belongs to A}

Representation of a set

REPRESENTATION OF A SET:
There are three main ways to specify a set:
(1) by listing all its members(Tabulation method OR Roster form);
(2) by stating a property of its elements (Rule method OR Set builder method);
(3) by defining a set of rules which generates (defines) its members (recursive rules).

ROSTER FORM. The first way of course is suitable only for finite sets. In this case we list
names of elements of a set, separate them by commas and enclose them in braces:
Examples: {1, 2,3, 4,5}, {George,William,Ram}, {a,b,c,d}.

RULE METHOD:The method by which we list the property or properties satisfied by the elts of the set is called rule method or set-builder method.
Example: {x/x is a multiple of 3.}
Read: “the set of all x such that x is a multiple of 3”

RECURSIVE RULES. (Always safe.)
Example – the set E of even numbers greater than 3:
a) 4 belongs to E
b) if x belongs to E, then x + 2 belongs to E
c) nothing else belongs to E.
The first rule is the basis of recursion, the second one generates new elements from the
elements defined before and the third rule restricts the defined set to the elements
generated by rules a and b. (The third rule should always be there; sometimes in practice
it is left implicit.)

set theory

SET:
Set theory is a basis of modern mathematics, and notions of set theory are used in all
formal descriptions. The notion of set is taken as “undefined”, “primitive”, or “basic”, so
we don’t try to define what a set is, but we can give an informal description, describe
important properties of sets, and give examples. All other notions of mathematics can be
built up based on the notion of set.
Similar (but informal) words: collection, group, aggregate.
Description and terminology: a set is a collection of objects (entities) which are called
the members or elements of that set. If we have a set we say that some objects belong (or
do not belong) to this set, are (or are not) in the set. We say also that sets consist of their
elements.
Examples: the set of students in this room; the English alphabet may be viewed as the set
of letters of the English language; the set of even numbers; etc.
So sets can consist of elements of various natures: people, physical objects,
numbers, signs, other sets, etc. (We will use the words object or entity in a very broad
way to include all these different kinds of things.)
The membership criteria for a set must in principle be well-defined, and not
vague. If we have a set and an object, it is possible that we do not know whether this
object belongs to the set or not, because of our lack of information or knowledge. (E.g.
“The set of people in this room over the age of 28”, if we don’t know everyone’s age.)
But the answer should exist, at any rate in principle. It could be unknown, but it should
not be vague. If the answer is vague for some putative set-description, we can not
consider that a real description of a set. Another thing: If we have a set, then for every
two elements of it, x and y, it should not be vague whether x = y, or they are different.
Sometimes we simply assume for the sake of examples that a description is not
vague when perhaps for other purposes it would be vague – e.g., the set of all red objects.