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

Save this PDF as:

Size: px
Start display at page:

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

Transcription

1 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, while lower case letters are used to denote elements a, b, x, y, of a set. Membership in a set is denoted as follows: a S denotes that a is a member or element of a set S. Similarly a set S. a, b S denotes that a and b are both elements of a S denotes that a is not an element of a set S. Similarly elements of a set S. a, b S denotes that neither of a and b are In Set Theory, we work within a Universe, U, and consider sets containing elements from U. WUCT121 Logic 130

2 A set may be specified in essentially two ways: 1. The elements of the set are listed within braces, { }, and separated by commas. Technically, the listing of elements can be done only for finite sets. However, if an infinite set is defined by a simple rule, we sometimes write a few elements and then use to mean roughly and so on or by the same rule. Examples: A = {1,3,5,7,9 }. The set A is the finite collection of odd integers, 1 to 9 inclusive B = { K, 4, 2,0,2,4, K}. The set B is the infinite collection of even integers. Exercises: List a finite set, C, containing even integers between 10 and 20 inclusive. List an infinite set, D, containing natural numbers that are divisible by 3 WUCT121 Logic 131

3 2. A statement defining the properties which characterise the elements in the set is written within braces Examples: A = { z :( z isodd 1 z 9)}. The set A is the finite collection of odd integers, 1 to 9 inclusive B = { z : k, z = 2k}. The set B is the infinite collection of even integers. Exercises: Define a finite set, C, containing even integers between 10 and 20 inclusive Define an infinite set, D, containing natural numbers that are divisible by 3 WUCT121 Logic 132

4 Axiom of Specification. Given a Universe U and any statement P (x) involving x U, then there exists a set A such that x U,( x A P( x)). Further, we write A = { x U : P( x)}. In other words, the Axiom of Specification says that we can pick a set and a property and build a new set. This is why the notation for A is sometimes referred to as set-builder notation. Example: Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} and P (x) be the statement x is odd. \ by the Axiom of Specification, A = { x U : x is odd}. Notes: 1. We know an element x belongs to the set A = { x U : P( x)} if x satisfies the condition P (x). 2. This notation is more simply written { x D : P( x)}. This is called set builder notation. In using this notation, the elements of the domain, D, must belong to the Universe, U, WUCT121 Logic 133

5 and P ( x) can be any predicate involving x. D could be all of U. Examples: The interval [0, 1] can be written in set builder notation as: { x : x 0 x 1} = { x : 0 x 1} The set of all rational numbers, can be written as: = = a : a, b b 0 b a x : x = : a, b b b 0 3 { x : x = x} = {0, 1, 1}. Exercises: Write down the following sets by listing their elements: { x : x = x} { x : x 2 = 9} { x : x 2 = 7} 3 WUCT121 Logic 134

6 4.2. Venn Diagrams Venn diagrams are a pictorial method of demonstrating the relationship between set. The universal set, U, is represented by a rectangle and sets within the universe are depicted with circles. While a Venn diagram may be used to demonstrate the relationship between sets, it does not provide a method of proving those relationships. WUCT121 Logic 135

7 4.3. Special Sets The Singleton Set Sets having a single element are frequently called singleton sets. Example: {1} is read singleton 1. If a U, then { x U : x = a} = { a} Note: The singleton set { a } is NOT the same as the element a The Empty Set The empty set or null set is a set which contains no elements. It is denoted by the symbol or by empty braces { }. Using set builder notation, one way of defining the empty set is: = { x : x x} WUCT121 Logic 136

8 4.4. Subsets Definition: Subset. If A and B are sets, then A is called a subset of B, written A B, if and only if, every element in A is also in B. Examples: { 1,2} {1,2,3 } The Venn diagram demonstrating A B is: Exercises: Write the definition of subset using logic notation. Is {cat, dog} {bird, fish, cat, dog}? WUCT121 Logic 137

9 Definition: Proper Subset. If A and B are sets, then A is called a proper subset of B, written A B, if and only if, every element in A is also in B but there is at least one element of B that is not in A. A is a proper subset of B if A B but A B. Examples: { 1, 2} {1, 2,3} Exercises: Draw a Venn diagram demonstrating A B, where A = {1,2} and B = {1,2,3,4,5 } Is { a, b, c} { c, b, a}? WUCT121 Logic 138

10 Notes. 1. If A B, then each element of A belongs to B, or for each x A, it is true that x B. 2. If A is a subset of B, then B is sometimes called a superset of A. 3. If A and B are sets, then to prove A B, we need to prove x, x A x B 4. If A is a proper subset of B, there must be at least one element in B that is not in A. 5. If A and B are sets, to prove A is not a subset of B, denoted A B, we need to prove ~ ( A B) : ~ ( x, x A x B) x,~ ( x A x B) x,~ ( x A x B) x,( x A x B) 6. The following relationships hold in the number system: WUCT121 Logic 139

