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:

Slides:



Advertisements
Similar presentations
Discrete Structures Chapter 6: Set Theory
Advertisements

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
2.1 Sets ‒Sets ‒Common Universal Sets ‒Subsets 2.2 Set Operations 2.3 Functions 2.4 Sequences and Summations 1.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
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.
Discrete Structures Chapter 3 Set Theory Nurul Amelina Nasharuddin Multimedia Department.
Sets 1.
Sets 1.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
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.
Discrete Maths Objective to re-introduce basic set ideas, set operations, set identities , Semester 2, Set Basics 1.
Vocabulary word (put this word on the back of the card.) THIS WILL BE THE DEFINITION – FILL IN THE BLANKS ON THE VOCABULARY CARDS PROVIDED.
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)
Definition and Representation A set is a well-defined collection of objects; The objects are called elements or members of the set; A set can be represented.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
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.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Copyright  The McGraw-Hill Companies, Inc. Permission required for reproduction.
Discrete Structure Sets. 2 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.
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.
CS201: Data Structures and Discrete Mathematics I
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,
Sets and Sentences Open Sentences Foundations of Real Analysis.
CompSci 102 Discrete Math for Computer Science
Chapter 2 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
SAT MATH Lesson 10.
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.
(CSC 102) Lecture 13 Discrete Structures. Previous Lectures Summary  Direct Proof  Indirect Proof  Proof by Contradiction  Proof by Contra positive.
Basic Definitions of Set Theory Lecture 23 Section 5.1 Wed, Mar 8, 2006.
Basic Definitions of Set Theory Lecture 24 Section 5.1 Fri, Mar 2, 2007.
Discrete Mathematics Set.
1 Section 1.2 Sets A set is a collection of things. If S is a set and x is a member or element of S we write x  S. Othewise we write x  S. The set with.
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.
Fr: Discrete Mathematics by Washburn, Marlowe, and Ryan.
Introduction to Graph Theory & its Applications
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.
Thinking Mathematically Venn Diagrams and Set Operations.
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.
Section 9.1. Section Summary Relations and Functions Properties of Relations Reflexive Relations Symmetric and Antisymmetric Relations Transitive Relations.
Dr. Ameria Eldosoky Discrete mathematics
Applied Discrete Mathematics Week 1: Logic and Sets
Sets Finite 7-1.
Set Definition: A set is unordered collection of objects.
Set Theory.
Discrete Mathematical The Set Theory
CSNB 143 Discrete Mathematical Structures
Set, Combinatorics, Probability & Number Theory
Sets Section 2.1.
(є:belongs to , є:does not belongs to)
CSE 2353 – September 22nd 2003 Sets.
… and now for something completely different…
CS100: Discrete structures
Algebra 1 Section 1.1.
Set-Builder Notation.
Chapter Sets &Venn Diagrams.
Discrete Mathematics CS 2610
More about Sets.
… and now for something completely different…
2.1 – Symbols and Terminology
books WARM-uP Lesson 1 Independent work Exit card
Set – collection of objects

Sets, Unions, Intersections, and Complements
Terminology and Symbols
Presentation transcript:

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: What’s a collection?? 2/10/122

Some sets = the set of integers = the set of nonnegative integers R = the set of real numbers {1, 2, 3} {{1}, {2}, {3}} {Z} ∅ = the empty set P({1,2}) = the set of all subsets of {1,2} = { ∅, {1}, {2}, {1,2}} P() = the set of all sets of integers (“the power set of the integers”) 2/10/123

“Determined by its members” {7, “Sunday”, π} is a set containing three elements {7, “Sunday”, π} = {π, 7, “Sunday”, π, 14/2} 2/10/124

Set Membership Let A = {7, “Sunday”, π} Then 7 ∈ A 8 ∉ A N ∈ P(Z) 2/10/125

Subset: ⊆ A ⊆ B is read “A is a subset of B” or “A is contained in B” ( ∀ x) (x ∈ A ⇒ x ∈ B) N ⊆ Z, {7} ⊆ {7, “Sunday”, π} ∅ ⊆ A for any set A ( ∀ x) (x ∈∅ ⇒ x ∈ A) A ⊆ A for any set A To be clear that A ⊆ B but A ≠ B, write A ⊊ B “Proper subset” (I don’t like “ ⊂ ”) 2/10/126

Finite and Infinite Sets A set is finite if it can be counted using some initial segment of the integers { ∅, {1}, {2}, {1,2}} Otherwise infinite N, Z {0, 2, 4, 6, 8, …} (to be continued …} 2/10/127

Set Constructor The set of elements of A of which P is true: –{x ∈ A: P(x)} or {x ∈ A | P(x)} E.g. the set of even numbers is {n ∈ Z: n is even} = {n ∈ Z: ( ∃ m ∈ Z) n = 2m} E. g. A×B = {(a,b): a ∈ A and b ∈ B} –Ordered pairs also written 〈 a,b 〉 2/10/128

Size of a Finite Set |A| is the number of elements in A |{2,4,6}| = ? 2/10/129

Size of a Finite Set |A| is the number of elements in A |{2,4,6}| = 3 |{{2,4,6}}| = ? 2/10/1210

Size of a Finite Set |A| is the number of elements in A |{2,4,6}| = 3 |{{2,4,6}}| = 1 |{N}| = ? 2/10/1211

Size of a Finite Set |A| is the number of elements in A |{2,4,6}| = 3 |{{2,4,6}}| = 1 |{N}| = 1 (a set containing only one thing, which happens to be an infinite set) 2/10/1212

Operators on Sets Union: x ∈ A ∪ B iff x ∈ A or x ∈ B Intersection: x ∈ A∩B iff x ∈ A and x ∈ B Complement: x ∈ B iff x ∉ B x ∈ A-B iff x ∈ A and x ∉ B A-B = A\B = A∩B 2/10/1213

Proof that A ∪ (B∩C) = (A ∪ B)∩(A ∪ C) x ∈ A ∪ (B∩C) iff x ∈ A or x ∈ B∩C (defn of ∪ ) iff x ∈ A or (x ∈ B and x ∈ C) (defn of ∩) Let p := “x ∈ A”, q := “x ∈ B”, r := x ∈ C Then p ∨ ( q ⋀ r ) ≡ ( p ∨ q) ⋀ (p ∨ r) ≡ (x ∈ A or x ∈ B) and (x ∈ A or x ∈ C)iff (x ∈ A ∪ B) and (x ∈ A ∪ C)iff x ∈ (A ∪ B)∩(A ∪ C) 2/10/1214