82
Chapter 1 Algebra of Numbers MATH 17. COLLEGE ALGEBRA AND TRIGONOMETRY

1.1 set and set operations (MATH 17)

Embed Size (px)

DESCRIPTION

For freshman taking Math 17. c/o UP.

Citation preview

Page 1: 1.1 set and set operations (MATH 17)

Chapter 1

Algebra of Numbers

MATH 17. COLLEGE ALGEBRA AND TRIGONOMETRY

Page 2: 1.1 set and set operations (MATH 17)
Page 3: 1.1 set and set operations (MATH 17)

1. Sets and Set Operations 2. The Set of Real Numbers 3. Operations on Real Numbers and Laws of

Exponents 4. The Set of Complex Numbers 5. Operations on and Factoring of Polynomials/

Zeros of Polynomials 6. Rational Expressions and Radicals 7. Equations 8. Inequalities

Chapter Outline

Page 4: 1.1 set and set operations (MATH 17)

Chapter 1

Section 1.1

Sets, Set Operations,

and Number Sets

Page 5: 1.1 set and set operations (MATH 17)

Section Objectives

Describe sets using different

methods

Identify different set relations and

perform different set operations

Identify special

number sets

Page 6: 1.1 set and set operations (MATH 17)

Set has pervaded almost all of mathematics so that it has become a fundamental concept. It becomes impossible to define set precisely in terms of more basic concepts.

Notion of a Set

Page 7: 1.1 set and set operations (MATH 17)

A set is a well-defined collection of objects.

It should be possible to determine (in some

manner) whether an object belongs to the given

collection or not.

Notion of a Set

Page 8: 1.1 set and set operations (MATH 17)

Example

The collection of all natural numbers between 0 and 5.

Which of the following collection of objects are sets?

SET

The collection of all buildings in UPLB.

SET

The collection of all schools near Intramuros.

NOT A SET

Page 9: 1.1 set and set operations (MATH 17)

Example

The collection of all handsome students in this class.

Which of the following collection of objects are sets?

NOT A SET

The collection of all flying horses.

SET

The collection of all letters in the word honorificabilitudinitatibus.

SET

Page 10: 1.1 set and set operations (MATH 17)

Definition

If an object belongs to a set, it is called an element of the set.

π‘Ž ∈ 𝐴: π‘Ž is an element of the set 𝐴

Element

Otherwise, the object is not an element of the set.

π‘Ž βˆ‰ 𝐴: π‘Ž is not an element of the set 𝐴

Page 11: 1.1 set and set operations (MATH 17)

Example

β„Ž ∈ 𝐴 π‘ž βˆ‰ 𝐴

If 𝐴 is the set of all letters in the word β€œPhilippines”, then

3 ∈ 𝑂 22 βˆ‰ 𝑂

If 𝑂 is the set of all odd integers, then

Page 12: 1.1 set and set operations (MATH 17)

Roster/Enumeration method

Set is indicated by enumerating the elements of the set and enclosing them in a pair of braces.

Rule method

Set is indicated by enclosing in a pair of braces a

phrase describing the elements of the set with the

condition that those objects, and only those, which

have the described property belong to the set.

Describing a Set

Page 13: 1.1 set and set operations (MATH 17)

Example

using the roster method, 𝐴 = π‘š, π‘Ž, 𝑑, β„Ž, 𝑒, 𝑖, 𝑐, 𝑠

while using the rule method,

𝐴 = distinct letters of the word "mathematics"

If 𝐴 is the collection of distinct letters in the word mathematics, then

Page 14: 1.1 set and set operations (MATH 17)

Set Builder Notation

The set-builder notation is another way of

describing sets using the rule method. This method

uses a defining property of the elements.

π‘₯ π‘₯ 𝑖𝑠 π‘Ž __________ is read as "the set of all x such

that x is a (a certain defining property of all the

elements)”.

Describing a Set

Page 15: 1.1 set and set operations (MATH 17)

Example

𝐡 = counting number from 1 to 5 or

𝐡 = π‘₯ x is a counting number from 1 to 5 or

𝐡 = 𝑦 𝑦 is a counting number less than 6

If 𝐡 = 1,2,3,4,5 , write 𝐡 using the rule method.

Page 16: 1.1 set and set operations (MATH 17)

