Set and element. Cardinality of a set. Empty set (null set) Finite and infinite sets. Ordered pair / n-tuple. Cartesian product. Proper subset.

Save this PDF as:

Size: px
Start display at page:

Download "Set and element. Cardinality of a set. Empty set (null set) Finite and infinite sets. Ordered pair / n-tuple. Cartesian product. Proper subset."

Transcription

1 Set and element Cardinality of a set Empty set (null set) Finite and infinite sets Ordered pair / n-tuple Cartesian product Subset Proper subset Power set Partition

2 The cardinality of a set is the number of elements in the set. The cardinality of the set A is denoted by A or #A. A set is a collection of objects; the objects in the set are called elements. If A is a set, and a is an element of A, then we write a A. A set is finite if its cardinality is finite, that is, the set contains finitely many elements. A set is infinite if it contains infinitely many elements. The empty set is the set that contains zero elements. The empty set is denoted by. If A and B are sets, the cartesian product A B is the set of ordered pairs where the first element is from A, and the second is from B. A B = {(a, b) : a A, b B}. (a, b) A B a A and b B An ordered pair is an ordered list of two elements. More generally, an ordered n-tuple is an ordered list of n elements. The standard notation is to use a comma separated list enclosed by parenthesis: (a 1, a 2,..., a n ). The set B is a proper subset of A if B is a subset of A that is not equal A, and we write B A. B A B A and B A A set A is a subset of a set B if every element of A is an element of B. A B x A x B Let A be a set, and let P P(A). The set P is a partition of A if 1. X P X = A; 2. if X 1, X 2 P, then X 1 X 2 = X 1 X 2. The power set of a set A is the set of all subsets of A. The power set of A is denoted by P(A). P(A) = {B : B A}

3 Set equality Union Finite and infinite union Intersection Finite and infinite intersection Set difference Disjoint sets Double containment principle Complement De Morgan s laws

4 The union of two sets, A and B, is the set of all element in A or in B. The union of these sets is denoted by A B. A B = {x : x A or x B} x A B x A or x B Two sets, A and B, are equal if all the elements of A are elements of B and vice versa. A = B x A if and only if x B The intersection of two sets, A and B, is the set of all element in A and in B. The intersection of these sets is denoted by A B. A B = {x : x A and x B} x A B x A and x B A finite union is the union of finitely many sets. An infinite union is the union of infinitely many sets. Let A 1, A 2, A 3,... be sets, then n A i = {x : x A i for some 1 i n} i=1 A i = {x : x A i for some i N} i N If A and B are sets, the, is the difference A B is the set of elements in A that are not in B. A B = {x : x A and x / B} x A B x A and x B A finite intersection is the intersection of finitely many sets. An infinite intersection is the intersection of infinitely many sets. Let A 1, A 2, A 3,... be sets, then n A i = {x : x A i for all 1 i n} i=1 A i = {x : x A i for all i N} i N Let A and B be sets. Then A = B if and only if A B and B A. A = B A B and B A Two sets, A and B, are disjoint if A B =. For any sets A and B, (A B) c = A c B c, (A B) c = A c B c. The complement of a set A is the set of all elements that are not in A, and is denoted by A c or A. If A B, then the complement of A in B is the set of elements in B that are not in A, i.e. A c = B A. A c = {x : x / A} x A c x A

5 Statement al statement al and al or al negation Implies Converse If and only if Contrapositive Universal quantifier: for all

6 A statement is a sentence or mathematical expression that is definitely true or definitely false. A statement is a sentence or mathematical expression that is definitively true or definitively false. The statement P or Q is true if P is true or Q is true (or both statements are true). The statement P and Q is false only if both P is false and Q is false. P Q is true P is true or Q is true The statement P and Q is true if both P is true and Q is true. Otherwise P and Q is false. P Q is true P is true and Q is true The statement P implies Q (P Q) is false if P is true and Q is false. Otherwise the statement is true. P Q is false P is false and Q is true The negation of a statement P is the statement P. The statement P is true if P is true. The statement of P is false if P is true. P is true (resp. false) P is false (resp. true) The statement P if and only if Q (P Q) is equivalent to the statement (P Q) (Q P ). In other words, P Q is true if both P Q and Q P are true. P Q (P Q) (Q P ) The converse of P Q is the statement Q P. In general, these two statements are independent, meaning that the truthfulness of one statement does not determine the truthfulness of the other. The for all/each/every/any statement takes the form: for all P, we have Q. In other words, Q is true whenever P is true. In this light, for all statements can often be reworded as if-then statements (and vice versa). P, we have Q P Q The contrapositive of the statement if P, then Q is the statement if Q, then P. These statements are equivalent, meaning that they are either both true or both false. P Q Q P

