Sets and set operations. Lecture 5 ICOM 4075
|
|
- Alvin Bryan
- 5 years ago
- Views:
Transcription
1 Sets and set operations Lecture 5 ICOM 4075
2 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, and that an element belongs to its set If S is a set and x an element in S, we write x ЄS
3 Examples of sets 1. The set of integers: {, -3, -2, -1, 0, 1, 2, 3, } 2. The set of the vowels in the Latin alphabet: {a, e, i, o, u} 3. The set of all real solutions of the equation x⁴ + y⁴ 1 4. The set of 6 foot tall people 5. The set with no elements: this is the so-called empty set, and is denoted by φ
4 Describing sets a) By listing: this is, providing a list (sometimes partial list or mere pattern of formation) of the elements Example: Integers {, -3, -2, -2, 0, 1, 2, 3, } b) By property:this is, by providing a logical statement (property) that characterizes membership in the set. In this case, an element x is in the set if the statement is true for x and it is not if the statement is false Property logical statement Example: {x : x is an integer and x⁴ + 1 is even} 1Є, since 1⁴+1 2; 3Є since 3⁴+182; etc
5 Equality of sets Definition: Two sets are equalif they have the same elements. If S and R are sets and they are equal, then we write S R Examples: {1, 2, 3} {3, 1, 2} {a, b, a} {a, b} {a, c} {a}
6 Implications of equality s illustrated in the previous examples, (as a consequence of the definition of equality between sets) we have that in sets: Repeated elements do not count (repetitions are ignored) There is no particular order of the elements in a set
7 Finite and infinite sets set is finiteif it has a finite number of elementsor if it is the empty set. Otherwise, the set is said to be infinite Examples: The set of vowels in the Latin alphabet is finite since it has only 5 elements The set of people 20 foot tall is finite since it is empty The set of integers is infinite
8 Subsets Definition: If and B are sets and every element in is also an element in B, we say that is a subset of B. If is a subset of B we write: B Remark: The empty set is a subset of any set
9 The power set Definition: The power set of a set is the set of all subsets of (includes the empty set and the set itself). The power set of is denoted by pow() Example: Let {1, 2, 3}. The subsets of are: φ, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, and itself. Thus, pow( ) {φ, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, }
10 Proof strategies with subsets and equalities Following are useful strategies for proving logical statements asserting that two sets are equal or that one set is a subset of another set: Statement to prove is a subset of B is not a subset of B equals B is not equal to B Strategy Forarbitrary x in, show that x is also in B Find an element in that is not an element in B Show that is a subset of B and B is a subset of Find an element in that is not in B oran element in Bthat is not in
11 Example 1 Prove that is subset of B where {x : x 1 / (3n + 6), for some natural n} B {x : x 1 / n, for some natural n} Proof: If x is an element in, then there is a natural number q such that x 1 /(3q + 6). So, x 1 / 3(q + 2) or what is the same x 1 / 3k, where k q + 2 is a natural number. generic element in Therefore, x 1 / n with n 3k, a natural number. Conclusion: x is in B. Just a bit of algebra The generic element in satisfies the condition of membership in B
12 Example 2 Let {x : x 3k + 4, k integer} and B {x : x 5k + 6, k integer}. Is subset of B or B subset of? nswer: Neither is subset of B nor B is subset of. Proof: 7 is in, since But, 7 is not in B since 7 5k+6 implies k 1/5 which is not integer. So, is not a subset of B. Reciprocally, 11 is in B since But, 11 is not in since 11 3k+4 implies k 7/3 which is not integer. So, B is not a subset of.
13 Example 3 Let {x : x is prime and 12 x 18} and B {x : x 4 k + 1 and k 3 or k 4} Prove that B. Proof: First prove that is a subset of B: Note that {13, 17} since these are the primes that satisfy the property. But, and Therefore, 13 is in B and 17 is in B. Reciprocally, if k 3, 4 k Now, 13 is prime and So, 13 is in. lso, if k 4, 4 k But, 17 is prime and So, 17 is in
14 Set operations The main set operations are Union of sets Intersection of sets Complement of a set
15 The union of two sets Definition: given two sets and B, their unionis the set U B defined as U B {x: x in or x in B} Example 1: Let {a, b, c, d} and B {a, e, f}. Then, U B {a, b, c, d, e, f} Example 2: Let be the even numbers and B be the odd numbers. Then, U B is the set of natural numbers
16 Properties of union 1. φ 2. B B 3. (B C) ( B) C Bif andonly if B B
17 Proving some of these properties These properties (as any other property) are logical statements about sets and operations. This is, they are ultimately mathematical statements. We ll prove a one of them. Let s take for example, properties 5.
18 Proof of property 3 Remark: Note that property is and if and only if statement, and therefore, there are two implications involved. These are: (a) If B then B B (b) If Proof of (a): B B then The thesis is a equality of sets. We ll prove it by proving that: B B, and B B B
19 Proof of (a) (continuation) If x B, then x or x B. Since by hypothesis B, we have that if x, then x B. Therefore, if x B, then x B. This is, B B. Reciprocally, if x B then x B or x ; therefore, B B. So, B B.
20 Proof of (b) Theimplication is now : If B B then, B. We use the contrapositive: If B then B B. Proof of the contrapositive: If B, then there is an element x such that x B. But then,x B but x B. Therefore B and B do not have thesameelements. This is, B B.
21 Infinite unions Definition: Let ₁, ₂, ₃, be an infinite collection of sets. Their unionis define as the set: Thus, Now, U i 1 Example: Let { 2i, 2i}, i i 1 U i 1 i { 2, i {x : x, for some i 1,2,3,... 2}; 2 i { 4, 4}; 1} { 6, 6}, etc... {...,-10, -8, - 6, - 4, - 2, 2, 4, 6, 8,10,...} 3
22 Intersections Definition: The intersection of two sets and B is defined to be the set Example: B {x : x and x B} Let {n : n is integer and n 3k + 7 for some integer k} and let B {m : m is integer and m 4k + 5 for some integer k} Then B {n : n 3k + 7 4k + 5, for some integer k} Is there a solution? Yes!Pick k 2. Then 3k k + 5. Therefore, B {13}.
23 Properties of the intersection of two sets 1. φ φ 2. B B 3. ( B) C (B C) B if and only if B
24 Further examples 1. Let {x : x is integer and x and let B the set of all integers. 20 for some integer k} k Then B {-20, -10, -5, - 4, - 2, 2, 4, 5,10, 20} 2. Let {y : y (x -1) for some real number x} and let B {z :z -2x + 3 for some real number x}. Then, B {3}since if y z then (x -1) x + 3 x 2 2x x + 3 x This is, x 0. By replacing in both equations : y z 3.
25 ,, Infinite intersections Definition : The intersection of 1 I i 1 i 2 Example: Let 3,...of sets is defined to be the set {x : x is an element of positive even number.then, I i 2 i i {x : x is integer and -i { 2, 0, 2} an infinite collection i for all i} x : i} where i is a
26 Complement of a set Definition: The complementof a set always refer to sets that are subsets of a particular set U, called universe, universal set or universe of discourse. Thus, if U, the complement of, denoted ', is defined to be the set ' {x U : x }
27 Example Let be the set of odd numbers. If U is chosen to be the set of naturals, then { 0, 2, 4, 6, }, this is, the set of all even numbers But if U is chosen to be the set of all real numbers, then {x: x real and x 2n+1 for any n natural}
28 Operational properties: Combining union and intersection ( B C) ( B) ( C) ( B C) ( B) ( C) Illustration of 1. : Let {1, 2, 3}, B {a, b, 2, 3} and C {1, 2, b, c}. Then, (B C) {1, 2,3} ({a,b, 2,3} {1,2, b,c}) {1, 2,3} {a,b,c,1, 2,3} {1, 2,3} ( B) ( C) ({1,2,3} {a,b, 2,3}) ({1,2,3} {1,2, b,c}) {2,3} {1, 2} {1, 2,3}
29 Properties of complement 1.(')' 2. φ' ( 6.( U and U' ' B if B)' B)' φ φ and and only if ' ' B' B' ' B' U ' De Morgan s LWS
30 Illustration of De Morgan s laws 7}' 5, 3, o,1, e,i, {a, B)' Then,( 9}. 7,8, 6, 5, 4, 3, 2, 0,1, u, o, e,i, {a, with universeu 7} 5, 3, o,1, i, {a,e, B 7}, 3, o, {a, Let 9} 6,8, 4, 2, 0, {u, 6,8,9} 4, 2, 0, {u, 9} 6,8, 4,5, 2, 0,1, u, {e,i, B' ' 9} 6,8, 4, 2, 0, {u,
31 Summary Notion of set, set descriptions Set equality and its implications Finite sets and infinite sets Subsets, power set Proof strategies with subsets and set equalities Operations with sets: definitions and properties Properties of combined operations
32 Exercises 1. Describe each of the following sets in terms of a property 1. {1, 5, 9, 13, } 2. B {, -8, -5, -2, 1, 4, 7, } 3. C {1, 2, 5, 10, 17,,82} 2. Write down the power set for each of the following sets 1. pow({a, b}) 2. {a, {a, b}, φ} 3. {φ, {φ}}
33 Exercises (cont.) 3. Is it true that power( B) power() power(b)? {x : x is integer and x -i or x i}, if i is even 4. Let i < > {x : x is integer and -i < x < i}, if i is odd 1.Find the union of 2. Find the intersection of 3.Find the union of 4. Find the intersection of the collection{ the collection{ the collection{ the collection{ i i :i natural} i :i natural} :i 1, 2, 3, 4, 5} i :i 1,3,5,7}
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets
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.
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 informationLecture 15: The subspace topology, Closed sets
Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology
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 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 informationCOUNTING AND PROBABILITY
CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.3 Counting Elements of Disjoint Sets: The Addition Rule Copyright Cengage Learning. All rights reserved. Counting
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 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 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 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 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 informationLecture-12: Closed Sets
and Its Examples Properties of Lecture-12: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Introduction and Its Examples Properties of 1 Introduction
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 informationLecture - 8A: Subbasis of Topology
Lecture - 8A: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline 1 Introduction 2 3 4 Introduction I As we know that topology generated by a basis B may
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 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 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 informationMath 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)
Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.
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 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 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 informationAlgebra of Sets (Mathematics & Logic A)
Algebra of Sets (Mathematics & Logic A) RWK/MRQ October 28, 2002 Note. These notes are adapted (with thanks) from notes given last year by my colleague Dr Martyn Quick. Please feel free to ask me (not
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 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 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 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 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 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 informationLecture : Topological Space
Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous
More informationOpen and Closed Sets
Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.
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 informationMA651 Topology. Lecture 4. Topological spaces 2
MA651 Topology. Lecture 4. Topological spaces 2 This text is based on the following books: Linear Algebra and Analysis by Marc Zamansky Topology by James Dugundgji Fundamental concepts of topology by Peter
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 7: Direct Proof Introduction 1. The statement below is true. Rewrite the
More information1 Elementary number theory
Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},
More informationChapter 1: Number and Operations
Chapter 1: Number and Operations 1.1 Order of operations When simplifying algebraic expressions we use the following order: 1. Perform operations within a parenthesis. 2. Evaluate exponents. 3. Multiply
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 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 informationSets. Sets. Subset, universe. Specifying sets, membership. Examples: Specifying a set using a predicate. Examples
Sets 2/36 We will not give a precise definition of what is a set, but we will say precisely what you can do with it. Sets Lectures 7 and 8 (hapter 16) (Think of a set as a collection of things of which
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 to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
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 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 informationAnnouncements. CS243: Discrete Structures. Strong Induction and Recursively Defined Structures. Review. Example (review) Example (review), cont.
Announcements CS43: Discrete Structures Strong Induction and Recursively Defined Structures Işıl Dillig Homework 4 is due today Homework 5 is out today Covers induction (last lecture, this lecture, and
More informationCS Bootcamp Boolean Logic Autumn 2015 A B A B T T T T F F F T F F F F T T T T F T F T T F F F
1 Logical Operations 1.1 And The and operator is a binary operator, denoted as, &,, or sometimes by just concatenating symbols, is true only if both parameters are true. A B A B F T F F F F The expression
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 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 informationSET 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 informationFunctions. Def. Let A and B be sets. A function f from A to B is an assignment of exactly one element of B to each element of A.
Functions functions 1 Def. Let A and B be sets. A function f from A to B is an assignment of exactly one element of B to each element of A. a A! b B b is assigned to a a A! b B f ( a) = b Notation: If
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 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 informationIntegers and Mathematical Induction
IT Program, NTUT, Fall 07 Integers and Mathematical Induction Chuan-Ming Liu Computer Science and Information Engineering National Taipei University of Technology TAIWAN 1 Learning Objectives Learn about
More informationCS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation
CS 441 Discrete Mathematics for CS Lecture 24 Relations IV Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Equivalence relation Definition: A relation R on a set A is called an equivalence relation
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 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 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 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 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 informationThe Relational Data Model. Functional Dependencies. Example. Functional Dependencies
The Relational Data Model Functional Dependencies 1 Functional Dependencies X -> A is an assertion about a relation R that whenever two tuples of R agree on all the attributes of X, then they must also
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 information2 Sets. 2.1 Notation. last edited January 26, 2016
2 Sets Sets show up in virtually every topic in mathematics, and so understanding their basics is a necessity for understanding advanced mathematics. As far as we re concerned, the word set means what
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 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 informationModule 11. Directed Graphs. Contents
Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................
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 informationFinal Test in MAT 410: Introduction to Topology Answers to the Test Questions
Final Test in MAT 410: Introduction to Topology Answers to the Test Questions Stefan Kohl Question 1: Give the definition of a topological space. (3 credits) A topological space (X, τ) is a pair consisting
More informationLet A(x) be x is an element of A, and B(x) be x is an element of B.
Homework 6. CSE 240, Fall, 2014 Due, Tuesday October 28. Can turn in at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Given two arbitrary
More informationTopology Homework 3. Section Section 3.3. Samuel Otten
Topology Homework 3 Section 3.1 - Section 3.3 Samuel Otten 3.1 (1) Proposition. The intersection of finitely many open sets is open and the union of finitely many closed sets is closed. Proof. Note that
More informationRelational Database: The Relational Data Model; Operations on Database Relations
Relational Database: The Relational Data Model; Operations on Database Relations Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Overview
More information1. [5 points each] True or False. If the question is currently open, write O or Open.
University of Nevada, Las Vegas Computer Science 456/656 Spring 2018 Practice for the Final on May 9, 2018 The entire examination is 775 points. The real final will be much shorter. Name: No books, notes,
More informationJohns Hopkins Math Tournament Proof Round: Point Set Topology
Johns Hopkins Math Tournament 2019 Proof Round: Point Set Topology February 9, 2019 Problem Points Score 1 3 2 6 3 6 4 6 5 10 6 6 7 8 8 6 9 8 10 8 11 9 12 10 13 14 Total 100 Instructions The exam is worth
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 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 informationSection 17. Closed Sets and Limit Points
17. Closed Sets and Limit Points 1 Section 17. Closed Sets and Limit Points Note. In this section, we finally define a closed set. We also introduce several traditional topological concepts, such as limit
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 informationFigure 1.1: This is an illustration of a generic set and its elements.
Chapter 1 Mathematical Review et theory is now generally accepted as the foundation of modern mathematics, and it plays an instrumental role in the treatment of probability. Unfortunately, a simple description
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 informationMathematically Rigorous Software Design Review of mathematical prerequisites
Mathematically Rigorous Software Design 2002 September 27 Part 1: Boolean algebra 1. Define the Boolean functions and, or, not, implication ( ), equivalence ( ) and equals (=) by truth tables. 2. In an
More informationPhil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or
Phil 320 Chapter 1: Sets, Functions and Enumerability I. Sets Informally: a set is a collection of objects. The objects are called members or elements of the set. a) Use capital letters to stand for sets
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 informationCS2 Language Processing note 3
CS2 Language Processing note 3 CS2Ah 5..4 CS2 Language Processing note 3 Nondeterministic finite automata In this lecture we look at nondeterministic finite automata and prove the Conversion Theorem, which
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 informationAlphabets, strings and formal. An introduction to information representation
Alphabets, strings and formal languages An introduction to information representation 1 Symbols Definition: A symbol is an object endowed with a denotation (i.e. literal meaning) Examples: Variables are
More informationSemantics via Syntax. f (4) = if define f (x) =2 x + 55.
1 Semantics via Syntax The specification of a programming language starts with its syntax. As every programmer knows, the syntax of a language comes in the shape of a variant of a BNF (Backus-Naur Form)
More informationTHREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.
THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of
More informationVLSI System Design Part II : Logic Synthesis (1) Oct Feb.2007
VLSI System Design Part II : Logic Synthesis (1) Oct.2006 - Feb.2007 Lecturer : Tsuyoshi Isshiki Dept. Communications and Integrated Systems, Tokyo Institute of Technology isshiki@vlsi.ss.titech.ac.jp
More informationMATH 22 MORE ABOUT FUNCTIONS. Lecture M: 10/14/2003. Form follows function. Louis Henri Sullivan
MATH 22 Lecture M: 10/14/2003 MORE ABOUT FUNCTIONS Form follows function. Louis Henri Sullivan This frightful word, function, was born under other skies than those I have loved. Le Corbusier D ora innanzi
More information1 Elementary number theory
1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...}, along with their most basic arithmetical and ordering properties.
More informationAXIOMS FOR THE INTEGERS
AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,
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 informationCMPSCI 250: Introduction to Computation. Lecture #7: Quantifiers and Languages 6 February 2012
CMPSCI 250: Introduction to Computation Lecture #7: Quantifiers and Languages 6 February 2012 Quantifiers and Languages Quantifier Definitions Translating Quantifiers Types and the Universe of Discourse
More informationChapter 1. Preliminaries
Chapter 1 Preliminaries 1.1 Topological spaces 1.1.1 The notion of topological space The topology on a set X is usually defined by specifying its open subsets of X. However, in dealing with topological
More informationTA: Jade Cheng ICS 241 Recitation Lecture Notes #12 November 13, 2009
TA: Jade Cheng ICS 241 Recitation Lecture Notes #12 November 13, 2009 Recitation #12 Question: Use Prim s algorithm to find a minimum spanning tree for the given weighted graph. Step 1. Start from the
More information= [ U 1 \ U 2 = B \ [ B \ B.
5. Mon, Sept. 8 At the end of class on Friday, we introduced the notion of a topology, and I asked you to think about how many possible topologies there are on a 3-element set. The answer is... 29. The
More informationUniversity of Nevada, Las Vegas Computer Science 456/656 Fall 2016
University of Nevada, Las Vegas Computer Science 456/656 Fall 2016 The entire examination is 925 points. The real final will be much shorter. Name: No books, notes, scratch paper, or calculators. Use pen
More informationSECTION A (40 marks)
OLLSCOIL NA héireann, MÁ NUAD NATIONAL UNIVERSITY OF IRELAND, MAYNOOTH THIRD COMPUTER SCIENCE AND SOFTWARE ENGINEERING EXAMINATION FEBRUARY 2002 PAPER SE307 COMPUTATION AND COMPLEXITY THEORY Dr. P. Stevens,
More informationCompiler Construction
Compiler Construction Exercises 1 Review of some Topics in Formal Languages 1. (a) Prove that two words x, y commute (i.e., satisfy xy = yx) if and only if there exists a word w such that x = w m, y =
More informationSet theory is a branch of mathematics that studies sets. Sets are a collection of objects.
Set Theory Set theory is a branch of mathematics that studies sets. Sets are a collection of objects. Often, all members of a set have similar properties, such as odd numbers less than 10 or students in
More informationSets. Margaret M. Fleck. 15 September 2010
Sets Margaret M. Fleck 15 September 2010 These notes cover set notation, operations on sets, and how to prove claims involving sets (Rosen sections 2.1 and 2.2). They also cover some logic subtleties that
More informationPublication Data. Reading Options. Licence and permissions ISBN Mark Jago, 2007
Running Head The World is all that is the case http//www.humanities-ebooks.co.uk Philosophy Insights General Editor: Mark ddis Formal Logic Mark Jago What makes an argument valid? For advice on use of
More information3.DEFINITION. examples being the finite sets. However, we will have to consider infinite sets as well.
3.DEFINITION Discrete Mathema6cs is the Math needed in decision making in noncon6nuous situa6ons. Thus, it mainly deals with discrete objects, their best examples being the finite sets. However, we will
More information