Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.
|
|
- Richard Lloyd
- 7 years ago
- Views:
Transcription
1 MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we will show that there are, in fact, an infinite number of infinities. Definition 5.1. The cardinality of set A is the number of elements in A and is denoted by either n(a) or A. Finite Sets Definition 5.2. (a) For all n 1, the first n natural numbers is the set N n = {1,..., n } and N n = n. (b) A non-empty set A is called finite and A = n if and only if there exists a bijection f : N n A. The empty set is also finite and = 0. Note: If A and B are finite sets, then A B is finite and A B = A B. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent. Proof. Suppose A = n = B. Then there exist bijections f : N n A and g: N n B. Then f 1 : A N n is a bijection; hence, the composition g f 1 : A B is also a bijection. Therefore, A ~ B. Now suppose A ~ B where A and B are finite sets with A = n and B = m. Then there exist bijections f : A B, g: N n A, and h: N m B. Then the function h 1 f g: N n N m is also a bijection. Therefore, N m = n ; i.e., m = n. Hence, A = B. Finite sets of different sizes cannot be equivalent. In fact, suppose A and B are finite sets and f : A B is a function (with the domain being all of A ). (i) If A < B, then f cannot be onto. (ii) If A > B, then f cannot be one-to-one. (iii) f is a bijection if and only if A = B. Note: Whenever A ~ N n, then there is a bijection f : N n A. We then can let f (i) = a i A for 1 i n. Then A can be written as A = {a 1,...,a n }. Theorem 5.2. A finite union of disjoint, non-empty finite sets is finite.
2 Proof. Let A 1, A 2,..., A m be disjoint, finite sets denoted by A 1 = {a 1,1,..., a 1,n1 } A 2 = {a 2,1,..., a 2,n2 }... A m = {a m,1,..., a m,nm } m m Then A i has M = n i elements. We define a bijection from f : A i i=1 i =1 m i=1 {1,...,M} by j if i = 1 f (a i, j ) = n n i 1 + j if i > 1 m Thus, A i ~ N M. i=1 Infinite Sets Definition 5.3. Set A is called infinite if it is not finite. Some infinite sets are: the natural numbers ℵ, the integers Z, the Rationals Q, the Reals R, the even integers E, the odd integers O, the prime numbers P, and the irrationals I (because p is irrational for every prime p ). Denumerable and Countable Sets Definition 5.4. (a) Set A is called denumerable (or countably infinite) if there exists a bijection between the natural numbers ℵ and set A. In other words, a denumerable set is equivalent to the natural numbers ℵ. (b) If set A is denumerable ( A ~ ℵ), then A is said to have cardinality Aleph Naught denoted by A = ℵ 0. (c) Set A is called countable if it is either finite or denumerable. Example 5.1. The set of all odd numbers O is denumerable. n if n is odd Proof. Define f :ℵ O by f (n) =. Then f is a bijection; so the odd n +1 if n is even numbers are countably infinite and O = ℵ 0. ℵ O
3 Theorem 5.3. All denumerable sets are equivalent and have cardinality ℵ 0. Proof. Any two denumerable sets are equivalent to the natural numbers. Because set equivalence is an equivalence relation, any two denumerable sets are equivalent to each other. Moreover, by being denumerable, each has cardinality ℵ 0. Note: Whenever A is denumerable, then there is a bijection f :ℵ A. We then can let f (i) = a i A for i 1. Then A can be written as A = {a 1, a 2,...}. Lemma 5.1. (a) If A is non-empty and finite, and B is denumerable with A B =, then A B is denumerable. (b) If A and B are denumerable with A B =, then A B is denumerable. (c) Any infinite subset S of a denumerable set A is denumerable. Proof. (a) Let A = {a 1,...,a n } and B = {b 1, b 2,...}. Define a bijection f : A B ℵ by f (a i ) = i and f (b j ) = n + j. Note that f 1 :ℵ A B is also a bijection given by f 1 (i) = a i if 1 i n. b i n if i > n (b) Let A = {a 1, a 2,...} and B = {b 1, b 2,...}. Define a bijection f : A B ℵ by f (a i ) = 2i and f (b j ) = 2 j 1. Note that f 1 :ℵ A B is also a bijection given by f 1 (i) = a i/2 b (i+1)/2 if i is even. if i is odd (c) Let A = {a 1, a 2,...}. Subset S is actually a subsequence S = {a n1, a n2,...} where n 1 is the first index such that a n1 S, n 2 is the next index such that a n2 S, etc. So we can define a bijection f : ℵ S by f (k ) = a nk. Corollary 5.1. The set integers Z is denumerable. Proof. First, the whole numbers W = {0} ℵ are denumerable by Lemma 1(a). The negative integers ℵ are clearly in one-to-one correspondence with ℵ, so they are denumerable. Thus, Z = ℵ W is denumerable Lemma 5.1 (b). Exercise: Find a direct one-to-one correspondence between ℵ and Z.
4 Corollary 5.2. (a) The prime numbers are denumerable. (b) The odd numbers are denumerable. (c) The set of all multiples of a fixed natural number is denumerable. Proof. All are infinite subsets of the denumerable set Z. Lemma 5.2. Let A be an infinite set and let f : A ℵ be one-to-one. Then A is denumerable. Proof. Redefine the function as f : A Range f. Then f is both one-to-one and onto. Thus, A is equivalent to Range f which must be infinite because A is infinite. But then Range f is an infinite subset of N ; hence, Range f is denumerable. Therefore A is denumerable because it is equivalent to the denumerable set Range f. Theorem 5.4. A countable union of disjoint denumerable sets is denumerable. Proof. Let A 1, A 2,..., A n,... be disjoint denumerable sets and let A be their union. We can enumerate set each as follows: A 1 = {a 11, a 12, a 13,... } A 2 = {a 21, a 22, a 23,... }... A n = {a n1, a n2, a n3,... } Because all the A n are disjoint, each a i j is distinct. Now define f : A ℵ by etc. f (a i j ) = 2 i 3 j. By the uniqueness of prime factorizations, each a i j gives a different natural number. Thus, f is one-to-one. By Lemma 2, the infinite set A is denumerable. Recall: Countable means finite or denumerable. So the countable collection of sets may be finite A 1, A 2,..., A n or denumerable A 1, A 2,..., A n,... which does not affect the preceding proof. Corollary 5.3. A countable union of disjoint countable sets is countable. To prove this corollary, simply apply the preceding proof where each set A n could be either finite or denumerable. Theorem 5.5. The set of positive rational numbers Q + and the set of negative rational numbers Q are denumerable.
5 Proof. We can write Q + as the set {a / b a,b ℵ, gcd(a,b) = 1}. Define f :Q + ℵ by f (a / b) = 2 a 3 b. By the uniqueness of prime factorizations, each positive rational a / b gives a different natural number. Thus, f is one-to-one. By Lemma 2, the infinite set Q + is denumerable. Because Q ~ Q +, we have that Q is denumerable also. Corollary 5.4. The rational numbers Q are denumerable. Proof. Q = Q {0} Q + is denumerable by Lemma 5.1. Uncountable Sets Definition 5.5. Set A is called uncountable if it is infinite but not denumerable. All finite sets can be counted. Denumerable sets are infinite, but are equivalent to the natural numbers 1, 2, 3,..., so they too can be counted. We aim to prove that the irrational numbers and the real numbers are both uncountable sets. For now, we can express the relationship between all types of infinite and countable sets with the following Venn diagram: Uncountable Finite {1,..., n} Denumerable ℵ R Countable Infinite Theorem 5.6. The interval (0, 1) is uncountable. Proof. Because (0, 1) contains all fractions of the form 1 / n for n 2, the interval is at least infinite. Suppose though that (0, 1) is denumerable (i.e., countably infinite). We shall obtain a contradiction.
6 If (0, 1) is denumerable, then there exists a bijection f :ℵ (0, 1). Thus, for every natural number n, 0 < f (n) < 1. So we consider the list f (1), f (2), f (3),... Each such value in (0, 1) has a unique decimal expansion of the form 0.d 1 d 2 d 3... = d d d , where d i {0, 1, 2,..., 9} and there is no ending string of all 9. (For example, we write 1/2 as rather than ) So the list of values in (0, 1) becomes f (1) = 0.d 11 d 12 d 13 d 14 d (e.g., ) f (2) = 0.d 21 d 22 d 23 d 24 d (e.g., ) f (3) = 0.d 31 d 32 d 33 d 34 d (e.g., ) f (4) = 0.d 41 d 42 d 43 d 44 d (e.g., ) etc. Next, consider the terms d 11 in f (1), d 22 in f (2), d 33 in f (3), d 44 in f (4), etc. We then create a new element x = 0.e 1 e 2 e 3... in (0, 1) by letting e i = 5 if d ii = 6 and letting e i = 6 if d ii 6. (The choice of 5 and 6 is arbitrary.) For the example values above, the first four digits in x are Because the i th decimal digit in x is different than the i th decimal digit in f (i), x cannot equal f (i) for any i. So x is not in the range of f. Thus, f is not onto, which is a contradiction to it being a bijection. Thus, (0, 1) cannot be denumerable. Corollary 5.5. The real numbers are uncountable. We can see this result in a couple of ways: (i) The interval (0, 1) is a proper subset of R; hence, R must have at least as large a cardinality as (0, 1). (ii) We have seen previously that the interval (0, 1) is set equivalent to the real line. So if the real line were denumerable (equivalent to the naturals), then (0, 1) would be denumerable by transitivity. Corollary 5.6. The irrational numbers I are uncountable. Proof. We know that the Rationals Q are denumerable and the Reals R are uncountable. If I were denumerable, then the disjoint union R = Q I would be denumerable by Lemma 5.1, which is a contradiction. Definition 5.6. We denote the cardinality of the real numbers by R = c. If set A is equivalent to the real line, then A = c also. Corollary 5.7. Any open interval (a, b ) on the real line has cardinality c.
7 Continuum Hypothesis So far, we have three types of cardinalities: finite, denumerable, uncountable. These cardinalities create different numbers: 0, 1, 2, 3,..., n,..., ℵ 0, c. The symbol ℵ 0 represents the countably infinite cardinality of the natural numbers and is also called first infinite ordinal. The symbol c represents the uncountably infinite cardinality of the real numbers. So we have two different types of infinity here, and we designate 0 < n < ℵ 0 < c. The continuum hypothesis states that there are no other cardinalities between ℵ 0 and c. Georg Cantor ( ) believed but could not prove this result. In 1940, Kurt Godel proved that the continuum hypothesis is consistent with the axioms of set theory. In other words, accepting the continuum hypothesis as true causes no contradictions and set theory cannot disprove the hypothesis. In 1963, Paul Cohen proved that the continuum hypothesis is independent of the axioms of set theory. In other words, set theory also cannot prove the hypothesis. Therefore, the continuum hypothesis can be accepted as true or it can be accepted as false without causing any other contradictions. Convention. As of now, we have three types of cardinalities: finite, denumerable, and uncountable (n, ℵ 0, and c ). For sets of other possible types of cardinalities, we say that the sets have the same cardinality if and only if they are equivalent (which is already the case for cardinalities n, ℵ 0, and c ). The Power Set Definition 5.7. Let A be any set. The power set of A, denoted P( A ), is the collection of all subsets of A. If A is finite with n elements, then there are 2 n subsets of A. For example if A =, then P( A ) = { }, which is the set containing the null set. So for A = 0, then P(A) = 2 0 = 1. Also, if A = {a, b, c }, then the power set of A is P( A ) = {, {a }, {b }, {c }, {a, b }, {b, c }, {a,c }, {a, b, c }} So if A = 3, then P(A) = 2 3 = 8. Cantor showed how to use the power set of infinite sets to create more types of infinities beyond ℵ 0 and c. Cantor s Theorem. For every set A, the cardinality of A is strictly less than the cardinality of its power set: A < P(A).
8 Proof. First, if A =, then A = 0 and P(A) = { } = 1. So the theorem holds. Next, assume A is finite with A = n > 0. To create a subset of A, we have two choices for every element in A : in the subset or not in the subset. Thus, there are 2 n possibilities, which makes P(A) = 2 n. Because n < 2 n for all n 0 (which can be proved by induction), we have A < P(A) for a finite set A. Now suppose that A is infinite. Let f : A P( A ) be defined by f (x) = { x }. If f (x) = f (y), then { x } = { y } which implies that x = y. Thus, f is one-to-one. Hence, A is equivalent to the subset of P( A ) consisting of all singleton sets { x}. Because there are more elements in P( A ), we have A P(A). We now must show that equality cannot hold. So suppose that A = P(A). Then because of equal cardinalities, there would be a bijection g : A P( A ). We shall show that this assumption leads to a contradiction. Let B be the subset of A defined by B = { x A x g(x) }. The set B can be understood as follows: For every element x in A, the function value g(x) is a subset of A. So g(x) contains some of the elements of A. Either g(x) contains x or it does not contain x. If g(x) does not contain x, then we set aside x to belong to subset B. Because B is a subset of A, it belongs to P( A ). Then because g is onto, there must exist some x A such that g(x) = B. Question: Is x B? If x B, then by definition of B, we have that x g(x) = B, a contradiction. If x B = g(x), then we set aside x to belong to B, another contradiction. Therefore the onto function g cannot exist. So A P(A) but A P(A). We conclude that A < P(A) for infinite sets A. How Many Infinities Are There? We know that the natural numbers ℵ are infinite. So by Cantor s Theorem, the power set of ℵ has a larger cardinality. Then the power set of the power set has a still larger cardinality. Then the power set of the power set of the power set has an even larger cardinality. Denoting the cardinality of the natural numbers by ℵ 0, we obtain ℵ 0 = ℵ < P(ℵ) < P( P(ℵ) ) < P( P( P(ℵ) )) <...
9 As written in the above inequality, these increasing cardinalities are in one-to-one correspondence with the denumerable set {0, 1, 2, 3,... }. Thus we have a countably infinite number of infinities! However the real numbers R are also infinite with a larger cardinality than ℵ. Denoting the cardinality of the real numbers by c, we obtain c = R < P(R) < P( P(R) ) < P( P( P(R) )) <... So it appears that we have another countably infinite set of infinite cardinalities. However, it has been proven that P(ℵ) = c. Hence, we really have just one countable string of infinities listed: ℵ 0 = ℵ < P(ℵ) = c = R < P(R) < P( P(R) ) < P( P( P(R) )) <... To prove that P(ℵ) = c, we first state a result (without proof) that was first postulated by Cantor. He was unable to prove it, but it was proven independently by Ernst Schroeder in 1896 and Felix Bernstein in 1898: Cantor-Schroeder-Bernstein Theorem. Let A and B be sets. If A B and B A, then A = B. This proof of this result is trivial for finite sets; however it is non-trivial for infinite sets. We demonstrate its usefulness though with our last result. Theorem 5.9. P(ℵ) = c. Proof. We first note that every number x (0, 1] can be in a unique infinite binary expansion that does not end in an infinite string of zeros. For example, 1/2 can be written as or as In the first case, 0.1 = = 1/2. In the second case, = 2 k (1 / 2)2 = = 1/2. So we write 1/2 as in binary. 1 1 / 2 k =2 Now define f : (0, 1] P(ℵ) as follows: Let x = a k 2 k, where a k = 0 or 1 for k =1 all k where the binary expansion does not end in an infinite string of zeros. Let f (x) be the set of indices k in the expansion of x for which a k are non-zero. Then f (x) is a subset of ℵ (i.e., an element of P(ℵ)). By uniqueness of the binary expansion, f is well-defined and one-to-one. For if f (x 1 ) = f (x 2 ), then x 1 = 2 k = 2 k = x 2. By Theorem 5.6, since f is a oneto-one k f (x 1 ) k f (x 2 ) function (but not necessarily onto), then c = (0, 1] P(ℵ). Next let Ω be the set of denumerable subsets of ℵ. We now define g : P(ℵ) R by
10 2 k k A g(a) = k k A if A Ω. if A Ω Then g( A) gives a real number such that 0 < g( A) 1 or 2 < g( A) 3. If 0 < g( A) = g(b) 1, then 2 k = 2 k where A and B are infinite sets. Thus the sums cannot end k A k B in an infinite string of zeros since the index sets are infinite. Thus by uniqueness of binary expansion, the index sets A and B must be equal. If 2 < g( A) = g(b) 3, then by subtracting 2, 2 k = 2 k k A k B where A and B are finite sets. The sums here do end in an infinite string of zeros since the index sets are finite. Thus g( A) and g(b) must be rational numbers, and again by uniqueness of binary expansion, the index sets A and B must be equal. Thus g is one-to-one (but not necessarily onto); hence, P(ℵ) R = c. Since c P(ℵ) and P(ℵ) c, we may conclude that P(ℵ) = c. Addendum The Schroeder-Bernstein Theorem states that if A 1 A 2 A 3 and A 1 is equivalent to A 3, then A 2 is equivalent to A 3. We can apply the result to show that the open interval (0, 1) is equivalent to the half-open interval [0,1). We simply note that [1 / 2,1) (0, 1) [0, 1) and [1 / 2,1) ~ [0,1) because [a,b) ~ [c, d) by a direct linear function f :[a, b) [c, d) defined by f ( x) = d c b a ( x a) + c. Thus, (0, 1) ~ [0, 1), and in general (a, b) ~ [a,b), although it is difficult to define a direct one-to-one correspondence between the sets. Exercises 1. For each problem, prove the result by defining a bijection f from ℵ into the set and verifying that f is a bijection. Also give the function formula for f 1. (a) Prove that the negative odd numbers O = { 1, 3, 5, 7,... } are denumerable. (b) Prove that the even numbers E = {..., 6, 4, 2, 0, 2, 4, 6,... } are denumerable. 2. Prove that the intervals [0, 1) and [0, 1] are uncountable.
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 },
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More information1 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
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationINTRODUCTORY 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,
More information1. 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
More informationGeorg Cantor (1845-1918):
Georg Cantor (845-98): The man who tamed infinity lecture by Eric Schechter Associate Professor of Mathematics Vanderbilt University http://www.math.vanderbilt.edu/ schectex/ In papers of 873 and 874,
More informationCardinality. 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
More informationGod 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
More informationI. 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
More informationBasic 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
More informationMA651 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
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationDEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
More informationThis 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
More informationMathematics 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
More informationCartesian 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
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationLinear 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)),
More informationSet theory as a foundation for mathematics
V I I I : Set theory as a foundation for mathematics This material is basically supplementary, and it was not covered in the course. In the first section we discuss the basic axioms of set theory and the
More informationSo 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
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationSOLUTIONS 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
More information8 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
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationChapter 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
More informationMathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationMASSACHUSETTS 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
More informationMathematics 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
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationFollow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu
COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part
More informationTHE 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
More informationSet Theory Basic Concepts and Definitions
Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric
More informationBasic Probability Concepts
page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes
More informationSMALL SKEW FIELDS CÉDRIC MILLIET
SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite
More informationFUNCTIONAL 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
More informationMathematical 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.............................
More informationLecture Notes on Discrete Mathematics
Lecture Notes on Discrete Mathematics A. K. Lal September 26, 2012 2 Contents 1 Preliminaries 5 1.1 Basic Set Theory.................................... 5 1.2 Properties of Integers.................................
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More information( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationGROUPS 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
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationThe Banach-Tarski Paradox
University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible
More informationFundamentele 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
More informationCOMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
More informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More information3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.
SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid
More informationFull and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationSOLUTIONS 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
More informationCS 3719 (Theory of Computation and Algorithms) Lecture 4
CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a
More informationAutomata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi
Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the
More information6.3 Conditional Probability and Independence
222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More informationLEARNING 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
More informationElements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationIntroduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
More informationLemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
More information1 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
More informationSolutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013
More informationINCIDENCE-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
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationGREATEST COMMON DIVISOR
DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their
More information1 The Concept of a Mapping
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 1 The Concept of a Mapping The concept of a mapping (aka function) is important throughout mathematics. We have been dealing
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationNo: 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
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More informationHow To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
More informationMath 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
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More informationSolutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
More informationIntroduction 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.......................................
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationChapter 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
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationTHE TURING DEGREES AND THEIR LACK OF LINEAR ORDER
THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.
More informationHow many numbers there are?
How many numbers there are? RADEK HONZIK Radek Honzik: Charles University, Department of Logic, Celetná 20, Praha 1, 116 42, Czech Republic radek.honzik@ff.cuni.cz Contents 1 What are numbers 2 1.1 Natural
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationAn 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
More informationMathematics 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,
More informationMath 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
More informationCOFINAL MAXIMAL CHAINS IN THE TURING DEGREES
COFINA MAXIMA CHAINS IN THE TURING DEGREES WEI WANG, IUZHEN WU, AND IANG YU Abstract. Assuming ZF C, we prove that CH holds if and only if there exists a cofinal maximal chain of order type ω 1 in the
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationMath Review. for the Quantitative Reasoning Measure of the GRE revised General Test
Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More informationGENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY
GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in
More information