7 Existential quantifier: there exists Negation of P Q Negation of P Q Negation of P Q Negation of P, we have Q Negation of P such that Q Proof List and entries

8 (P Q) = P Q The there exists statement takes the form: there exists P such that Q. This statement is true if there is at least one case where P is true and Q is true. (It maybe that there are many cases where P is false but Q is true.) P such that Q it is sometimes the case that P Q (P Q) = P Q (P Q) = P Q ( P, such that Q) = P we have Q ( P, we have Q) = P, such that Q A proof of a theorem is a written verification that shows that the theorem is definitely and unequivocally true. A theorem is a mathematical statement that is true and can be (and has been) verified as true. A list is an ordered sequence of objects. The objects in the list are called entries. Unlike sets, the order of entries matters, and entries may be repeated. A definition is an exact, unambiguous explanation of the meaning of a mathematical word or phrase.

9 List length List equality Empty list Multiplication principle Factorial n choose k Binomial theorem Inclusion-exclusion Addition principle Even

10 Two lists L and M are equal if they have the same length, and the i-th entry of L is the i-th entry of M. The length of a list is the number of entries in the list. Suppose in making a list of length n there are a i possible choices for the i-th entry. Then the total number of different lists that can be made in this way is a 1 a 2 a 3 a n. The empty list is the list with no entries, and is denoted by (). If n and k are integers, and 0 k n, then ( ) n n! = k k!(n k)!. If n is a non-negative integer, then n! is the number of non-repetitive lists of length n that can be made from n symbols. Thus 0! = 1, and if n > 1, then n! is the product of all integers from 1 to n. That is, if n > 1, then n! = n(n 1)(n 2) 2 1. If n is a non-negative integer, then If A and B are sets, then A B = A + B A B. (x + y) n = n k=0 ( ) n x k y n k. k An integer a is even if there exists an integer b such that a = 2b. a is even a = 2b for some b Z If A 1, A 2,..., A n are disjoint sets, then A 1 A 2 A n = A 1 + A A n.

11 Odd Divides Parity Prime Composite Greatest common divisor Least common multiple Well-ordering principle Division algorithm Basis for a topology Topology

12 If a and b are integers, then b divides a if there exists an integer q such that a = qb. In this case, b is a divisor of a, and a is a multiple of b. b a a = qb for some q Z An integer a is odd if there exists an integer b such that a = 2b + 1. a is odd a = 2b + 1 for some b Z A positive integer p > 1 is prime if the only divisors of p are 1 and p. p > 1 is prime a has exactly two positive divisors: 1 and p Two integers have the same parity if they are both even or both odd. Otherwise they have opposite parity. The greatest common divisor of two integers a and b, denoted gcd(a, b), is the largest integer that divides both a and b. A positive integer a is composite if there exists a positive integer b > 1 satisfying b a. a > 1 is composite b a and 1 < b < a Every non-empty subset of N contains a least element. The least common multiple of two integers a and b, denoted lcm(a, b), is the smallest positive integer is a multiple of both a and b. Let A be a set, and let B P(A). The set B is a basis for a topology on A if the following are satisfied. 1. If x A, then there exists B B such that x B. 2. If B 1, B 2 B and x B 1 B 2, then there exists B 3 B such that x B 3 and B 3 B 1 B 2. Given integers a and b with b > 0, there exist unique integers q and r that satisfy a = bq + r, where 0 r < b.

13 Open set Closed set Topology Topology Relation on a set Reflexive Symmetric Transitive Equivalence relation Equivalence class Relation between sets Inverse relation

