1.5 Set Operations. Chapter 1, section 5 Set Operations union intersection (relative) complement {difference}

Slides:



Advertisements
Similar presentations
 Union  Intersection  Relative Complement  Absolute Complement Likened to Logical Or and Logical And Likened to logical Negation.
Advertisements

Chapter 2 The Operations of Fuzzy Set. Outline Standard operations of fuzzy set Fuzzy complement Fuzzy union Fuzzy intersection Other operations in fuzzy.
Algebra I Vocabulary Chapter 3. Any number that makes an inequality true is called a.
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
1 More Properties of Regular Languages. 2 We have proven Regular languages are closed under: Union Concatenation Star operation Reverse.
Sets Definition of a Set: NAME = {list of elements or description of elements} i.e. B = {1,2,3} or C = {x  Z + | -4 < x < 4} Axiom of Extension: A set.
SET.   A set is a collection of elements.   Sets are usually denoted by capital letters A, B, Ω, etc.   Elements are usually denoted by lower case.
Fall 2004COMP 3351 Single Final State for NFA. Fall 2004COMP 3352 Any NFA can be converted to an equivalent NFA with a single final state.
1 NFAs accept the Regular Languages. 2 Equivalence of Machines Definition: Machine is equivalent to machine if.
Fall 2006Costas Busch - RPI1 Properties of Regular Languages.
CSE115/ENGR160 Discrete Mathematics 02/14/12 Ming-Hsuan Yang UC Merced 1.
Chapter 2 Chapter The sample space of an experiment, denoted S , is the set of all possible outcomes of that experiment. An event is any collection.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
1 Set Operations CS/APMA 202, Spring 2005 Rosen, section 1.7 Aaron Bloomfield.
Discrete Maths Objective to re-introduce basic set ideas, set operations, set identities , Semester 2, Set Basics 1.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Survey of Mathematical Ideas Math 100 Chapter 2
Operations on Sets – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Operations on Sets Reading: Kolman, Section 1.2.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 2.3, Slide 1 Set Theory 2 Using Mathematics to Classify Objects.
1.2 Sample Space.
Chapter 3 – Set Theory  .
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.
LECTURE 15 THURSDAY, 15 OCTOBER STA 291 Fall
1. Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element of A” A = {a 1, a 2,
Chapter 2: Equations and Inequalities
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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.
Set Theory Using Mathematics to Classify Objects 2 © 2010 Pearson Education, Inc. All rights reserved.
Ch. 2 Basic Structures Section 1 Sets. Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C.
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Discrete Mathematics Set.
Chapter 10 – Data Analysis and Probability 10.7 – Probability of Compound Events.
AP Statistics Section 6.2 B Probability Rules. If A represents some event, then the probability of event A happening can be represented as _____.
Set Operations Section 2.2.
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
 Union Symbol ∪ If A and B are sets, their union is equal to all elements in both A & B A = {1,2,3,4} B = {2,4,5,6,7,8} A ∪ B = {1,2,3,4,5,6,7,8}
Section 1.2 – 1.3 Outline Intersection  Disjoint Sets (A  B=  ) AND Union  OR Universe The set of items that are possible for membership Venn Diagrams.
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 Set Operations.
Venn Diagrams.
Chapter 1: Outcomes, Events, and Sample Spaces men 1.
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
The set of whole numbers less than 7 is {1, 2, 3, 4, 5, 6}
Discrete Structures – CNS 2300
CSNB 143 Discrete Mathematical Structures
Properties of Regular Languages
PROPERTIES OF REGULAR LANGUAGES
Formal Language & Automata Theory
Counting and Probability Section 12.1: Sets and Counting IBTWW…
Single Final State for NFA
Set Operations Section 2.2.
Session – 2 SETS & Operations of SETS
CSE322 PROPERTIES OF REGULAR LANGUAGES
Venn Diagrams and Partitions
Closure Properties of Context-Free languages
Chapter Sets &Venn Diagrams.
COUNTING AND PROBABILITY
Section 10.4 Other Angle Relationships in Circles
Lesson 1.2 Set Operations pp. 6-8.
Sets A set is simply any collection of objects
AND.
Set Theoretic Operations
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations

Sets, Unions, Intersections, and Complements
Section – Linear Programming
NFAs accept the Regular Languages
Presentation transcript:

1.5 Set Operations

Chapter 1, section 5 Set Operations union intersection (relative) complement {difference}

Chapter 1, section 5 Set Operations Disjoint Sets For Example, A = {0,1} B = {2,3} A B = Ø –A and B are disjoint

Chapter 1, section 5 Set Operations Unions and Intersections Examples, given –A = {0,1,3} –B = {1,2,5} union (U) A U B = {0,1,2,3,5} intersection ( ): A B = {1}

Chapter 1, section 5 Set Operations DeMorgans Laws DeMorgans Laws: ~(A U B ) == ~A ~B ~(A B) == ~A U ~B

Chapter 1, section 5 Set Operations Distributive Properties A (B U C) == (A B) U (A C) A U (B C) == (A U B) (A U C)

Chapter 1, section 5 Set Operations Generalized Unions and Intersections Generalized unions and intersections A 1 U A 2 U … U A N = U A i *(similarly for intersections)

Chapter 1, section 5 Set Operations One final note on Sets Note: When N is infinity, then membership in the infinite union implies that there exists an N such that membership occurs in A N