Chapter 2: The Basic Concepts of Set Theory. Sets A set is a collection of distinguishable objects (called elements) Can define in words Can list elements.

Slides:



Advertisements
Similar presentations
Chapter 2 The Basic Concepts of Set Theory
Advertisements

2.1 – Symbols and Terminology
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
Slide 2-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Chapter 2 The Basic Concepts of Set Theory
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Cardinality of a Set “The number of elements in a set.” Let A be a set. a.If A =  (the empty set), then the cardinality of A is 0. b. If A has exactly.
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
Properties and Relationships of Set Theory. Properties and Relationships of Set Theory How are Venn Diagrams used to show relationships among sets? How.
Survey of Mathematical Ideas Math 100 Chapter 2
Survey of Mathematical Ideas Math 100 Chapter 2 John Rosson Thursday January 25, 2007.
2.1 – Symbols and Terminology Definitions: Set: A collection of objects. Elements: The objects that belong to the set. Set Designations (3 types): Word.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Sets.
Discrete Mathematics Unit - I. Set Theory Sets and Subsets A well-defined collection of objects (the set of outstanding people, outstanding is very subjective)
CS355 - Theory of Computation Lecture 2: Mathematical Preliminaries.
Partially borrowed from Florida State University
2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.
Set Theory. What is a set?  Sets are used to define the concepts of relations and functions. The study of geometry, sequences, probability, etc. requires.
Sets --- A set is a collection of objects. Sets are denoted by A, B, C, … --- The objects in the set are called the elements of the set. The elements are.
SET THEORY. BASIC CONCEPTS IN SET THEORY Definition: A set is a collection of well-defined objects, called elements Examples: The following are examples.
2.1 Sets and Whole Numbers Remember to Silence Your Cell Phone and Put It In Your Bag!
College Algebra & Trigonometry Asian College of Aeronautics AVT 1.
CompSci 102 Discrete Math for Computer Science
Thinking Mathematically Chapter 2 Set Theory 2.1 Basic Set Concepts.
Slide Chapter 2 Sets. Slide Set Concepts.
Chapter 2 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Aim: How can the word ‘infinite’ define a collection of elements?
2.1 Symbols and Terminology. Designating Sets A set is a collection of objects (in math, usually numbers). The objects belonging to the set are called.
Slide Section 2-1 Symbols and Terminology. SYMBOLS AND TERMINOLOGY Designating Sets Sets of Numbers and Cardinality Finite and Infinite Sets Equality.
Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com ICOM 5016 – Introduction.
Unit 2 Sets.
SECTION 2-3 Set Operations and Cartesian Products Slide
ELEMENTARY SET THEORY.
INFIINITE SETS CSC 172 SPRING 2002 LECTURE 23. Cardinality and Counting The cardinality of a set is the number of elements in the set Two sets are equipotent.
Set Notation and Description Kinds of Sets Operations on Sets By: Mr. Gerzon B. Mascariñas.
Sets 2/10/121. What is a Set? Informally, a collection of objects, determined by its members, treated as a single mathematical object Not a real definition:
Chapter 2 With Question/Answer Animations. Section 2.1.
Rosen 1.6, 1.7. Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
1 Chapter Two Basic Concepts of Set Theory –Symbols and Terminology –Venn Diagrams and Subsets.
Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com ICOM 5016 – Introduction.
Discrete Mathematics Set.
College Algebra: Section 8.1 Sets and Counting Objectives of this Section Find All the Subsets of a Set Find All the Subsets of a Set Find the Intersection.
Chapter 7 Sets and Probability Section 7.1 Sets What is a Set? A set is a well-defined collection of objects in which it is possible to determine whether.
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
Thinking Mathematically Venn Diagrams and Set Operations.
The Basic Concepts of Set Theory. Chapter 1 Set Operations and Cartesian Products.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Set Builder Notation. If you recall, a set is a collection of objects which we write using brackets and name using a capital letter. Remember also that:
Sets Finite 7-1.
The Basic Concepts of Set Theory
Sets Section 2.1.
The Basic Concepts of Set Theory
Exercises Show that (P  Q)  (P)  (Q)
CS100: Discrete structures
Chapter 2 The Basic Concepts of Set Theory
The Basic Concepts of Set Theory
The Basic Concepts of Set Theory
2.1 Sets Dr. Halimah Alshehri.
Chapter 2 The Basic Concepts of Set Theory
Discrete Mathematics CS 2610
Chapter 2 The Basic Concepts of Set Theory
Chapter 2 The Basic Concepts of Set Theory
2.1 – Symbols and Terminology
ICOM 5016 – Introduction to Database Systems
Sets, Unions, Intersections, and Complements
Presentation transcript:

