Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets
|
|
- Randall Bates
- 5 years ago
- Views:
Transcription
1 Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H. Rosen; 7th edition, Chapter 2.1 Sets 1
2 Definition : A set is an unordered collection of objects. Definition : The objects in a set are called the elements, or members, of the set. Capital letters (A, B, S ) used for sets Italic lower-case letters (a, x, y ) used to denote elements of sets There are several ways to describe a set. 1. Listing all members of a set, when this is possible Some examples: {1, 2, 3} is the set containing 1 and 2 and 3. {1, 1, 2, 3, 3} = {1, 2, 3} since repetition is irrelevant. {1, 2, 3} = {3, 2, 1} since sets are unordered. {1, 2, 3, } is a way we denote an infinite set. = { } is the empty set, or the set containing no elements. Note that { } 2. Set Builder notation Characterize all those elements in the set by stating the property or properties they must have to be members. D = {x x is prime and x > 2} E = {x x is odd and x > 2} The vertical bar means such that N = {0, 1, 2, 3, } is the set of natural numbers Z = {, -2, -1, 0, 1, 2, } is the set of integers Z + = {1, 2, 3, } is the set of positive integers Z - = {-1, -2, -3, } is the set of negative integers Q = {p/q : p, q Z, q 0} is the set of rational numbers Any number that can be expressed as a fraction of two integers (where the bottom one is not zero) R is the set of real numbers R +, the set of positive real numbers C, the set of complex numbers. 2
3 x S means x is an element of set S. x S means x is not an element of set S. Example: 4 {1, 2, 3, 4} 7 {1, 2, 3, 4} Universal set U : the set of all of elements (or the universe ) from which given any set is drawn. For the set {-2, 0.4, 2}, U would be the real numbers For the set {0, 1, 2}, U could be the N, Z, Q, R depending on the context For the set of the vowels of the alphabet, U would be all the letters of the alphabet Venn diagrams Sets can be represented graphically using Venn diagrams universal set U, which contains all the objects under consideration, is represented by a rectangle. Circles or other geometrical figures Inside this rectangle are used to represent sets. Points represent the particular elements of the set. S U 3
4 Sets can contain other sets S = { {1}, {2}, {3} } T = { {1}, {{2}}, {{{3}}} } V = { {{1}, {{2}}}, {{{3}}}, { {1}, {{2}}, {{{3}}} } } V has only 3 elements! Note that 1 {1} {{1}} {{{1}}} They are all different { } The first is a set of zero elements The second is a set of 1 element Replace by { }, and you get: { } {{ }} It s easier to see that they are not equal that way Definition: Two sets are equal if and only if they have the same elements. Therefore, if A and B are sets, then A and B are equal if and only if x(x A x B). We write A = B if A and B are equal sets. Definition: The set A is a subset of B if and only if every element of A is also an element of B.We use the notation A B to indicate that A is a subset of the set B. Examples: {1, 2, 3, 4, 5} = {5, 4, 3, 2, 1} but {1, 2, 3, 4, 5} {1, 2, 3, 4} If A = {2, 4, 6}, B = {1, 2, 3, 4, 5, 6, 7}, A is a subset of B This is specified by A B meaning that x (x A x B) 4
5 A B means A is a subset of B. or, B contains A. or, every element of A is also in B. or, x ((x A) (x B)). For any set S, S S ( S S S) For any set S, S ( S S) Every non-empty set S, it has at least two subsets: 1) S A B 2) S S U Venn Diagram A B means A is a subset of B. A B means A is a superset of B. A = B if and only if A and B have exactly the same elements. iff, A B and B A iff, A B and A B iff, x ((x A) (x B)). 5
6 Proper Subsets A B means A is a proper subset of B. A B, and A B. x ((x A) (x B)) x ((x B) (x A)) A B U The difference between subset and proper subset is like the difference between less than or equal to and less than for numbers. {1,2,3} {1,2,3,4,5} {1,2,3} {1,2,3,4,5} Examples: Let B = {0, 1, 2, 3, 4, 5} If A = {1, 2, 3}, A is not equal to B, and A is a subset of B A proper subset is written as A B Sets may contain other sets as members: A = {0, {a}, {b}, {a, b}} and B = {x I x is a subset of the set {a, b}}. Note that A = B, {a} A, but a A 6
7 Quick examples: Is {1,2,3}? Yes! x (x ) (x {1,2,3}) holds, because (x ) is false. Is {1,2,3}? NO Is {1,2,3}? Yes Is {,1,2,3}? Yes Is {,1,2,3}? Yes Is {x} {x}? No Cardinality of Set If S is finite, then the cardinality of S is the number of distinct elements in S. The cardinality of S is denoted by S. Examples: If S = {1, 2, 3, 4, 5}, Then S = 5 If S = {3,3,3,3,3}, Then S = 1 If S =, Then S = 0 If S = {, {a}, {b}, {a, b}}, Then S = 4 If S be the set of odd positive integers less than 10 Then S = 5. If S be the set of letters in the English alphabet Then S = 26 7
8 Power Sets The power set of S is the set of the subsets of S. (written as P(S)) Given S = {0, 1, 2}. All the possible subsets of S? P(S) = {, {0}, {l}, {2}, {0, 1}, {0, 2}, {l, 2}, {0, 1, 2}} Note that S = 3 and P(S) = 8 If S has n elements then the power set of S has 2 n elements If S is a set, then the power set of S is 2 S = { x : x S }. If S = {a}, then P(S) =2 S = {, {a}}. If S = {,{ }}, then P(S) = 2 S = {, { }, {{ }}, {,{ }}}. Fact: if S is finite, P(S) = 2 S = 2 S. (if S = n, 2 S = 2 n ) Cartesian Product The Cartesian Product of two sets A and B is: A x B = { < a, b > : a A b B} Example: Given A = { a, b } and B = { 0, 1 }, what is their Cartesian product? C = A x B = { (a,0), (a,1), (b,0), (b,1) } Example: What is the Cartesian product of: A = { I, 2} and B = {a, b, c} Solution: The Cartesian product A x B is: A B = {(1, a), (1, b), (1, c), (2, a), (2, b), (2, c) }. Note that: A B B A Since, B A = {(a, I), (a, 2), (b, I), (b, 2), (c, 1), (c, 2)} A 1 x A 2 x x A n = {<a 1, a 2,, a n >: a 1 A 1, a 2 A 2,, a n A n } 8
9 Example: What is the Cartesian product A B C, where A = {0, l}, B = { I, 2}, and C = {0, 1, 2}? Solution: A B C = {(0, 1, 0), (0, I, I), (0, 1, 2), (0, 2, 0), (0, 2, I), (0, 2, 2), (1, 1, 0), (1, 1, 1), (1, 1, 2), (1, 2, 0), (1, 2, 1), (1, 2, 2)}. Exercises 1. List the members of these sets. a) {x I x is a real number such that x 2 = I} b) {x I x is a positive integer less than 12} c) {x I x is the square of an integer and x < 100} d) {x I x is an integer such that x 2 = 2} 2. Use set builder notation to give a description of each of these sets. a) {0, 3, 6, 9, I2} b) {-3, -2, -I,0, I, 2, 3} c) {m, n, o, p} 3. Determine whether each of these pairs of sets are equal. a) {I, 3, 3, 3, 5, 5, 5, 5, 5}, {5, 3, I} b) {{I}}, {I, {I}} c), { } 4. Suppose that A = {2, 4, 6}, B = {2, 6}, C = {4, 6}, and D = {4, 6, 8}. Determine which of these sets are subsets of which other of these sets. 9
10 Exercises Exercises 10
11 Exercises Chapter 2.2 Set Operations 11
12 Two sets can be combined in many different ways: Definition: Union The union of the sets A and B, denoted by A U B, is the set that contains those elements that are either in A or in B, or in both. A B = { x : x A v x B} B A Examples: {1, 2, 3} U {3, 4, 5} = {1, 2, 3, 4, 5} {a, b} U {3, 4} = {a, b, 3, 4} {1, 2} U = {1, 2} Properties of the union operation A U = A A U U = U A U A = A A U B = B U A A U (B U C) = (A U B) U C Identity law Domination law Idempotent law Commutative law Associative law 12
13 Intersection The intersection of the sets A and B, denoted by A B, is the set containing those elements in both A and B A B = { x : x A x B} B A Examples: {1, 2, 3} {3, 4, 5} = {3} {a, b} {3, 4} = {1, 2} = Properties of the intersection operation A U = A A = A A = A A B = B A A (B C) = (A B) C Identity law Domination law Idempotent law Commutative law Associative law 13
14 Disjoint Formal definition for disjoint sets: two sets are disjoint if their intersection is empty set A B = Examples: {1, 2, 3} and {3, 4, 5} are not disjoint {a, b} and {3, 4} are disjoint {1, 2} and are disjoint Their intersection is empty set and are disjoint! Their intersection is empty set Complement Let U be the universal set. The complement of the set A, denoted by A, is the complement of A with respect to U. The complement of the set A is U - A. The complement of a set A is: A = { x : x A} = A c Note that: = U and U = Properties of complement sets (A c ) c = A Complementation law A U A c = U Complement law A A c = Complement law Example: Let U is the set of all positive integers If A = {x x > 10}, Then A c = {l,2,3,4,5,6,7,8,9,l0}. A A 14
15 Difference The difference of A and B, denoted by A - B, is the set containing those elements that are in A but not in B. The difference of two sets A and B is: A - B = { x : x A x B } A - B = A B U Examples: {1, 2, 3} - {3, 4, 5} = {1, 2} {a, b} - {3, 4} = {a, b} {1, 2} - = {1, 2} The difference of any set S with the empty set will be the set S S - = S, where S is any set 15
16 symmetric difference The symmetric difference of two sets A and B is: A B = { x : (x A x B) v (x B x A)} = (A - B) U (B - A) = (A B) (A B) Set identities 16
17 How to prove a set identity? For example Prove that : (A U B) = A B Four methods: Use the basic set identities Use membership tables Prove each set is a subset of each other Use set builder notation and logical equivalences 1- By using the basic set identities (A U B) = A U B = A B = A B 17
18 2- Bu Using membership tables 3- By using each set is a subset of each other 1. ( ) (x A U B) (x A U B) (x A and x B) (x A B) 2. ( ) (x A B) (x A and x B) (x A U B) (x A U B) 18
19 4- By using set builder notation and logical equivalences (A U B) = {x : (x A v x B)} = {x : (x A) (x B)} = {x : (x A) (x B)} = A B Generalized Unions and Intersections Let A, B, and C be sets then: A B C contains those elements that are in at least one of the sets A, B, and C A B C contains those elements that are in all of A, B, and C. 19
20 Example: Let A = {0, 2, 4, 6, 8}, B = {0, 1,2,3, 4}, and C = {0, 3, 6, 9}, determine the following combinations: 1. A B C 2. A B C Solution: 1. A B C = {0, 1,2, 3,4, 6, 8, 9}. 2. A B C = {0}. Computer Representation of Sets Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. The bit string (of length U = 10) that represents the set A = {1, 3, 5, 6, 9} has a one in the first, third, fifth, sixth, and ninth position, and zero elsewhere. It is What bit strings represent the subset of: 1. All odd integers in U, A= {I, 3, 5, 7, 9}, and the bit string is Integers not exceeding 5 in U A= {l, 2, 3, 4, 5}, and the bit string is
21 Example: The bit strings for the sets {I, 2, 3, 4, 5} and {I, 3, 5, 7, 9} are and , respectively. Use bit strings to find the union and intersection of these sets. Solution: The bit string for the union of these sets is: = , Corresponds to the set {l, 2, 3,4, 5, 7, 9}. The bit string for the intersection of these sets is: = , Corresponds to the set {I, 3, 5}. Exercises 1. Let A = { l, 2, 3,4, 5} and B = {0, 3, 6}. Find a) A B b) A B c) A B d) B - A 2. Let A = {a, b, c, d, e} and B = {a, b, c, d, e, f, g, h}. Find a) A B b) A B c) A B d) B A 3. Find the sets A and B if A - B = {I, 5, 7, 8}, B - A = {2, l0}, and A B = {3, 6,9} 4. Show that if A and B are sets, then a) A - B = A B c b) (A B) (A Bc)= A 5. Find the symmetric difference of: a) { I, 3, 5} and { I, 2, 3}. b) the set of computer science majors at a school and the set of mathematics majors at this school 21
22 6. Let A = {0, 2, 4, 6, 8, 10}, B = {0, 1, 2, 3,4,5, 6}, and C = {4, 5, 6, 7, 8, 9, 10}. Find a) A B C b) A B C c) (A B) C d) (A B) C 7. What can you say about the sets A and B if we know that: a) A B=A b) A B=A c) A B = A d) A B= B A e) A B = B - A 8. Can you conclude that A = B if A, B, and C are sets such that: a) A C = B C b) A C = B C c) A B = B C and A C = B C 22
SET DEFINITION 1 elements members
SETS SET DEFINITION 1 Unordered collection of objects, called elements or members of the set. Said to contain its elements. We write a A to denote that a is an element of the set A. The notation a A denotes
More informationCS100: DISCRETE STRUCTURES
CS: DISCRETE STRUCTURES Computer Science Department Lecture : Set and Sets Operations (Ch2) Lecture Contents 2 Sets Definition. Some Important Sets. Notation used to describe membership in sets. How to
More informationSet and Set Operations
Set and Set Operations Introduction A set is a collection of objects. The objects in a set are called elements of the set. A well defined set is a set in which we know for sure if an element belongs to
More information2.1 Sets 2.2 Set Operations
CSC2510 Theoretical Foundations of Computer Science 2.1 Sets 2.2 Set Operations Introduction to Set Theory A set is a structure, representing an unordered collection (group, plurality) of zero or more
More informationCSC Discrete Math I, Spring Sets
CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its
More information2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2
2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of
More informationSets. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee
Sets Mukulika Ghosh Fall 2018 Based on slides by Dr. Hyunyoung Lee Sets Sets A set is an unordered collection of objects, called elements, without duplication. We write a A to denote that a is an element
More information9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS
What is discrete? Sets (Rosen, Chapter 2) TOPICS Discrete math Set Definition Set Operations Tuples Consisting of distinct or unconnected elements, not continuous (calculus) Helps us in Computer Science
More informationc) the set of students at your school who either are sophomores or are taking discrete mathematics
Exercises Exercises Page 136 1. Let A be the set of students who live within one mile of school and let B be the set of students who walk to classes. Describe the students in each of these sets. a) A B
More informationIntroduction II. Sets. Terminology III. Definition. Definition. Definition. Example
Sets Slides by Christopher M. ourke Instructor: erthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction
More informationSets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31
Sets MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Sets Fall 2014 1 / 31 Outline 1 Sets Introduction Cartesian Products Subsets Power Sets Union, Intersection, Difference
More information1.1 - Introduction to Sets
1.1 - Introduction to Sets Math 166-502 Blake Boudreaux Department of Mathematics Texas A&M University January 18, 2018 Blake Boudreaux (Texas A&M University) 1.1 - Introduction to Sets January 18, 2018
More informationReview of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16
Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special
More informationToday s Topics. What is a set?
Today s Topics Introduction to set theory What is a set? Set notation Basic set operations What is a set? Definition: A set is an unordered collection of objects Examples: Sets can contain items of mixed
More informationDiscrete Mathematics
Discrete Mathematics Lecture 2: Basic Structures: Set Theory MING GAO DaSE@ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 18, 2017 Outline 1 Set Concepts 2 Set Operations 3 Application
More information2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members
More informationIntroduction. Sets and the Real Number System
Sets: Basic Terms and Operations Introduction Sets and the Real Number System Definition (Set) A set is a well-defined collection of objects. The objects which form a set are called its members or Elements.
More information2/18/14. Uses for Discrete Math in Computer Science. What is discrete? Why Study Discrete Math? Sets and Functions (Rosen, Sections 2.1,2.2, 2.
Why Study Discrete Math? Sets and Functions (Rosen, Sections 2.1,2.2, 2.3) TOPICS Discrete math Set Definition Set Operations Tuples Digital computers are based on discrete units of data (bits). Therefore,
More information[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics
400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {
More informationSets 1. The things in a set are called the elements of it. If x is an element of the set S, we say
Sets 1 Where does mathematics start? What are the ideas which come first, in a logical sense, and form the foundation for everything else? Can we get a very small number of basic ideas? Can we reduce it
More information2 Review of Set Theory
2 Review of Set Theory Example 2.1. Let Ω = {1, 2, 3, 4, 5, 6} 2.2. Venn diagram is very useful in set theory. It is often used to portray relationships between sets. Many identities can be read out simply
More information1 of 7 7/15/2009 3:40 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 1. Sets Poincaré's quote, on the title page of this chapter could not be more wrong (what was he thinking?). Set theory
More informationWhat is Set? Set Theory. Notation. Venn Diagram
What is Set? Set Theory Peter Lo Set is any well-defined list, collection, or class of objects. The objects in set can be anything These objects are called the Elements or Members of the set. CS218 Peter
More informationOutline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set
Outline CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets rthur G. Werschulz Fordham University Department of Computer and Information Sciences Copyright rthur G. Werschulz, 2017.
More information11 Sets II Operations
11 Sets II Operations Tom Lewis Fall Term 2010 Tom Lewis () 11 Sets II Operations Fall Term 2010 1 / 12 Outline 1 Union and intersection 2 Set operations 3 The size of a union 4 Difference and symmetric
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More informationSets and set operations
CS 44 Discrete Mathematics for CS Lecture Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Course administration Homework 3: Due today Homework 4: Due next week on Friday,
More informationSETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.
SETS A set is a file of objects which have at least one property in common. The objects of the set are called elements. Sets are notated with capital letters K, Z, N, etc., the elements are a, b, c, d,
More informationCS 1200 Discrete Math Math Preliminaries. A.R. Hurson 323 CS Building, Missouri S&T
CS 1200 Discrete Math A.R. Hurson 323 CS Building, Missouri S&T hurson@mst.edu 1 Course Objective: Mathematical way of thinking in order to solve problems 2 Variable: holder. A variable is simply a place
More informationSlides for Faculty Oxford University Press All rights reserved.
Oxford University Press 2013 Slides for Faculty Assistance Preliminaries Author: Vivek Kulkarni vivek_kulkarni@yahoo.com Outline Following topics are covered in the slides: Basic concepts, namely, symbols,
More information2.1 Symbols and Terminology
2.1 Symbols and Terminology A is a collection of objects or things. The objects belonging to the are called the, or. - : there is a way of determining for sure whether a particular item is an element of
More informationThis Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.
Sets A B C This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set Identities Defining Sets Definition: A set is an unordered collection
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More informationChapter 3. Set Theory. 3.1 What is a Set?
Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any
More informationFigure 1: From Left to Right, General Venn Diagrams for One, Two, and Three Sets
2.3. VENN DIAGRAMS & SET OPERATIONS In this section we introduce Venn diagrams and define four basic operations on sets. We also present some important properties related to these operations. Venn Diagrams
More informationMath 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS
2-1Numeration Systems Hindu-Arabic Numeration System Tally Numeration System Egyptian Numeration System Babylonian Numeration System Mayan Numeration System Roman Numeration System Other Number Base Systems
More informationSection Sets and Set Operations
Section 6.1 - Sets and Set Operations Definition: A set is a well-defined collection of objects usually denoted by uppercase letters. Definition: The elements, or members, of a set are denoted by lowercase
More informationSets and set operations. Lecture 5 ICOM 4075
Sets and set operations Lecture 5 ICOM 4075 Reviewing sets s defined in a previous lecture, a setis a collection of objects that constitute the elementsof the set We say that a set containsits elements,
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 14: Set Theory: Definitions and Properties 1. Let C = {n Z n = 6r 5 for
More informationA set with only one member is called a SINGLETON. A set with no members is called the EMPTY SET or 2 N
Mathematical Preliminaries Read pages 529-540 1. Set Theory 1.1 What is a set? A set is a collection of entities of any kind. It can be finite or infinite. A = {a, b, c} N = {1, 2, 3, } An entity is an
More informationThe set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;
Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method
More informationComputer Science and Mathematics. Part I: Fundamental Mathematical Concepts Winfried Kurth
Computer Science and Mathematics Part I: Fundamental Mathematical Concepts Winfried Kurth http://www.uni-forst.gwdg.de/~wkurth/csm17_home.htm 1. Mathematical Logic Propositions - can be either true or
More informationDiscrete Mathematics Lecture 4. Harper Langston New York University
Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam
More informationDefinition. A set is a collection of objects. The objects in a set are elements.
Section 1.1: Sets Definition A set is a collection of objects. The objects in a set are elements. Definition A set is a collection of objects. The objects in a set are elements. Examples: {1, cat, ψ} (Sets
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 2-1 Chapter 2 Sets 2.1 Set Concepts Set A collection of objects, which are called elements or members of the set. Listing the elements of a set inside
More informationComplexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np
Chapter 1: Introduction Introduction Purpose of the Theory of Computation: Develop formal mathematical models of computation that reflect real-world computers. Nowadays, the Theory of Computation can be
More informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics
About the Tutorial Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics
More informationNumber System. Introduction. Natural Numbers (N) Whole Numbers (W) Integers (Z) Prime Numbers (P) Face Value. Place Value
1 Number System Introduction In this chapter, we will study about the number system and number line. We will also learn about the four fundamental operations on whole numbers and their properties. Natural
More informationSets. {1, 2, 3, Calvin}.
ets 2-24-2007 Roughly speaking, a set is a collection of objects. he objects are called the members or the elements of the set. et theory is the basis for mathematics, and there are a number of axiom systems
More informationCOLLEGE ALGEBRA. Intro, Sets of Real Numbers, & Set Theory
COLLEGE LGER y: Sister Mary Rebekah www.survivormath.weebly.com Cornell-Style Fill in the lank Notes and Teacher s Key Intro, Sets of Real Numbers, & Set Theory 1 Vocabulary Workshop SIMPLIFY Expressions
More informationA.1 Numbers, Sets and Arithmetic
522 APPENDIX A. MATHEMATICS FOUNDATIONS A.1 Numbers, Sets and Arithmetic Numbers started as a conceptual way to quantify count objects. Later, numbers were used to measure quantities that were extensive,
More informationIn this section we take an aside from the normal discussion in algebra.
1.5 Set Notation In this section we take an aside from the normal discussion in algebra. We want to take a look at the topic of sets and set notation. The reason we want to do this is so that as we encounter
More informationTopology notes. Basic Definitions and Properties.
Topology notes. Basic Definitions and Properties. Intuitively, a topological space consists of a set of points and a collection of special sets called open sets that provide information on how these points
More informationLECTURE 8: SETS. Software Engineering Mike Wooldridge
LECTURE 8: SETS Mike Wooldridge 1 What is a Set? The concept of a set is used throughout mathematics; its formal definition matches closely our intuitive understanding of the word. Definition: A set is
More informationCalculating Cardinalities
Math Circle Monday March 20, 2017 Calculating Cardinalities Martin Zeman To say that a set A has 5 elements means that we can write the elements of A as a list a 1, a 2, a 3, a 4, a 5 in a way that (a)
More information1.2 Venn Diagrams and Partitions
1.2 Venn Diagrams and Partitions Mark R. Woodard Furman U 2010 Mark R. Woodard (Furman U) 1.2 Venn Diagrams and Partitions 2010 1 / 9 Outline 1 Venn Diagrams 2 Partitions 3 Fundamentals of Counting Mark
More informationSets. X. Zhang Dept. of Computer & Information Sciences Fordham University
Sets! X. Zhang Dept. of Computer & Information Sciences Fordham University 1 Outline on sets! Basics!! Specify a set by enumerating all elements!! Notations!! Cardinality!! Venn Diagram!! Relations on
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More informationEDAA40 At home exercises 1
EDAA40 At home exercises 1 1. Given, with as always the natural numbers starting at 1, let us define the following sets (with iff ): Give the number of elements in these sets as follows: 1. 23 2. 6 3.
More informationSection 1.7 Sequences, Summations Cardinality of Infinite Sets
Section 1.7 Sequences, Summations Cardinality of Infinite Sets Definition: A sequence is a function from a subset of the natural numbers (usually of the form {0, 1, 2,... } to a set S. Note: the sets and
More informationReview of Operations on the Set of Real Numbers
1 Review of Operations on the Set of Real Numbers Before we start our jurney through algebra, let us review the structure of the real number system, properties of four operations, order of operations,
More informationRelational terminology. Databases - Sets & Relations. Sets. Membership
Relational terminology Databases - & Much of the power of relational databases comes from the fact that they can be described analysed mathematically. In particular, queries can be expressed with absolute
More informationWhat is a Set? Set Theory. Set Notation. Standard Sets. Standard Sets. Part 1.1. Organizing Information
Set Theory What is a Set? Part 1.1 Organizing Information What is a Set? Set Notation A set is an unordered collection of objects The collection objects are also called members or "elements" One of the
More informationQuestion7.How many proper subsets in all are there if a set contains (a) 7 elements (b) 4 elements
Question1. Write the following sets in roster form: 1. A={z: z=3x-8, x W and x0 and x is a multiple of 3 less than 100} Question2. Write the following
More informationIntersection of sets *
OpenStax-CNX module: m15196 1 Intersection of sets * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 We have pointed out that a set
More informationMath Week in Review #5
Math 141 Spring 2006 c Heather Ramsey Page 1 Math 141 - Week in Review #5 Section 4.1 - Simplex Method for Standard Maximization Problems A standard maximization problem is a linear programming problem
More informationLECTURE NOTES ON SETS
LECTURE NOTES ON SETS PETE L. CLARK Contents 1. Introducing Sets 1 2. Subsets 5 3. Power Sets 5 4. Operations on Sets 6 5. Families of Sets 8 6. Partitions 10 7. Cartesian Products 11 1. Introducing Sets
More informationAlgebraic Expressions
P.1 Algebraic Expressions, Mathematical Models, and Real Numbers P.2 Exponents and Scientific Notation Objectives: Evaluate algebraic expressions, find intersection and unions of sets, simplify algebraic
More informationThe Further Mathematics Support Programme
Degree Topics in Mathematics Groups A group is a mathematical structure that satisfies certain rules, which are known as axioms. Before we look at the axioms, we will consider some terminology. Elements
More informationCardinality of Sets. Washington University Math Circle 10/30/2016
Cardinality of Sets Washington University Math Circle 0/0/06 The cardinality of a finite set A is just the number of elements of A, denoted by A. For example, A = {a, b, c, d}, B = {n Z : n } = {,,, 0,,,
More informationChapter 2: Sets. Diana Pell. In the roster method: elements are listed between braces, with commas between the elements
Chapter 2: Sets Diana Pell 2.1: The Nature of Sets Set: any collection of elements. Elements: objects of the set. In the roster method: elements are listed between braces, with commas between the elements
More informationPre-Calc Unit 1 Lesson 1
Pre-Calc Unit 1 Lesson 1 The Number System and Set Theory Learning Goal: IWBAT write subsets of the rational, real, and complex number system using set notation and apply set operations on sets of numbers.
More informationLecture 6,
Lecture 6, 4.16.2009 Today: Review: Basic Set Operation: Recall the basic set operator,!. From this operator come other set quantifiers and operations:!,!,!,! \ Set difference (sometimes denoted, a minus
More informationProof Techniques Alphabets, Strings, and Languages. Foundations of Computer Science Theory
Proof Techniques Alphabets, Strings, and Languages Foundations of Computer Science Theory Proof By Case Enumeration Sometimes the most straightforward way to prove that a property holds for all elements
More informationThe Language of Sets and Functions
MAT067 University of California, Davis Winter 2007 The Language of Sets and Functions Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (January 7, 2007) 1 The Language of Sets 1.1 Definition and Notation
More information1KOd17RMoURxjn2 CSE 20 DISCRETE MATH Fall
CSE 20 https://goo.gl/forms/1o 1KOd17RMoURxjn2 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Explain the steps in a proof by mathematical and/or structural
More informationProblem One: A Quick Algebra Review
CS103A Winter 2019 Solutions for Week One Handout 01S Problem One: A Quick Algebra Review In the first week of CS103, we'll be doing a few proofs that will require some algebraic manipulations and reasoning
More informationSummary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More informationEric Roberts Handout #39 CS 106B February 20, 2015 Sets
Eric Roberts Handout #39 S 106 February 20, 2015 Sets Sets Eric Roberts S 106 February 20, 2015 Outline 1. Midcourse correction 2. Sets in mathematics 3. Venn diagrams 4. High-level set operations 5. Implementing
More informationSome basic set theory (and how it relates to Haskell)
Some basic set theory (and how it relates to Haskell) John Longley School of Informatics University of Edinburgh jrl@inf.ed.ac.uk Inf1-FP guest lecture 25 September 2017 1 / 17 Sets Intuitively, a set
More informationMATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability)
MATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability) Last modified: September 16, 2004 Reference: Apostol, Calculus, Vol. 2, section 13.19 (attached). The aim
More informationIB Sets and Venn Diagram Questions- Package #1
I Sets and Venn Diagram Questions- Package #1 1. is the set of all the positive integers less than or equal to 12., and C are subsets of. = {1, 2, 3, 4, 6,12} = {odd integers} C = {5, 6, 8} (a) Write down
More informationTopology 550A Homework 3, Week 3 (Corrections: February 22, 2012)
Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012) Michael Tagare De Guzman January 31, 2012 4A. The Sorgenfrey Line The following material concerns the Sorgenfrey line, E, introduced in
More informationCS402 - Theory of Automata Glossary By
CS402 - Theory of Automata Glossary By Acyclic Graph : A directed graph is said to be acyclic if it contains no cycles. Algorithm : A detailed and unambiguous sequence of instructions that describes how
More informationTo illustrate what is intended the following are three write ups by students. Diagonalization
General guidelines: You may work with other people, as long as you write up your solution in your own words and understand everything you turn in. Make sure to justify your answers they should be clear
More informationCS3102 Theory of Computation Problem Set 2, Spring 2011 Department of Computer Science, University of Virginia
CS3102 Theory of Computation Problem Set 2, Spring 2011 Department of Computer Science, University of Virginia Gabriel Robins Please start solving these problems immediately, and work in study groups.
More information1. Chapter 1, # 1: Prove that for all sets A, B, C, the formula
Homework 1 MTH 4590 Spring 2018 1. Chapter 1, # 1: Prove that for all sets,, C, the formula ( C) = ( ) ( C) is true. Proof : It suffices to show that ( C) ( ) ( C) and ( ) ( C) ( C). ssume that x ( C),
More information1 Sets, Fields, and Events
CHAPTER 1 Sets, Fields, and Events B 1.1 SET DEFINITIONS The concept of sets play an important role in probability. We will define a set in the following paragraph. Definition of Set A set is a collection
More informationDiscrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London
Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1
More informationThe Intersection of Two Sets
Venn Diagrams There are times when it proves useful or desirable for us to represent sets and the relationships among them in a visual manner. This can be beneficial for a variety of reasons, among which
More informationCardinality of Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Cardinality of Sets Fall / 15
Cardinality of Sets MAT Transition to Higher Mathematics Fall 0 MAT (Transition to Higher Math) Cardinality of Sets Fall 0 / Outline Sets with Equal Cardinality Countable and Uncountable Sets MAT (Transition
More informationDISCRETE MATHEMATICS
DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The
More information1. Draw the state graphs for the finite automata which accept sets of strings composed of zeros and ones which:
P R O B L E M S Finite Autom ata. Draw the state graphs for the finite automata which accept sets of strings composed of zeros and ones which: a) Are a multiple of three in length. b) End with the string
More informationCantor s Diagonal Argument for Different Levels of Infinity
JANUARY 2015 1 Cantor s Diagonal Argument for Different Levels of Infinity Michael J. Neely University of Southern California http://www-bcf.usc.edu/ mjneely Abstract These notes develop the classic Cantor
More information4 Mathematical Data Types
mcs 2015/5/18 1:43 page 81 #89 4 Mathematical Data Types We have assumed that you ve already been introduced to the concepts of sets, sequences, and functions, and we ve used them informally several times
More informationST MARY S COLLEGE FORM ONE COURSE OUTLINE MATHEMATICS. Term 1. Addition and subtraction. Multiplication and division facts
ST MARY S COLLEGE FORM ONE COURSE OUTLINE MATHEMATICS Term 1 1 1 Arithmetic: Place Value Definition of number types and the relation to each other Place value for integers. Number in words and vice versa
More informationAlgebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper.
Algebra of Sets Aditya Ghosh April 6, 2018 It is recommended that while reading it, sit with a pen and a paper. 1 The Basics This article is only about the algebra of sets, and does not deal with the foundations
More informationTOPICS. Integers Properties of addition and. Rational Numbers Need for rational numbers. Exponents or Powers Introduction to Exponents or
TOPICS DETAILS Integers Properties of addition and subtraction of integers Multiplication of integers Properties of multiplication of integers Division of integers Properties of division of integers Introduction
More informationMaterial from Recitation 1
Material from Recitation 1 Darcey Riley Frank Ferraro January 18, 2011 1 Introduction In CSC 280 we will be formalizing computation, i.e. we will be creating precise mathematical models for describing
More information