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

Save this PDF as:

Size: px
Start display at page:

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

## Transcription

1 Math 525 Chapter 1 Stuff If A and B are sets, then A B = {(x,y) x A, y B} denotes the product set. If S A B, then S is called a relation from A to B or a relation between A and B. If B = A, S A A is called a relation on A. For a relation S A B, we define Dom S = {x A y B s.t. (x,y) S} Ran S = {y B x A s.t. (x,y) S} domain of S range or image of S S 1 = {(y,x) (x,y) S} inverse of S Note that S 1 B A is a relation from B to A. Clearly, DomS 1 = Ran S and Ran S 1 = Dom S. If S A B and T B C, we define the composition T S A C by T S = {(x,y) z B s.t. (x,z) S and (z,y) T }. It should be clear that T S = φ if (Ran S) (Dom T) = φ. If S A B, C A and D B, we define: S(C) = {y B x C s.t. (x,y) S} image of C relative to S S 1 (D) = {x A y D s.t. (x,y) S} preimage of D relative to S. In the case that C or D is a singleton set, the { } are often omitted in the above definitions: S(x) means S({x}) and S 1 (y) means S 1 ({y}). Functions If A, B are sets, f : A B is a function from A into B if f A B, Dom f = A, and f(x) is a singleton set for all x A. If f is a function and f(x) = {y}, we normally write f(x) = y instead. In general, B is called the codomain of f and Ran f B. If f is a function satisfying f(x) = f(y) = x = y for all x,y A, then f is injective.

2 If Ran f = B, then f is surjective (relative to the codomain B). A function f : A B which is both injective and surjective is said to be bijective (or a bijection). Since a function f : A B is a special case of a relation from A to B, inverses and compositions are defined for functions as described previously. It is easy to check that if f : A B and g : B C are functions, then g f : A C is also a function. Furthermore, f 1 B A always exists as a relation, but f 1 is not necessarily a function. Note that f 1 : Ranf A is a function (indeed, a bijection) iff f is injective. Also, f 1 : B A is a bijection iff f : A B is a bijection. Proposition A1 Let f : A B and g : B A be functions such that g f = i A and f g = i B. Then f and g are bijections, and f = g 1. Equivalence Relations In studying equivalence and order relations, we restrict our attention to relations of the form S A A. In other words, S is a relation on A. We define a relation S on A to be: (1) Reflexive iff x A, (x,x) S; (2) Symmetric iff x,y A, (x,y) S = (y,x) S; (3) Transitive iff x,y,z A, ((x,y) S and (y,z) S) = (x,z) S. Another notion closely related to an equivalence relation on A is a partition of a set A. Let C = {A i i I}, where I is an arbitrary index set and A i A for all i I. Then C is called a partition of A iff C = i I A i = A and A i A j = φ whenever i j in I. Equivalence relations and partitions are essentially the same thing. If S is an equivalence relation on A, then for each x in A, [x] = {y x y} is called the equivalence class containing x, and the set A/S = {[x] x A} of equivalence classes forms a partition of A, which is called the quotient set of A relative to S. On the other hand, if C = {A i i I} is any partition of A, then the relation S = {(x,y) S i I s.t. x,y A i } is an equivalence relation on A and A/S = C.

3 A relation S on a set A is: anti-symmetric iff x,y A, (x,y) S and (y,x) S x = y; comparable iff x,y A, either (x,y) S or (y,x) S. A relation S on A is called a partial order relation (or just a partial order) iff it is reflexive, transitive, and anti-symmetric. A partial order which is comparable is called a total order (other terms used for this same concept include simple order, linear order, and, in Munkres, order). A partially ordered set is often called a poset; a simply ordered set is often called a chain. In dealing with any type of order relation S on A, it is common to write x y or y x rather than (x,y) S. If x y and x y, then we write x < y (or y > x), which is referred to as a strict inequality. Using the inequality notion, we can define a poset (A, ) to be a set A with a partial order satisfying (1) x x for all x A (reflexive) (2) (x y and y z) = x z for all x,y,z A (transitive) (3) (x y and y x) = x = y for all x,y A (anti-symmetric) (A, ) is a totally ordered set or chain iff, in addition, (4) x,y A, either x y or y x. Examples 1. R, Q, Z and N are all totally ordered sets, with their usual orderings. 2. Let X be any set and let P(X) denote the power set of X (the set of all subsets of X). Define an ordering on P(X) as follows: For all B,C P(X), B C iff B C. Then (P(X), ) is a poset, but is not simply ordered if X has 2 or more elements. For if x,y X and x y, then the sets {x} and {y} do not satisfy the comparability condition, since {x} {y} and {y} {x}.

