Union Definition: The union of sets A and B, denoted by A B, contains those elements that are in A or B or both: Example: { 1, 2, 3} {3, 4, 5} = { 1,

Slides:

Advertisements

Similar presentations

Set Operations. When sets are equal A equals B iff for all x, x is in A iff x is in B or … and this is what we do to prove sets equal.

Advertisements

Membership Tables: Proving Set Identities with One Example

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

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices

Discrete Structures & Algorithms Basics of Set Theory EECE 320 — UBC.

Instructor: Hayk Melikya

(CSC 102) Discrete Structures Lecture 14.

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices

Set Operators Goals Show how set identities are established Introduce some important identities.

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.

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.

Discrete Structures Chapter 3 Set Theory Nurul Amelina Nasharuddin Multimedia Department.

CSE115/ENGR160 Discrete Mathematics 02/14/12 Ming-Hsuan Yang UC Merced 1.

modified from UCI ICS/Math 6D, Fall Sets+Functions-1 Sets “Set”=Unordered collection of Objects “Set Elements”

1 Set Theory. 2 Set Properties Commutative Laws: Associative Laws: Distributive Laws:

1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.

1 Discussion #21 Discussion #21 Sets & Set Operations; Tuples & Relations.

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.

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.

Operations on Sets – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Operations on Sets Reading: Kolman, Section 1.2.

2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Sets.

Sets Defined A set is an object defined as a collection of other distinct objects, known as elements of the set The elements of a set can be anything:

Set Theory Dr. Ahmed Elmoasry. Contents Ch I: Experiments, Models, and Probabilities. Ch II: Discrete Random Variables Ch III: Discrete Random Variables.

1.4 Sets Definition 1. A set is a group of objects ． The objects in a set are called the elements, or members, of the set. Example 2 The set of positive.

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,

CompSci 102 Discrete Math for Computer Science

Set Operators. Copyright © Peter Cappello Union Let A and B be sets. A union B, denoted A  B, is the set A  B = { x | x  A  x  B }. Draw a.

Set Operations Chapter 2 Sec 3. Union What does the word mean to you? What does it mean in mathematics?

Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 Basic Structure : Sets, Functions, Sequences, and Sums Sets Operations.

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.

Introduction to Set theory. Ways of Describing Sets.

Discrete Mathematics SETS. What is a set? ^A set is a unordered collection of “objects”  People in a class: {A yşe, B arış, C anan }  Cities in Turkey.

Lecture # 12 Set Identities

Ch. 2 Basic Structures Section 1 Sets. Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C.

Discrete Mathematics. Set Theory - Definitions and notation A set is an unordered collection of elements. Some examples: {1, 2, 3} is the set containing.

Discrete Mathematics CS 2610 January 27, part 2.

Discrete Mathematics Set.

Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.

Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.

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.

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.

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.

Thinking Mathematically Venn Diagrams and Set Operations.

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.

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 Operators Goals Show how set identities are established

Set. Outline Universal Set Venn Diagram Operations on Sets.

Discrete Structures – CNS 2300

Discrete Mathematical The Set Theory

Lecture 04 Set Theory Profs. Koike and Yukita

Sets Section 2.1.

CSE15 Discrete Mathematics 02/15/17

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.

Exercises Show that (P  Q)  (P)  (Q)

CS100: Discrete structures

Set Operations Section 2.2.

Propositional Equivalences

Session – 2 SETS & Operations of SETS

Discrete Mathematics R. Johnsonbaugh

L5 Set Operations.

Lecture Sets 2.2 Set Operations.

CSC102 - Discrete Structures (Discrete Mathematics) Set Operations

Sets, Unions, Intersections, and Complements

Presentation transcript:

Union Definition: The union of sets A and B, denoted by A B, contains those elements that are in A or B or both: Example: { 1, 2, 3} {3, 4, 5} = { 1, 2, 3, 4, 5} U A B Venn Diagram for A B

Intersection Definition: The intersection of sets A and B, denoted by A B, contains elements that are in both A and B If the intersection is empty, then A and B are disjoint. Examples: {1, 2, 3} {3, 4, 5} = {3} {1, 2, 3} {4, 5, 6} = U A B Venn Diagram for A B

Difference Definition: The difference of sets A and B, denoted by A–B, is the set containing the elements of A that are not in B: A–B = { x | x A x B } Example: { 1, 2, 3} – {3, 4, 5} = { 1, 2} U A B Venn Diagram for AB

Complement Definition: The complement of a set A, denoted by Ā is the set U – A; i.e., it contains all elements that are not in A Ā = { x U | x A } Example: If U are positive integers less than 100 then the complement of { x | x > 70} is { x | x 70} A U Venn Diagram for Complement Ā

Examples U = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10} A = {1, 2, 3, 4, 5} B ={4, 5, 6, 7, 8} A B = {1, 2, 3, 4, 5, 6, 7, 8} A B = {4, 5} Ā = {0, 6, 7, 8, 9, 10} = {0, 1, 2, 3, 9, 10} A–B = {1, 2, 3} B–A = {6, 7, 8}

Set Identities How can we compare sets constructed using the various operators? Identity laws Domination laws Idempotent laws Complementation law

Set Identities Commutative laws Associative laws Distributive laws

Set Identities De Morgans laws Absorption laws Complement laws

Proving Set Identities Different ways to prove set identities: 1. Prove that each set is a subset of the other. 2. Use set builder notation and propositional logic. 3. Membership Tables: To compare two sets S1 and S2, each constructed from some base sets using intersections, unions, differences, and complements: Consider an arbitrary element x from U and use 1 or 0 to represent its presence or absence in a given set Construct all possible combinations of memberships of x in the base sets Use the definitions of set operators to establish the membership of x in S1 and S2 S1=S2 iff the memberships are identical for all combinations

Membership Table ABC Example: Solution: Show that the distributive law holds.