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

Slides:



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

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.
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,
 Union  Intersection  Relative Complement  Absolute Complement Likened to Logical Or and Logical And Likened to logical Negation.
CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
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
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.
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 Mathematics Lecture 4 Harper Langston New York University.
Discrete Structures Chapter 3 Set Theory Nurul Amelina Nasharuddin Multimedia Department.
1 CA 208 Logic Ex4 Commutativity (P  Q)  Associativity P  (Q  R)  (P  Q)  R Distributivity P  (Q  R)  Idempotency.
CSE115/ENGR160 Discrete Mathematics 02/14/12 Ming-Hsuan Yang UC Merced 1.
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.
Lecture 3 Operations on Sets CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
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.
Chapter 1 Probability Spaces 主講人 : 虞台文. Content Sample Spaces and Events Event Operations Probability Spaces Conditional Probabilities Independence of.
CS201: Data Structures and Discrete Mathematics I
CompSci 102 Discrete Math for Computer Science
Chapter 2 The Operation of Fuzzy Set. 2.1 Standard operations of fuzzy set Complement set Union A  B Intersection A  B difference between characteristics.
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.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 Basic Structure : Sets, Functions, Sequences, and Sums Sets Operations.
Probability Rules. We start with four basic rules of probability. They are simple, but you must know them. Rule 1: All probabilities are numbers between.
Probability. Rules  0 ≤ P(A) ≤ 1 for any event A.  P(S) = 1  Complement: P(A c ) = 1 – P(A)  Addition: If A and B are disjoint events, P(A or B) =
Chapter 2 With Question/Answer Animations. Section 2.1.
Introduction to Set theory. Ways of Describing Sets.
Lecture # 12 Set Identities
Snick  snack Supplement: Worked Set Proofs Based on work by Meghan Allen.
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.
George Boole Set Theory More Set Theory – Union (“OR”) X is the set of men, Y is the set of women X + Y = ? Y + X = ?
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.
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.
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.
Venn Diagrams.
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.
Lecture 6 Set Theory.
7.1 De Morgan's Laws Bond Chapter 7.1 Part 2.
Set Theory.
Discrete Structures – CNS 2300
Discrete Mathematical The Set Theory
The Foundations: Logic and Proofs
Sets Section 2.1.
Week 7 - Monday CS322.
CSE15 Discrete Mathematics 02/15/17
CS100: Discrete structures
Set Operations Section 2.2.
Propositional Equivalences
Probability Models Section 6.2.
CS 220: Discrete Structures and their Applications
Chapter 2 Notes Math 309 Probability.
Discrete Mathematics R. Johnsonbaugh
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
Chapter 1 Probability Spaces
Presentation transcript:

Ch. 2 Basic Structures Section 1 Sets

Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C | – | A  B| – | A  C | – | B  C | + | A  B  C | | A c | = | U | – | A |

Disjoint sets A & B are disjoint sets iff A  B =  Example: A = {1, 2, 3} B = { 4, 5, 6}

Power Set P(A) = The power set of a set A = the set of all subsets of A. A  P(S) iff A  S | P( {{a, {b}}, a, {b} } ) | = 2 3 There is no set A s.t. |P(A)| = 0 There is a set A s.t. |P(A)| = 1 There is no set A s.t. |P(A)| = 3

Power Set A = B iff P(A) = P(B) Proof “  ” Suppose that A=B. Then P(A) = P(B) “  ” If P(A) = P(B), then A  P(A) = P(B) and so A  B Similarly, B  P(B) = P(A) and so B  A Therefore A =B

Power Set P( ? ) = { , {a}, {a,  }} Note that:   {  },   {  },   {  },   {  } {2}  {2, {2}}, {2}  {2, {2}}, 2  {2, {2}} {{2}}  {2, {2}}, {2}  {2} a  {{a}, {a, {a}} }

Some facts A  B = A  B  A A – B = A  A  B =  A – B = B – A  A = B A = A – B  (A  B)

Ch. 2 Basic Structures Section 2 Set Operations

1. Union A  B 2. Intersection A  B 3. Complement A c = Ā = U – A complement of A w.r.t. to U 4. DifferenceA – B = A  B c 5. Generalized operations

Example A = set of students who live 1 mile of school B = set of students who walk to school 1. A  B = set of students who live 1 mile of school OR walk to it. 2. A  B = set of students who live 1 mile of school AND walk to it. 3. A – B = set of students who live 1 mile of school but not walk to it.

Set Identities See Table 1 in page 124 Identity Laws: A   = A A  U = A Dominations Laws: A  U = U A   = 

Set Identities Idempotent Laws: A  A = A A  A = A Complementation Law: (A c ) c = A Commutative Laws: A  B = B  A A  B = B  A

Set Identities Associative Laws: A  (B  C) = (A  B)  C A  (B  C) = (A  B)  C Distributive Laws: A  (B  C) = (A  B)  (A  C) A  (B  C) = (A  B)  (A  C) De Morgan’s Laws: (A  B) c = B c  A c (A  B) c = B c  A c

Set Identities Absorption Laws: A  (A  B) = A A  (B  C) = A Complement Laws: A  A c =  A  A c = U

Proof of A=B Show that A  B and B  A Show that  x (x  A  x  B) Direct proof

Examples (A  B) c = B c  A c Proof (A  B) c = { x  U | x  A  B } = { x  U |  (x  A  B) } = { x  U |  x  A   x  B } = { x  U | x  A  x  B } = { x  U | x  A }  { x  U | x  B } = A c  B c

Another proof of (A  B) c = B c  A c x  (A  B) c  x  A  B  x  A or x  B  x  A c or x  B c  x  A c  B c