# The Language of Mathematics

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 CHPTER 2 The Language of Mathematics 2.1. Set Theory 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, 4, 5}. The symbol is used to express that an element is (or belongs to) a set, for instance 3. Its negation is represented by, e.g. 7. If the set is finite, its number of elements is represented, e.g. if = {1, 2, 3, 4, 5} then = 5. Some important sets are the following: 1. N = {0, 1, 2, 3, } = the set of natural numbers Z = { 3, 2, 1, 0, 1, 2, 3, } = the set of integers. 3. Q = the set of rational numbers. 4. R = the set of real numbers. 5. C = the set of complex numbers. Is S is one of those sets then we also use the following notations: 2 1. S + = set of positive elements in S, for instance Z + = {1, 2, 3, } = the set of positive integers. 2. S = set of negative elements in S, for instance Z = { 1, 2, 3, } = the set of negative integers. 3. S = set of elements in S excluding zero, for instance R = the set of non zero real numbers. Set-builder notation. n alternative way to define a set, called setbuilder notation, is by stating a property (predicate) P (x) verified by exactly its elements, for instance = {x Z 1 x 5} = set of 1 Note that N includes zero for some authors N = {1, 2, 3, }, without zero. 2 When working with strings we will use a similar notation with a different meaning be careful not to confuse it. 21

2 2.1. SET THEORY 22 integers x such that 1 x 5 i.e.: = {1, 2, 3, 4, 5}. In general: = {x U p(x)}, where U is the domain of discourse in which the predicate P (x) must be interpreted, or = {x P (x)} if the domain of discourse for P (x) is implicitly understood. In set theory the term universal set is often used in place of domain of discourse for a given predicate. 3 Principle of Extension. Two sets are equal if and only if they have the same elements, i.e.: = B x (x x B). Subset. We say that is a subset of set B, or is contained in B, and we represent it B, if all elements of are in B, e.g., if = {a, b, c} and B = {a, b, c, d, e} then B. is a proper subset of B, represented B, if B but B, i.e., there is some element in B which is not in. Empty Set. set with no elements is called empty set (or null set, or void set), and is represented by or {}. Note that nothing prevents a set from possibly being an element of another set (which is not the same as being a subset!). For instance if = {1, a, {3, t}, {1, 2, 3}} and B = {3, t}, then obviously B is an element of, i.e., B. Power Set. The collection of all subsets of a set is called the power set of, and is represented P(). For instance, if = {1, 2, 3}, then P() = {, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, }. Exercise: Prove by induction that if = n then P() = 2 n. Multisets. Two ordinary sets are identical if they have the same elements, so for instance, {a, a, b} and {a, b} are the same set because they have exactly the same elements, namely a and b. However, in some applications it might be useful to allow repeated elements in a set. In that case we use multisets, which are mathematical entities similar to sets, but with possibly repeated elements. So, as multisets, {a, a, b} and {a, b} would be considered different, since in the first one the element a occurs twice and in the second one it occurs only once. 3 Properly speaking, the domain of discourse of set theory is the collection of all sets (which is not a set).

3 2.1. SET THEORY Venn Diagrams. Venn diagrams are graphic representations of sets as enclosed areas in the plane. For instance, in figure 2.1, the rectangle represents the universal set (the set of all elements considered in a given problem) and the shaded region represents a set. The other figures represent various set operations. Figure 2.1. Venn Diagram. B Figure 2.2. Intersection B. B Figure 2.3. Union B.

4 2.1. SET THEORY 24 Figure 2.4. Complement. B Figure 2.5. Difference B. B Figure 2.6. Symmetric Difference B Set Operations. 1. Intersection: The common elements of two sets: B = {x (x ) (x B)}. If B =, the sets are said to be disjoint. 2. Union: The set of elements that belong to either of two sets: B = {x (x ) (x B)}.