Example

IMPRACTICAL and DIFFICULT

If 𝐢 = clock, blue, television , write 𝐢 using the rule method.

Page 17: 1.1 set and set operations (MATH 17)

Example

IMPOSSIBLE

If 𝐷 = points in the line π‘₯ = 2 , write 𝐷 using the roster method.

Page 18: 1.1 set and set operations (MATH 17)

Time to Think!

When is the use of the rule method appropriate? The roster method?

Page 19: 1.1 set and set operations (MATH 17)

The concept and the representation of the collection is subject to the following: β€’ the collection must be well-defined β€’ each unique object of the set should be

uniquely represented; and β€’ the order of representing each object of the

set is immaterial.

Remember

Page 20: 1.1 set and set operations (MATH 17)

Definition

- denoted by βˆ… or { }

- are sets having no elements

Empty Sets

Example: 𝐷 = y y is a country in Asia with no people

= βˆ… 𝐴 = {positive numbers less than βˆ’ 5} = { }

Page 21: 1.1 set and set operations (MATH 17)

Empty Set is a subset of any set.

Empty Set

βˆ… βŠ† 𝐴, for any set 𝐴.

The empty set is a subset of itself.

βˆ… βŠ† βˆ…

Remarks:

Page 22: 1.1 set and set operations (MATH 17)

Definition

Otherwise, the set is said to be infinite.

Finite/Infinite Sets

Loosely speaking, we say a set is finite if it is possible to write down completely in a list all the elements of the set or if its elements can be counted (and the counting process terminates)

Sets differ in sizes and kinds.

Page 23: 1.1 set and set operations (MATH 17)

Example

The set of all rational numbers between 0 and 5.

Which of the following sets is finite? Infinite?

INFINITE

The set of all buildings in UPLB.

FINITE

The set of all flying horses. FINITE

Page 24: 1.1 set and set operations (MATH 17)

Example

The set of all hair strands on your head FINITE

The set of points in a circle.

INFINITE

The set of counting numbers between 1 and 1,000,000,000 FINITE

The set of grains of sand in a beach FINITE

Which of the following sets is finite? Infinite?

Page 25: 1.1 set and set operations (MATH 17)

Definition

Cardinality

The cardinality (or size) of a set is the number of elements of that set.

𝑛 𝐴 : the cardinality of set 𝐴

Example: 1. If 𝐴 is the set of vowels in the English alphabet then

𝑛 𝐴 =

2. n βˆ… = 0

5.

Page 26: 1.1 set and set operations (MATH 17)

Definition

Set of all elements under consideration

Universal Set

Superset of all sets under consideration

Denoted by π‘ˆ

Page 27: 1.1 set and set operations (MATH 17)

Example

If 𝐴 = π‘₯ π‘₯ is an even counting number 𝐡 = 𝑦 𝑦 is an odd counting number 𝐢 = 𝑧 𝑧 is a prime number

A possible universal set is

π‘ˆ = π‘₯ π‘₯ is a counting number OR

π‘ˆ = 𝑦 𝑦 is an integer OR

π‘ˆ = 𝑧 𝑧 is a real number

Page 28: 1.1 set and set operations (MATH 17)

Two sets 𝐴 and 𝐡 are equal if they have exactly the same elements.

𝐴 = 𝐡: Set 𝐴 is equal to set 𝐡.

Equal Sets

Otherwise, the sets are not equal.

𝐴 β‰  𝐡:Set 𝐴 is not equal to set 𝐡.

Definition

Page 29: 1.1 set and set operations (MATH 17)

To say 𝐴 β‰  𝐡, we should be able to produce an element that is in 𝐴 but not in 𝐡 or an element that is in 𝐡 but not in 𝐴.

Equal Sets

Thus, to say 𝐴 = 𝐡, we should be certain that every element in 𝐴 belongs to 𝐡 and every element in 𝐡 is also in 𝐴.

Page 30: 1.1 set and set operations (MATH 17)

Example

𝐴 = 𝐡

If 𝐴 is the set of all letters in the word β€œresistance”, and 𝐡 is the set of all letters in the word β€œancestries”, then

𝐡 β‰  𝐢 because 𝑖 ∈ 𝐡 but 𝑖 βˆ‰ 𝐢.