Chapter 2: The Basic Concepts of Set Theory

Sets A set is a collection of distinguishable objects (called elements) Can define in words Can list elements explicitly Can use set-builder notation Sets must be well-defined.

Sets of Numbers Natural/Counting numbers {1, 2, 3,…} Whole Numbers {0,1, 2, 3,…} Integers {…, -2, -1, 0, 1, 2, … } Rationals {p/q | p,q are integers and q≠0} Reals {x | x is a number that can be written as a decimal} (For now we won’t focus on the rationals and reals, we will come back to them in Chapter 6)

Some Notation and Terminology Sets are denoted by A,B,C, etc, elements are often a,b,c,… x Î A means x is an element of A x Ï A means x is not an element of A n(A)= number of distinct elements in A, called the cardinal number of A. If n(A) is a whole number then A is a finite set. Otherwise it is an infinite set. The empty set:  or { } The universal set U

Equality, Complements and Subsets The complement of a set A within U, denoted A’, is the set of all elements of U that are not in A: A’= {x|x Î U and x ÏA} A is a subset of B if every element of A is also an element of B: A Í B A is equal to B if every element of A is in B and every element of B is in A. A=B means A Í B and B Í A.

Proper Subsets and Number of Subsets A is a proper subset of B if A Í B and A ≠ B, denoted by A Ì B. So every element of A is in B and B contains something that is not in A. Number of subsets of a set with n elements is 2 n Number of proper subsets is 2 n-1

Operations on Sets The intersection of A and B is A Ç B = {x | x ÎA and x Î B}

The union of A and B is A È B = {x | x Î A or x Î B}

The difference of A and B is A – B = {x | x Î A and x Ï B}

Some Useful Results Cardinal number formula: n(A È B) = n(A) + n(B) – n(A Ç B) De Morgan’s Laws: (A Ç B)’ = A’ È B’ (A È B)’ = A’ Ç B’

Ordered Pairs and Cartesian Product In the ordered pair (a,b), a is called the first component and b is called the second component. In general, (a,b) ≠ (b,a). The Cartesian product of A and B is A x B = { (a,b) | a Î A and b ÎB}. We have: n(A x B) = n(A) x n(B)

#21, page 81 The following list shows the preferences of 102 people at a wine-tasting party: 99 like Spanada 96 like Ripple 99 like Boone’s 95 like Spanada and Ripple 94 like Ripple and Boone’s 96 like Spanada and Boone’s 93 like all three

#23, page 81 Country-Western Songs Songs are about three themes: love, prison and trucks. Survey of local ratio: 12 songs about a truck driver in love while in prison 13 about a prisoner in love 28 about a person in love 18 about truck driver in love 3 about a truck driver in prison who is not in love 2 about people in prison who are not in love and don’t drive trucks 8 about people who are out of prison, are not in love and do not drive trucks 16 about truck drivers who are not in prison

#23 continued How many songs were surveyed? Find the number of songs about Truck drivers Prisoners Truck drivers in prison People not in prison People not in love

Equivalent sets and Infinite Sets Sets with the same cardinality can be put in a one-to-one correspondence. If n(A) = n(B), then A and B are equivalent, and we write A ~ B. A set is infinite if it can be placed in one-to- one correspondence with a proper subset of itself.

Countability The set of counting numbers is infinite and has cardinality À 0. (aleph-null) A set is countable if it is finite or has cardinal number À 0. The set of reals is uncountable and has cardinality c. (so there are different infinities!)

Achilles and the Tortoise Achilles, if he starts out behind a tortoise, can never overtake the tortoise even if he runs faster: Suppose Tortoise has a head start of one meter and goes one-tenth as fast as Achilles. When Achilles reaches the point where the tortoise started, Tortoise is then one-tenth meter ahead. When Achilles reaches that point, Tortoise is one- hundredth meter ahead. And so on. Achilles gets closer but he can never catch up!