11 The null set as a subset. For any set A in a Universe U, A Proof: Suppose ~ ( A). Then, there exists x such that x A. This, therefore, means that is not empty, which is a contradiction. Therefore, A Distinction between elements and subsets Examples: 2 {1,2,3 }, 2 {1,2,3 } { 2} {1,2,3 }, { 2} {1,2,3 } 2 = 1 { x : x 1}, { 1} { x : x 2 = 1} Exercises: Let S be a set in a Universe U. Determine whether the following are true or false. S S S {S} S {S} {S} {S} { } { S} WUCT121 Logic 140

12 4.5. Set Equality Definition: Set Equality. If A and B are sets, then A equals B, written A = B, if and only if, every element in A is also in B and every element in B is also in A. Equivalently, A = B if, and only if A B and B A. Note: To prove that two sets are equal two things must be shown:: Examples: A B and B A. The Venn diagram demonstrating A = B is: WUCT121 Logic 141

13 Exercises: Write the definition of set equality using logic notation Axiom of Extent. If A and B are sets then A = B ( x U, x A x B). The Axiom of Extent says that a set is completely determined by its elements, the order in which the elements are listed is irrelevant, as is the fact that some members may be listed more than once. Examples: { 1,2} = {1,2 } { a, b, c} = { c, b, a} Exercises: Is { a, b, c, d} = { b, d, a, c} Is { Ann, Bob, Cal} = {Bob, Cal, Ann, Cal} WUCT121 Logic 142

14 Theorem: Equality by Specification Let U be a universe and let P ( x) be a statement. If x U,( P( x) Q( x)), that is x U,( P( x) Q( x)) then { x U : P( x)} = { x U : Q( x)} The Theorem states that subsets of the same universe U which are defined by equivalent statements are equal sets. This theorem allows the use of tautologies of logic to prove set theoretic statements, as will be outlined later. Example: 2 We know that = 1 ( x = 1 x = 1) x. Therefore { x : x 2 = 1} = { ( x = 1 x = 1 )} = { 1, 1} If a1, a2, a3,k an U, then we can write A = = { x U : x = a1 x = a2 K x = an} { a, a, a, K a } n In other words, if we know the elements of a set, we know the set. A = { x : x = 1 x = 2 x = 3} = { 1, 2, 3} WUCT121 Logic 143

15 Exercise: Are the following sets equal? Using logic, can you prove your answer? { 1, 3,1, 2}, {3, 2,1}, {1, 2,3} Are the following two sets equal? Give reasons. { n : n is even} E = : and T = { n : : n is even}. 2 WUCT121 Logic 144

16 4.6. Power Sets Definition: Power Set If X is any set, then { A : A X} is the power set of X. The power set of X is often written as ( X ). So ( X ) = { A : A X}. A power set is a set whose elements are sets. If the elements of X are in a universe U, those of ( X ) are in a universe (U ). Examples: Let X = {1} and let S be the set of all subsets of X. Write down the set S by listing its elements. S = { A : A X}. {1} and { 1} {1}. Thus S = {,{1}} Let X = {1, 2} and S = { A : A X}. Write down the set S by listing its elements. {1, 2}, { 1} {1, 2}, { 2} {1, 2}, and { 1, 2} {1, 2}. Thus S = {,{1},{2},{1, 2}} WUCT121 Logic 145

17 Exercises: Let X = {1,2,3 }. o Write down the set ( X ) by listing its elements. o How many elements are there in ( X )? o Is ( X )? o Is ( X )? o Is 1 ( X )? o Is { 1} ( X )? o Is { 2} ( X )? o Is {{ 1, 2}} ( X )? WUCT121 Logic 146

18 4.7. Hasse Diagrams The elements of ( X ) can be represented by diagrams using the following procedure: 1. An upward directed line between two sets indicates that the lower set is a subset of the upper set. 2. is at the bottom and X is at the top. 3. Each pair of sets is joined by an upward directed line to the smallest set which contains each as a subset. 4. Each pair of sets is joined by a downward directed line to the largest set which is a subset of each. Example: Let X = {1, 2}, thus ( X ) = {,{1},{2},{1,2 }} and the Hasse diagram is given by: {1, 2} {1} {2} ø WUCT121 Logic 147

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

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:

(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

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

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,

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

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

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

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

1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

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

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

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

Relations and Functions

Section 5. Relations and Functions 5.1. Cartesian Product 5.1.1. Definition: Ordered Pair Let A and B be sets and let a A and b B. An ordered pair ( a, b) is a pair of elements with the property that:

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

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

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

This section demonstrates some different techniques of proving some general statements.

Section 4. Number Theory 4.. Introduction This section demonstrates some different techniques of proving some general statements. Examples: Prove that the sum of any two odd numbers is even. Firstly you

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

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

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

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

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

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

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

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

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

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:

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

WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology

First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121

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,

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

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,

WUCT121. Discrete Mathematics. Logic

WUCT121 Discrete Mathematics Logic 1. Logic 2. Predicate Logic 3. Proofs 4. Set Theory 5. Relations and Functions WUCT121 Logic 1 Section 1. Logic 1.1. Introduction. In developing a mathematical theory,

CS 2336 Discrete Mathematics

CS 2336 Discrete Mathematics Lecture 5 Proofs: Mathematical Induction 1 Outline What is a Mathematical Induction? Strong Induction Common Mistakes 2 Introduction What is the formula of the sum of the first

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 (

Math 166 - Week in Review #4. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.

Math 166 Spring 2007 c Heather Ramsey Page 1 Math 166 - Week in Review #4 Sections A.1 and A.2 - Propositions, Connectives, and Truth Tables A proposition, or statement, is a declarative sentence that

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

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

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

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

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

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. 1. Motivation. Fido Sue. Fred Aristotle Bob. LX 502 - Semantics I September 11, 2008

Basic Set Theory LX 502 - Semantics I September 11, 2008 1. Motivation When you start reading these notes, the first thing you should be asking yourselves is What is Set Theory and why is it relevant?

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

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,

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

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

How does x differ in what it represents in the following statements? x is real. x represents no values

Section. redicate Logic Discussion: In Maths we use variables usuall ranging over numbers in various was. How does differ in what it represents in the following statements? is real. = 0 represents one

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

Equivalence Relations

Equivalence Relations Definition An equivalence relation on a set S, is a relation on S which is reflexive, symmetric and transitive. Examples: Let S = Z and define R = {(x,y) x and y have the same parity}

Set Theory Basic Concepts and Definitions

Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric

So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

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

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

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

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.

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

Introduction to mathematical arguments

Introduction to mathematical arguments (background handout for courses requiring proofs) by Michael Hutchings A mathematical proof is an argument which convinces other people that something is true. Math

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,

Chap2: The Real Number System (See Royden pp40)

Chap2: The Real Number System (See Royden pp40) 1 Open and Closed Sets of Real Numbers The simplest sets of real numbers are the intervals. We define the open interval (a, b) to be the set (a, b) = {x

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

A brief history of type theory (or, more honestly, implementing mathematical objects as sets)

A brief history of type theory (or, more honestly, implementing mathematical objects as sets) Randall Holmes, Boise State University November 8, 2012 [notes revised later; this is the day the talk was

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

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

Section 1.1 Real Numbers

. Natural numbers (N):. Integer numbers (Z): Section. Real Numbers Types of Real Numbers,, 3, 4,,... 0, ±, ±, ±3, ±4, ±,... REMARK: Any natural number is an integer number, but not any integer number is

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

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

Section 3 Sequences and Limits

Section 3 Sequences and Limits Definition A sequence of real numbers is an infinite ordered list a, a 2, a 3, a 4,... where, for each n N, a n is a real number. We call a n the n-th term of the sequence.

Discrete Mathematics: Chapter 4, Basic Set Theory & Combinatorics

Digital Collections @ Dordt Faculty Work: Comprehensive List 1-2016 Discrete Mathematics: Chapter 4, Basic Set Theory & Combinatorics Calvin Jongsma Dordt College, calvin.jongsma@dordt.edu Follow this

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

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

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

PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

MATH INTRODUCTION TO PROBABILITY FALL 2011

MATH 7550-01 INTRODUCTION TO PROBABILITY FALL 2011 Lecture 4. Measurable functions. Random variables. I have told you that we can work with σ-algebras generated by classes of sets in some indirect ways.

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

Math 582 Introduction to Set Theory

Math 582 Introduction to Set Theory Kenneth Harris kaharri@umich.edu Department of Mathematics University of Michigan January 7, 2009 Kenneth Harris (Math 582) Math 582 Introduction to Set Theory January

For the purposes of this course, the natural numbers are the positive integers. We denote by N, the set of natural numbers.

Lecture 1: Induction and the Natural numbers Math 1a is a somewhat unusual course. It is a proof-based treatment of Calculus, for all of you who have already demonstrated a strong grounding in Calculus

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

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

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

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

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)

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

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,

Appendix A: Numbers, Inequalities, and Absolute Values. Outline

Appendix A: Numbers, Inequalities, and Absolute Values Tom Lewis Fall Semester 2015 Outline Types of numbers Notation for intervals Inequalities Absolute value A hierarchy of numbers Whole numbers 1, 2,

. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

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

COUNTING SUBSETS OF A SET: COMBINATIONS

COUNTING SUBSETS OF A SET: COMBINATIONS DEFINITION 1: Let n, r be nonnegative integers with r n. An r-combination of a set of n elements is a subset of r of the n elements. EXAMPLE 1: Let S {a, b, c, d}.

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

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,

6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

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,

Access The Mathematics of Internet Search Engines

Lesson1 Access The Mathematics of Internet Search Engines You are living in the midst of an ongoing revolution in information processing and telecommunications. Telephones, televisions, and computers are