Sets. {1, 2, 3, Calvin}.

Size: px
Start display at page:

Download "Sets. {1, 2, 3, Calvin}."

Transcription

1 ets Roughly speaking, a set is a collection of objects. he objects are called the members or the elements of the set. et theory is the basis for mathematics, and there are a number of axiom systems for set theory; von Neumann-Gödel-ernays (NG) and Zermelo-Fraenkel-hoice (ZF) are the most well-known. I m going to take a somewhat informal approach to avoid unnecessary complexity. Examples. You construct or define a set by saying what its elements are. You can define a set by listing its elements between curly brackets: {1, 2, 3, alvin}. he order of the elements in the list is irrelevant; thus, {1, 2, 3, alvin} is the same as {alvin, 2, 1, 3}. In fact, two sets are equal if and only if they have the same elements. It s understood when you list the elements of a set that no duplicates are allowed. You can also define a set using set constructor notation. Here s an example: {n Z n is a perfect square}. he set constructor consists of two statements separated by a, contained in curly brackets. he two statements together give the properties which must be satisfied by an element of the set. (hus, the functions like a logical and.) Usually, the first statement is more general than the second. In this case, the set consists of all integers which are perfect squares. I could write this more explicitly (but less precisely) as {0, 1, 4, 9,...}. (his is less precise because the... assumes that it is clear what the pattern is.) Here s an example using two variables: {(x, y) x, y R and y = x 2 }. his set consists of pairs of real numbers such that the second is the square of the first. (y the way, the last sentence gives a verbal description of the set. It s useful to say things in words when the symbols get confusin.) Here are some elements of the set: ( 1, 1), (0, 0), ( 3, 3), (1.1, 1.21),.... In this case, I can t list the elements of the set when I discuss cardinality, I ll explain why and thus, it s particularly important to have a set constructor definition available. You can also have sets whose elements are sets. For example, {{1, 2}, {3, alvin}, π} is a set with three elements, two of which are sets with two elements. Definition. he set with no elements is called the empty set, and is denoted or { }. 1

