This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: c Kendra Kilmer September 16, 2011 Section 6.1  Sets and Set Operations Definition: A set is a welldefined collection of objects usually denoted by uppercase letters. Definition: The elements , or members, of a set are denoted by lowercase letters. Set Notations: 1. Roster Notation: Lists each element between braces Example 1: 2. Setbuilder Notation: A rule is given that describes the property an object x must satisfy to qualify for mem bership in the set. Example 2: Notation: If a is an element of a set A , we write a A . If a doesnt belong to A we write a / A . Example 3: Let A = { 1 , 2 , 3 } . Definition: Two sets A and B are equal , written A = B , if and only if they have exactly the same elements. (Note: The elements do NOT have to be in the same order.) Example 4: Let A = { 1 , 2 , 3 } , B = { 2 , 1 , 3 } , C = { 1 , 2 , 3 , 4 } Definition: If every element of a set A is also an element of a set B , then we say that A is a subset of B and write A B ....
View Full
Document
 Fall '08
 JillZarestky
 Sets

Click to edit the document details