Copyright © Cengage Learning. All rights reserved.

Slides:



Advertisements
Similar presentations
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Advertisements

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Section 1.6: Sets Sets are the most basic of discrete structures and also the most general. Several of the discrete structures we will study are built.
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
Sets.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Set theory Sets: Powerful tool in computer science to solve real world problems. A set is a collection of distinct objects called elements. Traditionally,
P.1 Real Numbers. 2 What You Should Learn Represent and classify real numbers. Order real numbers and use inequalities. Find the absolute values of real.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 FUNCTIONS.
Copyright © Cengage Learning. All rights reserved. 11 Infinite Sequences and Series.
Mathematical Proofs. Chapter 1 Sets 1.1 Describing a Set 1.2 Subsets 1.3 Set Operations 1.4 Indexed Collections of Sets 1.5 Partitions of Sets.
Copyright © Cengage Learning. All rights reserved.
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
Copyright © 2010 Pearson Education, Inc. All rights reserved Sec
Chapter 2 With Question/Answer Animations. Section 2.1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
1 1 Devon M. Simmonds University of North Carolina, Wilmington CSC133 Discrete Mathematical Structures TIME: Tuesday/Thursday 9:30 – 10:45am in Office.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 1 The Foundations: Logic, Sets,
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.
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Set & Interval Notation
Chapter 2 Sets and Functions.
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
The Language of Sets If S is a set, then
Copyright © Cengage Learning. All rights reserved.
Relations and Functions
Relations, Functions, and Matrices
1.1: Objectives Properties of Real Numbers
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Set, Combinatorics, Probability & Number Theory
Copyright © Cengage Learning. All rights reserved.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
Chapter 2 Sets and Functions.
Discrete Structure II: Introduction
Linear Inequalities and Absolute Value
Direct Proof and Counterexample V: Floor and Ceiling
Set and Set Operations Grab a sheet from front.
Copyright © Cengage Learning. All rights reserved.
Chapter 1 Section 1.
Set-Builder Notation.
Copyright © Cengage Learning. All rights reserved.
2.1 Sets Dr. Halimah Alshehri.
Copyright © Cengage Learning. All rights reserved.
Algebra: Graphs, Functions, and Linear Systems
Copyright © Cengage Learning. All rights reserved.
Sets. EXAMPLE 1 The set O of odd positive integers less than 10 can be expressed by O = { l, 3, 5, 7, 9}. * This way of describing a set is known as.
Copyright © Cengage Learning. All rights reserved.
Precalculus Essentials
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
2 Chapter Numeration Systems and Sets
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Real Numbers and Their Properties Section 1.1 – The Real Numbers
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Appendix A: Numbers, Inequalities, and Absolute values
Presentation transcript:

Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY Copyright © Cengage Learning. All rights reserved.

Copyright © Cengage Learning. All rights reserved. SECTION 1.2 The Language of Sets Copyright © Cengage Learning. All rights reserved.

The Language of Sets

The Language of Sets Use of the word set as a formal mathematical term was introduced in 1879 by Georg Cantor (1845–1918). For most mathematical purposes we can think of a set intuitively, as Cantor did, simply as a collection of elements. For instance, if C is the set of all countries that are currently in the United Nations, then the United States is an element of C, and if I is the set of all integers from 1 to 100, then the number 57 is an element of I.

The Language of Sets The axiom of extension says that a set is completely determined by what its elements are—not the order in which they might be listed or the fact that some elements might be listed more than once.

Example 1 – Using the Set-Roster Notation a. Let A = {1, 2, 3}, B = {3, 1, 2}, and C = {1, 1, 2, 3, 3, 3}. What are the elements of A, B, and C? How are A, B, and C related? b. Is {0} = 0? c. How many elements are in the set {1, {1}}? d. For each nonnegative integer n, let Un = {n, –n}. Find U1, U2, and U0.

The Language of Sets Certain sets of numbers are so frequently referred to that they are given special symbolic names. These are summarized in the following table:

The Language of Sets The set of real numbers is usually pictured as the set of all points on a line, as shown below. The number 0 corresponds to a middle point, called the origin. A unit of distance is marked off, and each point to the right of the origin corresponds to a positive real number found by computing its distance from the origin.

The Language of Sets Each point to the left of the origin corresponds to a negative real number, which is denoted by computing its distance from the origin and putting a minus sign in front of the resulting number. The set of real numbers is therefore divided into three parts: the set of positive real numbers, the set of negative real numbers, and the number 0. Note that 0 is neither positive nor negative.

The Language of Sets Labels are given for a few real numbers corresponding to points on the line shown below. The real number line is called continuous because it is imagined to have no holes. The set of integers corresponds to a collection of points located at fixed intervals along the real number line.

The Language of Sets Thus every integer is a real number, and because the integers are all separated from each other, the set of integers is called discrete. The name discrete mathematics comes from the distinction between continuous and discrete mathematical objects. Another way to specify a set uses what is called the set-builder notation.

Example 2 – Using the Set-Builder Notation Given that R denotes the set of all real numbers, Z the set of all integers, and Z+ the set of all positive integers, describe each of the following sets. a. b. c.

Subsets

Subsets A basic relation between sets is that of subset.

Subsets It follows from the definition of subset that for a set A not to be a subset of a set B means that there is at least one element of A that is not an element of B. Symbolically:

Example 4 – Distinction between ∈ and ⊆ Which of the following are true statements? a. 2 ∈ {1, 2, 3} b. {2} ∈ {1, 2, 3} c. 2 ⊆ {1, 2, 3} d. {2} ⊆ {1, 2, 3} e. {2} ⊆ {{1}, {2}} f. {2} ∈ {{1}, {2}}

Cartesian Products

Cartesian Products

Example 5 – Ordered Pairs a. Is (1, 2) = (2, 1)? b. Is ? c. What is the first element of (1, 1)?

Cartesian Products

Example 6 – Cartesian Products Let A = {1, 2, 3} and B = {u, v}. a. Find A × B b. Find B × A c. Find B × B d. How many elements are in A × B, B × A, and B × B? e. Let R denote the set of all real numbers. Describe R × R.