If 𝐢 is the set of all letters in the word β€œancestor”, then

Page 31: 1.1 set and set operations (MATH 17)

Time to Think!

If 𝐴 = {2, 3, 5, 7, 11} and 𝐡 = {x|x is a prime number less than 12}

Is 𝐴 = 𝐡?

If C= {11, 2, 5, 7, 3}

Is 𝐴 = 𝐢?

Page 32: 1.1 set and set operations (MATH 17)

Definition

We write 𝐴 βŠ† 𝐡 if and only if π‘₯ ∈ 𝐴 implies π‘₯ ∈ 𝐡.

Subsets and Supersets

𝐴 βŠ† 𝐡: Set 𝐴 is a subset of 𝐡 or Set 𝐡 is a superset of 𝐴

Set 𝐴 is said to be a subset of set 𝐡 if every element of 𝐴 is also an element of 𝐡.

Page 33: 1.1 set and set operations (MATH 17)

Thus, if there is an element in 𝐴 which is not in 𝐡,

we say 𝐴 is not a subset of 𝐡 and we write 𝐴 ⊈ 𝐡.

Subset of a Set

If 𝐴 βŠ† 𝐡 then whenever π‘₯ is in 𝐴, π‘₯ is also in 𝐡.

and

If whenever π‘₯ is in 𝐴, π‘₯ is also in 𝐡 then 𝐴 βŠ† 𝐡

This notation is to be understood to mean two

things:

Page 34: 1.1 set and set operations (MATH 17)

Example

If 𝐡 = 1, 2, 3, 4 then

𝐡 ⊈ 1,2, 5, 6 .

If 𝐢 = π‘Ž, 𝑏, 𝑐, 𝑑 and 𝐷 = π‘Ž, 𝑏, 𝑐

Yes it is.

but

𝐡 βŠ† {1, 2, 3, 4, 5}

β€’ Is 𝐷 βŠ† C?

No it isn’t. Thus 𝐢 ⊈ 𝐷.

β€’ Is 𝐢 βŠ† 𝐷?

Page 35: 1.1 set and set operations (MATH 17)

Time to Think!

β€’ If 𝐴 βŠ† 𝐡 and 𝐡 βŠ† 𝐴, what can be said about 𝐴 and 𝐡?

β€’ If 𝐴 βŠ† 𝐡 and 𝐡 βŠ† 𝐢, is 𝐴 βŠ† 𝐢?

β€’ Is 𝐴 βŠ† 𝐴?

β€’ Give an example for sets 𝐴 and 𝐡 such that 𝐴 βŠ† 𝐡 but 𝐡 ⊈ 𝐴

Page 36: 1.1 set and set operations (MATH 17)

If 𝐴 βŠ† 𝐡 and 𝐡 βŠ† 𝐢 then 𝐴 βŠ† 𝐢.

Subset of a Set

Transitive Property of Set Inclusion

𝐴 βŠ† 𝐴, for any set 𝐴.

Reflexive Property of Set Inclusion

Page 37: 1.1 set and set operations (MATH 17)

Definition

𝐴 βŠ‚ 𝐡 if and only if A is a nonempty set and 𝐴 βŠ† 𝐡 but 𝐡 β‰  𝐴.

Proper Subsets β€œβŠ‚β€™β€™

If 𝐴 βŠ† 𝐡 and 𝐡 βŠ† 𝐴 then 𝐴 = 𝐡.

Alternative Definition of Equality of Sets

Page 38: 1.1 set and set operations (MATH 17)

Example

If 𝐢 = π‘Ž, 𝑏, 𝑐, 𝑑 and 𝐷 = π‘Ž, 𝑏, 𝑐

Therefore 𝐷 βŠ‚ C.

𝐢 ⊈ 𝐷 since 𝑑 ∈ 𝐢 but 𝑑 βˆ‰ 𝐷.

𝐷 βŠ† C and

Is 𝐷 βŠ‚ C?

Page 39: 1.1 set and set operations (MATH 17)

Definition

Two sets 𝐴 and 𝐡 are in one-to-one correspondence if it is possible to pair each element of 𝐴 with exactly one element of 𝐡 and each element of 𝐡 with exactly one element of 𝐴.

One-to-one Correspondence

Page 40: 1.1 set and set operations (MATH 17)

