Math 5801 General Topology and Knot Theory
|
|
- Delilah Miles
- 5 years ago
- Views:
Transcription
1 Lecture 3-8/27/2012 Math 5801 Ohio State University August 27, 2012 Course Info Textbook (required) J. R. Munkres, Topology (2nd Edition), Prentice Hall, Englewood Cliffs, NJ, ISBN-10: Reading for Wednesday, August 29 Chapter , pgs HW 2 for Wednesday, September 5 Chapter 1.4: 3a, 4a-b Chapter 1.5: 1 Chapter 1.6: 2, 7 Prove Propositions 10(1) and 11(3)
2 Zermelo-Fraenkel Axioms (EXT) (Extensionality Axiom) Sets are determined by their elements: For all sets A and B, (A = B) iff ( x, x A iff x B) (PAIR) (Pair Set Axiom) The set {x, y} exists: For all x and y, there is A s.t. z, [z A iff (z = x or z = y)] (UNION) (Axiom of Unions) Unions of sets exist: For all sets A there is a set B such that x B iff A A s.t. x A (POW) (Power Set Axiom) Every set has a power set: For all sets A there is a set P such that B, B P iff ( x B, x A) (SEP) (Separation Axiom) If A is a set and Q(x) is a logical statement which depends on x then the set of all elements of A satisfying Q(x) exists: A and statements Q(x), B s.t. x, x B iff x A and Q(x) is true. (REP) (Replacement Axiom) If A is a set and f is a function then B = f (A) is a set: For any set A and any statement Q(x, y) ( x A,!y s.t. Q(x,y) is true) implies ( B s.t. y B iff x A s.t. Q(x, y) is true) (EMP) (Existence of an empty set) There is a set which has no elements: There exists E s.t. x, x / E (REG) (Axiom of Regularity) Every nonempty set A contains an element x with x A =. For all sets A if A then x A s.t. ( y s.t. (y x) and (y A)) (INF) (Axiom of Infinity) There is an infinite set and it contains, { }, {, { }},. There exists S s.t. S and x S, x {x} S. (AC) (Axiom of Choice) Given a set A of nonempty disjoint sets there is a set C which contains exactly one element from each set in A. For all A s.t. ( / A) and ( A, B A,A B implies A B = ) C s.t. A A,!x C s.t. x C A. Forget everything you know about set theory. Can only talk about sets that exist due to ZFC axioms. Note: We can prove existence of some sets without Axiom of Choice (AC). Such sets are constructible. Using (AC) is fine but sets whose existence depends on (AC) are inaccessible.
3 Proposition 7 (Empty set is unique) Let denote the set given by (EMP). Then if the set A satisfies same properties as given in (EMP) then A =. Proof. By (EMP) there exists a set E such that x, x / E. Call it. Suppose there is A s.t. x, x / A. Then x, (x / A) and (x / ). Then x, (x A) and (x ). Then x, ( (x A) and (x ) ) or ( (x A) and (x ) ). Then x, (x A) iff (x ). So by (EXT) A =. Proposition 8 (Subsets of the empty set are empty) A iff A =. Proof. A = iff x, (x / A) iff x, (x A) iff x, (x A) implies (x ) iff A.
4 Proposition 9 P( ) = { }. Proof. By definition P( ) has property given in (POW). Namely B, B P( ) iff x B, x. By definition { } = {, } which by (PAIR) satisfies B, B {, } iff (B = ) or (B = ). Thus B, B { } iff B =. B P( ) iff x B, x iff B }{{} iff B = iff B { }. Thus B, B P( ) iff B { }. Thus by (EXT) we have P( ) = { }. Prop. 8 Proposition 10 (Miscellaneous properties of sets) If A, B and C are sets then: 1. A A. (Reflexivity) 2. A = B iff (A B and B A). 3. (A B and B C) implies A C. (Transitivity) 4. A A B. 5. A B A. 6. A. 7. A = A. 8. A =. 9. =. 10. B P(A) iff B A.
5 Proposition 11 (More properties of sets) 1. x {y} iff x = y. 2. {x} A iff x A. 3. {a, b} = {x, y} iff ((a = x and b = y) or (a = y and b = x)). Proposition 12 For any set A we have A / A. Proof. Let A be a set. Suppose A A. By (PAIR) the set {A} exists. A A and A {A} so A {A}. By (REG) there is x {A} such that x {A} =. But x {A} implies x = A implies x {A} = A {A} =. }{{} so A / A. Prop. 11(1) CONTRADICTION.
6 Ordered Pairs in ZFC Definition 13 (Ordered pair) (x, y) = {x, {x, y}}. Proposition 14 (x, y) = (z, w) iff x = z and y = w. Proof. Suppose x = z and y = w. Then {x, {x, y}} = {z, {z, w}}. Thus (x, y) = (z, w). Ordered Pairs in ZFC Proof of Prop. 14 (continued). Suppose (x, y) = (z, w). Then {x, {x, y}} = {z, {z, w}}. Then (x = z and {x, y} = {z, w}) or (x = {z, w} and {x, y} = z). CASE I: Suppose x = z and {x, y} = {z, w}. Then x = z and ((x = z and y = w) or (x = w and y = z)). If x = z and (x = z and y = w) then we are done. If x = z and (x = w and y = z) then w = x = z = y so (x = z and y = w) and we are done. CASE II: Suppose x = {z, w} and {x, y} = z. Then x = {{x, y}, w}. Let A = {{x, y}, x}. A fails (REG). CONTRADICTION
7 The Cartesian Product We d like to define A B = {(a, b) a A and b B}. In order to use (SEP) we need a set which contains each (a, b). Suppose a A and b B. By definition (a, b) = {a, {a, b}}. a A and {a, b} P(A B). So {a, {a, b}} A P(A B). So {a, {a, b}} P(A P(A B)). Definition 15 (Cartesian Product) A B = { C P(A P(A B)) } a A, b B s.t. C = (a, b). or more informally, A B = {(a, b) a A and b B}. Functions Definition 16 (Function) Let A and B be sets. A function f : A B is a pair f = (G, B) where G A B and for all a A there is a unique b B such that (a, b) G. If (a, b) G we write f (a) = b. The set dom(f ) = A is called the domain of f. The set codom(f ) = B is called the codomain or range of f. The set graph(f ) = G is called the graph of f. Observations: Let f be a function. Then a dom(f ) iff b B s.t. (a, b) graph(f ). If f and g are functions and f = g then graph(f ) = graph(g) and codom(f ) = codom(g). Moreover dom(f ) = dom(g). (Why?)
8 Functions Definition 17 Let f : A B be a function. 1. f is injective (or one-to-one) if 2. f is surjective (or onto) if x, y A, ( f (x) = f (y) implies x = y ). b B, a A s.t. f (a) = b. 3. f is bijective (or gives a one-to-one correspondence) if it is injective and surjective. 4. If f is bijective then its inverse is the function f 1 : B A with graph(f 1 ) = { (b, a) B A a A s.t. f (a) = b }. Functions Definition 18 (Composition of functions) Let f : A B and g : B C be functions. Then the composition of g and f is the function g f : A C with graph(g f ) = { (a, c) A C b B s.t. f (a) = b and g(b) = c }. Definition 19 (Identity function) The identity function on the set A is the function ida : A A with graph(ida) = { (a, a) A A a A }. Proposition 20 If f : A B is a bijection then f 1 f = ida and f f 1 = idb.
9 Functions Definition 21 Let f : A B be a function. 1. If X A then the image of X under f is the set f (X ) = { b B x X s.t. f (x) = b } 2. In particular f (A) is called the image of f. 3. If Y B then the preimage of Y under f is the set f 1 (Y ) = { a A y Y s.t. f (a) = y } 4. Let X A. The restriction of f to X is the function f X : X B where graph(f X ) = { (x, b) X B x X s.t. f (x) = b } Functions Proposition 22 Let f : A B be a function. 1. If X A then X f 1 (f (X )). 2. If Y B then f (f 1 (Y )) Y. 3. If f is injective and X A then X = f 1 (f (X )). 4. If f is surjective and Y B then f (f 1 (Y )) = Y.
10 Functions Definition 23 (The set of all functions) Let A and B be sets. The set of all functions from A to B is the set B A = { f f : A B }. More formally, B A = { f P(A B) {B} } f : A B. Let A be a nonempty set. Which of the following are empty? 1. A A 2. A 3. A 4. Relations Definition 24 (Relation) Let A be a set. A relation is a subset C A A. We write xcy instead of (x, y) C. Example 25 If f : A A then graph(f ) is a relation on A.
11 Equivalence Relations Definition 26 (Equivalence Relation) Let A be a set. An equivalence relation on A is a relation C on A satisfying: 1. (Reflexivity) xcx for all x A. 2. (Symmetry) If xcy then ycx. 3. (Transitivity) If xcy and ycz then xcz. We ll usually write x y instead of xcy. Definition 27 (Equivalence Class) Let be a relation on A. If x A then the equivalence class of x is the set Ex = {y A x y} Partitions Definition 28 (Partition) Let A be a set. A partition of A is a subset D P(A) with 1. D = A. 2. If X, Y D then (X Y = X = Y ). Proposition 29 Let A be a set with an equivalence relation and let E = { E P(A) x A s.t. E is equiv. class of x }. Then E is a partition of A.
12 Order Relations Definition 30 (Order Relation) Let A be a set. An order relation (or simple order or linear order) on A is a relation C on A satisfying: 1. (Comparability) For all x, y A, x y implies (xcy or ycx). 2. (Nonrefexivity) For all x A, xcx. 3. (Transitivity) If xcy and ycz then xcz. We ll usually write x < y or y > x instead of xcy. Definition 31 (Open Interval) Let A be a set with an order relation < and let a, b A. The set Is an open interval in A. {x A a < x < b} Order Relations Definition 32 (Bounds) Let A be a set with an order relation < and let X A be a subset. 1. An upper bound for X is an elt. a A s.t. for all x X, x a. 2. X is bounded above if it has an upper bound. 3. X has a largest element if x X s.t. x is an upper bound of X. 4. A lower bound for X is an elt. a A s.t. for all x X, a x. 5. X is bounded below if it has a lower bound. 6. X has a smallest element if x X s.t. x is a lower bound of X. 7. The supremum of X sup X is the smallest upper bound of X. 8. The infimum of X inf X is the smallest upper bound of X.
Math 5801 General Topology and Knot Theory
Lecture 2-8/24/2012 Math 5801 Ohio State University August 24, 2012 Course Info Textbook (required) J. R. Munkres, Topology (2nd Edition), Prentice Hall, Englewood Cliffs, NJ, 2000. ISBN-10: 0131816292
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationLecture 7: Relations
Lecture 7: Relations 1 Relation Relation between two objects signify some connection between them. For example, relation of one person being biological parent of another. If we take any two people at random,
More informationZermelo-Fraenkel Set Theory
Zermelo-Fraenkel Set Theory Zak Mesyan University of Colorado Colorado Springs The Real Numbers In the 19th century attempts to prove facts about the real numbers were limited by the lack of a rigorous
More information(a) We need to prove that is reflexive, symmetric and transitive. 2b + a = 3a + 3b (2a + b) = 3a + 3b 3k = 3(a + b k)
MATH 111 Optional Exam 3 lutions 1. (0 pts) We define a relation on Z as follows: a b if a + b is divisible by 3. (a) (1 pts) Prove that is an equivalence relation. (b) (8 pts) Determine all equivalence
More information9 FUNCTIONS. 9.1 The Definition of Function. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2018 1 9 FUNCTIONS 9.1 The Definition of Function DEFINITION 1. Let X and Y be nonempty sets. A function f from the set X to the set Y is a correspondence that assigns to each
More informationChapter 2 Axiomatic Set Theory
Chapter 2 Axiomatic Set Theory Ernst Zermelo (1871 1953) was the first to find an axiomatization of set theory, and it was later expanded by Abraham Fraenkel (1891 1965). 2.1 Zermelo Fraenkel Set Theory
More informationRelations, Functions, and Sequences
MCS-236: Graph Theory Handout #A3 San Skulrattanakulchai Gustavus Adolphus College Sep 13, 2010 Relations, Functions, and Sequences Relations An ordered pair can be constructed from any two mathematical
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationMATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.
MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described
More information5 FUNCTIONS. 5.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2017 1 5 FUNCTIONS 5.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from the set A to the set B is a correspondence that assigns to
More informationAxioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationFunctions as Relations
Functions as Relations Definition Recall that if A and B are sets, then a relation from A to B is a subset of A B. A function from A to B is a relation f from A to B with the following properties (i) The
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More informationMath 109 September 1, 2016
Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationPostulate 2 [Order Axioms] in WRW the usual rules for inequalities
Number Systems N 1,2,3,... the positive integers Z 3, 2, 1,0,1,2,3,... the integers Q p q : p,q Z with q 0 the rational numbers R {numbers expressible by finite or unending decimal expansions} makes sense
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationA Logician s Toolbox
A Logician s Toolbox 461: An Introduction to Mathematical Logic Spring 2009 We recast/introduce notions which arise everywhere in mathematics. All proofs are left as exercises. 0 Notations from set theory
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationLecture 8: Equivalence Relations
Lecture 8: Equivalence Relations 1 Equivalence Relations Next interesting relation we will study is equivalence relation. Definition 1.1 (Equivalence Relation). Let A be a set and let be a relation on
More informationABOUT THE CLASS AND NOTES ON SET THEORY
ABOUT THE CLASS AND NOTES ON SET THEORY About the Class Evaluation. Final grade will be based 25%, 25%, 25%, 25%, on homework, midterm 1, midterm 2, final exam. Exam dates. Midterm 1: Oct 4. Midterm 2:
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationMathematics Review for Business PhD Students
Mathematics Review for Business PhD Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationTopics in Logic, Set Theory and Computability
Topics in Logic, Set Theory and Computability Homework Set #3 Due Friday 4/6 at 3pm (by email or in person at 08-3234) Exercises from Handouts 7-C-2 7-E-6 7-E-7(a) 8-A-4 8-A-9(a) 8-B-2 8-C-2(a,b,c) 8-D-4(a)
More informationMath 6120 Fall 2012 Assignment #1
Math 6120 Fall 2012 Assignment #1 Choose 10 of the problems below to submit by Weds., Sep. 5. Exercise 1. [Mun, 21, #10]. Show that the following are closed subsets of R 2 : (a) A = { (x, y) xy = 1 },
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationINTRODUCTION TO CARDINAL NUMBERS
INTRODUCTION TO CARDINAL NUMBERS TOM CUCHTA 1. Introduction This paper was written as a final project for the 2013 Summer Session of Mathematical Logic 1 at Missouri S&T. We intend to present a short discussion
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationProblems - Section 17-2, 4, 6c, 9, 10, 13, 14; Section 18-1, 3, 4, 6, 8, 10; Section 19-1, 3, 5, 7, 8, 9;
Math 553 - Topology Todd Riggs Assignment 2 Sept 17, 2014 Problems - Section 17-2, 4, 6c, 9, 10, 13, 14; Section 18-1, 3, 4, 6, 8, 10; Section 19-1, 3, 5, 7, 8, 9; 17.2) Show that if A is closed in Y and
More informationREVIEW FOR THIRD 3200 MIDTERM
REVIEW FOR THIRD 3200 MIDTERM PETE L. CLARK 1) Show that for all integers n 2 we have 1 3 +... + (n 1) 3 < 1 n < 1 3 +... + n 3. Solution: We go by induction on n. Base Case (n = 2): We have (2 1) 3 =
More informationIntroduction to Mathematical Analysis I. Second Edition. Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam
Introduction to Mathematical Analysis I Second Edition Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam Introduction to Mathematical Analysis I Second Edition Beatriz Lafferriere Gerardo Lafferriere
More informationEconomics 204 Summer/Fall 2011 Lecture 2 Tuesday July 26, 2011 N Now, on the main diagonal, change all the 0s to 1s and vice versa:
Economics 04 Summer/Fall 011 Lecture Tuesday July 6, 011 Section 1.4. Cardinality (cont.) Theorem 1 (Cantor) N, the set of all subsets of N, is not countable. Proof: Suppose N is countable. Then there
More informationMath 564 Homework 1. Solutions.
Math 564 Homework 1. Solutions. Problem 1. Prove Proposition 0.2.2. A guide to this problem: start with the open set S = (a, b), for example. First assume that a >, and show that the number a has the properties
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationSets, Structures, Numbers
Chapter 1 Sets, Structures, Numbers Abstract In this chapter we shall introduce most of the background needed to develop the foundations of mathematical analysis. We start with sets and algebraic structures.
More informationMathematics Review for Business PhD Students Lecture Notes
Mathematics Review for Business PhD Students Lecture Notes Anthony M. Marino Department of Finance and Business Economics Marshall School of Business University of Southern California Los Angeles, CA 90089-0804
More information9/19/2018. Cartesian Product. Cartesian Product. Partitions
Cartesian Product The ordered n-tuple (a 1, a 2, a 3,, a n ) is an ordered collection of objects. Two ordered n-tuples (a 1, a 2, a 3,, a n ) and (b 1, b 2, b 3,, b n ) are equal if and only if they contain
More informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationMATH XYZ. 1. Basics: Sets, Maps, Relations,...
MATH XYZ 1. Basics: Sets, Maps, Relations,... The axiomatic point of view: All entities are sets. For any sets X, A one has: - Either X A [read X belongs to A or X is element of A ]. - Or X / A [read X
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationLecture 2. Econ August 11
Lecture 2 Econ 2001 2015 August 11 Lecture 2 Outline 1 Fields 2 Vector Spaces 3 Real Numbers 4 Sup and Inf, Max and Min 5 Intermediate Value Theorem Announcements: - Friday s exam will be at 3pm, in WWPH
More informationMath 105A HW 1 Solutions
Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S
More informationCopyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction
Copyright & License Copyright c 2007 Jason Underdown Some rights reserved. statement sentential connectives negation conjunction disjunction implication or conditional antecedant & consequent hypothesis
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationHandout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1
22M:132 Fall 07 J. Simon Handout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1 Chapter 1 contains material on sets, functions, relations, and cardinality that
More informationTutorial on Axiomatic Set Theory. Javier R. Movellan
Tutorial on Axiomatic Set Theory Javier R. Movellan Intuitively we think of sets as collections of elements. The crucial part of this intuitive concept is that we are willing to treat sets as entities
More informationSupplementary Material for MTH 299 Online Edition
Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think
More informationA BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox
A BRIEF INTRODUCTION TO ZFC CHRISTOPHER WILSON Abstract. We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular
More informationGENERAL TOPOLOGY JESPER M. MØLLER
GENERAL TOPOLOGY JESPER M. MØLLER Contents 1. Sets, functions and relations 3 1.1. Sets 3 1.2. Functions 3 1.5. Relations 4 2. The integers and the real numbers 7 3. Products and coproducts 9 4. Finite
More information{x : P (x)} P (x) = x is a cat
1. Sets, relations and functions. 1.1. Set theory. We assume the reader is familiar with elementary set theory as it is used in mathematics today. Nonetheless, we shall now give a careful treatment of
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationRED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam
RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
More information1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9
1.4 Cardinality Tom Lewis Fall Term 2006 Tom Lewis () 1.4 Cardinality Fall Term 2006 1 / 9 Outline 1 Functions 2 Cardinality 3 Cantor s theorem Tom Lewis () 1.4 Cardinality Fall Term 2006 2 / 9 Functions
More informationChapter 0. Introduction: Prerequisites and Preliminaries
Chapter 0. Sections 0.1 to 0.5 1 Chapter 0. Introduction: Prerequisites and Preliminaries Note. The content of Sections 0.1 through 0.6 should be very familiar to you. However, in order to keep these notes
More informationAN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES
AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES DUSTIN HEDMARK Abstract. A study of the conditions under which a topological space is metrizable, concluding with a proof of the Nagata Smirnov
More informationMATH 433 Applied Algebra Lecture 14: Functions. Relations.
MATH 433 Applied Algebra Lecture 14: Functions. Relations. Cartesian product Definition. The Cartesian product X Y of two sets X and Y is the set of all ordered pairs (x,y) such that x X and y Y. The Cartesian
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationContents Propositional Logic: Proofs from Axioms and Inference Rules
Contents 1 Propositional Logic: Proofs from Axioms and Inference Rules... 1 1.1 Introduction... 1 1.1.1 An Example Demonstrating the Use of Logic in Real Life... 2 1.2 The Pure Propositional Calculus...
More informationCHAPTER 0: BACKGROUND (SPRING 2009 DRAFT)
CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) MATH 378, CSUSM. SPRING 2009. AITKEN This chapter reviews some of the background concepts needed for Math 378. This chapter is new to the course (added Spring
More informationMATH 13 SAMPLE FINAL EXAM SOLUTIONS
MATH 13 SAMPLE FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers.
More informationBackground for Discrete Mathematics
Background for Discrete Mathematics Huck Bennett Northwestern University These notes give a terse summary of basic notation and definitions related to three topics in discrete mathematics: logic, sets,
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationSelected problems from past exams
Discrete Structures CS2800 Prelim 1 s Selected problems from past exams 1. True/false. For each of the following statements, indicate whether the statement is true or false. Give a one or two sentence
More informationThis paper is also taken by Combined Studies Students. Optional Subject (i): Set Theory and Further Logic
UNIVERSITY OF LONDON BA EXAMINATION for Internal Students This paper is also taken by Combined Studies Students PHILOSOPHY Optional Subject (i): Set Theory and Further Logic Answer THREE questions, at
More informationCITS2211 Discrete Structures (2017) Cardinality and Countability
CITS2211 Discrete Structures (2017) Cardinality and Countability Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets Reading Sections 45 and 81 84 of Mathematics
More informationNumbers, sets, and functions
Chapter 1 Numbers, sets, and functions 1.1. The natural numbers, integers, and rational numbers We assume that you are familiar with the set of natural numbers the set of integers and the set of rational
More informationShort notes on Axioms of set theory, Well orderings and Ordinal Numbers
Short notes on Axioms of set theory, Well orderings and Ordinal Numbers August 29, 2013 1 Logic and Notation Any formula in Mathematics can be stated using the symbols and the variables,,,, =, (, ) v j
More informationRelations. Relations. Definition. Let A and B be sets.
Relations Relations. Definition. Let A and B be sets. A relation R from A to B is a subset R A B. If a A and b B, we write a R b if (a, b) R, and a /R b if (a, b) / R. A relation from A to A is called
More informationCardinality and ordinal numbers
Cardinality and ordinal numbers The cardinality A of a finite set A is simply the number of elements in it. When it comes to infinite sets, we no longer can speak of the number of elements in such a set.
More informationMATH 318 Mathematical Logic Class notes
MATH 318 Mathematical Logic Class notes Notes by: Yue Ru Sun 1 Instructor: Dr. Marcin Sabok McGill University Last updated: December 15, 2015 {a, b, c} {b, c} {a, c} {a, b} {c} {b} {a} 1 If you find any
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationLecture 5: Minimizing DFAs
6.45 Lecture 5: Minimizing DFAs 6.45 Announcements: - Pset 2 is up (as of last night) - Dylan says: It s fire. - How was Pset? 2 DFAs NFAs DEFINITION Regular Languages Regular Expressions 3 4 Some Languages
More informationSet Theory and the Foundation of Mathematics. June 19, 2018
1 Set Theory and the Foundation of Mathematics June 19, 2018 Basics Numbers 2 We have: Relations (subsets on their domain) Ordered pairs: The ordered pair x, y is the set {{x, y}, {x}}. Cartesian products
More informationCHAPTER THREE: RELATIONS AND FUNCTIONS
CHAPTER THREE: RELATIONS AND FUNCTIONS 1 Relations Intuitively, a relation is the sort of thing that either does or does not hold between certain things, e.g. the love relation holds between Kim and Sandy
More informationINFINITY: CARDINAL NUMBERS
INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex
More informationGeneral Topology. Jesper M. Møller
General Topology Jesper M. Møller Matematisk Institut, Universitetsparken 5, DK 2100 København E-mail address: moller@math.ku.dk URL: http://www.math.ku.dk/~moller Contents Chapter 0. Introduction 5 Chapter
More informationFoundations of mathematics. 5. Galois connections
Foundations of mathematics 5. Galois connections Sylvain Poirier http://settheory.net/ The notion of Galois connection was introduced in 2.11 (see http://settheory.net/set2.pdf) with its first properties.
More informationApplied Calculus GS1001
1 Applied Calculus GS1001 January 24, 2019 0 Numbers, sets 0.1 numbers natural numbers N (+) (0),1,2,3,... integers Z 3, 2, 1,0,... rational numbers m/n m,n Z n 0 real numbers R complex numbers C = {a+ib
More informationTopology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski
Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More information