14 Let A be a set, let B be a basis for a topology on A, and let U A. The set U is closed if U c is open. Let A be a set, let B be a basis for a topology on A, and let U A. The set U is open if for each x U, there exists B B such that x B and B U. Let R be a relation on A. The relation R is reflexive if a A implies that (a, a) R. Let A be a set. The set R is a relation on A if R A 2. Let R be a relation on A. The relation R is transitive if (a, b), (b, c) R implies that (a, c) R. Let R be a relation on A. The relation R is symmetric if (a, b) R implies that (b, a) R. Let R be an equivalence relation on A, and let a A. The equivalence class of a is the set [a] = {b A : (a, b) R}. Let R be a relation on A. The relation R is an equivalence relation (on A) if it is reflexive, symmetric, and transitive. x [a] (a, x) R Let R be a relation from A to B. The inverse of R is the relation from B to A given by R 1 = {(b, a) : (a, b) R}. Let A and B be sets. The set R is a relation from A to B if R A B. (x, y) R 1 (y, x) R

15 Function Domain/codomain/image Image of a set Inverse image of a set

16 Let f be a function from A to B. The domain of f is A. The codomain of f is B, and the image of f is the set {b B : (a, b) f}. In other words, the image of f is the set {f(a) : a A}. Let R be a relation from A to B. The relation R is a function if for each a A, R contains a unique element of the form (a, b). In this case, we write R(a) = b. Let f be a function from A to B, and let V B. Then the inverse image of V (or preimage of V ) is the set f 1 (V ) = {x A : f(x) V }. x f 1 (V ) f(x) V y V y = f(x) for some x f 1 (V ) Let f be a function from A to B, and let U A. Then the image of U is the set f(u) = {f(x) B : x U}. y f(u) y = f(x) for some x U x U f(x) f(u)

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

The Language of Mathematics

CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,

Review for Final Exam

Review for Final Exam Note: Warning, this is probably not exhaustive and probably does contain typos (which I d like to hear about), but represents a review of most of the material covered in Chapters

SETS, RELATIONS, AND FUNCTIONS

September 27, 2009 and notations Common Universal Subset and Power Set Cardinality Operations A set is a collection or group of objects or elements or members (Cantor 1895). the collection of the four

Math 3000 Running Glossary