Example

Is there a one-to-one correspondence between the set of days in a week and the set of colors in the rainbow?

YES

M T W Th F Sa S

red orange yellow green blue indigo violet

Page 41: 1.1 set and set operations (MATH 17)

Example

Is there a one-to-one correspondence between the set of days in a week and the set of months in a year? NO

Jan

Feb

Mar

Ap

r

May

Jun

Jul

Au

g

Sep

Oct

No

v

Dec

S M T W Th F Sa

Page 42: 1.1 set and set operations (MATH 17)

Example

Let 𝐴 = 1,2,3,4 𝐡 = 3,6,9,12 𝐢 = βˆ’4, βˆ’3, βˆ’2, βˆ’1,1,2,3,4

NO

Is there a one-to-one correspondence between set 𝐴 and set 𝐢?

YES

Is there a one-to-one correspondence between set 𝐴 and set 𝐡?

Page 43: 1.1 set and set operations (MATH 17)

Example

Is there a one-to-one correspondence between the set of even counting numbers and the set of odd counting numbers?

YES

E 2 4 6 8 34290

…

O 1 3 5 7 34289

Page 44: 1.1 set and set operations (MATH 17)

Time to Think!

Is there a one-to-one correspondence between the set of points in a line and the

set of all counting numbers?

Page 45: 1.1 set and set operations (MATH 17)

Definition

Two sets are equivalent (or of the same size) if they are in one-to-one correspondence.

Equivalent Sets

Page 46: 1.1 set and set operations (MATH 17)

Time to Think!

β€’ When are two sets β€œnot equivalent”?

β€’ If 𝐴 and 𝐡 are equivalent and 𝐡 and 𝐢 are equivalent, are 𝐴 and 𝐢 equivalent?

β€’ Are equivalent sets equal?

β€’ Are equal sets equivalent?

Page 47: 1.1 set and set operations (MATH 17)

Number Sets

β„• = set of natural (counting) numbers ={1,2,3, … }

π•Ž = set of whole numbers = {0,1,2,3, … }

β„€ = set of integers = {… , βˆ’3, βˆ’2, βˆ’1,0,1,2,3, … }

Page 48: 1.1 set and set operations (MATH 17)

Number Sets

N- = set of negative counting numbers E = set of even integers

O = set of odd integers

E+ = set of positive even integers

E- = set of negative even integers

P = set of prime numbers C = set of composite numbers

π‘˜β„€= set of multiples of k, k is positive

Page 49: 1.1 set and set operations (MATH 17)

Example

2β„€ = … , βˆ’6, βˆ’4, βˆ’2,0,2,4,6, …

3β„€ = … , βˆ’9, βˆ’6, βˆ’3,0,3,6,9, …

4β„€ = … , βˆ’12, βˆ’8, βˆ’4,0,4,8,12, …

Page 50: 1.1 set and set operations (MATH 17)

Venn Diagram

𝐴 βŠ† 𝐡 𝐡 βŠ† 𝐴

𝐴

𝐡 𝐴

𝐡

Page 51: 1.1 set and set operations (MATH 17)

Example

Draw a Venn Diagram such that A is not a subset of B.

𝐴 𝐡

𝐴

𝐡 or

Page 52: 1.1 set and set operations (MATH 17)

Example

Draw a Venn Diagram satisfying 𝐴 βŠ† 𝐡, 𝐴 βŠ† 𝐢 and 𝐡 βŠ† 𝐢.

𝐴

𝐡

𝐢

Page 53: 1.1 set and set operations (MATH 17)

Definition

Two sets are disjoint if they have no element in common.

Disjoint Sets

𝐴 and 𝐡 are disjoint:

If π‘₯ ∈ 𝐴 then π‘₯ βˆ‰ 𝐡.

Page 54: 1.1 set and set operations (MATH 17)

Disjoint Sets

𝐴

𝐡

𝐴

𝐡

𝐴 and 𝐡 are disjoint 𝐴 and 𝐡 are not disjoint

Page 55: 1.1 set and set operations (MATH 17)

Definition

Union The union of two sets 𝐴 and 𝐡 is the set of elements that belong to 𝐴 or to 𝐡.

𝐴 βˆͺ 𝐡: 𝐴 union B

