Discrete Mathematics Lecture # 10. Set Theory  A well defined collection of {distinct} objects is called a set.  The objects are called the elements.

Slides:



Advertisements
Similar presentations
Sets and its element A set is a collection of well-defined and well-distinguished objects. The objects that make up a set are called the members or elements.
Advertisements

22 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Lecture 2 Introduction To Sets CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Sets DISCRETE STRUCTURE ABDUL BASIT TAHIR, KAMRAN ALI, FAIZAN ILLAHI, NOMAN AHMAD, ARSALAN MUBASHIR.
Analytical Methods in CS (CIS 505)
Chapter 2 The Basic Concepts of Set Theory
Sets 1.
CSE115/ENGR160 Discrete Mathematics 02/10/11 Ming-Hsuan Yang UC Merced 1.
Sets 1.
Set Theory.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
1 Learning Objectives for Section 7.2 Sets After today’s lesson, you should be able to Identify and use set properties and set notation. Perform set operations.
Mathematics.
2.1 – Symbols and Terminology Definitions: Set: A collection of objects. Elements: The objects that belong to the set. Set Designations (3 types): Word.
CSCI 1900 Discrete Structures
MATHEMATICS XI SETS.
Set Notation.
This section will discuss the symbolism and concepts of set theory
Set theory Sets: Powerful tool in computer science to solve real world problems. A set is a collection of distinct objects called elements. Traditionally,
Objectives: By the end of class, I will be able to:  Identify sets  Understand subsets, intersections, unions, empty sets, finite and infinite sets,
Definition and Representation A set is a well-defined collection of objects; The objects are called elements or members of the set; A set can be represented.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
SET THEORY. BASIC CONCEPTS IN SET THEORY Definition: A set is a collection of well-defined objects, called elements Examples: The following are examples.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Chapter 7 Logic, Sets, and Counting Section 2 Sets.
CS201: Data Structures and Discrete Mathematics I
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
Sets and Sentences Open Sentences Foundations of Real Analysis.
2.1 Symbols and Terminology. Designating Sets A set is a collection of objects (in math, usually numbers). The objects belonging to the set are called.
Slide Section 2-1 Symbols and Terminology. SYMBOLS AND TERMINOLOGY Designating Sets Sets of Numbers and Cardinality Finite and Infinite Sets Equality.
ELEMENTARY SET THEORY.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
Definition of a Set DM is study of discrete structures. Fundamental discrete structure upon which most of other discrete structures are built is the sets.
Module Code MA1032N: Logic Lecture for Week Autumn.
Set Notation and Description Kinds of Sets Operations on Sets By: Mr. Gerzon B. Mascariñas.
Chapter 2 With Question/Answer Animations. Section 2.1.
Real Numbers Natural Numbers – {1,2,3,4,5,6….}
1 Chapter Two Basic Concepts of Set Theory –Symbols and Terminology –Venn Diagrams and Subsets.
(CSC 102) Lecture 13 Discrete Structures. Previous Lectures Summary  Direct Proof  Indirect Proof  Proof by Contradiction  Proof by Contra positive.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
Unit :1 Set Theory Prof. A.J. SHAKADWIPI. Sets and Subsets A well-defined collection of objects. finite sets, infinite sets, subset A={1,3,5,7,9} B={x|x.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Discrete Mathematics Lecture # 10 Venn Diagram. Union  Let A and B be subsets of a universal set U. The union of sets A and B is the set of all elements.
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
Sets, Permutations, and Combinations. Lecture 4-1: Sets Sets: Powerful tool in computer science to solve real world problems. A set is a collection of.
Sets. Outline Set and Set Elements Set Representation Subset, Proper Subset, Set Equality, and Null Set.
CSE15 Discrete Mathematics 02/13/17
The set of whole numbers less than 7 is {1, 2, 3, 4, 5, 6}
Sets Page 746.
Set Definition: A set is unordered collection of objects.
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
Set, Combinatorics, Probability & Number Theory
The Basic Concepts of Set Theory
(є:belongs to , є:does not belongs to)
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
CS100: Discrete structures
        { } Sets and Venn Diagrams Prime Numbers Even Numbers
Algebra 1 Section 1.1.
The Basic Concepts of Set Theory
2.1 Sets Dr. Halimah Alshehri.
CHAPTER 1 - Sets and Intervals
Chapter 2 The Basic Concepts of Set Theory
CHAPTER 1 - Sets and Intervals
Discrete Mathematics CS 2610
2 Chapter Numeration Systems and Sets
Chapter 2 The Basic Concepts of Set Theory
Chapter 7 Logic, Sets, and Counting
Presentation transcript:

Discrete Mathematics Lecture # 10

Set Theory  A well defined collection of {distinct} objects is called a set.  The objects are called the elements or members of the set.  Sets are denoted by capital letters A, B, C …, X, Y, Z.  The elements of a set are represented by lower case letters a, b, c, …, x, y, z.  If an object x is a member of a set A we write x ∈ A, which reads “x belongs to A” or “x is in A” or “x is an element of A”, otherwise we write x ∉ A, which reads “x does not belong to A” or “x is not in A” or “x is not an element of A”.

Tabular Form  Listing all the elements of a set, separated by commas and enclosed within braces or curly brackets{}. E.g.,  A = {1, 2, 3, 4, 5}is the set of first five Natural Numbers.  B = {2, 4, 6, 8, …, 50} is the set of Even numbers up to 50.  C = {1, 3, 5, 7, 9, …} is the set of positive odd numbers.  The symbol “…” is called an ellipsis. It is a short for “and so forth.”

Descriptive Form  Stating in words the elements of a set. E.g.,  A = set of first five Natural Numbers.  B = set of positive even integers less or equal to fifty.  C = set of positive odd integers.

Set builder Form  Writing in symbolic form the common characteristics shared by all the elements of the set. E.g.,  A = {x  N / x<=5}  B = {x  E / 0 < x <=50}  C = {x  O / 0 < x }

Sets of Numbers  Set of Natural Numbers N = {1, 2, 3, … }  Set of Whole Numbers W = {0, 1, 2, 3, … }  Set of Integers Z = {…, -3, -2, -1, 0, +1, +2, +3, …} = {0,  1,  2,  3, …} {“Z” stands for the first letter of the German word for integer: Zahlen.}  Set of Even Integers E = {0,  2,  4,  6, …}  Set of Odd Integers O = {  1,  3,  5, …}

Sets of Numbers  Set of Prime Numbers P = {2, 3, 5, 7, 11, 13, 17, 19, …}  Set of Rational Numbers (or Quotient of Integers) Q = {x | x = ; p, q  Z, q  0}  Set of Irrational Numbers Q / = { x | x is not rational} For example,  2,  3, , e, etc.  Set of Real Numbers R = Q  Q /  10.Set of Complex Numbers C = {z | z = x + iy; x, y  R}

Subset  If A & B are two sets, A is called a subset of B, written A  B, if, and only if, any element of A is also an element of B.  Symbolically: A  B  if x  A then x  B

Notes 1. When A  B, then B is called a superset of A. 2. When A is not subset of B, then there exist at least one x  A such that x  B. 3. Every set is a subset of itself.

EXAMPLES: Let A = {1, 3, 5}B = {1, 2, 3, 4, 5} C = {1, 2, 3, 4}D = {3, 1, 5} Then A  B ( Because every element of A is in B ) C  B ( Because every element of C is also an element of B ) A  D ( Because every element of A is also an element of D and also note that every element of D is in A so D  A ) and A is not subset of  C.( Because there is an element 5 of A which is not in C )

Example  The set of integers “Z” is a subset of the set of Rational Number “Q”, since every integer ‘n’ could be written as:  Hence Z  Q.

Proper Subset Let A and B be sets. A is a proper subset of B, if, and only if, every element of A is in B but there is at least one element of B that is not in A, and is denoted as A  B. Example:  Let A = {1, 3, 5}B = {1, 2, 3, 5}  then A  B ( Because there is an element 2 of B which is not in A).

Equal Sets  Two sets A and B are equal if, and only if, every element of A is in B and every element of B is in A and is denoted A = B.  Symbolically: A = B iff A  B and B  A  EXAMPLE:  Let A = {1, 2, 3, 6}  B = the set of positive divisors of 6  C = {3, 1, 6, 2}D = {1, 2, 2, 3, 6, 6, 6}  Then A, B, C, and D are all equal sets.

NULL Set  A set which contains no element is called a null set, or an empty set or a void set. It is denoted by the Greek letter  (phi) or { }.  EXAMPLE  A = {x | x is a person taller than 10 feet} =  ( Because there does not exist any human being which is taller then 10 feet )  B = {x | x2 = 4, x is odd} =  (Because we know that there does not exist any odd whose square is 4)   is regarded as a subset of every set.

Exercise Determine whether each of the following statements is true or false. 1. x  {x} 2. {x}  {x} 3. {x}  {x} 4. {x}  {{x}} 5.   {x} 6.   {x}

Exercise Determine whether each of the following statements is true or false. 1. x  {x} TRUE ( Because x is the member of the singleton set { x } ) 2. {x}  {x} TRUE ( Because Every set is the subset of itself. Note that every Set has necessarily two subsets  and the Set itself, these two subset are known as Improper subsets and any other subset is called Proper Subset) 3. {x}  {x} FALSE ( Because { x} is not the member of {x} ) Similarly other 4. {x}  {{x}} TRUE 5.   {x} TRUE 6.   {x} FALSE

Universal Set  The set of all elements under consideration is called the Universal Set.  The Universal Set is usually denoted by U.

Venn Diagram  A Venn diagram is a graphical representation of sets by regions in the plane.  The Universal Set is represented by the interior of a rectangle, and the other sets are represented by disks lying within the rectangle. U B A

Finite and Infinite Sets  A set S is said to be finite if it contains exactly m distinct elements where m denotes some non negative integer.  In such case we write  S  = m or n(S) = m  A set is said to be infinite if it is not finite.

Examples 1. The set S of letters of English alphabets is finite and  S  = The null set  has no elements, is finite and  = 0 3. The set of positive integers {1, 2, 3,…} is infinite.

Exercise  Determine which of the following sets are finite/infinite.  A = {month in the year}  B = {even integers}  C = {positive integers less than 1}  D = {animals living on the earth}  E = {lines parallel to x-axis}  F = {x  R  x x 50 – 1 = 0}  G = {circles through origin}

Exercise  Determine which of the following sets are finite/infinite.  A = {month in the year} FINITE  B = {even integers} INFINITE  C = {positive integers less than 1} FINITE  D = {animals living on the earth} FINITE  E = {lines parallel to x-axis} INFINITE  F = {x  R  x x 50 – 1 = 0} FINITE  G = {circles through origin} INFINITE

Membership Table  A table displaying the membership of elements in sets. To indicate that an element is in a set, a 1 is used; to indicate that an element is not in a set, a 0 is used.  Membership tables can be used to prove set identities. AAcAc 10 01