4 3. Consider two frequently used partial orders on the Euclidean plane R 2 : (1) (a,b) (c,d) iff a c and b d (pointwise order) (2) (a,b) (c,d) iff a < c or a = c and b d (dictionary order) Relative to pointwise ordering, R 2 is a poset but is not simply ordered, since (for example) the elements (1, 2) and (2, 1) are not comparable. Relative to the dictionary order, R 2 is totally ordered. Let (A, ) be a poset and φ B A. Then y A is an upper bound for B iff b y for all b B. Let U(B) be the set of all upper bounds of B. If U(B) has a least element (i.e. x U(B) such that x y for all y U(B)), then x is the least upper bound of B, denoted supb. Analogously, we can define the greatest lower bound of B, which, if it exists, is denoted by inf B. Note that supb will fail to exist either if U(B) is empty or if U(B) φ but contains no least element. A poset in which each set bounded above has a least upper bound and each set bounded below has a greatest lower bound is defined to be order complete. Note that R, N, Z, P(X) and (R 2, pointwise order) are order complete, whereas Q and (R 2, dictionary order) are not. An element x in a poset (A, ) is a maximal element iff y A such that x < y. If A contains a greatest element, that element is the unique maximal element. But a maximal element need not be the greatest element. For example, let A = {(x,y) R 2 y x} and use the pointwise order on A. Then every element on the line y = x is a maximal element of A, but A has no greatest element. Axiom of Choice If C = {A i i I} is an arbitrary non-empty collection of non-empty sets, there is a function f : I C such that f(i) A i for all i I. Many constructions and proofs in topology involve selecting an arbitrary element from each member of an arbitrary collection of non-empty sets, and the Axiom of Choice justifies this procedure. The Axiom of Choice does not explicitly describe how to carry out this selection;

5 rather it asserts that the assumption that such a selection can be made will not lead to any contradiction. A small group of mathematicians called Constructionists reject this axiom, but most mathematicians accept the Axiom of Choice because of its many useful and interesting applications. Next, we state Zorn s Lemma, which is (not obviously) equivalent to the Axiom of Choice. Zorn s Lemma Let Z be a non-empty poset in which each simply ordered subset has an upper bound. Then Z contains a maximal element. Zorn s Lemma can often be used to prove results to which the original statement of the Axiom of Choice does not seem applicable. To illustrate the use of Zorn s Lemma and some of the order properties discussed earlier, we ll next prove a theorem from linear algebra. Recall that a set B is a basis for a vector space V iff B is an independent set in V which spans V. Theorem A2 Every vector space V {0} has a basis. Proof: Let Z be the set of all linearly independent subsets of V, partially ordered by set inclusion. Since V {0}, there is a nonzero element x in V, and so {x} Z, and Z φ. To show that Z satisfies the hypothesis of Zorn s Lemma, let {D i i I} be a simply ordered (i.e. nested) subset of Z. Let D = D i. Because the D i are nested, it can be verified that i I D is linearly independent and hence an upper bound of {D i i I} in Z. Now, by Zorn s Lemma, Z must have a maximal element. That is, Z must contain a maximal independent subset of V ; call it B. To show that B is a basis for V, it remains only to show that B spans V. Let Y be the vector subspace of V spanned by B (sometimes written as Y = span B). If Y V, then y V Y. Since y is not in the span of B, the set B {y} would be an independent set in V which properly contains B, contradicting the maximality of B in Z. Thus Y = V, and B is a basis for V.

