Terminology and Symbols

Slides:



Advertisements
Similar presentations
Chapter 2 Revision of Mathematical Notations and Techniques
Advertisements

More Set Definitions and Proofs 1.6, 1.7. Ordered n-tuple The ordered n-tuple (a1,a2,…an) is the ordered collection that has a1 as its first element,
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
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.
Lecture 3UofH - COSC Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 3.
Sets Definition of a Set: NAME = {list of elements or description of elements} i.e. B = {1,2,3} or C = {x  Z + | -4 < x < 4} Axiom of Extension: A set.
CS 310 – Fall 2006 Pacific University CS310 Strings, String Operators, and Languages Sections: August 30, 2006.
CS5371 Theory of Computation Lecture 1: Mathematics Review I (Basic Terminology)
Sets 1.
CSE115/ENGR160 Discrete Mathematics 02/10/11 Ming-Hsuan Yang UC Merced 1.
Sets 1.
Costas Busch - RPI1 Mathematical Preliminaries. Costas Busch - RPI2 Mathematical Preliminaries Sets Functions Relations Graphs Proof Techniques.
Courtesy Costas Busch - RPI1 Mathematical Preliminaries.
Survey of Mathematical Ideas Math 100 Chapter 2
Survey of Mathematical Ideas Math 100 Chapter 2 John Rosson Thursday January 25, 2007.
Sets Day 1 Part II.
Discrete Mathematics Unit - I. Set Theory Sets and Subsets A well-defined collection of objects (the set of outstanding people, outstanding is very subjective)
Objectives: By the end of class, I will be able to:  Identify sets  Understand subsets, intersections, unions, empty sets, finite and infinite sets,
INTRODUCTION TO THE THEORY OF COMPUTATION INTRODUCTION MICHAEL SIPSER, SECOND EDITION 1.
Mathematical preliminaries Episode 2 0 Sets Sequences Functions Relations Strings.
1 Strings and Languages. 2 Review Sets and sequences Functions and relations Graphs Boolean logic:      Proof techniques: – Construction, Contradiction,
Mathematical Preliminaries. Sets Functions Relations Graphs Proof Techniques.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Mathematical Notions and Terminology Lecture 2 Section 0.2 Fri, Aug 24, 2007.
Strings and Languages CS 130: Theory of Computation HMU textbook, Chapter 1 (Sec 1.5)
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
Section 2.2 Subsets and Set Operations Math in Our World.
ELEMENTARY SET THEORY.
Mathematical Preliminaries
Sets Goal: Introduce the basic terminology of set theory.
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 P SECTION 1 NOTES.
Introduction Episode 0 What is TOC (Theory of Computation) about? Giorgi Japaridze Theory of Computability Subject: The fundamental mathematical properties.
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.
Basic Definitions of Set Theory Lecture 24 Section 5.1 Fri, Mar 2, 2007.
Strings and Languages Denning, Section 2.7. Alphabet An alphabet V is a finite nonempty set of symbols. Each symbol is a non- divisible or atomic object.
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.
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
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.
CSE15 Discrete Mathematics 02/13/17
Sets Page 746.
Sets Finite 7-1.
Set Definition: A set is unordered collection of objects.
Introduction Chapter 0.
Formal Language & Automata Theory
Sets Section 2.1.
Lecture 1 Theory of Automata
ALGEBRA II H/G - SETS : UNION and INTERSECTION
Mathematical Notions and Terminology
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
Jaya Krishna, M.Tech, Assistant Professor
Algebra 1 Section 1.1.
Session – 2 SETS & Operations of SETS
COSC 3340: Introduction to Theory of Computation
2.1 Sets Dr. Halimah Alshehri.
INTRODUCTION TO THE THEORY OF COMPUTATION
CHAPTER 1 - Sets and Intervals
CHAPTER 1 - Sets and Intervals
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.
ALGEBRA I - SETS : UNION and INTERSECTION
Discrete Mathematics CS 2610
Lecture 2.1: Sets and Set Operations*
Introduction Chapter 0.
ALGEBRA II H/G - SETS : UNION and INTERSECTION
Introduction Reading: Sections 1.5 – 1.7.
2.1 – Symbols and Terminology
Chapter 1 Introduction to the Theory of Computation
Lecture Sets 2.2 Set Operations.
Presentation transcript:

Terminology and Symbols csci 432 Lecture one

Sets a Set is a collection of objects L = { a, b, c, d } a is an element or member of L a ∈ L z ∉ L {3, 1, 9} = {1, 3, 9} {7} is a singleton

Sets … A = { a, b, c, d } B = { a, b } C = { e, f, g, … z } B ⊆ A B is a subset of A ∅ ⊆ A the empty set is a subset of A C ⊄ A C is not a subset of A B ⊂ A B is proper subset of A, A ≠ B

Check your understanding… A = { a, b, … z} B = { a, b, c } Which are True? A ⊆ B X B ⊆ A ✔ B ⊆ B ✔ B ⊂ A ✔

Sets … A = { 1, 3, 9 } B = { 3, 5, 7 } A∩B = { 3 } intersection A∪B = { 1, 3, 5, 7, 9 } union A - B = { 1, 9 } difference

Closed Form A ∪ B = { x : x ∈ A or x ∈ B } A ∩ B = { x : x ∈ A and x ∈ B } A - B = { x : x ∈ A and x ∉ B } ?????????????? "Closed Form" is a way to mathematically denote something. The first line denotes Union. What is the closed form for intersection and difference? ??????????????

Practice N = {0, 1, 2, 3, … } what is { 2n : n ∈ N } Write the definition of positive odd numbers. O = { x : x ∈ N and x is not divisible by 2 } So what about this? O = { x : 2x-1 and x ∈ N }

Strings alphabet = set of symbols string = finite sequence from the alphabet language = set of words |w| = length of a word w wR = reverse of word w So… What is this called? w = wR

Ordered Pairs (a, b) a and b are components of the ordered pair (a, b) ≠ (b, a) order matters (a, b) ≠ { a, b } ordered pair v. set

Cartesian Product A = { 1, 2 } B = { a, b, c } A x B = { (1,a), (1,b), (1,c), (2,a), (2,b), (2,c) } So… Does A x B = B x A?

Functions f : R -> S f is a function that takes input from set R and returns elements from set S. f ⊆ R x S and for each x ∈ R there is at most one y ∈ S such that f(x) = y or (x, y).

One to One Functions f (x) = y is one to one if f -1 (y) = x

Practice True or False {2, 4, 5} ⊆ { 2n : n ∈ N } What is |w| and wR for this word? ysaEooTsIsihT Let A = {1, 2, … 100} and B = {a, b, c, d} How large is A x B? textbook page 9

Practice Suppose, R = {1, 2} and S = {a, b} Which is correct? RxS = { (1,a), (1,b), (2,a), (2,b) } RxS = ( {1,a}, {1,b}, {2,a}, {2,b} ) RxS = { (a,1), (a,2), (b,1), (b,2) } RxS = { (1,a), (2,a), (1,b), (2,b) }

Practice A ∪ A = A A ∩ A = A A ∪ B = B ∪ A ( A ∪ B ) ∩ A = A True or False A ∪ A = A A ∩ A = A A ∪ B = B ∪ A ( A ∪ B ) ∩ A = A ( A ∪ B ) ∩ C = (A ∩ C) ∪ (B ∩ C)

Practice L = A - ( B U C ) R = (A - B) ∩ (A - C) L = R True or False if L = A - ( B U C ) and R = (A - B) ∩ (A - C) then L = R

Practice ∅ ⊆ { ∅ } ∅ ∈ { ∅ } {a,b} ∈ {a, b, c, d} True or False ∅ ⊆ { ∅ } ∅ ∈ { ∅ } {a,b} ∈ {a, b, c, d} {a,b} ∈ {a, b, c, d, {a,b}} {a,b} ⊆ {a, b, c, d} What is ({1,3,5}∪{3,1})∩{3,5,7}