5 2.1. SET THEORY Complement: The set of elements (in the universal set) that do not belong to a given set: = {x U x }. 4. Difference or Relative Complement: The set of elements that belong to a set but not to another: B = {x (x ) (x B)} = B. 5. Symmetric Difference: Given two sets, their symmetric difference is the set of elements that belong to either one or the other set but not both. B = {x (x ) (x B)}. It can be expressed also in the following way: B = B B = ( B) (B ) Counting with Venn Diagrams. Venn diagram with n sets intersecting in the most general way divides the plane into 2 n regions. If we have information about the number of elements of some portions of the diagram, then we can find the number of elements in each of the regions and use that information for obtaining the number of elements in other portions of the plane. Example: Let M, P and C be the sets of students taking Mathematics courses, Physics courses and Computer Science courses respectively in a university. ssume M = 300, P = 350, C = 450, M P = 100, M C = 150, P C = 75, M P C = 10. How many students are taking exactly one of those courses? (fig. 2.7) M P C 235 Figure 2.7. Counting with Venn diagrams. We see that (M P ) (M P C) = = 90, (M C) (M P C) = = 140 and (P C) (M P C) = = 65.

6 2.1. SET THEORY 26 Then the region corresponding to students taking Mathematics courses only has cardinality 300 ( ) = 60. nalogously we compute the number of students taking Physics courses only (185) and taking Computer Science courses only (235). The sum = 480 is the number of students taking exactly one of those courses Properties of Sets. The set operations verify the following properties: 1. ssociative Laws: (B C) = ( B) C (B C) = ( B) C 2. Commutative Laws: B = B B = B 3. Distributive Laws: (B C) = ( B) ( C) 4. Identity Laws: 5. Complement Laws: 6. Idempotent Laws: 7. Bound Laws: 8. bsorption Laws: 9. Involution Law: (B C) = ( B) ( C) = U = = U = = = U = U = ( B) = ( B) = =

7 2.1. SET THEORY /1 Laws: 11. DeMorgan s Laws: = U U = B = B B = B Generalized Union and Intersection. Given a collection of sets 1, 2,..., N, their union is defined as the set of elements that belong to at least one of the sets (here n represents an integer in the range from 1 to N): N n = 1 2 N = {x n (x n )}. n=1 nalogously, their intersection is the set of elements that belong to all the sets simultaneously: N n = 1 2 N = {x n (x n )}. n=1 These definitions can be applied to infinite collections of sets as well. For instance assume that S n = {kn k = 2, 3, 4,... } = set of multiples of n greater than n. Then S n = S 2 S 3 S 4 = {4, 6, 8, 9, 10, 12, 14, 15,... } n=2 = set of composite positive integers Partitions. partition of a set X is a collection S of non overlapping non empty subsets of X whose union is the whole X. For instance a partition of X{1, 2, 3, 4, 5, 6, 7, 8, 9, 10} could be S = {{1, 2, 4, 8}, {3, 6}, {5, 7, 9, 10}}. Given a partition S of a set X, every element of X belongs to exactly one member of S. Example: The division of the integers Z into even and odd numbers is a partition: S = {E, O}, where E = {2n n Z}, O = {2n + 1 n Z}.

8 2.1. SET THEORY 28 Example: The divisions of Z in negative integers, positive integers and zero is a partition: S = {Z +, Z, {0}} Ordered Pairs, Cartesian Product. n ordinary pair {a, b} is a set with two elements. In a set the order of the elements is irrelevant, so {a, b} = {b, a}. If the order of the elements is relevant, then we use a different object called ordered pair, represented (a, b). Now (a, b) (b, a) (unless a = b). In general (a, b) = (a, b ) iff a = a and b = b. Given two sets, B, their Cartesian product B is the set of all ordered pairs (a, b) such that a and b B: B = {(a, b) (a ) (b B)}. nalogously we can define triples or 3-tuples (a, b, c), 4-tuples (a, b, c, d),..., n-tuples (a 1, a 2,..., a n ), and the corresponding 3-fold, 4-fold,..., n-fold Cartesian products: 1 2 n = {(a 1, a 2,..., a n ) (a 1 1 ) (a 2 2 ) (a n n )}. If all the sets in a Cartesian product are the same, then we can use an exponent: 2 =, 3 =, etc. In general: n = (n times). n example of Cartesian product is the real plane R 2, where R is the set of real numbers (R is sometimes called real line).

### 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

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

### 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

### 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

### 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

### 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

### 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

### 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

### Discrete Mathematics Set Operations

Discrete Mathematics 1-3. Set Operations Introduction to Set Theory A setis a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different) objects.

### 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

### Sets and Logic. Chapter Sets