6 To form set exponents, it is useful to first extend the definition of set products. Let {X i i I} be an arbitrary collection of sets, and let P = {f : I X i f(i) Xi for all i I}. i I P is called the Cartesian product of the X i, denoted by P = X i. Note that each i I function f P is a function which chooses a representative element, f(i), from each set X i. Such a function is often referred to as a choice function, and its existence is a consequence of the Axiom of Choice. Also note that P = φ iff X i = φ for some i I. In dealing with set products, it is common to write f i I X i as f = (x i ) i I, where f(i) = x i. If I = {1, 2,...,n}, then f would be the n-tuple (x 1,x 2,...,x n ). If I = N, then f would be the sequence (x n ) n N. Set exponentiation is simply a special case of set product. If A and I are sets, and X i = A for all i, then i I X i can be thought of as the product of A with itself I times, and we write i I X i = i I A = AI. By the earlier definition of i I X i, it follows that A I is simply the set of all functions from I into A. If A and I are finite sets with n and k elements, respectively, then A I contains n k elements. Note that R n = R I, where I = {1, 2,...,n}, and R N is the set of all (infinite) sequences of real numbers. The power set P(X) of all subsets of X is often written via exponential notation. Let 2 denote the set {0, 1}, and for any subset A of X, let χ A denote the characteristic function of A: 1, x A χ A (x) = 0, x X A. Then every f 2 X is the characteristic function of some subset of X, and each subset of X is uniquely defined by its characteristic function. Thus P(X) can be identified with 2 X.

7 Cardinal Numbers The Cardinal numbers are the equivalence classes induced by the relation of bijectivity on the class of all sets. The the cardinal number (equivalence class) of φ is called 0 ; we write φ = 0. The cardinal number (equivalence class) of every singleton set is called 1 ; we write {a} = 1. The cardinal number (equivalence class) of every n-element set is called n ; for example, {a,b,c,d,e} = 5. The cardinal number of N, Z, Z + and Q is called ℵ 0. ℵ 0 is the smallest infinite cardinal. A set is countable iff its cardinal number is ℵ 0, and is otherwise uncountable. The cardinal numbers are totally ordered by. Well Ordered Sets The theory of well ordered sets provides the foundation for the study of ordinal numbers. A well ordered set (w.o.set) is a poset in which every non-empty subset contains a least element. Proposition A3 Every well-ordered set is totally ordered. Proof: Let X be a well ordered set, and let x,y X. Then the subset {x,y} must contain a least element, which is either x or y. If it is x, then x y. If it is y, then y x. Thus X is a poset which also satisfies the comparability axiom, and is therefore totally ordered. Every w.o.set contains a least element, but not every totally ordered set with a least element is well ordered. For example, [0, 1] (with the usual ordering) has a least element 0, but the subset (0, 1) does not. Every finite totally ordered set is well ordered, as is the set N of natural numbers. If A and B are disjoint well ordered sets, then A B can be made into a w.o.set by stipulating that (a A and b B) = a < b, while leaving the orders within A and B unchanged. For instance, suppose A = {a 0,a 1,...,a n,...} and B = {b 0,b 1,...,b n,...}, where the elements of these sets are listed in increasing order from left to right. Then A B = {a 0,a 1,...,a n,...,b 0,b 1,...,b n,...}, with elements again listed in increasing order from left to right, is a w.o.set. Furthermore, for any w.o.sets A and B, the set A B is well ordered relative to the dictionary order. Any subset of a well ordered set with the inherited

8 order is also well ordered. In a totally ordered set X, b is the immediate successor of a iff a < b and a < c b = c = b. The immediate predecessor is defined similarly. Proposition A4 In a w.o.set X, every element which is not the greatest element of X has an immediate successor, but every element does not necessarily have an immediate predecessor. Proof: Let a be an element of X which is not the greatest element. And let b be the least element of {x A a < x}, which is is non-empty. Then b is the immediate successor of a. In the example mentioned previously involving A B, neither a 0 nor b 0 has an immediate predecessor. Proposition A5 In a well ordered set X, every non-empty subset bounded above has a least upper bound, and every non-empty subset has a greatest lower bound. Proof: If A φ is bounded above, then the set U(A) of all upper bounds of A contains a least element, which is the l.u.b of A. Also, every A φ contains a least element, which is the g.l.b. of A. An important theorem in set theory is the Well Ordering Theorem, first proved by Zermelo in 1904 using the Axiom of Choice. It was later discovered that the Well Ordering Theorem is equivalent to the Axiom of Choice. We ll state the Well Ordering Theorem here without proof. Well Ordering Theorem Every set can be well ordered. This theorem is clear for countable sets, but is not obvious in general. Like other results based on the Axiom of Choice, the Well Ordering Theorem asserts the existence of something without providing a means for achieving it. If (X, ) is a w.o.set and x X, we define S x = {y X y < x}. S x is called the initial section of X determined by x. Recall from a previous example the well-ordered set A B = {a 0,a 1,...,a n,...,b 0,b 1,...,b m,...,...}, formed from the union of two disjoint well-ordered sets A and B. For this set, we have

