Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16

Similar documents
CSC Discrete Math I, Spring Sets

1.1 - Introduction to Sets

SET DEFINITION 1 elements members

9.5 Equivalence Relations

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets

Discrete Mathematics

2.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. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall

Introduction II. Sets. Terminology III. Definition. Definition. Definition. Example

What is Set? Set Theory. Notation. Venn Diagram

2.1 Sets 2.2 Set Operations

CS100: DISCRETE STRUCTURES

Sets. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee

Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31

11 Sets II Operations

9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics

2 Review of Set Theory

Set and Set Operations


2.1 Symbols and Terminology

Slides for Faculty Oxford University Press All rights reserved.

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.

Lecture : Topological Space

Topology notes. Basic Definitions and Properties.

SEVENTH EDITION and EXPANDED SEVENTH EDITION

Discrete Mathematics Lecture 4. Harper Langston New York University

Lecture 15: The subspace topology, Closed sets

Copyright 2006 Melanie Butler Chapter 1: Review. Chapter 1: Review

CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4

A set with only one member is called a SINGLETON. A set with no members is called the EMPTY SET or 2 N

This Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

LECTURE 8: SETS. Software Engineering Mike Wooldridge

A 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.

Sets. {1, 2, 3, Calvin}.

Today s Topics. What is a set?

Characterization of Boolean Topological Logics

TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.

Outline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set

Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say

Chapter 2: Sets. Diana Pell. In the roster method: elements are listed between braces, with commas between the elements

The Language of Sets and Functions

c) the set of students at your school who either are sophomores or are taking discrete mathematics

Chapter 3. Set Theory. 3.1 What is a Set?

Johns Hopkins Math Tournament Proof Round: Point Set Topology

Introduction to Functions of Several Variables

Sets. Margaret M. Fleck. 15 September 2010

Introduction. Sets and the Real Number System

T. Background material: Topology

2 Sets. 2.1 Notation. last edited January 26, 2016

About the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics

Sets and set operations

Lines and Planes in 3D

Topology Homework 3. Section Section 3.3. Samuel Otten

The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;

Pre-Calc Unit 1 Lesson 1

1 Sets, Fields, and Events

Solution: It may be helpful to list out exactly what is in each of these events:

Computer Science and Mathematics. Part I: Fundamental Mathematical Concepts Winfried Kurth

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

Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes

Open and Closed Sets

1.2 Venn Diagrams and Partitions

Lecture-12: Closed Sets

Review of Operations on the Set of Real Numbers

Definition. A set is a collection of objects. The objects in a set are elements.

2 A topological interlude

Relational Database: The Relational Data Model; Operations on Database Relations

Math 395: Topology. Bret Benesh (College of Saint Benedict/Saint John s University)

Binary Relations McGraw-Hill Education

Math 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS

Sets. X. Zhang Dept. of Computer & Information Sciences Fordham University

Math Week in Review #5

1.7 The Heine-Borel Covering Theorem; open sets, compact sets

Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012)

COUNTING AND PROBABILITY

Functions. How is this definition written in symbolic logic notation?

2/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.

Intersection of sets *

Complexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np

Introduction to Sets and Logic (MATH 1190)

A.1 Numbers, Sets and Arithmetic

LECTURE NOTES ON SETS

A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY

Algebra of Sets (Mathematics & Logic A)

Algorithm. Algorithm Analysis. Algorithm. Algorithm. Analyzing Sorting Algorithms (Insertion Sort) Analyzing Algorithms 8/31/2017

THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.

Lecture 1. 1 Notation

Section 6.3: Further Rules for Counting Sets

Algebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper.

1-1 Sets of Numbers. Warm Up Lesson Presentation Lesson Quiz. Holt Algebra 2

Sets and set operations. Lecture 5 ICOM 4075

Objective. Vocabulary. 1.1: Sets of Numbers. 1-1 Sets of Numbers

Alphabets, strings and formal. An introduction to information representation

CS 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

Notes on metric spaces and topology. Math 309: Topics in geometry. Dale Rolfsen. University of British Columbia

Cantor s Diagonal Argument for Different Levels of Infinity

Algebraic Expressions

MATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability)

Transcription:

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 Symbols 4 Operations on Sets 5 Results About Sets 6 Exercises. Philippe B. Laval (KSU) Sets Current Semester 2 / 16

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Exercises See the problems at the end of my notes on Review of Sets. Philippe B. Laval (KSU) Sets Current Semester 16 / 16