2 Warning. You have to be a little bit careful in constructing sets in order to avoid set-theoretic paradoxes. For example, here is Russell s paradox. onsider the set of all sets which are not members of themselves. Is an element of? If is an element of, then by definition is not a member of itself contradicting my assumption that is an element of. If is not an element of, then is an element of, since consists of sets which are not members of themselves. his is also a contradiction. y the Law of the Excluded Middle, either is an element of, or it is not but both alternatives lead to contradictions. Paradoxes of this kind are avoided by setting up axioms for set theory which do not allow the construction of sets such as this one. Notation. If is a set, x means that x is an element of. x / means that x is not an element of. Here is some notation for some sets that occur often in mathematics. Z is the set of integers. Q is the set of rational numbers. R is the set of real numbers. is the set of complex numbers. If you just want the positive integers (also known as the natural numbers, use Z + or N; if you want the nonnegative integers, use Z 0. Definition. Let and be sets. is a subset of if and only if x implies x. means that is a subset of, and means that is not a subset of. his picture illustrates : he picture above is called a Venn diagram. Venn diagrams are often useful for picturing sets and relationships among sets. e careful not to substitute diagrams for proofs, however! Definition. Let and be sets. = if and only if and. (In words, every element of is an element of, and every element of is an element of.) he definition of set equality tells you how to prove that two sets are equal: o prove that =, try proving that and. Notational remark. ome people use to mean that is a subset of, but is not equal to. subset of other than itself is called a proper subset of. With this convention, you write to mean that is a subset of, possibly itself. I prefer to write to mean is any subset of. If I want to be a proper subset of, I ll write. Reason: More often than not, you want to include the possibility that =, and you should use the simpler notation ( rather than ) for the case that occurs more often. Example. Let = {n Z n = 2m for some m Z} and = {n Z n = 6m for some m Z}. 2

3 Prove that. o prove that, I must show that if n, then n. You can often prove set inclusion or equality by considering elements. Let n. y definition of, I have n = 6m for some m Z. Now n = 6m = 2(3m). ince m is an integer, so is 3m. herefore, n has the form 2 (an integer), so by definition n. Hence,. It s common to shorten the definitions of and as follows: = {2m m Z} and = {6m m Z}. e sure you understand the intent of these definitions. he m in the definition simply stands for some integer. hus, elements of can be described as integers which have the form 2 (some integer); elements of can be described as integers which have the form 6 (some integer). When working with sets like these, don t get hung up on the particular letter m. Lemma. Let and be sets. (a). (b). Proof. (a) o prove that, I have to prove that if x, then x. ut x is false for all x, so the conditional statement must be true. (In this situation, you often say that the statement is vacuously true the condition is satisfied because there are no cases!) (b) o prove that, I must show that if x, then x. his is trivially true P P is a tautology so. When one is discussing sets, there is usually a big set which contains all the sets under discussion. his big set is usually called the universe; usually, it will be clear from the context what it is. For example, if I m discussing sets of integers, the universe is the set of integers Z. If I m discussing sets of real numbers, the universe is the set of real numbers R. Definition. Let and be sets in the universe X. he complement of is the set of elements of the universe which are not contained in ; it is denoted or X. hus, = {x X x / }. he complement of in is the set of elements of which are not elements of ; it is denoted. hus, = {x x / }. Here s a picture; the shaded area is. - 3

4 et complements function likes logical negations; the analogy even extends to DeMorgan s Laws, as I ll show below. Example. If X is the universe, X = and = X. Example. Let the universe be {1, 2, 3, 4, alvin}. hen In fact, for any set, =. In this situation, {1, 3} = {2, 4, alvin} and {2, 4, alvin} = {1, 3}. {1, 3} = {1, 2, 3, alvin}, but {1, 3} {1, 2, 4, alvin}. Definition. Let and be sets. he union of and is the set whose elements are elements of or elements of ; it is denoted. hat is, = {x x or x }. Picture: U Definition. Let and be sets. he intersection of and is the set whose elements are elements of both and ; it is denoted. hat is, = {x x and x }. Picture: Note that the or and and in the last two definitions are the logical or and and. U Example. Let = {1, 2, 3, 4, 5}, let be the set of even integers, and suppose the universe is Z. hen = {..., 6, 4, 2, 0, 1, 2, 3, 4, 5, 6, 8, 10,...}, = {2, 4}, = {1, 3, 5}, 4

5 = {all even integers except 2 and 4}, = {all odd integers}. Example. Let R 0 = {x R x 0} and R 0 = {x R x 0}. Prove that R 0 R 0 = {0}. I ll prove the result by showing that {0} R 0 R 0 and that R 0 R 0 {0}. o prove that {0} R 0 R 0, I begin by taking an element of {0} but the only element of {0} is 0. o I have to show that 0 R 0 R 0. First, 0 R 0 because 0 0. Next, 0 R 0 because 0 0. ince 0 R 0 and 0 R 0, it follows that 0 R 0 R 0. Hence, {0} R 0 R 0. Now I have to show that R 0 R 0 {0}. Let x R 0 R 0. y definition of intersection, this means that x R 0 and x R 0. ince x R 0, I have x 0. ince x R 0, I have x 0. his means that x = 0, so x {0}. herefore, R 0 R 0 {0}. his proves that R 0 R 0 = {0}. Example. his is the general Venn diagram for three sets. Here are the Venn diagrams for some set constructed using complements, unions, and intersection: ( ) 5

6 ( ) ( ) c 2007 by ruce Ikenaga 6

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics 400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {

More information

1.1 - Introduction to Sets

1.1 - Introduction to Sets 1.1 - Introduction to Sets Math 166-502 Blake Boudreaux Department of Mathematics Texas A&M University January 18, 2018 Blake Boudreaux (Texas A&M University) 1.1 - Introduction to Sets January 18, 2018

More information

Chapter 3. Set Theory. 3.1 What is a Set?

Chapter 3. Set Theory. 3.1 What is a Set? Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any

More information

2.1 Sets 2.2 Set Operations

2.1 Sets 2.2 Set Operations CSC2510 Theoretical Foundations of Computer Science 2.1 Sets 2.2 Set Operations Introduction to Set Theory A set is a structure, representing an unordered collection (group, plurality) of zero or more

More information

CSC Discrete Math I, Spring Sets

CSC Discrete Math I, Spring Sets CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its

More information

Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16

Review of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special

More information

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall c Dr Oksana Shatalov, Fall 2014 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members

More information

Set and Set Operations

Set and Set Operations Set and Set Operations Introduction A set is a collection of objects. The objects in a set are called elements of the set. A well defined set is a set in which we know for sure if an element belongs to

More information

2 Review of Set Theory

2 Review of Set Theory 2 Review of Set Theory Example 2.1. Let Ω = {1, 2, 3, 4, 5, 6} 2.2. Venn diagram is very useful in set theory. It is often used to portray relationships between sets. Many identities can be read out simply

More information

1 of 7 7/15/2009 3:40 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 1. Sets Poincaré's quote, on the title page of this chapter could not be more wrong (what was he thinking?). Set theory

More information

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets. SETS A set is a file of objects which have at least one property in common. The objects of the set are called elements. Sets are notated with capital letters K, Z, N, etc., the elements are a, b, c, d,

More information

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.

More information

1 The Axiom of Extensionality

1 The Axiom of Extensionality 1 The Axiom of Extensionality Primitive notion: Set A set is a group, a collection, or an aggregate of things. In fact, the words set, group, collection, and aggregate are all synonyms denoting the same

More information

What is Set? Set Theory. Notation. Venn Diagram

What is Set? Set Theory. Notation. Venn Diagram What is Set? Set Theory Peter Lo Set is any well-defined list, collection, or class of objects. The objects in set can be anything These objects are called the Elements or Members of the set. CS218 Peter

More information

1. Chapter 1, # 1: Prove that for all sets A, B, C, the formula

1. Chapter 1, # 1: Prove that for all sets A, B, C, the formula Homework 1 MTH 4590 Spring 2018 1. Chapter 1, # 1: Prove that for all sets,, C, the formula ( C) = ( ) ( C) is true. Proof : It suffices to show that ( C) ( ) ( C) and ( ) ( C) ( C). ssume that x ( C),

More information

2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2

2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2 2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of

More information

Sets. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee

Sets. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee Sets Mukulika Ghosh Fall 2018 Based on slides by Dr. Hyunyoung Lee Sets Sets A set is an unordered collection of objects, called elements, without duplication. We write a A to denote that a is an element

More information

CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4

CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4 CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 14: Set Theory: Definitions and Properties 1. Let C = {n Z n = 6r 5 for

More information

Introduction. Sets and the Real Number System

Introduction. Sets and the Real Number System Sets: Basic Terms and Operations Introduction Sets and the Real Number System Definition (Set) A set is a well-defined collection of objects. The objects which form a set are called its members or Elements.

More information

SPERNER S LEMMA MOOR XU

SPERNER S LEMMA MOOR XU SPERNER S LEMMA MOOR XU Abstract. Is it possible to dissect a square into an odd number of triangles of equal area? This question was first answered by Paul Monsky in 970, and the solution requires elements

More information

Discrete Mathematics Lecture 4. Harper Langston New York University

Discrete Mathematics Lecture 4. Harper Langston New York University Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a

More information

This Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.

This Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets. Sets A B C This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set Identities Defining Sets Definition: A set is an unordered collection

More information

Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31

Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31 Sets MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Sets Fall 2014 1 / 31 Outline 1 Sets Introduction Cartesian Products Subsets Power Sets Union, Intersection, Difference

More information

2 Sets. 2.1 Notation. last edited January 26, 2016

2 Sets. 2.1 Notation. last edited January 26, 2016 2 Sets Sets show up in virtually every topic in mathematics, and so understanding their basics is a necessity for understanding advanced mathematics. As far as we re concerned, the word set means what

More information

Algebra of Sets (Mathematics & Logic A)

Algebra of Sets (Mathematics & Logic A) Algebra of Sets (Mathematics & Logic A) RWK/MRQ October 28, 2002 Note. These notes are adapted (with thanks) from notes given last year by my colleague Dr Martyn Quick. Please feel free to ask me (not

More information

Summary of Course Coverage

Summary of Course Coverage CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities

More information

IB Sets and Venn Diagram Questions- Package #1

IB Sets and Venn Diagram Questions- Package #1 I Sets and Venn Diagram Questions- Package #1 1. is the set of all the positive integers less than or equal to 12., and C are subsets of. = {1, 2, 3, 4, 6,12} = {odd integers} C = {5, 6, 8} (a) Write down

More information

AXIOMS FOR THE INTEGERS

AXIOMS FOR THE INTEGERS AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,

More information

CS 1200 Discrete Math Math Preliminaries. A.R. Hurson 323 CS Building, Missouri S&T

CS 1200 Discrete Math Math Preliminaries. A.R. Hurson 323 CS Building, Missouri S&T CS 1200 Discrete Math A.R. Hurson 323 CS Building, Missouri S&T hurson@mst.edu 1 Course Objective: Mathematical way of thinking in order to solve problems 2 Variable: holder. A variable is simply a place

More information

Today s Topics. What is a set?

Today s Topics. What is a set? Today s Topics Introduction to set theory What is a set? Set notation Basic set operations What is a set? Definition: A set is an unordered collection of objects Examples: Sets can contain items of mixed

More information

1 Introduction CHAPTER ONE: SETS

1 Introduction CHAPTER ONE: SETS 1 Introduction CHAPTER ONE: SETS Scientific theories usually do not directly describe the natural phenomena under investigation, but rather a mathematical idealization of them that abstracts away from

More information

Characterization of Boolean Topological Logics

Characterization of Boolean Topological Logics Characterization of Boolean Topological Logics Short Form: Boolean Topological Logics Anthony R. Fressola Denison University Granville, OH 43023 University of Illinois Urbana-Champaign, IL USA 61801-61802

More information

Lecture : Topological Space

Lecture : Topological Space Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous

More information

Introduction II. Sets. Terminology III. Definition. Definition. Definition. Example

Introduction II. Sets. Terminology III. Definition. Definition. Definition. Example Sets Slides by Christopher M. ourke Instructor: erthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction

More information

Outline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set

Outline. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets. Sets. Enumerating the elements of a set Outline CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 1 Sets rthur G. Werschulz Fordham University Department of Computer and Information Sciences Copyright rthur G. Werschulz, 2017.

More information

Cantor s Diagonal Argument for Different Levels of Infinity

Cantor s Diagonal Argument for Different Levels of Infinity JANUARY 2015 1 Cantor s Diagonal Argument for Different Levels of Infinity Michael J. Neely University of Southern California http://www-bcf.usc.edu/ mjneely Abstract These notes develop the classic Cantor

More information

Sets. Margaret M. Fleck. 15 September 2010

Sets. Margaret M. Fleck. 15 September 2010 Sets Margaret M. Fleck 15 September 2010 These notes cover set notation, operations on sets, and how to prove claims involving sets (Rosen sections 2.1 and 2.2). They also cover some logic subtleties that

More information

Algebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper.

Algebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper. Algebra of Sets Aditya Ghosh April 6, 2018 It is recommended that while reading it, sit with a pen and a paper. 1 The Basics This article is only about the algebra of sets, and does not deal with the foundations

More information

LECTURE NOTES ON SETS

LECTURE NOTES ON SETS LECTURE NOTES ON SETS PETE L. CLARK Contents 1. Introducing Sets 1 2. Subsets 5 3. Power Sets 5 4. Operations on Sets 6 5. Families of Sets 8 6. Partitions 10 7. Cartesian Products 11 1. Introducing Sets

More information

SET DEFINITION 1 elements members

SET DEFINITION 1 elements members SETS SET DEFINITION 1 Unordered collection of objects, called elements or members of the set. Said to contain its elements. We write a A to denote that a is an element of the set A. The notation a A denotes

More information

Lecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets

Lecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets Lecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets Saul Glasman 14 September 2016 Let s give the definition of an open subset of R. Definition 1. Let U R. We

More information

The Intersection of Two Sets

The Intersection of Two Sets Venn Diagrams There are times when it proves useful or desirable for us to represent sets and the relationships among them in a visual manner. This can be beneficial for a variety of reasons, among which

More information

Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say

Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say Sets 1 Where does mathematics start? What are the ideas which come first, in a logical sense, and form the foundation for everything else? Can we get a very small number of basic ideas? Can we reduce it

More information

Diagonalization. The cardinality of a finite set is easy to grasp: {1,3,4} = 3. But what about infinite sets?

Diagonalization. The cardinality of a finite set is easy to grasp: {1,3,4} = 3. But what about infinite sets? Diagonalization Cardinalities The cardinality of a finite set is easy to grasp: {1,3,4} = 3. But what about infinite sets? We say that a set S has at least as great cardinality as set T, written S T, if

More information

Sets and set operations

Sets and set operations CS 44 Discrete Mathematics for CS Lecture Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Course administration Homework 3: Due today Homework 4: Due next week on Friday,

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics Lecture 2: Basic Structures: Set Theory MING GAO DaSE@ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 18, 2017 Outline 1 Set Concepts 2 Set Operations 3 Application

More information

2.1 Symbols and Terminology

2.1 Symbols and Terminology 2.1 Symbols and Terminology A is a collection of objects or things. The objects belonging to the are called the, or. - : there is a way of determining for sure whether a particular item is an element of

More information

11 Sets II Operations

11 Sets II Operations 11 Sets II Operations Tom Lewis Fall Term 2010 Tom Lewis () 11 Sets II Operations Fall Term 2010 1 / 12 Outline 1 Union and intersection 2 Set operations 3 The size of a union 4 Difference and symmetric

More information

LECTURE 8: SETS. Software Engineering Mike Wooldridge

LECTURE 8: SETS. Software Engineering Mike Wooldridge LECTURE 8: SETS Mike Wooldridge 1 What is a Set? The concept of a set is used throughout mathematics; its formal definition matches closely our intuitive understanding of the word. Definition: A set is

More information

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

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

More information

Logic and Proof course Solutions to exercises from chapter 6

Logic and Proof course Solutions to exercises from chapter 6 Logic and roof course Solutions to exercises from chapter 6 Fairouz Kamareddine 6.1 (a) We prove it as follows: Assume == Q and Q == R and R == S then by Transitivity of == R and R == S. Again, by Transitivity

More information

Sets. X. Zhang Dept. of Computer & Information Sciences Fordham University

Sets. X. Zhang Dept. of Computer & Information Sciences Fordham University Sets! X. Zhang Dept. of Computer & Information Sciences Fordham University 1 Outline on sets! Basics!! Specify a set by enumerating all elements!! Notations!! Cardinality!! Venn Diagram!! Relations on

More information

My dear students, Believe in yourselves. Believe in your abilities. You have got this! -Dr. M

My dear students, Believe in yourselves. Believe in your abilities. You have got this! -Dr. M 1/20 2/10 3/7 4/18 5/10 6/6 7/17 8/12 Total/100 Please do not write in the spaces above. Directions: You have 50 minutes in which to complete this exam. You must show all work, or risk losing credit. Be

More information

Lecture 15: The subspace topology, Closed sets

Lecture 15: The subspace topology, Closed sets Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology

More information

COMP Logic for Computer Scientists. Lecture 17

COMP Logic for Computer Scientists. Lecture 17 COMP 1002 Logic for Computer Scientists Lecture 17 5 2 J Puzzle: the barber In a certain village, there is a (male) barber who shaves all and only those men of the village who do not shave themselves.

More information

9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS

9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS What is discrete? Sets (Rosen, Chapter 2) TOPICS Discrete math Set Definition Set Operations Tuples Consisting of distinct or unconnected elements, not continuous (calculus) Helps us in Computer Science

More information

COLLEGE ALGEBRA. Intro, Sets of Real Numbers, & Set Theory

COLLEGE ALGEBRA. Intro, Sets of Real Numbers, & Set Theory COLLEGE LGER y: Sister Mary Rebekah www.survivormath.weebly.com Cornell-Style Fill in the lank Notes and Teacher s Key Intro, Sets of Real Numbers, & Set Theory 1 Vocabulary Workshop SIMPLIFY Expressions

More information

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam

More information

9.5 Equivalence Relations

9.5 Equivalence Relations 9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same

More information

(iv) The square root of an integer is a rational number. (viii) There is an infinite number of natural numbers.

(iv) The square root of an integer is a rational number. (viii) There is an infinite number of natural numbers. A statement is a sentence that is either always true or always false. Examples 2 ` 2 4. Suppose x 2 2. henx is not an integer. All cats are gray. I have a gray cat. Non-examples x is an odd number. Let

More information

STABILITY AND PARADOX IN ALGORITHMIC LOGIC

STABILITY AND PARADOX IN ALGORITHMIC LOGIC STABILITY AND PARADOX IN ALGORITHMIC LOGIC WAYNE AITKEN, JEFFREY A. BARRETT Abstract. Algorithmic logic is the logic of basic statements concerning algorithms and the algorithmic rules of deduction between

More information

11,23,35,47 B) 1 is a multiple of 12

11,23,35,47 B) 1 is a multiple of 12 Where applicable, indicates that none of the above answers is correct. 1. Let X x x 1 is a multiple of 3 and 5 and 1 is a multiple of 4 Find XY. Y y y y. 11,23,35,47 B) 1 is a multiple of 12 A) z z C)

More information

THE AGDA STANDARD LIBRARY

THE AGDA STANDARD LIBRARY THE AGDA STANDARD LIBRARY N. P. STRICKLAND 1. Introduction In this document we give a survey of the structure, organisation and contents of the Agda standard library. We will mostly ignore foundational

More information

Lesson 10: Representing, Naming, and Evaluating Functions

Lesson 10: Representing, Naming, and Evaluating Functions : Representing, Naming, and Evaluation Functions Classwork Opening Exercise Study the 4 representations of a function below. How are these representations alike? How are they different? TABLE: Input 0

More information

Final Test in MAT 410: Introduction to Topology Answers to the Test Questions

Final Test in MAT 410: Introduction to Topology Answers to the Test Questions Final Test in MAT 410: Introduction to Topology Answers to the Test Questions Stefan Kohl Question 1: Give the definition of a topological space. (3 credits) A topological space (X, τ) is a pair consisting

More information

Sets. Sets. Subset, universe. Specifying sets, membership. Examples: Specifying a set using a predicate. Examples

Sets. Sets. Subset, universe. Specifying sets, membership. Examples: Specifying a set using a predicate. Examples Sets 2/36 We will not give a precise definition of what is a set, but we will say precisely what you can do with it. Sets Lectures 7 and 8 (hapter 16) (Think of a set as a collection of things of which

More information

Math 170- Graph Theory Notes

Math 170- Graph Theory Notes 1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory

More information

1.2 Venn Diagrams and Partitions

1.2 Venn Diagrams and Partitions 1.2 Venn Diagrams and Partitions Mark R. Woodard Furman U 2010 Mark R. Woodard (Furman U) 1.2 Venn Diagrams and Partitions 2010 1 / 9 Outline 1 Venn Diagrams 2 Partitions 3 Fundamentals of Counting Mark

More information

CS100: DISCRETE STRUCTURES

CS100: DISCRETE STRUCTURES CS: DISCRETE STRUCTURES Computer Science Department Lecture : Set and Sets Operations (Ch2) Lecture Contents 2 Sets Definition. Some Important Sets. Notation used to describe membership in sets. How to

More information

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.6 Indirect Argument: Contradiction and Contraposition Copyright Cengage Learning. All

More information

Exam 1 February 3, 2015

Exam 1 February 3, 2015 CSC 1300-003 Discrete Structures Exam 1 February 3, 2015 Name: KEY Question Value Score 1 20 2 20 3 20 4 20 5 20 OAL 100 Please answer questions in the spaces provided. If you make a mistake or for some

More information

Fault Tree Analysis (Minimal Cutset)

Fault Tree Analysis (Minimal Cutset) Fault Tree Analysis (Minimal Cutset) Arshad Ahmad arshad@utm.my asic Set Theory 2 Sets Definition. A Set is any well defined collection of objects. Definition. The elements of a set are the objects in

More information

CSC 501 Semantics of Programming Languages

CSC 501 Semantics of Programming Languages CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this

More information

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

CHAPTER 8. Copyright Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation

More information

following determine whether it is an element, subset or neither of A and

following determine whether it is an element, subset or neither of A and 1. Let A, B, and C be subsets of the universal set U. Draw Venn diagrams illustrating the following: First, we have a square representing the universe U and three circles, one for each of A, B and C. Each

More information

Unit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers

Unit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers Contents STRAND B: Number Theory Unit 7 Number System and Bases Student Text Contents Section 7. Number System 7.2 Binary Numbers 7.3 Adding and Subtracting Binary Numbers 7.4 Multiplying Binary Numbers

More information

Handout 9: Imperative Programs and State

Handout 9: Imperative Programs and State 06-02552 Princ. of Progr. Languages (and Extended ) The University of Birmingham Spring Semester 2016-17 School of Computer Science c Uday Reddy2016-17 Handout 9: Imperative Programs and State Imperative

More information

.Math 0450 Honors intro to analysis Spring, 2009 Notes #4 corrected (as of Monday evening, 1/12) some changes on page 6, as in .

.Math 0450 Honors intro to analysis Spring, 2009 Notes #4 corrected (as of Monday evening, 1/12) some changes on page 6, as in  . 0.1 More on innity.math 0450 Honors intro to analysis Spring, 2009 Notes #4 corrected (as of Monday evening, 1/12) some changes on page 6, as in email. 0.1.1 If you haven't read 1.3, do so now! In notes#1

More information

Discrete mathematics , Fall Instructor: prof. János Pach

Discrete mathematics , Fall Instructor: prof. János Pach Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,

More information

Figure 1.1: This is an illustration of a generic set and its elements.

Figure 1.1: This is an illustration of a generic set and its elements. Chapter 1 Mathematical Review et theory is now generally accepted as the foundation of modern mathematics, and it plays an instrumental role in the treatment of probability. Unfortunately, a simple description

More information

Eric Roberts Handout #39 CS 106B February 20, 2015 Sets

Eric Roberts Handout #39 CS 106B February 20, 2015 Sets Eric Roberts Handout #39 S 106 February 20, 2015 Sets Sets Eric Roberts S 106 February 20, 2015 Outline 1. Midcourse correction 2. Sets in mathematics 3. Venn diagrams 4. High-level set operations 5. Implementing

More information

MATH 271 Summer 2016 Assignment 4 solutions

MATH 271 Summer 2016 Assignment 4 solutions MATH 7 ummer 06 Assignment 4 solutions Problem Let A, B, and C be some sets and suppose that f : A B and g : B C are functions Prove or disprove each of the following statements (a) If f is one-to-one

More information

Bipartite Roots of Graphs

Bipartite Roots of Graphs Bipartite Roots of Graphs Lap Chi Lau Department of Computer Science University of Toronto Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only

More information

c) the set of students at your school who either are sophomores or are taking discrete mathematics

c) the set of students at your school who either are sophomores or are taking discrete mathematics Exercises Exercises Page 136 1. Let A be the set of students who live within one mile of school and let B be the set of students who walk to classes. Describe the students in each of these sets. a) A B

More information

Complexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np

Complexity Theory. Compiled By : Hari Prasad Pokhrel Page 1 of 20. ioenotes.edu.np Chapter 1: Introduction Introduction Purpose of the Theory of Computation: Develop formal mathematical models of computation that reflect real-world computers. Nowadays, the Theory of Computation can be

More information

What is a Set? Set Theory. Set Notation. Standard Sets. Standard Sets. Part 1.1. Organizing Information

What is a Set? Set Theory. Set Notation. Standard Sets. Standard Sets. Part 1.1. Organizing Information Set Theory What is a Set? Part 1.1 Organizing Information What is a Set? Set Notation A set is an unordered collection of objects The collection objects are also called members or "elements" One of the

More information

Topic 3: Propositions as types

Topic 3: Propositions as types Topic 3: Propositions as types May 18, 2014 Propositions as types We have seen that the main mathematical objects in a type theory are types. But remember that in conventional foundations, as based on

More information

CS103 Spring 2018 Mathematical Vocabulary

CS103 Spring 2018 Mathematical Vocabulary CS103 Spring 2018 Mathematical Vocabulary You keep using that word. I do not think it means what you think it means. - Inigo Montoya, from The Princess Bride Consider the humble while loop in most programming

More information

Topic 1: What is HoTT and why?

Topic 1: What is HoTT and why? Topic 1: What is HoTT and why? May 5, 2014 Introduction Homotopy type theory (HoTT) is a newly emerging field of mathematics which is currently being developed as a foundation of mathematics which is in

More information

Mathematically Rigorous Software Design Review of mathematical prerequisites

Mathematically Rigorous Software Design Review of mathematical prerequisites Mathematically Rigorous Software Design 2002 September 27 Part 1: Boolean algebra 1. Define the Boolean functions and, or, not, implication ( ), equivalence ( ) and equals (=) by truth tables. 2. In an

More information

Material from Recitation 1

Material from Recitation 1 Material from Recitation 1 Darcey Riley Frank Ferraro January 18, 2011 1 Introduction In CSC 280 we will be formalizing computation, i.e. we will be creating precise mathematical models for describing

More information

Integers and Mathematical Induction

Integers and Mathematical Induction IT Program, NTUT, Fall 07 Integers and Mathematical Induction Chuan-Ming Liu Computer Science and Information Engineering National Taipei University of Technology TAIWAN 1 Learning Objectives Learn about

More information

4 Mathematical Data Types

4 Mathematical Data Types mcs 2015/5/18 1:43 page 81 #89 4 Mathematical Data Types We have assumed that you ve already been introduced to the concepts of sets, sequences, and functions, and we ve used them informally several times

More information

SOFTWARE ENGINEERING DESIGN I

SOFTWARE ENGINEERING DESIGN I 2 SOFTWARE ENGINEERING DESIGN I 3. Schemas and Theories The aim of this course is to learn how to write formal specifications of computer systems, using classical logic. The key descriptional technique

More information

Introduction to Homotopy Type Theory

Introduction to Homotopy Type Theory Introduction to Homotopy Type Theory Lecture notes for a course at EWSCS 2017 Thorsten Altenkirch March 5, 2017 1 What is this course about? To explain what Homotopy Type Theory is, I will first talk about

More information

Chapter Summary. Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms

Chapter Summary. Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms Chapter Summary Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms Section 5.1 Sec.on Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken

More information

Bootcamp. Christoph Thiele. Summer Axioms of set theory. The naive idea of sets is that they colelct objects together. collection of objects

Bootcamp. Christoph Thiele. Summer Axioms of set theory. The naive idea of sets is that they colelct objects together. collection of objects Bootcamp Christoph Thiele Summer 2012 Axioms of set theory The naive idea of sets is that they colelct objects together. collection of objects a, b, c, d, e,... Then a set could be {a, c, e} Suppose we

More information

Topology notes. Basic Definitions and Properties.

Topology notes. Basic Definitions and Properties. Topology notes. Basic Definitions and Properties. Intuitively, a topological space consists of a set of points and a collection of special sets called open sets that provide information on how these points

More information

Dr. Relja Vulanovic Professor of Mathematics Kent State University at Stark c 2008

Dr. Relja Vulanovic Professor of Mathematics Kent State University at Stark c 2008 MATH-LITERACY MANUAL Dr. Relja Vulanovic Professor of Mathematics Kent State University at Stark c 2008 1 Real Numbers 1.1 Sets 1 1.2 Constants and Variables; Real Numbers 7 1.3 Operations with Numbers

More information