9 S a0 = φ, S a2 = {a 0,a 1 }, S an = {a 0,a 1,...,a n 1 }, S b0 = A, etc. Proposition A6 There exists an uncountable well-ordered set S Ω such that every initial section of S Ω is countable. Proof : Start with any uncountable set X and use the Well Ordering Theorem to well-order X. Let Y be another uncountable well-ordered set obtained by setting Y = X X with the dictionary order. If x 1 is not the least element of X, then the initial segment of Y determined by (x 1,x 1 ) is clearly uncountable, and so A = {y Y S y is uncountable } is a non-empty set in Y, which by assumption contains a least element; call it Ω. Note that by assumption, S Ω S y for all y Y. Claim 1: Every initial segment of S Ω countable. If not, then there would exists a z < Ω such that the initial section (S Ω ) z = Y z is uncountable. By definition of A and Ω, we d then have z A and z Ω, which is a contradiction. Claim 2: S Ω is uncountable. This follows immediately, since Ω A. This uncountable w.o.set S Ω plays an important role as a source of examples in topology. Ordinal Numbers Two well-ordered sets A and B are similar (we ll write A B) iff there is an order-preserving bijection ψ from A to B. This is a bijection ψ : A B such that x y in A iff ψ(x) ψ(y) in B. Note that similar w.o.sets have the same cardinal number. If there is a b B such that A B b, we write A B. Ordinal numbers are defined to be the equivalence classes obtained when the class W of all well-ordered sets is partitioned into equivalence classes relative to the equivalence relation similarity. If L W, let L denote the ordinal number of the equivalence class containing L. As before, we denote by L the cardinal number for L. For each ordinal number λ, there is an associated cardinal number λ, which is the cardinality of any set L λ.

10 Let O denote the class of ordinal numbers. A total order on O is defined by λ µ iff there exists L λ and M µ such that L M or L M, with λ < µ corresponding to L M. The finite ordinal numbers are those ordinals λ for which λ is finite. All well-ordered sets with exactly n elements are similar to each other, and thus they all belong to the same equivalence class in W. So there is a unique ordinal number corresponding to an n-element set, which it is natural to denote by n. Since there is an obvious order-preserving bijection between finite ordinals and finite cardinals, it is customary to make no distinction between finite ordinal numbers and finite cardinal numbers. When we consider the infinite ordinals (those ordinals λ for which λ ℵ 0 ), the situation is drastically different. We define denumerable ordinals (resp., countable ordinals) to be those of cardinality ℵ 0 (resp., ℵ 0 ). We can consider the denumerable ordinals to correspond to the distinct ways to well-order a denumerable set. For instance, N is already well-ordered in its natural ordering. Some other w.o.sets defining denumerable ordinals are listed here: ω = {a 0,a 1,...,a n,...} = N, ω + 1 = {a 0,a 1,...,a n,...,b 0 } ω + ω = {a 0,a 1,...,a n,...,b 0,b 1,...,b m,...} ω ω = N N, with dictionary order The number of denumerable ordinals in uncountable. It is customary to refer to S Ω as the set of countable ordinals, and Ω = S Ω is called the first (least) uncountable ordinal. ω = N is the smallest infinite ordinal. Two important facts about ordinal numbers which we may use but will not prove are the following. Theorem A7 Any set of ordinals in their natural order is a well-ordered set. Corollary Any set of cardinal numbers in their natural order is well-ordered. The assertion that R = 2 ℵ 0 is the immediate cardinal successor of ℵ 0 is called the Continuum Hypothesis. This hypothesis, like the Axiom of Choice, can be accepted or rejected as an axiom of set theory.

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

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

### POWER SETS AND RELATIONS

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

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

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

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

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

### SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

### This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

### (a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9

Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

### Introduction to Topology

Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

### LEARNING OBJECTIVES FOR THIS CHAPTER

CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

### Lecture Notes on Topology for MAT3500/4500 following J. R. Munkres textbook. John Rognes

Lecture Notes on Topology for MAT3500/4500 following J. R. Munkres textbook John Rognes November 29th 2010 Contents Introduction v 1 Set Theory and Logic 1 1.1 ( 1) Fundamental Concepts..............................

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

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

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### Cartesian Products and Relations

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

### Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

### Foundations of Mathematics I Set Theory (only a draft)

Foundations of Mathematics I Set Theory (only a draft) Ali Nesin Mathematics Department Istanbul Bilgi University Kuştepe Şişli Istanbul Turkey anesin@bilgi.edu.tr February 12, 2004 2 Contents I Naive

### 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 1. Metric Spaces. Metric Spaces. Examples. Normed linear spaces

Chapter 1. Metric Spaces Metric Spaces MA222 David Preiss d.preiss@warwick.ac.uk Warwick University, Spring 2008/2009 Definitions. A metric on a set M is a function d : M M R such that for all x, y, z

### 1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

### Recursion Theory in Set Theory

Contemporary Mathematics Recursion Theory in Set Theory Theodore A. Slaman 1. Introduction Our goal is to convince the reader that recursion theoretic knowledge and experience can be successfully applied

### FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

### Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

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

### Finite dimensional topological vector spaces

Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the

### Set theory as a foundation for mathematics

Set theory as a foundation for mathematics Waffle Mathcamp 2011 In school we are taught about numbers, but we never learn what numbers really are. We learn rules of arithmetic, but we never learn why these

### Separation Properties for Locally Convex Cones

Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam

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

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

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

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

### 13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

### An Introduction to Real Analysis. John K. Hunter. Department of Mathematics, University of California at Davis

An Introduction to Real Analysis John K. Hunter Department of Mathematics, University of California at Davis Abstract. These are some notes on introductory real analysis. They cover the properties of the

### 3. Prime and maximal ideals. 3.1. Definitions and Examples.

COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

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

### Linear Algebra I. Ronald van Luijk, 2012

Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.

### SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

### Fundamentele Informatica II

Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

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

### Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),

### ABSTRACT ALGEBRA. Romyar Sharifi

ABSTRACT ALGEBRA Romyar Sharifi Contents Introduction 7 Part 1. A First Course 11 Chapter 1. Set theory 13 1.1. Sets and functions 13 1.2. Relations 15 1.3. Binary operations 19 Chapter 2. Group theory

### Lecture 16 : Relations and Functions DRAFT

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

### INTRODUCTION TO TOPOLOGY

INTRODUCTION TO TOPOLOGY ALEX KÜRONYA In preparation January 24, 2010 Contents 1. Basic concepts 1 2. Constructing topologies 13 2.1. Subspace topology 13 2.2. Local properties 18 2.3. Product topology

### ZORN S LEMMA AND SOME APPLICATIONS

ZORN S LEMMA AND SOME APPLICATIONS KEITH CONRAD 1. Introduction Zorn s lemma is a result in set theory that appears in proofs of some non-constructive existence theorems throughout mathematics. We will

### 4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:

4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets

### ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction

ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity

### Vector Spaces II: Finite Dimensional Linear Algebra 1

John Nachbar September 2, 2014 Vector Spaces II: Finite Dimensional Linear Algebra 1 1 Definitions and Basic Theorems. For basic properties and notation for R N, see the notes Vector Spaces I. Definition

### 5. Linear algebra I: dimension

5. Linear algebra I: dimension 5.1 Some simple results 5.2 Bases and dimension 5.3 Homomorphisms and dimension 1. Some simple results Several observations should be made. Once stated explicitly, the proofs

### Notes on Richard Dedekind s Was sind und was sollen die Zahlen?

Notes on Richard Dedekind s Was sind und was sollen die Zahlen? David E. Joyce, Clark University December 2005 Contents Introduction 2 I. Sets and their elements. 2 II. Functions on a set. 5 III. One-to-one

### Notes on counting finite sets

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

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

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