UA B

𝐴 βˆͺ 𝐡 = π‘₯ π‘₯ ∈ 𝐴 or π‘₯ ∈ 𝐡

Page 56: 1.1 set and set operations (MATH 17)

Example

If 𝐴 = 1,3,5 and 𝐡 = π‘Ž, 𝑏, 𝑐 then 𝐴 βˆͺ 𝐡 = 1, 3, 5, π‘Ž, 𝑏, 𝑐

Moreover, 𝑛 𝐴 = 3, 𝑛 𝐡 = 3 and

𝑛 𝐴 βˆͺ 𝐡 = 6

Page 57: 1.1 set and set operations (MATH 17)

Time to Think!

Is it always true that 𝑛 𝐴 βˆͺ 𝐡 = 𝑛 𝐴 + 𝑛 𝐡 ?

Page 58: 1.1 set and set operations (MATH 17)

Definition

Intersection

The intersection of two sets 𝐴 and 𝐡 is the set of elements that belong to 𝐴 and to 𝐡.

𝐴 ∩ 𝐡: 𝐴 intersection B

𝐴 ∩ 𝐡 = π‘₯ π‘₯ ∈ 𝐴 and π‘₯ ∈ 𝐡

UA B

Page 59: 1.1 set and set operations (MATH 17)

Example

If 𝐴 = π‘Ž, 𝑒, 𝑖, π‘œ, 𝑒 and 𝐡 = π‘Ž, 𝑏, 𝑐, 𝑑, 𝑒 then 𝐴 ∩ 𝐡 = π‘Ž, 𝑒

If 𝑃 is the set of all prime numbers and 𝐢 is the set of all composite numbers, then

𝑃 ∩ 𝐢 = βˆ…

Page 60: 1.1 set and set operations (MATH 17)

Definition

Alternative Definition

Two sets 𝐴 and 𝐡 are disjoint if and only if 𝐴 ∩ 𝐡 = βˆ….

Page 61: 1.1 set and set operations (MATH 17)

Cardinality of 𝐴 βˆͺ 𝐡

If 𝐴 and 𝐡 are disjoint 𝑛 𝐴 βˆͺ 𝐡 = 𝑛 𝐴 + 𝑛 𝐡

In general, 𝑛 𝐴 βˆͺ 𝐡 = 𝑛 𝐴 + 𝑛 𝐡 βˆ’ 𝑛 𝐴 ∩ 𝐡

Page 62: 1.1 set and set operations (MATH 17)

Example

If 𝐺 = 1,3,5,7,9,10 and 𝐻 = 3,6,9,12 , then

𝑛 𝐺 = 6 𝑛 𝐻 = 4

𝑛 𝐺 ∩ 𝐻 = 2

𝑛 𝐺 βˆͺ 𝐻 = 8

Then

Page 63: 1.1 set and set operations (MATH 17)

Definition

Set Difference

𝐴 𝐡

A-B= π‘₯ π‘₯ ∈ 𝐴, π‘₯ βˆ‰ 𝐡

Page 64: 1.1 set and set operations (MATH 17)

Definition

Set Difference A-B= π‘₯ π‘₯ ∈ 𝐴, π‘₯ βˆ‰ 𝐡

A= {1,2,3,4,5,6} B= {2,5,7,9,10}

{1, 2, 3, 4, 5, 6}

{2, 5, 7, 9, 10}

Aβˆ’B =

Bβˆ’A =

Page 65: 1.1 set and set operations (MATH 17)

Definition

The complement of 𝐴 denoted by 𝐴′, is the set of all elements of π‘ˆ that are not in 𝐴.

Complement

π‘ˆ 𝐴

𝐴′ = π‘₯ π‘₯ ∈ π‘ˆ, π‘₯ βˆ‰ 𝐴

Page 66: 1.1 set and set operations (MATH 17)

Example

If π‘ˆ = 1,3,5,7,9 and A = 5, 9 then

π‘ˆ 𝐴

5 9 1

7

3

𝐴′ = 1,3,7

Page 67: 1.1 set and set operations (MATH 17)

Complement of a Set

π‘ˆβ€² =

βˆ…β€² =

Remark:

𝐴′ = π‘ˆ βˆ’ 𝐴

βˆ…

π‘ˆ