Chapter 2 Sets and Logic This chapter introduces sets. In it we study the structure on subsets of a set, operations on subsets, the relations of inclusion and equality on sets, and the close connection

### 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

### 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,

### 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

### (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

### Lecture 1 (Review of High School Math: Functions and Models) Introduction: Numbers and their properties

Lecture 1 (Review of High School Math: Functions and Models) Introduction: Numbers and their properties Addition: (1) (Associative law) If a, b, and c are any numbers, then ( ) ( ) (2) (Existence of an

### 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

### 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

### 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

### CHAPTER 2. Set, Whole Numbers, and Numeration

CHAPTER 2 Set, Whole Numbers, and Numeration 2.1. Sets as a Basis for Whole Numbers A set is a collection of objects, called the elements or members of the set. Three common ways to define sets: (1) A

### Discrete Mathematics

Discrete Mathematics Chih-Wei Yi Dept. of Computer Science National Chiao Tung University March 16, 2009 2.1 Sets 2.1 Sets 2.1 Sets Basic Notations for Sets For sets, we ll use variables S, T, U,. We can

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

### 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

### 2.1 Sets, power sets. Cartesian Products.

Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects. - used to group objects together, - often the objects with similar properties This description of a set (without

### 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

### 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

### 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

### Math 117 Chapter 7 Sets and Probability

Math 117 Chapter 7 and Probability Flathead Valley Community College Page 1 of 15 1. A set is a well-defined collection of specific objects. Each item in the set is called an element or a member. Curly

### 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

### Basic Concepts of Set Theory, Functions and Relations

March 1, 2006 p. 1 Basic Concepts of Set Theory, Functions and Relations 1. Basic Concepts of Set Theory...1 1.1. Sets and elements...1 1.2. Specification of sets...2 1.3. Identity and cardinality...3

### Lecture 1. Basic Concepts of Set Theory, Functions and Relations

September 7, 2005 p. 1 Lecture 1. Basic Concepts of Set Theory, Functions and Relations 0. Preliminaries...1 1. Basic Concepts of Set Theory...1 1.1. Sets and elements...1 1.2. Specification of sets...2

### THE LANGUAGE OF SETS AND SET NOTATION

THE LNGGE OF SETS ND SET NOTTION Mathematics is often referred to as a language with its own vocabulary and rules of grammar; one of the basic building blocks of the language of mathematics is the language

### 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 (

### 2.3. Relations. Arrow diagrams. Venn diagrams and arrows can be used for representing

2.3. RELATIONS 32 2.3. Relations 2.3.1. Relations. Assume that we have a set of men M and a set of women W, some of whom are married. We want to express which men in M are married to which women in W.

### Notes on Discrete Mathematics. Miguel A. Lerma

Notes on Discrete Mathematics Miguel A. Lerma Contents Introduction 5 Chapter 1. Logic, Proofs 6 1.1. Propositions 6 1.2. Predicates, Quantifiers 11 1.3. Proofs 13 Chapter 2. Sets, Functions, Relations

### Math/CSE 1019: Discrete Mathematics for Computer Science Fall Suprakash Datta

Math/CSE 1019: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/1019 1

### Section 3.3 Equivalence Relations

1 Section 3.3 Purpose of Section To introduce the concept of an equivalence relation and show how it subdivides or partitions a set into distinct categories. Introduction Classifying objects and placing

### A Little Set Theory (Never Hurt Anybody)

A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra

### not to be republishe NCERT SETS Chapter Introduction 1.2 Sets and their Representations

SETS Chapter 1 In these days of conflict between ancient and modern studies; there must surely be something to be said for a study which did not begin with Pythagoras and will not end with Einstein; but

### 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,

### 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:

### 2.1 The Algebra of Sets

Chapter 2 Abstract Algebra 83 part of abstract algebra, sets are fundamental to all areas of mathematics and we need to establish a precise language for sets. We also explore operations on sets and relations

### Basics of Probability

Basics of Probability August 27 and September 1, 2009 1 Introduction A phenomena is called random if the exact outcome is uncertain. The mathematical study of randomness is called the theory of probability.

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

### 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:

### 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,

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

### 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,

### Introduction Russell s Paradox Basic Set Theory Operations on Sets. 6. Sets. Terence Sim

6. Sets Terence Sim 6.1. Introduction A set is a Many that allows itself to be thought of as a One. Georg Cantor Reading Section 6.1 6.3 of Epp. Section 3.1 3.4 of Campbell. Familiar concepts Sets can

### 4.1. Sets. Introduction. Prerequisites. Learning Outcomes. Learning Style

ets 4.1 Introduction If we can identify a property which is common to several objects, it is often useful to group them together. uch a grouping is called a set. Engineers for example, may wish to study

### 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

### 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

### 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

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

### 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 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

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

### 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

### Basic Set Theory. Chapter Set Theory. can be written: A set is a Many that allows itself to be thought of as a One.

Chapter Basic Set Theory A set is a Many that allows itself to be thought of as a One. - Georg Cantor This chapter introduces set theory, mathematical induction, and formalizes the notion of mathematical

### LESSON SUMMARY. Set Operations and Venn Diagrams

LESSON SUMMARY CXC CSEC MATHEMATICS UNIT Three: Set Theory Lesson 4 Set Operations and Venn Diagrams Textbook: Mathematics, A Complete Course by Raymond Toolsie, Volumes 1 and 2. (Some helpful exercises

### Discrete Mathematics. Some related courses. Assessed work. Motivation: functions. Motivation: sets. Exercise. Motivation: relations

Discrete Mathematics Philippa Gardner This course is based on previous lecture notes by Iain Phillips. K.H. Rosen. Discrete Mathematics and its Applications, McGraw Hill 1995. J.L. Gersting. Mathematical

### 1 / Basic Structures: Sets, Functions, Sequences, and Sums - definition of a set, and the use of the intuitive notion that any property whatever there

C H A P T E R Basic Structures: Sets, Functions, Sequences, and Sums.1 Sets. Set Operations.3 Functions.4 Sequences and Summations Much of discrete mathematics is devoted to the study of discrete structures,

### 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

### 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

### Definition 14 A set is an unordered collection of elements or objects.

Chapter 4 Set Theory Definition 14 A set is an unordered collection of elements or objects. Primitive Notation EXAMPLE {1, 2, 3} is a set containing 3 elements: 1, 2, and 3. EXAMPLE {1, 2, 3} = {3, 2,

### Lecture 4 -- Sets, Relations, Functions 1

Lecture 4 Sets, Relations, Functions Pat Place Carnegie Mellon University Models of Software Systems 17-651 Fall 1999 Lecture 4 -- Sets, Relations, Functions 1 The Story So Far Formal Systems > Syntax»

### 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

### Classical Sets and Fuzzy Sets Classical Sets Operation on Classical Sets Properties of Classical (Crisp) Sets Mapping of Classical Sets to Functions

Classical Sets and Fuzzy Sets Classical Sets Operation on Classical Sets Properties of Classical (Crisp) Sets Mapping of Classical Sets to Functions Fuzzy Sets Notation Convention for Fuzzy Sets Fuzzy

### Automata and Formal Languages

Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

### 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

### RELATIONS AND FUNCTIONS

Chapter 1 RELATIONS AND FUNCTIONS There is no permanent place in the world for ugly mathematics.... It may be very hard to define mathematical beauty but that is just as true of beauty of any kind, we

### If f is a 1-1 correspondence between A and B then it has an inverse, and f 1 isa 1-1 correspondence between B and A.

Chapter 5 Cardinality of sets 51 1-1 Correspondences A 1-1 correspondence between sets A and B is another name for a function f : A B that is 1-1 and onto If f is a 1-1 correspondence between A and B,

### Set operations and Venn Diagrams. COPYRIGHT 2006 by LAVON B. PAGE

Set operations and Venn Diagrams Set operations and Venn diagrams! = { x x " and x " } This is the intersection of and. # = { x x " or x " } This is the union of and. n element of! belongs to both and,

### Activity Symbol per Hour 2.2 Venn Diagrams and Subsets universe of discourse. universal set. Venn diagrams, F I G U R E 1

U 2.2 A A FIGURE 1 Venn Diagrams and Subsets In every problem there is either a stated or implied universe of discourse. The universe of discourse includes all things under discussion at a given time.

### 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

### Lecture 12. More algebra: Groups, semigroups, monoids, strings, concatenation.

V. Borschev and B. Partee, November 1, 2001 p. 1 Lecture 12. More algebra: Groups, semigroups, monoids, strings, concatenation. CONTENTS 1. Properties of operations and special elements...1 1.1. Properties

Mathematics 0N1 Solutions 1 1. Write the following sets in list form. 1(i) The set of letters in the word banana. {a, b, n}. 1(ii) {x : x 2 + 3x 10 = 0}. 3(iv) C A. True 3(v) B = {e, e, f, c}. True 3(vi)

### 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

### 3. Recurrence Recursive Definitions. To construct a recursively defined function:

3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 20

CS 70 Discrete Mathematics and Probability Theory Fall 009 Satish Rao, David Tse Note 0 Infinity and Countability Consider a function (or mapping) f that maps elements of a set A (called the domain of

### 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

### Chapter 2: Systems of Linear Equations and Matrices:

At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,

### axiomatic vs naïve set theory

ED40 Discrete Structures in Computer Science 1: Sets Jörn W. Janneck, Dept. of Computer Science, Lund University axiomatic vs naïve set theory s Zermelo-Fraenkel Set Theory w/choice (ZFC) extensionality

### Mathematical Foundations of Computer Science Lecture Outline

Mathematical Foundations of Computer Science Lecture Outline September 21, 2016 Example. How many 8-letter strings can be constructed by using the 26 letters of the alphabet if each string contains 3,4,

### 1.1. Basic Concepts. Write sets using set notation. Write sets using set notation. Write sets using set notation. Write sets using set notation.

1.1 Basic Concepts Write sets using set notation. Objectives A set is a collection of objects called the elements or members of the set. 1 2 3 4 5 6 7 Write sets using set notation. Use number lines. Know

### f(x) is a singleton set for all x A. If f is a function and f(x) = {y}, we normally write

Math 525 Chapter 1 Stuff If A and B are sets, then A B = {(x,y) x A, y B} denotes the product set. If S A B, then S is called a relation from A to B or a relation between A and B. If B = A, S A A is called

### RELATIONS AND FUNCTIONS

Chapter 1 RELATIONS AND FUNCTIONS 1.1 Overview 1.1.1 Relation A relation R from a non-empty set A to a non empty set B is a subset of the Cartesian product A B. The set of all first elements of the ordered

### Course Syllabus. MATH 1350-Mathematics for Teachers I. Revision Date: 8/15/2016

Course Syllabus MATH 1350-Mathematics for Teachers I Revision Date: 8/15/2016 Catalog Description: This course is intended to build or reinforce a foundation in fundamental mathematics concepts and skills.

### Hawkes Learning Systems: College Algebra

Hawkes Learning Systems: College Algebra Section 1.2: The Arithmetic of Algebraic Expressions Objectives o Components and terminology of algebraic expressions. o The field properties and their use in algebra.

### All of mathematics can be described with sets. This becomes more and

CHAPTER 1 Sets All of mathematics can be described with sets. This becomes more and more apparent the deeper into mathematics you go. It will be apparent in most of your upper level courses, and certainly

### 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,

### Notes on counting finite sets

Notes on counting finite sets Murray Eisenberg February 26, 2009 Contents 0 Introduction 2 1 What is a finite set? 2 2 Counting unions and cartesian products 4 2.1 Sum rules......................................

### MATHEMATICS (CLASSES XI XII)

MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)

### (Refer Slide Time 1.50)

Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Module -2 Lecture #11 Induction Today we shall consider proof

### Math 421: Probability and Statistics I Note Set 2

Math 421: Probability and Statistics I Note Set 2 Marcus Pendergrass September 13, 2013 4 Discrete Probability Discrete probability is concerned with situations in which you can essentially list all the

### L01 - Set Theory. CSci/Math May 2015

L01 - Set Theory CSci/Math 2112 06 May 2015 1 / 10 Elements and Subsets of a Set a A means a is an element of the set A a / A means a is not an element of the set A A B means A is a subset of B (all elements

### Lecture 2 : Basics of Probability Theory

Lecture 2 : Basics of Probability Theory When an experiment is performed, the realization of the experiment is an outcome in the sample space. If the experiment is performed a number of times, different

### Chapter Three. Functions. In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics.

Chapter Three Functions 3.1 INTRODUCTION In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics. Definition 3.1: Given sets X and Y, a function from X to