COMP9020 Lecture 3 Session 2, 2014 Sets, Functions, and Sequences. Revision: 1.3
|
|
- Muriel Campbell
- 5 years ago
- Views:
Transcription
1 1 COMP9020 Lecture 3 Session 2, 2014 Sets, Functions, and Sequences Revision: 1.3
2 2 Notation for Numbers Definition Integers Z = {... 2, 1, 0, 1, 2,...} Reals R. : R Z floor of x, the greatest integer x. : R Z ceiling of x, the least integer x Example π = 3 = e
3 3 Simple properties x = x, hence x = x x + t = x + t and x + t = x + t, for all t Z Fact Let k, m, n Z such that k > 0 and m n. The number of multiples of k in the interval [n.. m] is m k n 1 k.
4 4 Examples 1.1.4(b) = 1; = 0 (d) 3 3 = 1; the same for every noninteger (a) Give x, y s.t. x + y < x + y. 3π + e = = 11 < 12 = = 3π + e
5 5 Divisibility Let m, n Z. m n means m is a divisor of n, defined by n = km for some k Z Also stated: n is divisible by m, m is a divisor of n m n - negation of m n Notion of divisibility applies to all integers positive, negative and zero. 1 m, 1 m, m m, m m, for every m 0 n 0 for every n; 0 n except n = 0
6 6 Notions derived from divisibility Numbers > 1 divisible only by 1 and themselves are primes. The greatest common divisor of n, m Z is gcd(m, n) = max { d N : d m d n }. Numbers m and n s.t. gcd(m, n) = 1 are said to be relatively prime or co-prime. The least common multiple of n, m Z is lcm(m, n) = min { d N : m d n d }. NB gcd(m, n) and lcm(m, n) are always taken as positive gcd( 4, 6) = gcd(4, 6) = gcd( 4, 6) = gcd(4, 6) = 2 lcm( 5, 5) =... = 5
7 7 Absolute Value x = { x, if x 0 x, if x < 0 NB gcd(m, n) lcm(m, n) = m n
8 Examples True or False. Explain briefly. (a) n 1 only if n = 1 (for n Z also n = 1) (b) n n always (c) n n 2 always 1.2.7(b) gcd(0, n) = n Can two even integers be relatively prime? No; why? (b) Find m, n, s st 1 m + 1 n = 1 s with s < lcm(n, m). In fact, if such s exists it must be s < m, s < n. NB Representing fractions (i.e. rational numbers) in the form r = 1 n n n k, n 1 > n 2 >... > n k 8 is called Egyptian fractions. Note that all denominators must be different; it is always possible, but not always easy.
9 Examples True or False. Explain briefly. (a) n 1 only if n = 1 (for n Z also n = 1) (b) n n always (c) n n 2 always 1.2.7(b) gcd(0, n) = n Can two even integers be relatively prime? No; why? (b) Find m, n, s st 1 m + 1 n = 1 s with s < lcm(n, m). In fact, if such s exists it must be s < m, s < n. NB Representing fractions (i.e. rational numbers) in the form r = 1 n n n k, n 1 > n 2 >... > n k 9 is called Egyptian fractions. Note that all denominators must be different; it is always possible, but not always easy.
10 Examples True or False. Explain briefly. (a) n 1 only if n = 1 (for n Z also n = 1) (b) n n always (c) n n 2 always 1.2.7(b) gcd(0, n) = n Can two even integers be relatively prime? No; why? (b) Find m, n, s st 1 m + 1 n = 1 s with s < lcm(n, m). In fact, if such s exists it must be s < m, s < n. NB Representing fractions (i.e. rational numbers) in the form r = 1 n n n k, n 1 > n 2 >... > n k 10 is called Egyptian fractions. Note that all denominators must be different; it is always possible, but not always easy.
11 11 Sets A set is defined by the collection of its elements. Sets are typically described by: (a) Explicit enumeration of their elements S 1 = {a, b, c} = {a, a, b, b, b, c} = {b, c, a} =... three elements S 2 = {a, {a}} S 3 = {a, b, {a, b}} S 4 = {} S 5 = {{{}}} S 6 = { {}, {{}} } two elements zero elements three elements one element two elements
12 12 (b) Specifying the properties their elements must satisfy; the elements are taken from some universal domain. A typical description involves a logical property P(x) S = { x : x X P(x) } = { x X : P(x) } We distinguish between an element and the set comprising of this single element. Thus always a {a}. Set {} is empty (no elements); set {{}} is nonempty it has one element. There is only one empty set; only one set consisting of a single a; only one set of all natural numbers.
13 13 (c) Constructions from other sets (already defined) Union, intersection, set difference, symmetric difference, complementation Power set P(X ) = { A : A X } Cartesian product (below) Empty set, also written {} X for all sets X. S T S is a subset of T ; includes the case of T T S T a proper subset: S T and S T NB An element of a set and a subset of that set are two different concepts a {a, b}, a {a, b}; {a} {a, b}, {a} / {a, b}
14 14 Cardinality Number of elements in a set X ; (various notations) X = #(X ) = card(x ) Always P(X ) = 2 X [m.. n] interval of integers; it is empty if n < m [m.. n] = n m + 1, for n m = 0 P( ) = { } P( ) = 1 P(P( )) = {, { }}... {a} = 1 P({a}) = {, {a}} P({a}) = 2...
15 15 Examples Find the cardinalities of sets 1 { 1 n : n [1.. 4] } = 4 four indices, no repetitions of values 2 { n 2 n : n [0.. 4] } = 4 one repetition of value 3 { 1 n 2 : n P 2 n n < 11 } = 5 4 { 2 + ( 1) n : n N } = 2 which are the two elements?
16 16 Sets of Numbers Natural numbers N = {0, 1, 2,...} Positive integers P = {1, 2,...} common notation N >0 = Z >0 = N \ 0 Integers Z = {..., n, (n 1),..., 1, 0, 1, 2,...} Rational numbers (fractions) Q = { } m n : m, n Z, n 0 Real numbers R In P N Z different symbols denote different numbers. In Q and R the standard representation is not necessarily unique.
17 17 NB Proper ways to introduce reals include Dedekind cuts and Cauchy sequences, neither of which will be discussed here. Natural numbers etc. are either axiomatized or constructed a from sets (0 = def {}, n + 1 = def n {n}) a If we need to emphasise that an object (expression, formula) is defined through an equality we use the symbol def =. It denotes that the object on the left is defined by the formula/expression given on the right.
18 18 Number sets and their containments Derived sets of positive numbers P N Z Q R P = N >0 = Z >0 = {n : n 1} Q >0 = {r : r = k l > 0} R >0 Derived sets of integers 2Z = { 2x : x Z } 3Z + 1 = { 3x + 1 : x Z } the even numbers
19 19 Intervals of numbers (applies to any type) [a, b] = { x : a x b } (a, b) = { x : a < x < b } [a, b] [a, b) (a, b] (a, b) NB (a, a) = (a, a] = [a, a) = ; however [a, a] = {a}. Intervals of P, N, Z are finite: if m n [m.. n] = {m, m + 1,..., n} [m.. n] = n m + 1
20 20 Set Operations Union A B; Intersection A B Note that there is a correspondence between set operations and logical operators (to be discussed in Topic-2) One can match set A with that subset of the universal domain, where the property a holds, then match B with the subset where b holds. Then A B a or b; A B a and b We say that A, B are disjoint if A B =. NB A B = B A B A B = B A B
21 21 Other set operations A \ B difference, set difference, relative complement. It corresponds (logically) to a but not b A B symmetric difference A B = def (A \ B) (B \ A) It corresponds to a and not b or b and not a; it is termed xor (exclusive or) A c = A set complement w.r.t. the universe. It corresponds to not a.
22 22 Cartesian Product S T = def { (s, t) : s S, t T }, where (s, t) is an ordered pair n i=1s i def = { (s 1,..., s n ) : s k S k, for 1 k n } S 2 = S S, S 3 = S S S,..., S n = n 1 S,... S =, for every S S T = S T, n i=1 S i = n i=1 S i
23 23 Venn diagrams p23 26: are a simple graphical tool to reason about the algebraic properties of set operations. De Morgan laws p 25, Table 1: are the rules satisfied by set operations, esp. those involving complementation. They are often termed set algebra rules, due to their partial correspondence to the algebra of positive integers.
24 24 Examples Σ = {a, b} (a) All subsets of Σ :, {a}, {b}, {a, b} (b) P(Σ) = A A? =, A? = A for all A Relate the cardinalities A B = A + B A B hence A B + A B = A + B A \ B = A A B A B = A + B 2 A B
25 25 Formal Languages Σ alphabet, a finite, nonempty set Examples (of various alphabets and their intended uses) Σ = {a, b,..., z} for single words (in lower case) Σ = {,, a, b,..., z} for composite terms Σ = {0, 1} for binary integers Σ = {0, 1,..., 9} for decimal integers The above cases all have a natural ordering; it is not required in general, thus the set of all Chinese characters forms a (formal) alphabet.
26 26 word - any finite string of symbols from Σ ω = aba, ω = ,... also: empty word λ length(ω) # of symbols in ω length(aaa) = 3, length(λ) = 0 The only operation on words (discussed here) is concatenation, written as juxtaposition νω, ωνω, abω, ωbν,... NB λω = ω = ωλ length(νω) = length(ν) + length(ω)
27 27 Notation: Σ k set of all words of length k We often identify Σ 0 = {λ}, Σ 1 = Σ. Σ set of all words (of all lengths) Σ + set of all nonempty words (of any positive length) Σ = Σ 0 Σ 1 Σ 2... ; Σ n = Σ + = Σ 1 Σ 2... = Σ \ {λ} n i=0 Σ i A language is a subset of Σ. Typically, only the subsets that can be formed (or described) according to certain rules are of interest. Such a collection of descriptive/formative rules is termed a grammar.
28 28 Examples Number of elements in the sets (cont d) (e) Σ where Σ = {a, b, c} Σ = (f) { ω Σ : length(ω) 4 } where Σ = {a, b, c} Σ 4 = = = = 121
29 29 Examples Number of elements in the sets (cont d) (e) Σ where Σ = {a, b, c} Σ = (f) { ω Σ : length(ω) 4 } where Σ = {a, b, c} Σ 4 = = = = 121
30 30 Functions and their Properties We deal with functions as a set-theoretic concept, it being a special kind of correspondence (between two sets). f : S T describes pairing of the sets: it means that f assigns to every element s S a unique element t T. To emphasise where a specific element is sent, we can write f : x y, which is equivalent to f (x) = y. S domain of f, symbol: Dom(f ) T codomain of f, symbol: Codom(f ) { f (x) : x Dom(f ) } image of f, symbol: Im(f ) Im(f ) Codom(f ) We observe that every function maps its domain onto its image, but only into its codomain.
31 31 Function is called 1 1 (one-to-one) or injective if different x implies different f (x), i.e. f (x) = f (y) x = y Examples (of functions that are not 1 1) absolute value floor, ceiling length of a word most functions of two or more arguments, when viewed as a function of a single pair of arguments
32 32 Composition of Functions Auxilliary notation f : x y, f : A B The former means that x is mapped to y; the latter means that B is the image of A under f. NB Observe the difference between and Composition of functions is described as g f : x g(f (x)), requiring Im(f ) Dom(g)
33 33 If a function maps a set into itself, i.e. when Dom(f ) = Codom(f ) (and thus Im(f ) Dom(f )), the function can be composed with itself iterated f f, f f f,..., written also f 2, f 3,... Composition is associative h (g f ) = (h g) f, can write h g f Identity function on S i S (x) = x, x S; Dom(i) = Codom(i) = Im(i) = S For g : S T g i S = g, i T g = g
34 34 Examples Regarding length : {a, b} N (c) length(λ) = 0 (d) Im(length) = N Σ as above and g(n) = def { ω Σ : length(ω) n }, n N. Here g(n) is a function that has a complex object as its value for any given argument it maps N into P(Σ ). (a c) g(0)? = {λ} g(1)? = {λ, a, b}, g(2)? = {λ, a, b, aa, ab, ba, bb} In general g(n) = n i=0 Σi = Σ n.
35 35 Examples (cont d) (d) Are all g(n) finite? Yes. (e) Give an example of a set in P(Σ ) that is not in Im(g) any infinite subset of Σ (infinite language) any finite language that excludes some intermediate length words, e.g. {λ, a}, {a, b}, {λ, a, aa},... Find g(n) It is n = 2 n Regarding gcd : P P P (c) Im(gcd) = P as gcd(n, n) = n x 3 x f (x) = x 0 x < 1 x 3 x < 0 (c) Im(f )? = R 0
36 36 Examples (cont d) (d) Are all g(n) finite? Yes. (e) Give an example of a set in P(Σ ) that is not in Im(g) any infinite subset of Σ (infinite language) any finite language that excludes some intermediate length words, e.g. {λ, a}, {a, b}, {λ, a, aa},... Find g(n) It is n = 2 n Regarding gcd : P P P (c) Im(gcd) = P as gcd(n, n) = n x 3 x f (x) = x 0 x < 1 x 3 x < 0 (c) Im(f )? = R 0
37 37 Examples (cont d) (d) Are all g(n) finite? Yes. (e) Give an example of a set in P(Σ ) that is not in Im(g) any infinite subset of Σ (infinite language) any finite language that excludes some intermediate length words, e.g. {λ, a}, {a, b}, {λ, a, aa},... Find g(n) It is n = 2 n Regarding gcd : P P P (c) Im(gcd) = P as gcd(n, n) = n x 3 x f (x) = x 0 x < 1 x 3 x < 0 (c) Im(f )? = R 0
38 38 Examples (cont d) (d) Are all g(n) finite? Yes. (e) Give an example of a set in P(Σ ) that is not in Im(g) any infinite subset of Σ (infinite language) any finite language that excludes some intermediate length words, e.g. {λ, a}, {a, b}, {λ, a, aa},... Find g(n) It is n = 2 n Regarding gcd : P P P (c) Im(gcd) = P as gcd(n, n) = n x 3 x f (x) = x 0 x < 1 x 3 x < 0 (c) Im(f )? = R 0
39 39 gcd Example Reconsider gcd as a higher-order function, defined by m if m = n gcd(f )(m, n) = f (m n, n) if m > n f (m, n m) if m < n Its type is now gcd : (P 2 P) (P 2 P) that is, it maps each partial function (from pairs of positive integers to a positive integer) to a (partial) function of the same type. The worst such function is the nowhere defined function f (m, n) =.
40 40 Consider the sequence gcd Example cont d f, gcd(f ), gcd(gcd(f )),..., gcd i (f ),... and observe that the i th element of this sequence is an approximation of the gcd function that works as long as the depth of the recursion is less than i 1. Since we proved that the original gcd function terminates, we can deduce that the limit of this sequence exists, and is the original gcd. It also is the least fixpoint of gcd i.e. the simplest solution f to the equation f = gcd(f ). This, in a nutshell, explains how the semantics of recursive procedures is defined in CS. How all this works is somewhat beyond the scope of COMP9020 but still serves the purpose of motivating why we discuss functions, their composition, iteration, and fixpoints.
41 41 Properties of Functions We ve met: one-to-one (1 1), onto Inverse function f 1 : T S; for a given f : S T exists exactly when f is both 1 1 and onto. Image of a subdomain A under a function f (A) = { f (s) : s A } = { t T : t = f (s) for some s A } Inverse image - f (B) = { s S : f (s) B } S; it is defined for every f If f 1 exists then f (B) = f 1 (B) f ( ) =, f ( ) =
42 42 Examples f and g are shift functions N N defined by f (n) = n + 1, and g(n) = max(0, n 1) (c) f is 1 1, not onto: f (N) = N \ {0} = P (d) g is onto, not 1 1: g(0) = g(1) (e) f and g do not commute: g f : n (n + 1) 1 = n, thus g f = i N f g : 0 1, hence f g i N NB f g is the identity when restricted to P
43 43 NB For a finite set S and f : S S the properties 1 onto, and are equivalent. (Proof suggestion?) Examples 1.7.6(c) Is length : Σ N onto? Yes: length ({n}) = Σ n (d) length (2)? = {aa, ab, ac, bb,..., cc}
44 44 NB For a finite set S and f : S S the properties 1 onto, and are equivalent. (Proof suggestion?) Examples 1.7.6(c) Is length : Σ N onto? Yes: length ({n}) = Σ n (d) length (2)? = {aa, ab, ac, bb,..., cc}
45 45 Examples Verify that f : R R R R defined by f (x, y) = (x + y, x y) is invertible. The inverse is f 1 (a, b) = ( a+b 2, a b 2 ); substituting shows that f f 1 = i R R
46 46 Sec. 1.8 Supplementary exercises 1.8.2(b) When (A \ B) \ C = A \ (B \ C)? From Venn diagram (A \ B) \ C = A B C; A \ (B \ C) = (A B) (A C). Equality would require that A C A B C; however, these two sets are disjoint, thus equal only when both are empty. One verifies that A C = is also a satisfactory condition and that, in this case, both set expressions simplify to A \ B How many third powers are 1, 000, 000 and end in 9? (solve without calculator). n 3 = 9 (mod 10) only when n = 9 (mod 10), and n 3 1, 000, 000 when n 10. Hence all such n are 9, 19,..., 99. Try the same question for n 4.
47 47 Examples Σ = {a, b}; relate it to Σ (a) Is there an onto Σ Σ? No: Σ = 2, Σ =. (b) Is there an onto Σ Σ? Yes, eg f (ω) = a when length(ω) - odd, f (ω) = b when length(ω) - even. The following is not completely correct f : ω first letter of ω Reason: f (λ) is not defined.
COMP9020 Lecture 3 Session 2, 2016 Sets, Functions, and Sequences. Revision: 1.3
1 COMP9020 Lecture 3 Session 2, 2016 Sets, Functions, and Sequences Revision: 1.3 2 Divisibility Let m, n Z. m n means m is a divisor of n, defined by n = km for some k Z (Also stated as: n is divisible
More informationSets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth
Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended
More informationWeek Some Warm-up Questions
1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationMathematics Review for Business PhD Students
Mathematics Review for Business PhD Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More informationDiscrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams
Contents : basic definitions and notation A set is an unordered collection of its elements (or members). The set is fully specified by its elements. Usually capital letters are used to name sets and lowercase
More informationMathematics Review for Business PhD Students Lecture Notes
Mathematics Review for Business PhD Students Lecture Notes Anthony M. Marino Department of Finance and Business Economics Marshall School of Business University of Southern California Los Angeles, CA 90089-0804
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationSet Theory. CSE 215, Foundations of Computer Science Stony Brook University
Set Theory CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 Set theory Abstract set theory is one of the foundations of mathematical thought Most mathematical
More information1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points
Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The
More informationSets McGraw-Hill Education
Sets A set is an unordered collection of objects. The objects in a set are called the elements, or members of the set. A set is said to contain its elements. The notation a A denotes that a is an element
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More information0 Sets and Induction. Sets
0 Sets and Induction Sets 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 A to denote that a is an element of the set
More informationBASIC MATHEMATICAL TECHNIQUES
CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationWith Question/Answer Animations. Chapter 2
With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationAnalysis I. Classroom Notes. H.-D. Alber
Analysis I Classroom Notes H-D Alber Contents 1 Fundamental notions 1 11 Sets 1 12 Product sets, relations 5 13 Composition of statements 7 14 Quantifiers, negation of statements 9 2 Real numbers 11 21
More informationIntroduction to Automata
Introduction to Automata Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr 1 /
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationToday s topics. Introduction to Set Theory ( 1.6) Naïve set theory. Basic notations for sets
Today s topics Introduction to Set Theory ( 1.6) Sets Definitions Operations Proving Set Identities Reading: Sections 1.6-1.7 Upcoming Functions A set is a new type of structure, representing an unordered
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationChapter 0 Introduction. Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin
Chapter 0 Introduction Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin October 2014 Automata Theory 2 of 22 Automata theory deals
More informationCISC 1100: Structures of Computer Science
CISC 1100: Structures of Computer Science Chapter 2 Sets and Sequences Fordham University Department of Computer and Information Sciences Fall, 2010 CISC 1100/Fall, 2010/Chapter 2 1 / 49 Outline Sets Basic
More informationMAT115A-21 COMPLETE LECTURE NOTES
MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes
More informationBackground for Discrete Mathematics
Background for Discrete Mathematics Huck Bennett Northwestern University These notes give a terse summary of basic notation and definitions related to three topics in discrete mathematics: logic, sets,
More informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 9 Sets, Functions, and Relations: Part I 1 What is a Set? Set Operations Identities Cardinality of a Set Outline Finite and Infinite Sets Countable and Uncountable
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationMATH 201 Solutions: TEST 3-A (in class)
MATH 201 Solutions: TEST 3-A (in class) (revised) God created infinity, and man, unable to understand infinity, had to invent finite sets. - Gian Carlo Rota Part I [5 pts each] 1. Let X be a set. Define
More informationNotation Index. gcd(a, b) (greatest common divisor) NT-16
Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9
More informationA set is an unordered collection of objects.
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 elements, or members of the set. A set is said to contain
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationMAS114: Solutions to Exercises
MAS114: s to Exercises Up to week 8 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationIntroduction to Proofs
Introduction to Proofs Notes by Dr. Lynne H. Walling and Dr. Steffi Zegowitz September 018 The Introduction to Proofs course is organised into the following nine sections. 1. Introduction: sets and functions
More informationSets. Introduction to Set Theory ( 2.1) Basic notations for sets. Basic properties of sets CMSC 302. Vojislav Kecman
Introduction to Set Theory ( 2.1) VCU, Department of Computer Science CMSC 302 Sets Vojislav Kecman A set is a new type of structure, representing an unordered collection (group, plurality) of zero or
More informationDiscrete Basic Structure: Sets
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) Discrete Basic Structure: Sets Discrete Math Team 2 -- KS091201 MD W-07 Outline What is a set? Set properties Specifying a set Often used sets The universal
More information2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Spring
c Dr Oksana Shatalov, Spring 2015 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More informationn CS 160 or CS122 n Sets and Functions n Propositions and Predicates n Inference Rules n Proof Techniques n Program Verification n CS 161
Discrete Math at CSU (Rosen book) Sets and Functions (Rosen, Sections 2.1,2.2, 2.3) TOPICS Discrete math Set Definition Set Operations Tuples 1 n CS 160 or CS122 n Sets and Functions n Propositions and
More informationTopics in Logic and Proofs
Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2
More informationNumber Theory and Counting Method. Divisors -Least common divisor -Greatest common multiple
Number Theory and Counting Method Divisors -Least common divisor -Greatest common multiple Divisors Definition n and d are integers d 0 d divides n if there exists q satisfying n = dq q the quotient, d
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationCS 173: Discrete Structures. Eric Shaffer Office Hour: Wed. 1-2, 2215 SC
CS 173: Discrete Structures Eric Shaffer Office Hour: Wed. 1-2, 2215 SC shaffer1@illinois.edu Agenda Sets (sections 2.1, 2.2) 2 Set Theory Sets you should know: Notation you should know: 3 Set Theory -
More informationNotes. Functions. Introduction. Notes. Notes. Definition Function. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y.
Functions Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Section 2.3 of Rosen cse235@cse.unl.edu Introduction
More informationChapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60
MATH 213 Chapter 2: Basic Structures Dr. Eric Bancroft Fall 2013 Dr. Eric Bancroft MATH 213 Fall 2013 1 / 60 Chapter 2 - Basics Structures 2.1 - Sets 2.2 - Set Operations 2.3 - Functions 2.4 - Sequences
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More information1 Chapter 1: SETS. 1.1 Describing a set
1 Chapter 1: SETS set is a collection of objects The objects of the set are called elements or members Use capital letters :, B, C, S, X, Y to denote the sets Use lower case letters to denote the elements:
More informationToday s Topics. Methods of proof Relationships to logical equivalences. Important definitions Relationships to sets, relations Special functions
Today s Topics Set identities Methods of proof Relationships to logical equivalences Functions Important definitions Relationships to sets, relations Special functions Set identities help us manipulate
More informationMath 13, Spring 2013, Lecture B: Midterm
Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.
More informationApplied Cryptography and Computer Security CSE 664 Spring 2017
Applied Cryptography and Computer Security Lecture 11: Introduction to Number Theory Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline What we ve covered so far: symmetric
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs
More informationNotes on Sets, Relations and Functions
PURE MTH 3002 Topology & Analysis III (3246) 2002 Notes on Sets, Relations and Functions These are some notes taken from Mathematical Applications (now Mathematics for Information Technology (MIT)). They
More informationSETS. JEE-Mathematics
STS J-Mathematics ST : A set is a collection of well defined objects which are distinct from each other Set are generally denoted by capital letters A, B, C,... etc. and the elements of the set by a, b,
More informationA Semester Course in Basic Abstract Algebra
A Semester Course in Basic Abstract Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved December 29, 2011 1 PREFACE This book is an introduction to abstract algebra course for undergraduates
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More information1. SET 10/9/2013. Discrete Mathematics Fajrian Nur Adnan, M.CS
1. SET 10/9/2013 Discrete Mathematics Fajrian Nur Adnan, M.CS 1 Discrete Mathematics 1. Set and Logic 2. Relation 3. Function 4. Induction 5. Boolean Algebra and Number Theory MID 6. Graf dan Tree/Pohon
More informationLESSON RELATIONS & FUNCTION THEORY
2 Definitions LESSON RELATIONS & FUNCTION THEORY Ordered Pair Ordered pair of elements taken from any two sets P and Q is a pair of elements written in small brackets and grouped together in a particular
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More information1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A.
1.A Sets, Relations, Graphs, and Functions 1.A.1 Set a collection of objects(element) Let A be a set and a be an elements in A, then we write a A. How to specify sets 1. to enumerate all of the elements
More informationSet Theory. CPT Section D Quantitative Aptitude Chapter 7 Brijeshwar Prasad Gupta
Set Theory CPT Section D Quantitative Aptitude Chapter 7 Brijeshwar Prasad Gupta Learning Objectives Number system Set Theory Set operations Product of Sets MCQ Number system Natural numbers:- N N = {1,2,3..}
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationHarvard CS121 and CSCI E-121 Lecture 2: Mathematical Preliminaries
Harvard CS121 and CSCI E-121 Lecture 2: Mathematical Preliminaries Harry Lewis September 5, 2013 Reading: Sipser, Chapter 0 Sets Sets are defined by their members A = B means that for every x, x A iff
More informationCSE 20. Final Review. CSE 20: Final Review
CSE 20 Final Review Final Review Representation of integers in base b Logic Proof systems: Direct Proof Proof by contradiction Contraposetive Sets Theory Functions Induction Final Review Representation
More informationPart I, Number Systems. CS131 Mathematics for Computer Scientists II Note 1 INTEGERS
CS131 Part I, Number Systems CS131 Mathematics for Computer Scientists II Note 1 INTEGERS The set of all integers will be denoted by Z. So Z = {..., 2, 1, 0, 1, 2,...}. The decimal number system uses the
More informationC-N Math 207 Discrete Math
C-N Math 207 - Massey, 1 / 70 C-N Math 207 Discrete Math Kenneth Massey September 16, 2011 Question C-N Math 207 - Massey, 2 / 70 Introduction What is the smallest positive number? Sets C-N Math 207 -
More informationC-N Math 207 Discrete Math
C-N Math 207 Discrete Math Kenneth Massey September 16, 2011 C-N Math 207 - Massey, 1 / 70 Question Introduction What is the smallest positive number? C-N Math 207 - Massey, 2 / 70 Sets Introduction a
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationReview CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.
CHAPTER 2 Review 2.1 Definitions in Chapter 2 2.1 Set; Element; Member; Universal Set 2.2 Subset 2.3 Proper Subset 2.4 The Empty Set, 2.5 Set Equality 2.6 Cardinality; Infinite Set 2.7 Complement 2.8 Intersection
More informationComment: The induction is always on some parameter, and the basis case is always an integer or set of integers.
1. For each of the following statements indicate whether it is true or false. For the false ones (if any), provide a counter example. For the true ones (if any) give a proof outline. (a) Union of two non-regular
More informationAssignment #2 COMP 3200 Spring 2012 Prof. Stucki
Assignment #2 COMP 3200 Spring 2012 Prof. Stucki 1) Construct deterministic finite automata accepting each of the following languages. In (a)-(c) the alphabet is = {0,1}. In (d)-(e) the alphabet is ASCII
More informationA B is shaded A B A B
NION: Let and be subsets of a universal set. The union of sets and is the set of all elements in that belong to or to or to both, and is denoted. Symbolically: = {x x or x } EMMPLE: Let = {a, b, c, d,
More informationSETS. Chapter Overview
Chapter 1 SETS 1.1 Overview This chapter deals with the concept of a set, operations on sets.concept of sets will be useful in studying the relations and functions. 1.1.1 Set and their representations
More informationChapter 2 - Basics Structures
Chapter 2 - Basics Structures 2.1 - Sets Definitions and Notation Definition 1 (Set). A set is an of. These are called the or of the set. We ll typically use uppercase letters to denote sets: S, A, B,...
More informationCSCE 222 Discrete Structures for Computing
CSCE 222 Discrete Structures for Computing Sets and Functions Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sets Sets are the most fundamental discrete structure on which all other discrete
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. College Algebra for STEM
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics College Algebra for STEM Marcel B. Finan c All Rights Reserved 2015 Edition To my children Amin & Nadia Preface From
More informationFoundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
More informationWhat Is a Language? Grammars, Languages, and Machines. Strings: the Building Blocks of Languages
Do Homework 2. What Is a Language? Grammars, Languages, and Machines L Language Grammar Accepts Machine Strings: the Building Blocks of Languages An alphabet is a finite set of symbols: English alphabet:
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationSets, Functions and Relations
Chapter 2 Sets, Functions and Relations A set is any collection of distinct objects. Here is some notation for some special sets of numbers: Z denotes the set of integers (whole numbers), that is, Z =
More informationFoundations Revision Notes
oundations Revision Notes hese notes are designed as an aid not a substitute for revision. A lot of proofs have not been included because you should have them in your notes, should you need them. Also,
More informationSET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas.
SETS: set is a well-defined collection of objects. SET THEORY The objects in a set are called elements or members of the set. If x is an object of set, we write x and is read as x is an element of set
More informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationReview 1. Andreas Klappenecker
Review 1 Andreas Klappenecker Summary Propositional Logic, Chapter 1 Predicate Logic, Chapter 1 Proofs, Chapter 1 Sets, Chapter 2 Functions, Chapter 2 Sequences and Sums, Chapter 2 Asymptotic Notations,
More information