Sets. EXAMPLE 1 The set O of odd positive integers less than 10 can be expressed by O = { l, 3, 5, 7, 9}. * This way of describing a set is known as.

Slides:



Advertisements
Similar presentations
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Advertisements

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Section 1.6: Sets Sets are the most basic of discrete structures and also the most general. Several of the discrete structures we will study are built.
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
Sets DISCRETE STRUCTURE ABDUL BASIT TAHIR, KAMRAN ALI, FAIZAN ILLAHI, NOMAN AHMAD, ARSALAN MUBASHIR.
Analytical Methods in CS (CIS 505)
Sets 1.
CSE115/ENGR160 Discrete Mathematics 02/10/11 Ming-Hsuan Yang UC Merced 1.
Sets 1.
Sets. Copyright © Peter Cappello Definition Visualize a dictionary as a directed graph. Nodes represent words If word w is defined in terms of word.
Set Theory.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
SETS A set B is a collection of objects such that for every object X in the universe the statement: “X is a member of B” Is a proposition.
2.1 – Symbols and Terminology Definitions: Set: A collection of objects. Elements: The objects that belong to the set. Set Designations (3 types): Word.
MATHEMATICS XI SETS.
SET Miss.Namthip Meemag Wattanothaipayap School. Definition of Set Set is a collection of objects, things or symbols. There is no precise definition for.
Sets.
This section will discuss the symbolism and concepts of set theory
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Mathematical Proofs. Chapter 1 Sets 1.1 Describing a Set 1.2 Subsets 1.3 Set Operations 1.4 Indexed Collections of Sets 1.5 Partitions of Sets.
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
1 Section 1.6 Sets. 2 Set Fundamental discrete structure on which all other discrete structures are built Can be loosely defined as a collection of elements.
CompSci 102 Discrete Math for Computer Science
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
Sets Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Definition of Set A set is a collection of objects called elements.
ELEMENTARY SET THEORY.
Chapter 2 With Question/Answer Animations. Section 2.1.
Rosen 1.6, 1.7. Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by.
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 CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
Section 2.1. Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the.
The Basic Concepts of Set Theory. Chapter 1 Set Operations and Cartesian Products.
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.
CPCS 222 Discrete Structures I
Section 6.1 Set and Set Operations. Set: A set is a collection of objects/elements. Ex. A = {w, a, r, d} Sets are often named with capital letters. Order.
Set. Outline Universal Set Venn Diagram Operations on Sets.
Sets CS 202, Spring 2007 Epp, chapter 5.
CSE15 Discrete Mathematics 02/13/17
Sets Page 746.
Sets Finite 7-1.
Set Definition: A set is unordered collection of objects.
The Language of Sets If S is a set, then
CSNB 143 Discrete Mathematical Structures
Set, Combinatorics, Probability & Number Theory
The Basic Concepts of Set Theory
Sets Section 2.1.
Chapter 1 Logic and Proofs Homework 2 Given the statement “A valid password is necessary for you to log on to the campus server.” Express the statement.
ALGEBRA II H/G - SETS : UNION and INTERSECTION
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
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
ALGEBRA I - SETS : UNION and INTERSECTION
Discrete Mathematics CS 2610
The aim of education is to teach students how to think rather than what to think. Sets The set is the fundamental discrete structure on which all other.
2 Chapter Numeration Systems and Sets
Chapter 2 The Basic Concepts of Set Theory
ALGEBRA II H/G - SETS : UNION and INTERSECTION
2.1 – Symbols and Terminology
Lecture Sets 2.2 Set Operations.
Sets & Set Operations.
Introduction A set is a collection of objects.
Chapter 3 Vocabulary 3.)Roster form 4.) Set-builder notation 5.) Empty set 6.) Universal set 7.) Complement of a set.
3-5 Working with Sets.
Presentation transcript:

Sets

EXAMPLE 1 The set O of odd positive integers less than 10 can be expressed by O = { l, 3, 5, 7, 9}. * This way of describing a set is known as the roster method. EXAMPLE 2 O = {x I x is an odd positive integer less than 10} * Another way to describe a set is to use set builder notation. We characterize all those elements in the set by stating the property or properties they must have to be members

Some Important Sets

Recall the notation for intervals of real numbers. When a and b are real numbers with a<b, we write

THE EMPTY SET There is a special set that has no elements. This set is called the empty set, or null set, and is denoted by ∅. The empty set can also be denoted by { }. A set with one element is called a singleton set.

Venn Diagrams In Venn diagrams the universal set U, which contains all the objects under consideration, is represented by a rectangle. EXAMPLE 4 Draw a Venn diagram that represents V, the set of vowels in the English alphabet? U V *a*a *u*u *o*o *i*i *e*e

DEFINITION 3 U B A A

Example 5 Suppose that A = {2, 4, 6}, B = {2, 6}, C = {4, 6}, and D = {4, 6, 8}. Determine which of these sets are subsets of which other of these sets. Solution:

THEOREM 1

DEFINITION 4 Let S be a set. If there are exactly n distinct elements in S where n is a nonnegative integer, we say that S is a finite set and that n is the cardinality of S. The cardinality of S is denoted by I S I. Example 6 *Let A be the set of odd positive integers less than 10. Then |A| = 5. * The null set has no elements, it follows that | ∅ | = 0.

The Power Set DEFINITION 6 Given a set S, the power set of S is the set of all subsets of the set S. The power set of S is denoted by P(S). EXAMPLE 8 What is the power set of the set to, {1, 2} ? Solution: P({1,2})=

Cartesian Products DEFINITION 7 The ordered n-tuple (a I, a 2,..., a n ) is the ordered collection that has a l as its first element, a 2 as its second element,..., and a n as its nth element.

Equality of two ordered n-tuples We say that two ordered n -tuples are equal if and only if each corresponding pair of their elements is equal. In other words, (a I, a 2,..., a n ) = (b l, b 2, …, b n ) if and only if a i = b i, for i = 1, 2,..., n. In particular, 2-tuples are called ordered pairs. The ordered pairs (a,b) and (c,d) are equal if and only if a =c and b = d. Note that (a,b) and (b,a) are not equal unless a = b.

The Cartesian product of two sets DEFINITION 8 Let A and B be sets. The Cartesian product of A and B, denoted by A x B, is the set of all ordered pairs (a,b), where a ϵ A and b ϵ B. Hence, A x B = {(a, b) | a ϵ A ᴧ b ϵ B }.

EXAMPLE 9 What is the Cartesian product of A = { 1, 2} and B= {a, b, c}? Solution: The Cartesian product A x B is A x B = { (1,a), (1,b), (1,c), (2,a), (2,b), (2,c)}.

Caution! The Cartesian products A x B and B x A are not equal, unless A = 0 or B ::::;:: 0 (so that A x B = 0) or A = B

The Cartesian product of sets DEFINITION 9 The Cartesian product of the sets A 1, A 2,..., A n, denoted by A 1 x A 2 X … x A n, is the set of ordered n-tuples (a 1, a 2,..., a n ), where a j belongs to A j for i =1, 2,..., n. In other words A 1 X A 2 x · · · x A n = {a 1, a 2,..., a n ) | a j ϵ A i for i=1, 2,..., n }.

EXAMPLE 10 What is the Cartesian product A x B x C, where A = {0, 1 }, B = { 1, 2}, and C = {0,1, 2}? Solution: The Cartesian product A x B x C consists of all ordered triples (a, b, c), where aϵ A, b ϵ B, and c ϵ C. Hence, A x B x C = {(0,1, 0), (0,1,1), (0, 1,2), (0,2,0), (0,2,1), (0, 2, 2), ( 1, 1, 0), ( 1, 1, 1 ), (1,1,2),(1,2,0), (1,2,1), (1,2,2)}