Page 68: 1.1 set and set operations (MATH 17)

Complement of a Set

U U

𝐴′ β€² = 𝐴

𝐴′ 𝐴′ β€²

𝐴 𝐴

Page 69: 1.1 set and set operations (MATH 17)

Example

UA B

A B 'A B

Illustrate using the Venn diagrams

𝐴 βˆͺ 𝐡 β€²

Page 70: 1.1 set and set operations (MATH 17)

Example

Illustrate using the Venn diagrams

𝐴′ ∩ 𝐡′

UA B

'A

UA B

'B

' 'A B

Page 71: 1.1 set and set operations (MATH 17)

Example

'A B ' 'A B

' ' 'A B A B

Page 72: 1.1 set and set operations (MATH 17)

Definition

Cross Product

The cross product (or Cartesian product) of two sets 𝐴 and 𝐡 is the set of all possible ordered pairs π‘₯, 𝑦 where π‘₯ ∈ 𝐴 and 𝑦 ∈ 𝐡.

𝐴 Γ— 𝐡: π‘₯, 𝑦 π‘₯ ∈ 𝐴 and 𝑦 ∈ 𝐡

Page 73: 1.1 set and set operations (MATH 17)

Example

If 𝐴 = 1,2 and 𝐡 = π‘Ž, 𝑏

On the other hand 𝐡 Γ— 𝐴 = π‘Ž, 1 , π‘Ž, 2 , 𝑏, 1 , 𝑏, 2

then 𝐴 Γ— 𝐡 = 1, π‘Ž , 1, 𝑏 , 2, π‘Ž , 2, 𝑏

Page 74: 1.1 set and set operations (MATH 17)

Time to Think!

What is the cardinality of 𝐴 Γ— 𝐡?

Page 75: 1.1 set and set operations (MATH 17)

Definition

Power Set

The power set of any set, denoted by β„˜ 𝐴 , is the set of all subsets of set 𝐴.

Let 𝐴 = π‘Ž, 3, # , then β„˜ 𝐴 =

π‘Ž , 3 , # , π‘Ž, 3 , π‘Ž, # , 3, # , 𝐴, βˆ…

What is 𝑛 β„˜ 𝐴 ? 8

Page 76: 1.1 set and set operations (MATH 17)

Time to Think!

What is the cardinality of the power set of any set 𝐴?

Page 77: 1.1 set and set operations (MATH 17)

Time to Think!

Let π‘ˆ be a universal set and A βŠ† π‘ˆ

𝐴 βˆͺ π‘ˆ

𝐴 βˆͺ 𝐴′

𝐴 βˆͺ βˆ…

𝐴 ∩ π‘ˆ

𝐴 ∩ 𝐴′

𝐴 ∩ βˆ…

Page 78: 1.1 set and set operations (MATH 17)

Time to Think!

Let U = β„€. Find the following:

1. β„• βˆͺ π•Ž = π•Ž 2. β„• ∩ π•Ž= β„• 3. 𝐸 βˆͺ 𝑂 = β„€ 4. 𝐸+ β€² = {0}

βˆͺO βˆͺ πΈβˆ’ 5. 3β„€ βˆͺ 2β„€

6. 3β„€ ∩ 2β„€= 6β„€ 7. β„•β€² ∩ π•Ž = {0} 8. β„• βˆͺ 𝑃′ = β„€ 9. 𝐢 ∩ 𝑃 Γ— πΈβˆ’ ={} 10. β„€β€² = {}

Page 79: 1.1 set and set operations (MATH 17)

Example

If 𝑛 π‘ˆ = π‘Ÿ and 𝑛 𝐡 = 𝑗, then 𝑛 𝐡′ =

π‘Ÿ βˆ’ 𝑗

Page 80: 1.1 set and set operations (MATH 17)

Example

Illustrate using the Venn diagrams

𝐴 ∩ 𝐡 βˆͺ 𝐢

B C A A B C

Page 81: 1.1 set and set operations (MATH 17)

Example

Illustrate using the Venn diagrams 𝐴 ∩ 𝐡 βˆͺ 𝐴 ∩ 𝐢

UA B

C

A B

UA B

C

A C

Page 82: 1.1 set and set operations (MATH 17)

Example

A B A C A B C

A B C A B A C