Section 3.2 More set operations.

Slides:

Advertisements

Similar presentations

THE WELL ORDERING PROPERTY Definition: Let B be a set of integers. An integer m is called a least element of B if m is an element of B, and for every x.

Advertisements

Section 7.5: Equivalence Relations Def: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Ex: Let.

Equivalence Relations

Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices

Instructor: Hayk Melikya

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.

Denoting the beginning

Sets, Relation and Functions A set is a collection of objects (elements) or a container of objects. Defining sets –Empty set (Ø): no elements –Universal.

1 Set Theory. 2 Set Properties Commutative Laws: Associative Laws: Distributive Laws:

SETS A set B is a collection of objects such that for every object X in the universe the statement: “X is a member of B” Is a proposition.

Survey of Mathematical Ideas Math 100 Chapter 2

Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.

SET Miss.Namthip Meemag Wattanothaipayap School. Definition of Set Set is a collection of objects, things or symbols. There is no precise definition for.

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.

1. Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element of A” A = {a 1, a 2,

SECTION 2-3 Set Operations and Cartesian Products Slide

Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.

2.2 Set Operations. The Union DEFINITION 1 Let A and B be sets. The union of the sets A and B, denoted by A U B, is the set that contains those elements.

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:

3.3 Finding Probability Using Sets. Set Theory Definitions Simple event –Has one outcome –E.g. rolling a die and getting a 4 or pulling one name out of.

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.

Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.

Module Code MA1032N: Logic Lecture for Week Autumn.

Basic Definitions of Set Theory Lecture 23 Section 5.1 Wed, Mar 8, 2006.

MAT 2720 Discrete Mathematics Section 3.3 Relations

Basic Definitions of Set Theory Lecture 23 Section 5.1 Mon, Feb 21, 2005.

Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.

Set Operations Section 2.2.

Discrete Mathematics Lecture # 10 Venn Diagram. Union  Let A and B be subsets of a universal set U. The union of sets A and B is the set of all elements.

Section 1.2 – 1.3 Outline Intersection  Disjoint Sets (A  B=  ) AND Union  OR Universe The set of items that are possible for membership Venn Diagrams.

Fr: Discrete Mathematics by Washburn, Marlowe, and Ryan.

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.

Section 2.1. Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the.

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.

“It is impossible to define every concept.” For example a “set” can not be defined. But Here are a list of things we shall simply assume about sets. A.

Section 6.1 Set and Set Operations. Set: A set is a collection of objects/elements. Ex. A = {w, a, r, d} Sets are often named with capital letters. Order.

Set. Outline Universal Set Venn Diagram Operations on Sets.

Citra Noviyasari, S.Si, MT

The set of whole numbers less than 7 is {1, 2, 3, 4, 5, 6}

CHAPTER 2 Set Theory A B C.

Set Definition: A set is unordered collection of objects.

CSNB 143 Discrete Mathematical Structures

4.1 Product Sets and Partitions

Sets Section 2.1.

CSE 2353 – September 22nd 2003 Sets.

Introductory Material

Equivalence Relations

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.

Discrete Mathematics CS 2610

Introduction to Relations and Functions

2.2 Set Operations L Al-zaid Math1101.

Formal Definition and Examples

Lecture Sets 2.2 Set Operations.

Counting Elements of Disjoint Sets: The Addition Rule

Basic Definitions of Set Theory

REVISION Relation. REVISION Relation Introduction to Relations and Functions.

Counting Elements of Disjoint Sets: The Addition Rule

Sets, Unions, Intersections, and Complements

Introductory Material

Terminology and Symbols

Presentation transcript:

Section 3.2 More set operations

More operations Sometimes an operation forms a new set with a different type of objects than in the original sets. Examples. A = {1, 2, 3}, B = {3, 5} are sets of numbers. A × B = { (1,3), (1,5), (2,3), (2,5), (3,3), (3,5) } is a set of ordered pairs. P(B) = { {3, 5}, {3}, {5}, { } } is a set of sets

Definitions A × B = { (a,b) : a  A and b  B}. This is called the Cartesian product of A and B. P(A) = { S : S  A }. This is called the power set of A.

Practice Let A = {2, 3, 4} and B = {3, 5}. Determine: A × B B × A (A  B) × (A  B) P(B) P(A  B)

Practice Let A = {a,b,c,d} and B = {b,c,e}. How many elements are in each of the following sets? A × B B × A (A  B) × (A  B) P(A) P(B) P(A  B)

Practice List the elements which belong to the following set:

Practice List five elements that belong to the set:

Practice List five elements that belong to the set:

Definition A partition of a set A is a set S of non- empty subsets of A satisfying the following: If P1 and P2 are two different members of S, then P1  P2 = Ø. (That is, distinct parts are disjoint.) The union of all of the members of S is the entire set A.

Examples and practice Let A = {1, 2, 3, 4, 5, 6}. {{1, 2}, {4, 3}, {5}, {6}} is a partition of A with 4 parts. {{1, 5, 3, 4, 2, 6}} is a partition of A with just 1 part. {{1, 3}, {4, 2}, {3, 5, 6}} is not a partition of A. Why not? {1, 2, {3, 4}, {5, 6}} is not a partition of A. Why not? {{ }, {1, 4, 2}, {3, 5, 6}} is not a partition of A. Why not?

More practice Which of the following are partitions of Z, the set of all integers? For each that is not, say why not. { {3n + 1 : n  Z}, {3n + 2 : n  Z}, {3n : n  Z} } { {2n + 1 : n  Z}, {3n + 2 : n  Z}, {6n : n  Z} } { {3n + 1 : n  Z}, {6n + 2 : n  Z}, {9n : n  Z} } { {4n + 1 : n  Z}, {4n + 3 : n  Z}, {2n : n  Z} }