Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16
|
|
- Clinton Miller
- 5 years ago
- Views:
Transcription
1 Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16
2 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special Symbols 4 Operations on Sets 5 Results About Sets 6 Exercises. Philippe B. Laval (KSU) Sets Current Semester 2 / 16
3 Introduction This section is only intended as a quick review of material the reader needs to know for this class. For a more thorough treatment of sets, the reader is invited to read books on set theory. Philippe B. Laval (KSU) Sets Current Semester 3 / 16
4 Definitions, Notations and Examples Definitions Definition A set is a well-defined, unordered collection of distinct objects. Well-defined means that given an object and a set, we can tell if the object is in the set. The objects in a set are called its elements. If x is an element of a set A, we write x A. This is read "x is an element of A". A set can be finite or infinite. Philippe B. Laval (KSU) Sets Current Semester 4 / 16
5 Definitions, Notations and Examples Definitions Definition A set is a well-defined, unordered collection of distinct objects. Well-defined means that given an object and a set, we can tell if the object is in the set. The objects in a set are called its elements. If x is an element of a set A, we write x A. This is read "x is an element of A". A set can be finite or infinite. Sets are usually named using a capital letter such as A, B,... The words sets, collection, family are all synonymous. Philippe B. Laval (KSU) Sets Current Semester 4 / 16
6 Definitions, Notations and Examples Definitions Definition A set is a well-defined, unordered collection of distinct objects. Well-defined means that given an object and a set, we can tell if the object is in the set. The objects in a set are called its elements. If x is an element of a set A, we write x A. This is read "x is an element of A". A set can be finite or infinite. Sets are usually named using a capital letter such as A, B,... The words sets, collection, family are all synonymous. The order in which the elements are listed is not relevant. In other words, two sets are equal if and only if they contain the same elements, regardless of the order in which they appear. Philippe B. Laval (KSU) Sets Current Semester 4 / 16
7 Definitions, Notations and Examples Notations and Examples There are different ways of representing a set. We list two of them here. For examples, see the notes. 1 Roster method: We can list all the elements of the set, or, we list enough elements until a pattern is established, then we add.... In both cases, the elements are surrounded by curly brackets. Philippe B. Laval (KSU) Sets Current Semester 5 / 16
8 Definitions, Notations and Examples Notations and Examples There are different ways of representing a set. We list two of them here. For examples, see the notes. 1 Roster method: We can list all the elements of the set, or, we list enough elements until a pattern is established, then we add.... In both cases, the elements are surrounded by curly brackets. 2 Set builder method: We give a rule or a condition to be satisfied in order to belong to a set. If P (x) denotes the condition to be satisfied, we can define a set by writing {x : P (x)}. This means the set of x s such that P (x) is true. Since this is real analysis, we will assume that the x s come from R. If this is not the case, we must specify the set they come from. If they come from a set A, then we write {x A : P (x)}. Philippe B. Laval (KSU) Sets Current Semester 5 / 16
9 Special Symbols Symbols There are some special symbols associated with sets. Some of these symbols include: means is a member of. When we write 2 A, we mean that the element 2 is a member of the set called A. Philippe B. Laval (KSU) Sets Current Semester 6 / 16
10 Special Symbols Symbols There are some special symbols associated with sets. Some of these symbols include: means is a member of. When we write 2 A, we mean that the element 2 is a member of the set called A. / means is not a member of. Philippe B. Laval (KSU) Sets Current Semester 6 / 16
11 Special Symbols Symbols There are some special symbols associated with sets. Some of these symbols include: means is a member of. When we write 2 A, we mean that the element 2 is a member of the set called A. / means is not a member of. means "is included in but not equal to" or is a proper subset of. It is used between two sets. When we write A B, we mean that A is contained in B, the two are not equal. Philippe B. Laval (KSU) Sets Current Semester 6 / 16
12 Special Symbols Symbols There are some special symbols associated with sets. Some of these symbols include: means is a member of. When we write 2 A, we mean that the element 2 is a member of the set called A. / means is not a member of. means "is included in but not equal to" or is a proper subset of. It is used between two sets. When we write A B, we mean that A is contained in B, the two are not equal. means "is included in and could be equal to" or is a subset of ; it is used between two sets. When we write A B, it is understood that A is contained in B and could be equal to B. Philippe B. Laval (KSU) Sets Current Semester 6 / 16
13 Special Symbols Symbols There are some special symbols associated with sets. Some of these symbols include: means is a member of. When we write 2 A, we mean that the element 2 is a member of the set called A. / means is not a member of. means "is included in but not equal to" or is a proper subset of. It is used between two sets. When we write A B, we mean that A is contained in B, the two are not equal. means "is included in and could be equal to" or is a subset of ; it is used between two sets. When we write A B, it is understood that A is contained in B and could be equal to B. denotes the empty set. It is also called the void set or the null set. Philippe B. Laval (KSU) Sets Current Semester 6 / 16
14 Special Symbols Symbols There are some special symbols associated with sets. Some of these symbols include: means is a member of. When we write 2 A, we mean that the element 2 is a member of the set called A. / means is not a member of. means "is included in but not equal to" or is a proper subset of. It is used between two sets. When we write A B, we mean that A is contained in B, the two are not equal. means "is included in and could be equal to" or is a subset of ; it is used between two sets. When we write A B, it is understood that A is contained in B and could be equal to B. denotes the empty set. It is also called the void set or the null set. If A is a set, we denote A the cardinality of A that is the number of elements of A. Philippe B. Laval (KSU) Sets Current Semester 6 / 16
15 Special Symbols Remarks Let A and B be two sets. 1 To show A B, one must show that if we pick an arbitrary element x in A then x is also in B. Philippe B. Laval (KSU) Sets Current Semester 7 / 16
16 Special Symbols Remarks Let A and B be two sets. 1 To show A B, one must show that if we pick an arbitrary element x in A then x is also in B. 2 To show A B one must show that A B and that B has at least one element which is not in A. Philippe B. Laval (KSU) Sets Current Semester 7 / 16
17 Special Symbols Remarks Let A and B be two sets. 1 To show A B, one must show that if we pick an arbitrary element x in A then x is also in B. 2 To show A B one must show that A B and that B has at least one element which is not in A. 3 To show A = B, one must show A B and B A. Philippe B. Laval (KSU) Sets Current Semester 7 / 16
18 Special Symbols Remarks Let A and B be two sets. 1 To show A B, one must show that if we pick an arbitrary element x in A then x is also in B. 2 To show A B one must show that A B and that B has at least one element which is not in A. 3 To show A = B, one must show A B and B A. 4 It should be clear that A for every set A. Philippe B. Laval (KSU) Sets Current Semester 7 / 16
19 Special Symbols Examples Some sets which are used often have a special name. N = {1, 2, 3,...} represents the set of natural numbers or positive integers. Philippe B. Laval (KSU) Sets Current Semester 8 / 16
20 Special Symbols Examples Some sets which are used often have a special name. N = {1, 2, 3,...} represents the set of natural numbers or positive integers. Z = {..., 2, 1, 0, 1, 2,...} represents the set of integers. Philippe B. Laval (KSU) Sets Current Semester 8 / 16
21 Special Symbols Examples Some sets which are used often have a special name. N = {1, 2, 3,...} represents the set of natural numbers or positive integers. Z = {..., 2, 1, 0, 1, 2,...} represents the set of integers. { m } Q = n : m, n Z and n 0 represents the set of rational numbers. Philippe B. Laval (KSU) Sets Current Semester 8 / 16
22 Special Symbols Examples Some sets which are used often have a special name. N = {1, 2, 3,...} represents the set of natural numbers or positive integers. Z = {..., 2, 1, 0, 1, 2,...} represents the set of integers. { m } Q = n : m, n Z and n 0 represents the set of rational numbers. R represents the set of real numbers. Philippe B. Laval (KSU) Sets Current Semester 8 / 16
23 Special Symbols Examples Some sets which are used often have a special name. N = {1, 2, 3,...} represents the set of natural numbers or positive integers. Z = {..., 2, 1, 0, 1, 2,...} represents the set of integers. { m } Q = n : m, n Z and n 0 represents the set of rational numbers. R represents the set of real numbers. If A is any set, then the power set of A, denoted P (A), is the set of all subsets of A (including and A). For example if A = {1, 2, 3} then P (A) = {, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}} It can be shown that if A has n elements, then P (A) has 2 n elements that is P (A) = 2 n. Philippe B. Laval (KSU) Sets Current Semester 8 / 16
24 Operations on Sets There are four operations defined on sets you should know about. They are: 1 The Union, denoted Philippe B. Laval (KSU) Sets Current Semester 9 / 16
25 Operations on Sets There are four operations defined on sets you should know about. They are: 1 The Union, denoted 2 The Intersection, denoted Philippe B. Laval (KSU) Sets Current Semester 9 / 16
26 Operations on Sets There are four operations defined on sets you should know about. They are: 1 The Union, denoted 2 The Intersection, denoted 3 The difference or relative complement, denoted or \ Philippe B. Laval (KSU) Sets Current Semester 9 / 16
27 Operations on Sets There are four operations defined on sets you should know about. They are: 1 The Union, denoted 2 The Intersection, denoted 3 The difference or relative complement, denoted or \ 4 The Cartesian product, denoted. Philippe B. Laval (KSU) Sets Current Semester 9 / 16
28 Operations on Sets Union and Intersection The union of A and B, denoted A B is defined by: A B = {x : x A or x B} that is it consists of the elements which are either in A or in B. Philippe B. Laval (KSU) Sets Current Semester 10 / 16
29 Operations on Sets Union and Intersection The union of A and B, denoted A B is defined by: A B = {x : x A or x B} that is it consists of the elements which are either in A or in B. The intersection of A and B, denoted A B is defined by: A B = {x : x A and x B} that is it consists of the elements which are in both A and B. Philippe B. Laval (KSU) Sets Current Semester 10 / 16
30 Operations on Sets Difference or relative complement The relative complement of B with respect to A, denoted A \ B or A B (we will use A \ B as A B also means {a b : a A and b B}) is defined by: A \ B = {x : x A and x / B} that is it consists of the elements of A which are not also in B. Philippe B. Laval (KSU) Sets Current Semester 11 / 16
31 Operations on Sets Difference or relative complement The relative complement of B with respect to A, denoted A \ B or A B (we will use A \ B as A B also means {a b : a A and b B}) is defined by: A \ B = {x : x A and x / B} that is it consists of the elements of A which are not also in B. If X is the universal set (or "the world") then instead of writing X \ A or X A, we write A C. This set is called the complement of A. It is understood that it is the complement of A in X. For example, in these notes, R is "the world", the set where all our elements come from, unless specified otherwise. So, if we write A C, it will mean R A. Philippe B. Laval (KSU) Sets Current Semester 11 / 16
32 Operations on Sets Difference or relative complement The relative complement of B with respect to A, denoted A \ B or A B (we will use A \ B as A B also means {a b : a A and b B}) is defined by: A \ B = {x : x A and x / B} that is it consists of the elements of A which are not also in B. If X is the universal set (or "the world") then instead of writing X \ A or X A, we write A C. This set is called the complement of A. It is understood that it is the complement of A in X. For example, in these notes, R is "the world", the set where all our elements come from, unless specified otherwise. So, if we write A C, it will mean R A. If A and B are two sets, A \ B B \ A in general. Philippe B. Laval (KSU) Sets Current Semester 11 / 16
33 Operations on Sets Cartesian Product The Cartesian product of A and B, denoted A B is defined by: A B = {(x, y) : x A and y B} This is called the Cartesian product of A and B. It is the set of all ordered pairs whose first element comes from A and second element from B. Philippe B. Laval (KSU) Sets Current Semester 12 / 16
34 Operations on Sets Cartesian Product The Cartesian product of A and B, denoted A B is defined by: A B = {(x, y) : x A and y B} This is called the Cartesian product of A and B. It is the set of all ordered pairs whose first element comes from A and second element from B. Because it is a set of ordered pairs, if A and B are different sets, A B B A. Philippe B. Laval (KSU) Sets Current Semester 12 / 16
35 Operations on Sets Cartesian Product The Cartesian product of A and B, denoted A B is defined by: A B = {(x, y) : x A and y B} This is called the Cartesian product of A and B. It is the set of all ordered pairs whose first element comes from A and second element from B. Because it is a set of ordered pairs, if A and B are different sets, A B B A. We can take the cartesian product of more than two sets. If A 1, A 2,..., A n are n sets then A 1 A 2... A n = {(a 1, a 2,..., a n ) where a i A i for i = 1, 2,..., n} (a 1, a 2,..., a n ) is called an n-tuple. Philippe B. Laval (KSU) Sets Current Semester 12 / 16
36 Results About Sets Some Remarks and Additional Definitions Let us make a few remarks before we state and prove some important results. The standard technique to prove that two sets A and B are equal (that is A = B) is to prove that A B and B A. Philippe B. Laval (KSU) Sets Current Semester 13 / 16
37 Results About Sets Some Remarks and Additional Definitions Let us make a few remarks before we state and prove some important results. The standard technique to prove that two sets A and B are equal (that is A = B) is to prove that A B and B A. Often, when proving some result about the elements of a set A, we start by picking an arbitrary element of that set by using a statement like "Let x A...". However, this statement makes sense only if A has elements, in other words A. If we do not know that fact, we will have to consider the special case A = as part of the proof. Philippe B. Laval (KSU) Sets Current Semester 13 / 16
38 Results About Sets Some Remarks and Additional Definitions Let us make a few remarks before we state and prove some important results. The standard technique to prove that two sets A and B are equal (that is A = B) is to prove that A B and B A. Often, when proving some result about the elements of a set A, we start by picking an arbitrary element of that set by using a statement like "Let x A...". However, this statement makes sense only if A has elements, in other words A. If we do not know that fact, we will have to consider the special case A = as part of the proof. It should be clear to the reader that if A = or B = then A B =. Philippe B. Laval (KSU) Sets Current Semester 13 / 16
39 Results About Sets Some Remarks and Additional Definitions Let us make a few remarks before we state and prove some important results. The standard technique to prove that two sets A and B are equal (that is A = B) is to prove that A B and B A. Often, when proving some result about the elements of a set A, we start by picking an arbitrary element of that set by using a statement like "Let x A...". However, this statement makes sense only if A has elements, in other words A. If we do not know that fact, we will have to consider the special case A = as part of the proof. It should be clear to the reader that if A = or B = then A B =. Two nonempty sets A and B are said to be disjoint if they do not intersect that is if A B =. Philippe B. Laval (KSU) Sets Current Semester 13 / 16
40 Results About Sets Basic results Theorem Let A, B, and C be three sets. Then, the following properties are satisfied: 1 A, A A = A, A A = A 2 A =, A = A 3 Commutative law. A B = B A and A B = B A 4 Associative law. A (B C) = (A B) C and A (B C) = (A B) C 5 Distributive laws. A (B C) = (A B) (A C) and A (B C) = (A B) (A C) 6 If in addition, A B then A B = B and A B = A Theorem A B and A \ B are disjoint sets. Furthermore, A = (A B) (A \ B). Philippe B. Laval (KSU) Sets Current Semester 14 / 16
41 Results About Sets De Morgan s Laws Theorem Let A, B, and C be sets. Then the following holds: 1 A \ (B C) = (A \ B) (A \ C) 2 A \ (B C) = (A \ B) (A \ C) If we assume that both A and B are subsets of a fixed set X and we wish to express the relative complement with respect to X, then the theorem can be written Theorem Let A and B be sets. Then the following holds: 1 (A B) c = A c B c 2 (A B) c = A c B c Philippe B. Laval (KSU) Sets Current Semester 15 / 16
42 Exercises See the problems at the end of my notes on Review of Sets. Philippe B. Laval (KSU) Sets Current Semester 16 / 16
CSC 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 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 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 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 informationTaibah 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 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.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 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 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 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.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 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 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 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 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/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 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 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 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 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 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 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 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 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 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 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 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 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 informationCopyright 2006 Melanie Butler Chapter 1: Review. Chapter 1: Review
QUIZ AND TEST INFORMATION: The material in this chapter is on Quiz 1 and Exam 1. You should complete at least one attempt of Quiz 1 before taking Exam 1. This material is also on the final exam. TEXT INFORMATION:
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 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 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 graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
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 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 informationCharacterization of Boolean Topological Logics
Characterization of Boolean Topological Logics Short Form: Boolean Topological Logics Anthony R. Fressola Denison University Granville, OH 43023 University of Illinois Urbana-Champaign, IL USA 61801-61802
More informationTOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.
TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3. 301. Definition. Let m be a positive integer, and let X be a set. An m-tuple of elements of X is a function x : {1,..., m} X. We sometimes use x i instead
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 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 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 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 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 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 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 informationIntroduction to Functions of Several Variables
Introduction to Functions of Several Variables Philippe B. Laval KSU Today Philippe B. Laval (KSU) Functions of Several Variables Today 1 / 20 Introduction In this section, we extend the definition of
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 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 informationT. Background material: Topology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 T. Background material: Topology For convenience this is an overview of basic topological ideas which will be used in the course. This material
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 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 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 informationLines and Planes in 3D
Lines and Planes in 3D Philippe B. Laval KSU January 28, 2013 Philippe B. Laval (KSU) Lines and Planes in 3D January 28, 2013 1 / 20 Introduction Recall that given a point P = (a, b, c), one can draw a
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 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 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 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 informationSolution: It may be helpful to list out exactly what is in each of these events:
MATH 5010(002) Fall 2017 Homework 1 Solutions Please inform your instructor if you find any errors in the solutions. 1. You ask a friend to choose an integer N between 0 and 9. Let A = {N 5}, B = {3 N
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 information2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to
2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to be connected if it is not disconnected. A subset of
More informationDomination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes
Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph
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 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 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 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 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 information2 A topological interlude
2 A topological interlude 2.1 Topological spaces Recall that a topological space is a set X with a topology: a collection T of subsets of X, known as open sets, such that and X are open, and finite intersections
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 informationMath 395: Topology. Bret Benesh (College of Saint Benedict/Saint John s University)
Math 395: Topology Bret Benesh (College of Saint Benedict/Saint John s University) October 30, 2012 ii Contents Acknowledgments v 1 Topological Spaces 1 2 Closed sets and Hausdorff spaces 7 iii iv CONTENTS
More informationBinary Relations McGraw-Hill Education
Binary Relations A binary relation R from a set A to a set B is a subset of A X B Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B. We can also represent
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 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 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 information1.7 The Heine-Borel Covering Theorem; open sets, compact sets
1.7 The Heine-Borel Covering Theorem; open sets, compact sets This section gives another application of the interval halving method, this time to a particularly famous theorem of analysis, the Heine Borel
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 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 informationFunctions. How is this definition written in symbolic logic notation?
functions 1 Functions 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. We write f(a) = b if b is the unique element of B assigned by
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 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 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 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 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 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 informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
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 informationAlgorithm. Algorithm Analysis. Algorithm. Algorithm. Analyzing Sorting Algorithms (Insertion Sort) Analyzing Algorithms 8/31/2017
8/3/07 Analysis Introduction to Analysis Model of Analysis Mathematical Preliminaries for Analysis Set Notation Asymptotic Analysis What is an algorithm? An algorithm is any well-defined computational
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 informationLecture 1. 1 Notation
Lecture 1 (The material on mathematical logic is covered in the textbook starting with Chapter 5; however, for the first few lectures, I will be providing some required background topics and will not be
More informationSection 6.3: Further Rules for Counting Sets
Section 6.3: Further Rules for Counting Sets Often when we are considering the probability of an event, that event is itself a union of other events. For example, suppose there is a horse race with three
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 information1-1 Sets of Numbers. Warm Up Lesson Presentation Lesson Quiz. Holt Algebra 2
1-1 Sets of Numbers Warm Up Lesson Presentation Lesson Quiz Warm Up Write in decimal form. 1. 4.5 2. 3. Write as a decimal approximation. 1.414 Order from least to greatest. 4. 10, 5, 10, 0, 5 10, 5, 0,
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 informationObjective. Vocabulary. 1.1: Sets of Numbers. 1-1 Sets of Numbers
Starter 1.1 Write in decimal form. 1. 4.5 2. 3. Write as a decimal approximation. 1.414 Order from least to greatest. 4. 10, 5, 10, 0, 5 10, 5, 0, 5, 10 5. 0.1, 1, 1.1, 0.01, 0.11, 0.009 0.009, 0.01, 0.1,
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 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 informationNotes on metric spaces and topology. Math 309: Topics in geometry. Dale Rolfsen. University of British Columbia
Notes on metric spaces and topology Math 309: Topics in geometry Dale Rolfsen University of British Columbia Let X be a set; we ll generally refer to its elements as points. A distance function, or metric
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 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 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 information