### Vector and Matrix Norms

Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

Radboud Universiteit Nijmegen Faculteit der Natuurwetenschappen, Wiskunde en Informatica Uniqueness of the Hyperreal Field Noud Aldenhoven (0620874) Supervisor: dr. W.H.M. Veldman Second reader: prof.

### MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α

### TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS

TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called separation axioms in greater detail. We shall try to understand how these axioms

### Our goal first will be to define a product measure on A 1 A 2.

1. Tensor product of measures and Fubini theorem. Let (A j, Ω j, µ j ), j = 1, 2, be two measure spaces. Recall that the new σ -algebra A 1 A 2 with the unit element is the σ -algebra generated by the

### The Rational Numbers

Math 3040: Spring 2011 The Rational Numbers Contents 1. The Set Q 1 2. Addition and multiplication of rational numbers 3 2.1. Definitions and properties. 3 2.2. Comments 4 2.3. Connections with Z. 6 2.4.

### This chapter is all about cardinality of sets. At first this looks like a

CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

### Math212a1010 Lebesgue measure.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

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

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

### You know from calculus that functions play a fundamental role in mathematics.

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

### Discrete Mathematics. Hans Cuypers. October 11, 2007

Hans Cuypers October 11, 2007 1 Contents 1. Relations 4 1.1. Binary relations................................ 4 1.2. Equivalence relations............................. 6 1.3. Relations and Directed Graphs.......................

### Duality of linear conic problems

Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

### Math 5311 Gateaux differentials and Frechet derivatives

Math 5311 Gateaux differentials and Frechet derivatives Kevin Long January 26, 2009 1 Differentiation in vector spaces Thus far, we ve developed the theory of minimization without reference to derivatives.

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

### (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties

Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry

ADVANCED CALCULUS Lecture notes for MA 440/540 & 441/541 2015/16 Rudi Weikard log x 1 1 2 3 4 5 x 1 2 Based on lecture notes by G. Stolz and G. Weinstein Version of September 3, 2016 1 Contents First things

### x < y iff x < y, or x and y are incomparable and x χ(x,y) < y χ(x,y).

12. Large cardinals The study, or use, of large cardinals is one of the most active areas of research in set theory currently. There are many provably different kinds of large cardinals whose descriptions

### Math 223 Abstract Algebra Lecture Notes

Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course

### WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

### Introduction to Modern Set Theory

Introduction to Modern Set Theory Judith Roitman December 6, 2011 1 for my father, who loved mathematics 1 Revised Edition Copyright 2011 by Judith Roitman, This book is licensed for use under a Creative

### Math 104: Introduction to Analysis

Math 104: Introduction to Analysis Evan Chen UC Berkeley Notes for the course MATH 104, instructed by Charles Pugh. 1 1 August 29, 2013 Hard: #22 in Chapter 1. Consider a pile of sand principle. You wish

### Elements of Abstract and Linear Algebra. E. H. Connell

Elements of Abstract and Linear Algebra E. H. Connell ii E.H. Connell Department of Mathematics University of Miami P.O. Box 249085 Coral Gables, Florida 33124 ec@math.miami.edu USA Mathematical Subject

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

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

### MEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich

MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites

### Mathematics Review for MS Finance Students

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

### Gröbner Bases and their Applications

Gröbner Bases and their Applications Kaitlyn Moran July 30, 2008 1 Introduction We know from the Hilbert Basis Theorem that any ideal in a polynomial ring over a field is finitely generated [3]. However,

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

### Metric Spaces. Chapter 7. 7.1. Metrics

Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

### Linear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.

Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a sub-vector space of V[n,q]. If the subspace of V[n,q]

### Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of

### THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

### Appendix A. Appendix. A.1 Algebra. Fields and Rings

Appendix A Appendix A.1 Algebra Algebra is the foundation of algebraic geometry; here we collect some of the basic algebra on which we rely. We develop some algebraic background that is needed in the text.

### Mathematics for Computer Science

Mathematics for Computer Science Lecture 2: Functions and equinumerous sets Areces, Blackburn and Figueira TALARIS team INRIA Nancy Grand Est Contact: patrick.blackburn@loria.fr Course website: http://www.loria.fr/~blackbur/courses/math