Math 3000 Running Glossary Last Updated on: July 15, 2014 The definition of items marked with a must be known precisely. Chapter 1: 1. A set: A collection of objects called elements. 2. The empty set (

A set is a Many that allows itself to be thought of as a One. (Georg Cantor)

Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

Sets, Relations and Functions

Sets, Relations and Functions Eric Pacuit Department of Philosophy University of Maryland, College Park pacuit.org epacuit@umd.edu ugust 26, 2014 These notes provide a very brief background in discrete

vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

Logic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour

Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS

Today s Topics. Primes & Greatest Common Divisors

Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

Classical Analysis I

Classical Analysis I 1 Sets, relations, functions A set is considered to be a collection of objects. The objects of a set A are called elements of A. If x is an element of a set A, we write x A, and if

Some Definitions about Sets Definition: Two sets are equal if they contain the same elements. I.e., sets A and B are equal if x[x A x B]. Notation: A = B. Recall: Sets are unordered and we do not distinguish

Sets and functions. {x R : x > 0}.

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

It is time to prove some theorems. There are various strategies for doing

CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it

Sets. A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object.

Sets 1 Sets Informally: A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object. Examples: real numbers, complex numbers, C integers, All students in

Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

2.1.1 Examples of Sets and their Elements

Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define

Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

Clicker Question. Theorems/Proofs and Computational Problems/Algorithms MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES Tuesday, 1/21/14 General course Information Sets Reading: [J] 1.1 Optional: [H] 1.1-1.7 Exercises: Do before next class; not to hand in [J] pp. 12-14:

Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

Sets and set operations: cont. Functions.

CS 441 Discrete Mathematics for CS Lecture 8 Sets and set operations: cont. Functions. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Set Definition: set is a (unordered) collection of objects.

Logic, Sets, and Proofs

Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical

Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

31 is a prime number is a mathematical statement (which happens to be true).

Chapter 1 Mathematical Logic In its most basic form, Mathematics is the practice of assigning truth to welldefined statements. In this course, we will develop the skills to use known true statements to

This chapter describes set theory, a mathematical theory that underlies all of modern mathematics.

Appendix A Set Theory This chapter describes set theory, a mathematical theory that underlies all of modern mathematics. A.1 Basic Definitions Definition A.1.1. A set is an unordered collection of elements.

Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

Introducing Functions

Functions 1 Introducing Functions A function f from a set A to a set B, written f : A B, is a relation f A B such that every element of A is related to one element of B; in logical notation 1. (a, b 1

Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

Florida State University Course Notes MAD 2104 Discrete Mathematics I

Florida State University Course Notes MAD 2104 Discrete Mathematics I Florida State University Tallahassee, Florida 32306-4510 Copyright c 2011 Florida State University Written by Dr. John Bryant and Dr.

DISCRETE MATHEMATICS W W L CHEN. c W W L Chen, 1982.

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 982. This work is available free, in the hope that it will be useful. Any part of this work may be reproduced or transmitted in any form or by any means, electronic

Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

S(A) X α for all α Λ. Consequently, S(A) X, by the definition of intersection. Therefore, X is inductive.

MA 274: Exam 2 Study Guide (1) Know the precise definitions of the terms requested for your journal. (2) Review proofs by induction. (3) Be able to prove that something is or isn t an equivalence relation.

DISCRETE MATHEMATICS W W L CHEN

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free

Math 3000 Section 003 Intro to Abstract Math Homework 2

Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these

Notes. Sets. Notes. Introduction II. Notes. Definition. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.

Sets Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction

(Refer Slide Time: 1:41)

Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 10 Sets Today we shall learn about sets. You must

Algebraic Systems, Fall 2013, September 1, 2013 Edition. Todd Cochrane

Algebraic Systems, Fall 2013, September 1, 2013 Edition Todd Cochrane Contents Notation 5 Chapter 0. Axioms for the set of Integers Z. 7 Chapter 1. Algebraic Properties of the Integers 9 1.1. Background

Section 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.

M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider

The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

A 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

In mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann)

Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics

Mathematics Review for MS Finance Students

Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

CmSc 175 Discrete Mathematics Lesson 10: SETS A B, A B

CmSc 175 Discrete Mathematics Lesson 10: SETS Sets: finite, infinite, : empty set, U : universal set Describing a set: Enumeration = {a, b, c} Predicates = {x P(x)} Recursive definition, e.g. sequences

What is a set? Sets. Specifying a Set. Notes. The Universal Set. Specifying a Set 10/29/13

What is a set? Sets CS 231 Dianna Xu set is a group of objects People: {lice, ob, Clara} Colors of a rainbow: {red, orange, yellow, green, blue, purple} States in the S: {labama, laska, Virginia, } ll

Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li 2 Kishan Mehrotra 3 Syracuse University, New York L A TEX at January 11, 2007 (Part I) 1 No part of this book can be reproduced without permission from

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

Announcements. CompSci 230 Discrete Math for Computer Science Sets. Introduction to Sets. Sets

CompSci 230 Discrete Math for Computer Science Sets September 12, 2013 Prof. Rodger Slides modified from Rosen 1 nnouncements Read for next time Chap. 2.3-2.6 Homework 2 due Tuesday Recitation 3 on Friday

Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

Quantifiers are used to describe variables in statements. - The universal quantifier means for all. - The existential quantifier means there exists.

11 Quantifiers are used to describe variables in statements. - The universal quantifier means for all. - The existential quantifier means there exists. The phrases, for all x in R if x is an arbitrary

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

Automata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi

Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the

The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;

Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method

SETS. 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

Set (mathematics) From Wikipedia, the free encyclopedia A set in mathematics is a collection of well defined and distinct objects, considered as an object in its own right. Sets are one of the most fundamental

Section 4.3 Image and Inverse Image of a Set

Section 43 Image and Inverse Image of a Set Purpose of Section: To introduce the concept of the image and inverse image of a set We show that unions of sets are preserved under a mapping whereas only one-to-one

Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

1.1 Logical Form and Logical Equivalence 1

Contents Chapter I The Logic of Compound Statements 1.1 Logical Form and Logical Equivalence 1 Identifying logical form; Statements; Logical connectives: not, and, and or; Translation to and from symbolic

Discrete Mathematics Lecture 5. Harper Langston New York University

Discrete Mathematics Lecture 5 Harper Langston New York University Empty Set S = {x R, x 2 = -1} X = {1, 3}, Y = {2, 4}, C = X Y (X and Y are disjoint) Empty set has no elements Empty set is a subset of

Mathematical induction & Recursion

CS 441 Discrete Mathematics for CS Lecture 15 Mathematical induction & Recursion Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Proofs Basic proof methods: Direct, Indirect, Contradiction, By Cases,

Matthias Beck Ross Geoghegan. The Art of Proof. Basic Training for Deeper Mathematics

Matthias Beck Ross Geoghegan The Art of Proof Basic Training for Deeper Mathematics ! "#\$\$%&#'!()*+!!,-''!.)-/%)/#0! 1)2#3\$4)0\$!-5!"#\$%)4#\$&*'!! 1)2#3\$4)0\$!-5!"#\$%)4#\$&*#6!7*&)0*)'! 7#0!83#0*&'*-!7\$#\$)!90&:)3'&\$;!

Discrete Mathematics, Chapter 5: Induction and Recursion

Discrete Mathematics, Chapter 5: Induction and Recursion Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 5 1 / 20 Outline 1 Well-founded

Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

Lecture 4: Probability Spaces

EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 4: Probability Spaces Lecturer: Dr. Krishna Jagannathan Scribe: Jainam Doshi, Arjun Nadh and Ajay M 4.1 Introduction

We give a basic overview of the mathematical background required for this course.

1 Background We give a basic overview of the mathematical background required for this course. 1.1 Set Theory We introduce some concepts from naive set theory (as opposed to axiomatic set theory). The

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

Lecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett

Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.

Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.

Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a

OPERATIONS AND PROPERTIES

CHAPTER OPERATIONS AND PROPERTIES Jesse is fascinated by number relationships and often tries to find special mathematical properties of the five-digit number displayed on the odometer of his car. Today

2.1 Symbols and Terminology

2.1 Symbols and Terminology Definitions: set is a collection of objects. The objects belonging to the set are called elements, ormembers, oftheset. Sets can be designated in one of three different ways:

POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.

Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,

Solving and Graphing Inequalities

Algebra I Pd Basic Inequalities 3A What is the answer to the following questions? Solving and Graphing Inequalities We know 4 is greater than 3, so is 5, so is 6, so is 7 and 3.1 works also. So does 3.01

Theory of Computation

Theory of Computation For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Theory of Computation Regular Expressions and Finite Automata, Context-Free Grammar s

CHAPTER 1. Basic Ideas

CHPTER 1 asic Ideas In the end, all mathematics can be boiled down to logic and set theory. ecause of this, any careful presentation of fundamental mathematical ideas is inevitably couched in the language

GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

Sets and Subsets. Countable and Uncountable

Sets and Subsets Countable and Uncountable Reading Appendix A Section A.6.8 Pages 788-792 BIG IDEAS Themes 1. There exist functions that cannot be computed in Java or any other computer language. 2. There

The degree of a polynomial function is equal to the highest exponent found on the independent variables.

DETAILED SOLUTIONS AND CONCEPTS - POLYNOMIAL FUNCTIONS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions and Comments to ingrid.stewart@csn.edu. Thank you! PLEASE NOTE

Foundations of Logic and Mathematics

Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic

Section 4.2: The Division Algorithm and Greatest Common Divisors

Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948

8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

Notes 2 for Honors Probability and Statistics

Notes 2 for Honors Probability and Statistics Ernie Croot August 24, 2010 1 Examples of σ-algebras and Probability Measures So far, the only examples of σ-algebras we have seen are ones where the sample

Chapter 1. Logic and Proof

Chapter 1. Logic and Proof 1.1 Remark: A little over 100 years ago, it was found that some mathematical proofs contained paradoxes, and these paradoxes could be used to prove statements that were known

Algebra for Digital Communication

EPFL - Section de Mathématiques Algebra for Digital Communication Fall semester 2008 Solutions for exercise sheet 1 Exercise 1. i) We will do a proof by contradiction. Suppose 2 a 2 but 2 a. We will obtain

An Innocent Investigation

An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number

7 Relations and Functions

7 Relations and Functions In this section, we introduce the concept of relations and functions. Relations A relation R from a set A to a set B is a set of ordered pairs (a, b), where a is a member of A,

DISCRETE MATH: LECTURE 4

DISCRETE MATH: LECTURE 4 DR. DANIEL FREEMAN 1. Chapter 3.1 Predicates and Quantified Statements I A predicate is a sentence that contains a finite number of variables and becomes a statement when specific

The Mathematics Driving License for Computer Science- CS10410

The Mathematics Driving License for Computer Science- CS10410 Venn Diagram, Union, Intersection, Difference, Complement, Disjoint, Subset and Power Set Nitin Naik Department of Computer Science Venn-Euler

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers