Section 3.1 Sets and their operation. Definitions A set S is collection of objects. These objects are said to be members or elements of the set, and the.

Slides:



Advertisements
Similar presentations
Learning Objectives for Section 7.2 Sets
Advertisements

Sets of Real Numbers The language of set notation.
College Algebra Review Section 1 Objectives of this Section Classify Numbers Evaluate Numerical Expressions Work with Properties of Real Numbers.
Lecture 2 Introduction To Sets CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Sets DISCRETE STRUCTURE ABDUL BASIT TAHIR, KAMRAN ALI, FAIZAN ILLAHI, NOMAN AHMAD, ARSALAN MUBASHIR.
Chapter 2 The Basic Concepts of Set Theory
1 Inference Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Ch 9 Inequalities and Absolute Value
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Properties and Relationships of Set Theory. Properties and Relationships of Set Theory How are Venn Diagrams used to show relationships among sets? How.
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.
Discrete Maths Objective to re-introduce basic set ideas, set operations, set identities , Semester 2, Set Basics 1.
Sets.
Set Notation.
This section will discuss the symbolism and concepts of set theory
Sullivan Algebra and Trigonometry: Section R.1 Real Numbers Objectives of this Section Classify Numbers Evaluate Numerical Expressions Work with Properties.
2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
MTH 231 Section 2.1 Sets and Operations on Sets. Overview The notion of a set (a collection of objects) is introduced in this chapter as the primary way.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Chapter 7 Logic, Sets, and Counting Section 2 Sets.
CompSci 102 Discrete Math for Computer Science
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Sets and Counting6 Sets and Set Operations The Number of Elements in a Finite Set The.
Chapter 2 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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.
SECTION 2-3 Set Operations and Cartesian Products Slide
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.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Sets and Counting6 Sets and Set Operations The Number of Elements in a Finite Set The.
Sets of Numbers Unions, Intersections, and Venn Diagrams
9.1 Sets, Intersections, and Unions  Standard 1.0  8 Key Terms.
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.
1 Chapter Two Basic Concepts of Set Theory –Symbols and Terminology –Venn Diagrams and Subsets.
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 01 – LESSON 10 - LOGIC ESSENTIAL QUESTION HOW DO YOU USE LOGICAL REASONING TO PROVE STATEMENTS ARE TRUE? SCHOLARS WILL DETERMINE TRUTH VALUES OF NEGATIONS,
1 Section 1.2 Sets A set is a collection of things. If S is a set and x is a member or element of S we write x  S. Othewise we write x  S. The set with.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Set Operations Section 2.2.
Chapter 7 Sets and Probability Section 7.1 Sets What is a Set? A set is a well-defined collection of objects in which it is possible to determine whether.
Thinking Mathematically Venn Diagrams and Subsets.
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.
Thinking Mathematically Venn Diagrams and Set Operations.
The Basic Concepts of Set Theory. Chapter 1 Set Operations and Cartesian Products.
Set Notation 1.3 – 1.4 Quiz Topics
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.
A Π B = all elements in both sets A and B
Sets and Operations TSWBAT apply Venn diagrams in problem solving; use roster and set-builder notation; find the complement of a set; apply the set operations.
Set Builder Notation. If you recall, a set is a collection of objects which we write using brackets and name using a capital letter. Remember also that:
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.
Dr. Ameria Eldosoky Discrete mathematics
Sets Page 746.
Sets Finite 7-1.
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
Sets Section 2.1.
1.1 Sets and Subsets.
Set and Set Operations Grab a sheet from front.
        { } Sets and Venn Diagrams Prime Numbers Even Numbers
Algebra 1 Section 1.1.
2.1 Sets Dr. Halimah Alshehri.
CHAPTER 1 - Sets and Intervals
CHAPTER 1 - Sets and Intervals
Chapter Sets &Venn Diagrams.
Section 16 Inclusion/Exclusion
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.
Chapter 7 Logic, Sets, and Counting
Which sets are equal? Which sets are equivalent?
Introduction A set is a collection of objects.
Presentation transcript:

Section 3.1 Sets and their operation

Definitions A set S is collection of objects. These objects are said to be members or elements of the set, and the shorthand for writing “x is an element of S” is “x  S.” The easiest way to describe a set is by simply listing its elements (the “roster method”). For example, the collection of odd one-digit numbers could be written {1, 3, 5, 7, 9}. Note that this is the same as the set {9, 7, 5, 3, 1} since the order elements are listed does not matter in a set.

Examples The elements of a set do not have to be numbers as the following examples show: 1.{Doug, Amy, John, Jessica} 2.{TTT, TTF, TFT, TFF, FTT, FTF, FFT, FFF} 3.{ {A,B}, {A,C}, {B,C} } 4.{ }

Common sets of numbers Page 182 N … set of natural numbers {0, 1, 2, …} Z … set of integers {…, -2, -1, 0, 1, 2, …} Q … set of rational numbers R … set of real numbers

Definitions If A and B are sets, then the notation A  B (read “A is a subset of B”) means that every element of set A is also an element of set B. Practice. Which is true? 1.{1, 2, 3, 4}  {2, 3, 4} 2.Z  Q 3.Z  N 4.{ }  {a, b, c} 5.{3, 5, 7}  {2, 3, 5, 7, 11} 6.{a, b}  { {a, b}, {a, c}, {b, c} } 7. {a}  { {a, b}, {a, c}, {a, b, c} }

Set notation Large sets cannot be listed in this way so we need the more compact “set-builder” notation. This comes in two types exemplified by the following: 1.(Property) {n  Z : n is divisible by 4} 2.(Form){4k : k  Z}

Practice with property description List five members of each of the following sets: 1.{n  N : n is an even perfect square } 2.{x  Z : x – 1 is divisible by 3 } 3.{r  Q : r 2 < 2 } 4.{x  R : sin(x) = 0 }

Practice with form description List five members of each of the following sets: 1.{ 3n 2 : n  Z } 2.{ 4k + 1 : k  N } 3.{ 3 – 2r : r  Q and 0  r  5 }

Definitions of set operations Let A and B be sets with elements from a specified universal set U. A  B (read “A intersect B”) is the set of elements in both sets A and B. A  B (read “A union B”) is the set of elements in either set A or B. A – B (read “A minus B”) is the set of elements in set A which are not in B. A’ (read “the complement of A”) is the set of elements in the universe U which are not in A.

Practice with set operations Let A = {1, 3, 5, 7, 9}, B = {2, 4, 6, 8, 10}, C = {2, 3, 5, 7}, D = {6, 7, 8, 9, 10} be sets with elements from the universal set U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} Find each of the following: 1.A  C 2.B  D 3.B – D 4.B’ 5.(A  B) – C 6.(A  C)  B 7.B’  C’ 8.(B  C)’ 9.(C  D) – A 10.B  D’

Venn diagrams

Inclusion-Exclusion Principle The notation n(A) means “the number of elements of A.” For example, if A = {2, 3, 6, 8, 9}, then n(A) = 5. Principle of Inclusion/Exclusion for two sets A and B: n(A  B) = n(A) + n(B) – n(A  B)

Inclusion-Exclusion Principle Example. A = { 2, 4, 6, 8, …, 96, 98, 100 } and B = { 5, 10, 15, 20, …, 90, 95, 100} n(A  B)=n(A) + n(B) – n(A  B) = – 10 = 60

Inclusion-Exclusion Principle Principle of Inclusion/Exclusion for three sets A, B, and C: n(A  B  C)= n(A) + n(B) + n(C) – n(A  B) – n(A  C) – n(B  C) + n(A  B  C)