MASTERS EXAMINATION IN MATHEMATICS
|
|
- Antonia Goodwin
- 5 years ago
- Views:
Transcription
1 MASTERS EXAMINATION IN MATHEMATICS PURE MATH OPTION, Spring 018 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth 0 points. All answers will be graded, but the score for the examination will be the sum of the scores of your best 8 solutions. Use separate answer sheets for each question. DO NOT PUT YOUR NAME ON YOUR ANSWER SHEETS. When you have finished, insert all your answer sheets into the envelope provided, then seal it. Any student whose answers need clarification may be required to submit to an oral examination. Algebra A1. Let G be a finite Abelian group of order n m, where m is odd. If the subgroup of order n is not cyclic, show that the product of all elements in G is the identity. Hint: evaluate separately the product of elements of order two. Solution. Let g G be an element of order g >. Then we have g g 1, so both g and its inverse g 1 appear in the product and they cancel each other. By the fundamental theorem of finite abelian groups, it is enough to consider groups G of the form Z/Z Z/Z in which the number of factors is at least two (by hypothesis). For such groups one easily concludes (e.g. by induction). A. Express both 13 and 5 + i as a product of irreducible elements of Z[i]. Solution. We have 13 = (3 + i)(3 i) and 5 + i = (3 i)(1 + i). Each of the factors is irreducible in Z[i] since the corresponding norm is a prime integer. A3. Prove the following assertions. (i) We have the equality Q[ 3, 5] = Q[ 3 + 5]. (ii) Let a and b be two rational numbers, such that a 0. The fields Q[ a] and Q[ b] are equal if and only if there exists c Q such that a = bc. Solution (i) The inclusion Q[ 3, 5] Q[ 3 + 5] is absolutely immediate. reverse inclusion, we notice that we have ( 3 + 5) 3 = For the
2 by a quick computation. Since equally belongs to Q[ 3 + 5]. Their sum will equally be an element of Q[ 3 + 5]. However, the sum in question equals 4 3 and we are done. Solution (ii) By hypothesis we have a = r1 + r b for some rational numbers r 1 and r. This gives a = r1 + br + r 1 r b. If r1 0 and r 0, we conclude that b Q and it follows that a Q in which case we are done. If r 1 = 0, then we define c := r and we have equally finished. If r = 0, then a Q and so Q[ a] = Q. Since Q[ a] = Q[ b], we infer that b is equally a rational number, and again the conclusion follows. Complex Analysis C1. Using residues, evaluate the following integral. Solution. x 1 + x 4 dx The degree of the denominator exceeds the degree of the numerator by, so the residue theorem implies that this integral is equal to ( ) z πi Res 1 + z ; z 4 k z k : 1+z 4 k =0, Im(z k)>0} The denominator z is zero when z 4 = 1 = e πi, so z = e π 4, e 3π 4, e 5π 4, e 7π 4. The first two are in the upper half-plane so the integral will equal ( ( ) ( )) z πi Res 1 + z ; e π z Res 1 + z ; e 3π 4 4 For simple poles, the residue of p(z)/q(z) at z k is given by p(z k )/q (z k ), so in the case at hand 1 it will equal 4z k. Hence the integral is equal to πi (e iπ 4 + e 3iπ 4 ) = πi( 1 i 1 1 i 1 ) = πi ( i 1 ) = π = π. C. Find the number of zeroes the function f(z) = e z + 5z + z has in z C : z 1}, counted according to multiplicity. Solution. On z = 1, one has e z + z e z + z = e Rez + 1 e = 5z. Thus by Rouche s theorem, e z + z + 5z and 5z have the same number of zeroes inside z < 1, counted according to multiplicity, namely.
3 C3. Evaluate the following integral, where C is the circle z C : z = 10} oriented positively. C sin z dz (z + π) 10 Solution. By the extended Cauchy s integral formula, since the pole at z = π is inside the circle, the integral will equal d 9 πi 1 9! dz sin(z) 9 z= π Since d9 sin(z) = cos(z), the answer is therefore πi 1 π cos( π) = i dz 9 9! 9! Number Theory N1. Suppose F n = n + 1. Show that for all m > n, F n F m. N. Determine all n with φ(n) n. N3. State the definition of the µ-function. Prove that 1 n = 1; µ(d) = 0 n > 1. Find an asymptotic formula for d n as X. You may use the identity µ(d) d d X a,b X gcd(a,b)=1 ab = 6 ( ) 1 π + O. X Real Analysis R1. For the following sequence of functions f n (x) = arctan (nx) find its pointwise limit on the real line R. Is this limit uniform on R? Is this limit uniform on [1, )? Explain your answer. 3
4 Solution. First note that as y, arctan(y) π, and as y, arctan(y) π, and arctan(0) = 0. So, π, x > 0 lim arctan(nx) = h(x) = 0, x = 0 n π, x < 0 Since h is discontinuous at x = 0, the limit cannot be uniform on any interval containing 0, hence on R. However on [1, ) we can use the fact that arctan(y) is a monotonically increasing function. So, if x 1, then arctan(n) f n (x) < π and the sequence arctan(n) converges to π as n. So, for any ε > 0 there exists an N > 0 such that for all n > N and for all x 1 we have f n (x) π arctan(n) π < ε. This proves that the sequence converges uniformly to the constant function π on [1, ). R. State the definition of convergent series and of absolutely convergent series. Prove that that if n=1 a n is an absolutely convergent series then the series n=1 a n converges. Give an example of a convergent series n=1 b n such that n=1 b n diverges. Solution. Since a n absolutely converges, we have a n < +. We also have a n 0. Thus there exists N so that for all n > N we have a n < 1 and therefore a n a n. Hence we can compare positive series a n = n=1 N a n + n=1 a n N+1 N a n + n=1 n=n+1 a n < +. For the counter example, consider b n = ( 1) n n 1/. This is an alternating series with terms monotonically decreasing to zero in absolute value. Such series converge by Leibnitz criterion. But b n = 1 n=1 1 n = +. R3. Let f : (0, ) (0, ) be a twice differentiable function and assume that f (x) < 0 for all x (0, ). Prove that f(x) is nondecreasing on (0, ). Prove that f(x) is uniformly continuous on (0, ). 4
5 Solution. Since f (x) < 0 it follows that f (x) is decreasing on (0, ). Fix arbitrary 0 < x 0 < x. By MVT there exists z (x 0, x) so that f(x) = f(x 0 ) + f (z)(x x 0 ) < f(x 0 ) + f (x 0 )(x x 0 ) In particular f (x 0 ) 1/(x x 0 ) and sending x we deduce f (x 0 ) 0. This applies to any x 0 (0, ). So f(x) is non-decreasing. But it cannot be constant on any interval (a, b), because f would vanish on (a, b) contradicting f < 0. Therefore f(x) is increasing. Let ɛ > 0 be given. Let m = inff(x) x > 0}. There exists a (0, ) so that m f(a) < m + ɛ/. Let k = f (a) and let δ = ɛ/k. For any x 1 < x in (0, a] we have m f(x 1 ) < f(x ) f(a) < m + ɛ/. So f(x ) f(x 1 ) < ɛ/. For any x 1 < x with x x 1 < δ and a x 1 by MVT we have for some z (x 1, x ) f(x ) f(x 1 ) = f (z)(x x 1 ) k(x x 1 ) < kδ < ɛ/. Finally for any x 1 < a < x with x x 1 < δ we combine the two estimates f(x ) f(x 1 ) = f(x ) f(a) + f(a) f(x 1 ) < ɛ/ + ɛ/ = ɛ. Topology T1. Suppose X is a compact metric space, and f : X X an isometric embedding. Show that f is surjective. Solution. Suppose for contradiction that f is not surjective. Let x X f(x). Since x is not in the compact set f(x), the distance δ = d(x, f(x)) is positive. Define a sequence (x n ) recursively by x 0 = x and x n = f(x n 1 ). Since f(x k ) f(x) for all k > 0, we have d(x 0, x k ) δ for all k > 0. Since f is an isometric embedding, it follows by applying this map i times to x 0 and x k that d(x i, x i+k ) = d(x 0, x k ) δ. Therefore, no subsequence of (x n ) is Cauchy. However, a compact metric space is sequentially compact, and so (x n ) has a convergent subsequence, which is therefore Cauchy. This is the desired contradiction. T. Let X and Y be topological spaces, and let A i } be a finite collection of closed subsets that cover X. Show that f : X Y is continuous if f Ai is continuous for each i. Give an example to show the finiteness assumption is necessary. Solution. Recall that continuity is equivalent to the condition that the preimage of each closed set is closed. Let f Ai be continuous for all i. Suppose the collection A i } contains n sets. Then for a closed set C Y we have n n f 1 (C) = f 1 (C) A i = (f Ai ) 1 (C) i=1 In the first equality above, we have used that the sets A i cover X. By continuity of f Ai, each set (f Ai ) 1 (C) is closed in the subspace topology of A i. However, since A i is closed in 5 i=1
6 X, we have that (f Ai ) 1 (C) is closed in X. Thus the formula above describes f 1 (C) as a finite union of closed sets in X, which is therefore closed. This shows f is continuous. The restriction to a finite collection A i } is essential: Consider X = [0, 1], Y = R, and the function 0 if x = 0 f(x) = 1 otherwise. This function is not continuous because the preimage of the open set ( 1, 1) is 0}, which is not open. Consider the collection of closed sets A 0 = 0} and A n = [ 1, 1] for n Z with n > 0. Then n the collection A n } n Z 0 covers [0, 1], and for each n the restriction of f to A n is constant and therefore continuous. T3. If X and Y are topological spaces, say X Y if there exists a continuous surjection from X to Y. Let Y be the set a, b}. Let X be a nonempty topological space. Prove: (1) If Y has the trivial topology then X Y iff X has at least two points. () If Y has the discrete topology then X Y iff X is disconnected. (3) If Y has the topology, a}, Y } then X Y iff X has a non-trivial topology. Solution (1). Suppose X Y. Let f : X Y be a continuous surjection. Then the subsets of X given by f 1 (a) and f 1 (b) are disjoint and nonempty. Thus X has at least two points. Suppose X has at least two points. Choose a point x a X. Define f : X Y by a if x = x a f(x) = b otherwise Since X has at least two points, there exists x b x a with f(x b ) = b, and f is surjective. Since Y has the trivial topology, every function X Y is continuous. Hence X Y. Solution (): Suppose X Y. Let f : X Y be a continuous surjection. Define U = f 1 (a) and V = f 1 (b). Since a}, b}} is a cover of Y by disjoint open sets, and f is continuous, the sets U, V are disjoint, open, and cover X. By surjectivity of f, both U and V are nonempty. Thus U, V give a separation of X, and X is not connected. Suppose X is not connected. Let U, V be a separation of X. Define a function f : X Y by a if x U f(x) = b otherwise The respective preimages under f of the open sets, a}, b}, Y are, U, V, X. All of the latter sets are open, so f is continuous. Since U and V are nonempty, f is surjective. Thus X Y. Solution (3): Suppose X Y. Let f : X Y be a continuous surjection. Define U = f 1 (a). Since a} is open in Y, we have that U is open in X. Since f is surjective, the 6
7 sets U and f 1 (b) are nonempty and disjoint, and in particular U X. Thus the topology of X includes the nonempty open set U X, and the topology is non-trivial. Suppose X has a non-trivial topology. Let U be a open set in X that is not or X. Define a function f : X Y by a if x U f(x) = b otherwise The respective preimages under f of the open sets, a}, Y are, U, X. All of the latter sets are open, so f is continuous. Since U is nonempty and U X, the function f is surjective. Thus X Y. Logic L1. Recall that for a structure M with universe M, a set A M n is definable in M if there is a parameter p M k for some k and n + k-ary formula φ, so that Let N = (N; 0, 1, +, ). A = a A n M = φ[ p, a]}. (a) Show the following are definable in N. 7} n n is a perfect square} (m, n) m < n} (m, n) m divides n} n n is prime} (b) Show there is a subset of N which is not definable in N. Solution.Part (a): 7} is definable by x = y and the parameter 7 (it also definable without parameters by x = seven times). n n is a perfect square} is definable by y(x = y y). (m, n) m < n} is definable by z(x + z = y z 0). (m, n) m divides n} is definable by φ div (x, y) := z(x z = y) n n is prime} is definable by φ(y) := y 1 x(φ div (x, y) (x = 1 x = y)). Part (b): For any definable X N, let φ X, k = k X, and p X N k witness that it is definable. Note that X (φ X, k X, p X ) is an injection into a countable set. So there are only countably many definable subsets of N. Since the powerset of N is uncountable, there are subsets which are not definable. L. Recall a graph is a structure G = (V ; E) such that E is a symmetric and irreflexive binary relation. Solution. Part (a). The following are the axioms: symmetric: x y(xry yrx); 7
8 irreflexivity: x (xrx); For every even k, λ k := ( x 1 )( x )...( x k )( x k+1 ) 1 i k x irx i+1 x 1 x k+1. For part (b), suppose for contradiction that the class of bipartite graphs is finitely axiomatizable. Then there is some sentence φ, such that A = φ iff A is a bipartite graph. Let Σ be the axiomatization defined in part (a). Then Σ = φ. By compactness it follows that there is some finite subset of Σ, such that = φ. Let n be large enough such that if λ k, then k < n. Let A be a graph with an odd-length cycle of size at least n. Then A =, and so A = φ. Contradiction with the assumptions that φ axiomatizes bipartite graphs. A cycle of length n is a sequence v 1,..., v n+1 V so that for all 1 i n, v i, v i+1 E; v 1 = v n+1 ; and for 1 i < j n, v i v j. A theorem of graph theory states that a graph is bipartite if and only if it contains no cycles of odd length. (a) Give a theory in the language L = R}, R a binary relation symbol, that axiomatizes the class of bipartite graphs. (b) Show the class of bipartite graphs is not finitely axiomatizable. L3. Let A = (A; A ) and B = (B; B ) be countable dense linear orders without endpoints. (a) Show A and B are isomorphic. (b) Show the theory of dense linear orders without endpoints is complete. Solution. (a) Enumerate A = a n n < ω} and B = b n n < ω}. Define an order preserving function f : A B as follows. Let f(a 0 ) be any element in B At even stages, n: if f(a n ) is already defined, do nothing. Otherwise, let D be the set of elements a, such that f(a) has been defined, and set B < := f(a) a D, a < a n } and B > := f(a) a D, a > a n }. By the inductive assumption for all b 1 B < and b B >, we have b 1 < b. Since B is a dense linear order, pick b B, such that for all b B <, b < b and for all b B >, b < b. Set f(a n ) = b. At odd stages, n + 1: if b n is in the range of the partial function defined so far, go to the next stage. Otherwise, let D be the set of elements a, such that f(a) has been defined and let R be the range, and let A < := a D f(a) < b n } and A > := a D b n < f(a)}. By the inductive assumption for all a 1 A <, a A >, a 1 < a. Since A is a dense linear order let a A be such that for all a A <, a < a and for all a A >, a < a. Set f(a ) = b n. Then by the even stages in the construction, dom(f) = A, and the odd stages ensure that ran(f) = B. Inductively we maintained that f is order preserving, and so it is an isomorphism. (b). The theory of dense linear orders without endpoints has no finite models, and by part (a) it is ℵ 0 -categorical. So, by the Los-Vaught Test test, it is complete 8
MASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION FALL 2007 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth the same
More informationMASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION FALL 2010 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth 20 points.
More informationMASTERS EXAMINATION IN MATHEMATICS SOLUTIONS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION SPRING 010 SOLUTIONS Algebra A1. Let F be a finite field. Prove that F [x] contains infinitely many prime ideals. Solution: The ring F [x] of
More information2.2 Lowenheim-Skolem-Tarski theorems
Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
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 informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 1. Please write your 1- or 2-digit exam number on
More informationAnalysis Qualifying Exam
Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,
More informationThus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a
Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
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 informationASSIGNMENT-1 M.Sc. (Previous) DEGREE EXAMINATION, DEC First Year MATHEMATICS. Algebra. MAXIMUM MARKS:30 Answer ALL Questions
(DM1) ASSIGNMENT-1 Algebra MAXIMUM MARKS:3 Q1) a) If G is an abelian group of order o(g) and p is a prime number such that p α / o(g), p α+ 1 / o(g) then prove that G has a subgroup of order p α. b) State
More informationSolutions to Tutorial 8 (Week 9)
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 8 (Week 9) MATH3961: Metric Spaces (Advanced) Semester 1, 2018 Web Page: http://www.maths.usyd.edu.au/u/ug/sm/math3961/
More informationHomework in Topology, Spring 2009.
Homework in Topology, Spring 2009. Björn Gustafsson April 29, 2009 1 Generalities To pass the course you should hand in correct and well-written solutions of approximately 10-15 of the problems. For higher
More informationContents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3
Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability
More informationVAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents
VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught
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 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationDetermine for which real numbers s the series n>1 (log n)s /n converges, giving reasons for your answer.
Problem A. Determine for which real numbers s the series n> (log n)s /n converges, giving reasons for your answer. Solution: It converges for s < and diverges otherwise. To see this use the integral test,
More informationAxioms of separation
Axioms of separation These notes discuss the same topic as Sections 31, 32, 33, 34, 35, and also 7, 10 of Munkres book. Some notions (hereditarily normal, perfectly normal, collectionwise normal, monotonically
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 information3. (a) What is a simple function? What is an integrable function? How is f dµ defined? Define it first
Math 632/6321: Theory of Functions of a Real Variable Sample Preinary Exam Questions 1. Let (, M, µ) be a measure space. (a) Prove that if µ() < and if 1 p < q
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More information3 COUNTABILITY AND CONNECTEDNESS AXIOMS
3 COUNTABILITY AND CONNECTEDNESS AXIOMS Definition 3.1 Let X be a topological space. A subset D of X is dense in X iff D = X. X is separable iff it contains a countable dense subset. X satisfies the first
More informationProblem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that
Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume
More informationB 1 = {B(x, r) x = (x 1, x 2 ) H, 0 < r < x 2 }. (a) Show that B = B 1 B 2 is a basis for a topology on X.
Math 6342/7350: Topology and Geometry Sample Preliminary Exam Questions 1. For each of the following topological spaces X i, determine whether X i and X i X i are homeomorphic. (a) X 1 = [0, 1] (b) X 2
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More informationMAT1000 ASSIGNMENT 1. a k 3 k. x =
MAT1000 ASSIGNMENT 1 VITALY KUZNETSOV Question 1 (Exercise 2 on page 37). Tne Cantor set C can also be described in terms of ternary expansions. (a) Every number in [0, 1] has a ternary expansion x = a
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
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 informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More informationMetric Spaces Math 413 Honors Project
Metric Spaces Math 413 Honors Project 1 Metric Spaces Definition 1.1 Let X be a set. A metric on X is a function d : X X R such that for all x, y, z X: i) d(x, y) = d(y, x); ii) d(x, y) = 0 if and only
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 informationSolutions to Unique Readability Homework Set 30 August 2011
s to Unique Readability Homework Set 30 August 2011 In the problems below L is a signature and X is a set of variables. Problem 0. Define a function λ from the set of finite nonempty sequences of elements
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationQualifying Exams I, 2014 Spring
Qualifying Exams I, 2014 Spring 1. (Algebra) Let k = F q be a finite field with q elements. Count the number of monic irreducible polynomials of degree 12 over k. 2. (Algebraic Geometry) (a) Show that
More informationMAT 544 Problem Set 2 Solutions
MAT 544 Problem Set 2 Solutions Problems. Problem 1 A metric space is separable if it contains a dense subset which is finite or countably infinite. Prove that every totally bounded metric space X is separable.
More informationMATS113 ADVANCED MEASURE THEORY SPRING 2016
MATS113 ADVANCED MEASURE THEORY SPRING 2016 Foreword These are the lecture notes for the course Advanced Measure Theory given at the University of Jyväskylä in the Spring of 2016. The lecture notes can
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More information1. If 1, ω, ω 2, -----, ω 9 are the 10 th roots of unity, then (1 + ω) (1 + ω 2 ) (1 + ω 9 ) is A) 1 B) 1 C) 10 D) 0
4 INUTES. If, ω, ω, -----, ω 9 are the th roots of unity, then ( + ω) ( + ω ) ----- ( + ω 9 ) is B) D) 5. i If - i = a + ib, then a =, b = B) a =, b = a =, b = D) a =, b= 3. Find the integral values for
More information118 PU Ph D Mathematics
118 PU Ph D Mathematics 1 of 100 146 PU_2016_118_E The function fz = z is:- not differentiable anywhere differentiable on real axis differentiable only at the origin differentiable everywhere 2 of 100
More informationEconomics 204 Fall 2012 Problem Set 3 Suggested Solutions
Economics 204 Fall 2012 Problem Set 3 Suggested Solutions 1. Give an example of each of the following (and prove that your example indeed works): (a) A complete metric space that is bounded but not compact.
More informationQualifying Exam Logic August 2005
Instructions: Qualifying Exam Logic August 2005 If you signed up for Computability Theory, do two E and two C problems. If you signed up for Model Theory, do two E and two M problems. If you signed up
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 information1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N
Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems
More informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationReal Analysis. Jesse Peterson
Real Analysis Jesse Peterson February 1, 2017 2 Contents 1 Preliminaries 7 1.1 Sets.................................. 7 1.1.1 Countability......................... 8 1.1.2 Transfinite induction.....................
More information= F (b) F (a) F (x i ) F (x i+1 ). a x 0 x 1 x n b i
Real Analysis Problem 1. If F : R R is a monotone function, show that F T V ([a,b]) = F (b) F (a) for any interval [a, b], and that F has bounded variation on R if and only if it is bounded. Here F T V
More informationANALYSIS WORKSHEET II: METRIC SPACES
ANALYSIS WORKSHEET II: METRIC SPACES Definition 1. A metric space (X, d) is a space X of objects (called points), together with a distance function or metric d : X X [0, ), which associates to each pair
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
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 informationMATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES
MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES PETE L. CLARK 4. Metric Spaces (no more lulz) Directions: This week, please solve any seven problems. Next week, please solve seven more. Starred parts of
More informationHomework 5. Solutions
Homework 5. Solutions 1. Let (X,T) be a topological space and let A,B be subsets of X. Show that the closure of their union is given by A B = A B. Since A B is a closed set that contains A B and A B is
More information11691 Review Guideline Real Analysis. Real Analysis. - According to Principles of Mathematical Analysis by Walter Rudin (Chapter 1-4)
Real Analysis - According to Principles of Mathematical Analysis by Walter Rudin (Chapter 1-4) 1 The Real and Complex Number Set: a collection of objects. Proper subset: if A B, then call A a proper subset
More information4th Preparation Sheet - Solutions
Prof. Dr. Rainer Dahlhaus Probability Theory Summer term 017 4th Preparation Sheet - Solutions Remark: Throughout the exercise sheet we use the two equivalent definitions of separability of a metric space
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationTHIRD SEMESTER M. Sc. DEGREE (MATHEMATICS) EXAMINATION (CUSS PG 2010) MODEL QUESTION PAPER MT3C11: COMPLEX ANALYSIS
THIRD SEMESTER M. Sc. DEGREE (MATHEMATICS) EXAMINATION (CUSS PG 2010) MODEL QUESTION PAPER MT3C11: COMPLEX ANALYSIS TIME:3 HOURS Maximum weightage:36 PART A (Short Answer Type Question 1-14) Answer All
More informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
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 information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
More informationProblem 1A. Use residues to compute. dx x
Problem 1A. A non-empty metric space X is said to be connected if it is not the union of two non-empty disjoint open subsets, and is said to be path-connected if for every two points a, b there is a continuous
More informationAn uncountably categorical theory whose only computably presentable model is saturated
An uncountably categorical theory whose only computably presentable model is saturated Denis R. Hirschfeldt Department of Mathematics University of Chicago, USA Bakhadyr Khoussainov Department of Computer
More informationReal Analysis Prelim Questions Day 1 August 27, 2013
Real Analysis Prelim Questions Day 1 August 27, 2013 are 5 questions. TIME LIMIT: 3 hours Instructions: Measure and measurable refer to Lebesgue measure µ n on R n, and M(R n ) is the collection of measurable
More informationPart IB. Further Analysis. Year
Year 2004 2003 2002 2001 10 2004 2/I/4E Let τ be the topology on N consisting of the empty set and all sets X N such that N \ X is finite. Let σ be the usual topology on R, and let ρ be the topology on
More information7 Complete metric spaces and function spaces
7 Complete metric spaces and function spaces 7.1 Completeness Let (X, d) be a metric space. Definition 7.1. A sequence (x n ) n N in X is a Cauchy sequence if for any ɛ > 0, there is N N such that n, m
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationMathematics 220 Workshop Cardinality. Some harder problems on cardinality.
Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second
More informationProblem 1A. Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1. (Hint: 1. Solution: The volume is 1. Problem 2A.
Problem 1A Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1 (Hint: 1 1 (something)dz) Solution: The volume is 1 1 4xydz where x = y = 1 z 2 This integral has value 16/3 Problem 2A Let f(x)
More informationMIDTERM REVIEW FOR MATH The limit
MIDTERM REVIEW FOR MATH 500 SHUANGLIN SHAO. The limit Define lim n a n = A: For any ε > 0, there exists N N such that for any n N, a n A < ε. The key in this definition is to realize that the choice of
More informationMATH 310 Course Objectives
MATH 310 Course Objectives Upon successful completion of MATH 310, the student should be able to: Apply the addition, subtraction, multiplication, and division principles to solve counting problems. Apply
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 informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationSOLUTIONS TO THE FINAL EXAM
SOLUTIONS TO THE FINAL EXAM Short questions 1 point each) Give a brief definition for each of the following six concepts: 1) normal for topological spaces) 2) path connected 3) homeomorphism 4) covering
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Spring Semester 2015
Department of Mathematics, University of California, Berkeley YOUR OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Spring Semester 205. Please write your - or 2-digit exam number on this
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 informationMORE ON CONTINUOUS FUNCTIONS AND SETS
Chapter 6 MORE ON CONTINUOUS FUNCTIONS AND SETS This chapter can be considered enrichment material containing also several more advanced topics and may be skipped in its entirety. You can proceed directly
More informationProblem 1A. Calculus. Problem 3A. Real analysis. f(x) = 0 x = 0.
Problem A. Calculus Find the length of the spiral given in polar coordinates by r = e θ, < θ 0. Solution: The length is 0 θ= ds where by Pythagoras ds = dr 2 + (rdθ) 2 = dθ 2e θ, so the length is 0 2e
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 1. I. Foundational material
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 1 Fall 2014 I. Foundational material I.1 : Basic set theory Problems from Munkres, 9, p. 64 2. (a (c For each of the first three parts, choose a 1 1 correspondence
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
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 informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationTEST CODE: PMB SYLLABUS
TEST CODE: PMB SYLLABUS Convergence and divergence of sequence and series; Cauchy sequence and completeness; Bolzano-Weierstrass theorem; continuity, uniform continuity, differentiability; directional
More informationMetric Space Topology (Spring 2016) Selected Homework Solutions. HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y)
Metric Space Topology (Spring 2016) Selected Homework Solutions HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y) d(z, w) d(x, z) + d(y, w) holds for all w, x, y, z X.
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationCommutative Banach algebras 79
8. Commutative Banach algebras In this chapter, we analyze commutative Banach algebras in greater detail. So we always assume that xy = yx for all x, y A here. Definition 8.1. Let A be a (commutative)
More informationFusing o-minimal structures
Fusing o-minimal structures A.J. Wilkie Mathematical Institute University of Oxford 24-29 St Giles Oxford OX1 3LB UK May 3, 2004 Abstract In this note I construct a proper o-minimal expansion of the ordered
More informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
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 information1. Simplify the following. Solution: = {0} Hint: glossary: there is for all : such that & and
Topology MT434P Problems/Homework Recommended Reading: Munkres, J.R. Topology Hatcher, A. Algebraic Topology, http://www.math.cornell.edu/ hatcher/at/atpage.html For those who have a lot of outstanding
More informationAlgebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001
Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,
More informationIntroduction to Real Analysis
Christopher Heil Introduction to Real Analysis Chapter 0 Online Expanded Chapter on Notation and Preliminaries Last Updated: January 9, 2018 c 2018 by Christopher Heil Chapter 0 Notation and Preliminaries:
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics
More information