MASTERS EXAMINATION IN MATHEMATICS
|
|
- Natalie Casey
- 5 years ago
- Views:
Transcription
1 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. 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 and print your name on it. Any student whose answers need clarification may be required to submit to an oral examination. 1
2 PURE MATHEMATICS OPTION FALL 2010 Algebra A1. Let G = Z/2 Z/6 Z/12. Show that G can not be generated by two elements. A2. Let G be a finite group of order n. Let H be a proper subgroup of G if index m. If n does not divide m!, show that G is not a simple group. A3. Let p be a prime number. Show the polynomial is irreducible in Q[x]. Φ p (x) = x p 1 + x p x + 1 C1. Show that z =3 e z2 z z dz 2πe9. Complex Analysis C2. Find all possible values of ( 3 + i) i and log(5 + 5i). In both cases indicate which of the values is the principal value. C3. Let D be the wedge in the upper right quadrant of the complex plane between the x axis and the line y = tan(θ)x, where 0 < θ < π. Explicitly find a conformal map that 2 takes D bijectively to the interior of an open disk containing the origin. 2
3 PURE MATHEMATICS OPTION FALL 2010 Logic L1. Let L be a first order language, M an L-structure and N M a substructure. (a) What does it mean for N to be an elementary substructure of M? Suppose L = {R}, where R is a binary relation symbol and let M = Z, R M and N = 2Z, R N be the L-structures defined by where 2Z is the set of even integers. (b) Is N a substructure of M? R M = {(n, m) Z Z n < m}, R N = {(n, m) 2Z 2Z n < m}, (c) Is N an elementary substructure of M? L2. Let L be a first order language. (a) Suppose φ(x, y) is an L-formula whose free variables are among x, y. Write an L-sentence σ that is true in an L-structure M if and only if there is a unique pair (a, b) of elements of M such that M = φ(a, b). For every formula ψ(x, ȳ) in L, we denote by!x ψ(x, ȳ) the formula where z is some variable not among x, ȳ. (b) Which of the following formulas are equivalent? x ( ψ(x, ȳ) z (ψ(z, ȳ) x = z) ), σ,!x!y φ(x, y),!y!x φ(x, y) L3. Test the validity of the following argument using the tableau-method proof system. Arguments not formalized in the tableau-method, e.g., using truth tables, will receive a maximum of 10 points. A (B C) (C A) D (B D) A D 3
4 PURE MATHEMATICS OPTION FALL 2010 Number Theory N1. Find all x that satisfy the following 3x 2 mod 13, 4x 1 mod 7, 2x 3 mod 11 Express your answer in the form x a mod b. N2. (a) State the law of quadratic reciprocity for a pair of odd primes. ( ) 85 (b) Use the law of quadratic reciprocity to compute. 101 N3. Show that X 2 1 mod p n has exactly two solutions mod p n for each odd prime p. [Suggestion: First consider the case n = 1. Then assume X satisfies X 2 1 mod p n 1, and show that there is a unique Y mod p n such that Y X mod p n 1 and Y 2 1 mod p n. ] Real Analysis R1. (a) Define lim sup a n for a sequence {a n } n=1 of real numbers. (b) Let {a n } n=1, {b n } n=1 be two sequences bounded from above. Prove that lim sup(a n + b n ) lim sup(a n ) + lim sup(b n ). (c) Give an example with strict inequality in (b). R2. For which values of x does the series n=1 (3x + 1) n n log n converge? absolutely converge? R3. Let f be a non-negative continuous function on [0, 1] with with that f(x) = 0 for all x [a, b]. 1 0 f(x) dx = 0. Prove 4
5 PURE MATHEMATICS OPTION FALL 2010 Topology T1. Let X be a topological space, and let A X be a connected subset of X. Let B = cl(a) denote the closure of A in X. Show that B is connected. T2. Show that a topological space X is Hausdorff if and only if the diagonal is closed for the product topology. (X) = {(x, x) x X} X X T3. Suppose that f : S 1 X is an injective continuous map from the circle to a Hausdorff space X. Show that the subspace f(s 1 ) is homeomorphic to S 1. 5
6 MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION FALL 2010 SOLUTIONS Algebra A1. Let G = Z/2 Z/6 Z/12. Show that G can not be generated by two elements. Solution: G is a direct sum of cyclic groups each of even order. There is a homomorphism from each of these summands onto Z/2. Therefore G maps onto H = Z/2 Z/2 Z/2. If G where generated by two elements, then H would be also. If a, b H, the subgroup generated by a, b consist of elements of the form xa + yb where x, y {0, 1}. There are at most four such elements while H has order 8. Therefore G cannot be generated by two elements. A2. Let G be a finite group of order n. Let H be a proper subgroup of G if index m. If n does not divide m!, show that G is not a simple group. Solution: G acts by left multiplication on the set S of cosets gh of H in G, that is, there is a homomorphism φ : G Perm(S) sending g 1 to the permutation sending gh to g 1 gh. ker φ is normal in G. Since φ acts nontrivially, ker φ G, and, since n does not divide m!, ker φ 0. Therefore G is not simple. A3. Let p be a prime number. Show the polynomial is irreducible in Q[x]. Solution: Note that Φ p (x) = xp 1 x 1. Let Φ p (x) = x p 1 + x p x + 1 f(u) = Φ p (u + 1) = (u + 1)p 1. u Then f(u) satisfies the Eisenstein s Criterion, hence f(u) is irreducible in Z[u] and therefore Φ p (x) is irreducible in Z[x]. We conclude that Φ p (x) is irreducible in Q[x] by Gauss s Lemma. 1
7 C1. Show that z =3 e z2 z z dz 2πe9. Complex Analysis Solution: The integral is at most the length of the contour times the maximum magnitude of the integrand on the contour. The length of the contour is 6π, and the integrand is at most e Re( z2 ) z 2 2 z e9 3. Hence the integral is at most 2πe9. C2. Find all possible values of ( 3 + i) i and log(5 + 5i). In both cases indicate which of the values is the principal value. Solution: 3 + i = 2e iπ 6 = e ln 2+ iπ 6 = e ln 2+i π 6 +2πki for any integral k. Hence ( 3+i) i = e i ln 2 π 6 2πk for any integral k, or e π 6 2πk [cos(ln 2) + i sin(ln 2)]. The case k = 0 gives the principal value. For the second part, (5+5i) is (5 2)e iπ 4, so the possible logarithms are ln(5 2) + i( π + 2kπ) for integers k, with k = 0 giving the principal value of the 4 logarithm. C3. Let D be the wedge in the upper right quadrant of the complex plane between the x axis and the line y = tan(θ)x, where 0 < θ < π. Explicitly find a conformal map that 2 takes D bijectively to the interior of an open disk containing the origin. Solution: z z π/θ takes D to the upper half plane. The conformal map (z i)/(z +i) takes the upper half plane to the unit disc. Hence (z π/θ i)/(z π/θ + i) works. Logic L1. Let L be a first order language, M an L-structure and N M a substructure. (a) What does it mean for N to be an elementary substructure of M? Suppose L = {R}, where R is a binary relation symbol and let M = Z, R M and N = 2Z, R N be the L-structures defined by where 2Z is the set of even integers. (b) Is N a substructure of M? R M = {(n, m) Z Z n < m}, R N = {(n, m) 2Z 2Z n < m}, (c) Is N an elementary substructure of M? 2
8 Solution: (a) N is an elementary substructure of M if and only if for all formulas φ(x) and parameters a in N, we have N = φ(a) M = φ(a). (b) N is a substructure of M since the domain N of N is a subset of the domain M of M and moreover R N = N 2 R M. (c) N is not an elementary substructure of M, since, for example, while L2. Let L be a first order language. M = x (R0x & Rx2), N = x (R0x & Rx2). (a) Suppose φ(x, y) is an L-formula whose free variables are among x, y. Write an L-sentence σ that is true in an L-structure M if and only if there is a unique pair (a, b) of elements of M such that M = φ(a, b). For every formula ψ(x, ȳ) in L, we denote by!x ψ(x, ȳ) the formula where z is some variable not among x, ȳ. (b) Which of the following formulas are equivalent? x ( ψ(x, ȳ) z (ψ(z, ȳ) x = z) ), σ,!x!y φ(x, y),!y!x φ(x, y) Solution: (a) Let σ be the following formula: x y ( φ(x, y) & z v (φ(z, v) (x = z & y = v) ). (b) None of the three formulas are equivalent. To see this, we can let φ(x, y) be the formula Rxy, where R is a binary relation symbol. We define two {R}-structures M and N with common domain {1, 2, 3} as follows R M = { (1, 1), (1, 2), (1, 3), (2, 1) } Then while R N = { (1, 1), (2, 1), (3, 1), (1, 2) } M = σ, M =!x!y φ(x, y), M =!y!x φ(x, y), N = σ, N =!x!y φ(x, y), N =!y!x φ(x, y), showing that the formulas are inequivalent. 3
9 L3. Test the validity of the following argument using the tableau-method proof system. Arguments not formalized in the tableau-method, e.g., using truth tables, will receive a maximum of 10 points. Solution: A (B C) (C A) D (B D) A D A (B C) (C A) D (B D) A D C A (C A) D D C A D D (B D) B D A B C B C Since the tableau does not close after all formulas have been checked, the argument is invalid. In this case, we can see that A, B, C, D will render all premises true, but the conclusion false. A Number Theory N1. Find all x that satisfy the following 3x 2 mod 13, 4x 1 mod 7, 2x 3 mod 11 Express your answer in the form x a mod b. 4
10 Solution: We start by simplifying the equations. One easily checks that mod 13, mod 7, mod 11. We rewrite the equations as We first consider the two top equations x 5 mod 13, (1) x 2 mod 7, (2) x 7 mod 11. (3) x 5 mod 13, x 2 mod 7. An x that satisfies the first equation is of the form x = k for an integer k. We insert this in the second equation to obtain k 2 mod 7. This equation simplifies to 6k 4 mod 7, or equivalently 3k 2 mod 7. Since mod 7, we get k 3 mod 7. This means that k = 3 + 7l for an integer l. Consequently x = k = (3 + 7l) = l. We insert this value x = l in equation (3) to obtain l 7 mod 11. This immediately give 13 7l 7 mod 11, and then 2 7l 7 mod 11 and then 2l 1 mod 11 and finally l 6 mod 11. Write l = m for an integer m. We have x = (6 + 11m) = m. The desired solution is x 590 mod N2. (a) State the law of quadratic reciprocity for a pair of odd primes. ( ) 85 (b) Use the law of quadratic reciprocity to compute. 101 Solution: (a) If p and q are distinct odd primes, the ( ) ( ) p q = ( 1) 1 2 (p 1) 1 2 (q 1). q p (b) ( ) ( 85 5 = ( 101 = = 1 5 ) ( ) ) ( ) 101 = 17 ( 1 5 ) ( ) as ( 16 17) = 1. 5
11 N3. Show that X 2 1 mod p n has exactly two solutions mod p n for each odd prime p. [Suggestion: First consider the case n = 1. Then assume X satisfies X 2 1 mod p n 1, and show that there is a unique Y mod p n such that Y X mod p n 1 and Y 2 1 mod p n. ] Solution: Let f(x) = X 2 1. If a Z/p and f(a) = 0 mod p, then (a 1)(a+1) = 0 mod p. Since Z/p has no zero divisors, a = 1 or a = 1. Assume inductively that if a Z/p n and f(a) = 0, then a = ±1 mod p n. Let b Z/p n+1 and f(b) = 0 mod p n+1. Then f(b) 0 mod p n and hence b ±1 mod p n. Therefore b = a + tp n where a = ±1. Now f(b) = (a+tp n ) 2 1 2atp n mod p n+1. Sincef(b) 0 mod p n+1, t 0 mod p. Thus b ±1 mod p n+1. Real Analysis R1. (a) Define lim sup a n for a sequence {a n } n=1 of real numbers. (b) Let {a n } n=1, {b n } n=1 be two sequences bounded from above. Prove that lim sup(a n + b n ) lim sup(a n ) + lim sup(b n ). (c) Give an example with strict inequality in (b). Solution: (a) If {a n } is bounded then the sequence A n = sup{a n, a n+1,... } is nonincreasing and bounded; therefore converges. Its limit is one of the equivalent definitions of lim sup a n. (b) For each n, let A n = sup{a i i n}, B n = sup{b i i n}, C n = sup{a i + b i i n}. For i n one has a i A n, b i B n giving a i + b i A n + B n. Hence C n A n + B n. Passing to the limit in n one obtains the claim. (c) For example: 0, 1, 0, 1, 0, 1,... and 1, 0, 1, 0, 1,.... R2. For which values of x does the series n=1 (3x + 1) n n log n converge? absolutely converge? 6
12 Solution: There are four cases: (1) x < 2/3 or x > 0, (2) 2/3 < x < 0, (3) x = 2/3, (4) x = 0. In case (1) the ratio test for the absolute values a n = 3x + 1 n /n log n gives a n+1 lim a n So a n 0 and the series diverges. = 3x + 1 lim (n + 1) log(n + 1) n log n In case (2) the same ratio test gives absolute convergence. = 3x + 1 > 1. In case (3) the series is ( 1) n /n log n; it converges conditionally by Leibnitz rule, because 1/n log n 0 monotonically. In case (4) the series is 1/n log n = +. This can be deduced from Cauchy criterion comparing the series to 2 k a 2 k = const 1, or by the integral criterion with change k of variables u = e x. So the series converges for x [ 2/3, 0) with conditional convergence at x = 0. R3. Let f be a non-negative continuous function on [0, 1] with with that f(x) = 0 for all x [0, 1]. 1 0 f(x) dx = 0. Prove Solution: Assume f(c) > 0 for some c [0, 1]. By continuity of f there is an interval J of length l > 0 with f(x) > f(c)/2 for x J. Then any partition of [0, 1] has a refinement P with the lower sum L(f, P) lf(c)/2 Thus 1 f(x) dx lf(c)/2 > 0. 0 This gives a contradiction. Topology T1. Let X be a topological space, and let A X be a connected subset of X. Let B = cl(a) denote the closure of A in X. Show that B is connected. Solution: Given open sets U V = with B U V we must show that either B U or B V. It is given that A is connected, and A U V, so either A U or A V. Assume A U. Then U V = implies that A (X V ). As (X V ) is closed, we also have B = cl(a) (X V ). Thus, B V =. Since B U V we conclude that B U. The case where A V is similar. T2. Show that a topological space X is Hausdorff if and only if the diagonal is closed for the product topology. (X) = {(x, x) x X} X X 7
13 Solution: Assume that X is Hausdorff. Let x, y X with (x, y) (X). Then x y, so by the Hausdorff assumption, there exists open sets U, V X with x U, y V and U V =. If (U V ) (X) then there exists some point (z, z) U V, so that z U V, a contradiction. Thus, U V (X (X)) is an open neighborhood in the product topology for the point (x, y). This shows that the complement of (X) is an open set, hence (X) is closed for the product topology. Conversely, suppose that (X) is closed, and x, y X satisfy x y. Then (x, y) (X (X)) which is open for the product topology. Thus, there exists open sets U, V X with (x, y) U V (X (X)). Then x U and y V with U V =. This shows that X is Hausdorff. T3. Suppose that f : S 1 X is an injective continuous map from the circle to a Hausdorff space X. Show that the subspace f(s 1 ) is homeomorphic to S 1. Solution: The circle is compact, since it is a closed and bounded subspace of R 2. The subspace f(s 1 ) is Hausdorff, since it is a subspace of a Hausdorff space. Thus f is a continuous bijection from the compact space S 1 to the Hausdorff space f(s 1 ). Any continuous bijection g from a compact space to a Hausdorff space is a homeomorphism. To show this it suffices to show that any such bijection g is a closed map. (If it is closed then it is also open since, being a bijection, it maps complements of closed sets to complements of closed sets.) But a closed subspace of a compact space is compact and a continuous image of a compact space is compact. Thus g maps closed sets to compact sets. Since compact subspaces of a Hausdorff space are closed, it follows that g maps closed sets to closed sets. 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 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 informationMASTERS EXAMINATION IN MATHEMATICS
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.
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 informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More 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 informationD-MATH Algebraic Geometry FS 2018 Prof. Emmanuel Kowalski. Solutions Sheet 1. Classical Varieties
D-MATH Algebraic Geometry FS 2018 Prof. Emmanuel Kowalski Solutions Sheet 1 Classical Varieties Let K be an algebraically closed field. All algebraic sets below are defined over K, unless specified otherwise.
More informationModern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.
1 2 3 style total Math 415 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. Every group of order 6
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 informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More information2 Sequences, Continuity, and Limits
2 Sequences, Continuity, and Limits In this chapter, we introduce the fundamental notions of continuity and limit of a real-valued function of two variables. As in ACICARA, the definitions as well as proofs
More informationINVERSE LIMITS AND PROFINITE GROUPS
INVERSE LIMITS AND PROFINITE GROUPS BRIAN OSSERMAN We discuss the inverse limit construction, and consider the special case of inverse limits of finite groups, which should best be considered as topological
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
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 informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, February 2, Time Allowed: Two Hours Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Scholarships Screening Test Saturday, February 2, 2008 Time Allowed: Two Hours Maximum Marks: 40 Please read, carefully, the instructions on the following
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. Research Awards Screening Test. February 25, Time Allowed: 90 Minutes Maximum Marks: 40
NATIONAL BOARD FOR HIGHER MATHEMATICS Research Awards Screening Test February 25, 2006 Time Allowed: 90 Minutes Maximum Marks: 40 Please read, carefully, the instructions on the following page before you
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 informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
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 informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationSPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS
SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly
More information(3) Let Y be a totally bounded subset of a metric space X. Then the closure Y of Y
() Consider A = { q Q : q 2 2} as a subset of the metric space (Q, d), where d(x, y) = x y. Then A is A) closed but not open in Q B) open but not closed in Q C) neither open nor closed in Q D) both open
More informationAnswers to Final Exam
Answers to Final Exam MA441: Algebraic Structures I 20 December 2003 1) Definitions (20 points) 1. Given a subgroup H G, define the quotient group G/H. (Describe the set and the group operation.) The quotient
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
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 informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationLet X be a topological space. We want it to look locally like C. So we make the following definition.
February 17, 2010 1 Riemann surfaces 1.1 Definitions and examples Let X be a topological space. We want it to look locally like C. So we make the following definition. Definition 1. A complex chart on
More informationMath 2070BC Term 2 Weeks 1 13 Lecture Notes
Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic
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 informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
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φ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationNotation. 0,1,2,, 1 with addition and multiplication modulo
Notation Q,, The set of all natural numbers 1,2,3, The set of all integers The set of all rational numbers The set of all real numbers The group of permutations of distinct symbols 0,1,2,,1 with addition
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
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 informationMath 203A - Solution Set 1
Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More 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 informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationMATH 113 FINAL EXAM December 14, 2012
p.1 MATH 113 FINAL EXAM December 14, 2012 This exam has 9 problems on 18 pages, including this cover sheet. The only thing you may have out during the exam is one or more writing utensils. You have 180
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 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 information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationSection IV.23. Factorizations of Polynomials over a Field
IV.23 Factorizations of Polynomials 1 Section IV.23. Factorizations of Polynomials over a Field Note. Our experience with classical algebra tells us that finding the zeros of a polynomial is equivalent
More informationAlgebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...
Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2
More informationTopology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski
Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology
More information2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.
Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms
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 informationEXERCISES FOR MATHEMATICS 205A
EXERCISES FOR MATHEMATICS 205A FALL 2008 The references denote sections of the text for the course: J. R. Munkres, Topology (Second Edition), Prentice-Hall, Saddle River NJ, 2000. ISBN: 0 13 181629 2.
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 informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More informationGroup Theory
Group Theory 2014 2015 Solutions to the exam of 4 November 2014 13 November 2014 Question 1 (a) For every number n in the set {1, 2,..., 2013} there is exactly one transposition (n n + 1) in σ, so σ is
More informationAlgebra Ph.D. Entrance Exam Fall 2009 September 3, 2009
Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009 Directions: Solve 10 of the following problems. Mark which of the problems are to be graded. Without clear indication which problems are to be graded
More informationx 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0
1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials
More informationPRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.
PRACTICE FINAL MATH 18.703, MIT, SPRING 13 You have three hours. This test is closed book, closed notes, no calculators. There are 11 problems, and the total number of points is 180. Show all your work.
More informationINTRODUCTION TO REAL ANALYTIC GEOMETRY
INTRODUCTION TO REAL ANALYTIC GEOMETRY KRZYSZTOF KURDYKA 1. Analytic functions in several variables 1.1. Summable families. Let (E, ) be a normed space over the field R or C, dim E
More informationPage Points Possible Points. Total 200
Instructions: 1. The point value of each exercise occurs adjacent to the problem. 2. No books or notes or calculators are allowed. Page Points Possible Points 2 20 3 20 4 18 5 18 6 24 7 18 8 24 9 20 10
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 information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
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 informationNOTES IN COMMUTATIVE ALGEBRA: PART 2
NOTES IN COMMUTATIVE ALGEBRA: PART 2 KELLER VANDEBOGERT 1. Completion of a Ring/Module Here we shall consider two seemingly different constructions for the completion of a module and show that indeed they
More informationCS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati
CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati Important 1. No questions about the paper will be entertained during
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 informationRUTGERS UNIVERSITY GRADUATE PROGRAM IN MATHEMATICS Written Qualifying Examination August, Session 1. Algebra
RUTGERS UNIVERSITY GRADUATE PROGRAM IN MATHEMATICS Written Qualifying Examination August, 2014 Session 1. Algebra The Qualifying Examination consists of three two-hour sessions. This is the first session.
More information23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time.
23. Quotient groups II 23.1. Proof of the fundamental theorem of homomorphisms (FTH). We start by recalling the statement of FTH introduced last time. Theorem (FTH). Let G, H be groups and ϕ : G H a homomorphism.
More informationMATH NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS
MATH. 4433. NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS TOMASZ PRZEBINDA. Final project, due 0:00 am, /0/208 via e-mail.. State the Fundamental Theorem of Algebra. Recall that a subset K
More informationSolutions of exercise sheet 6
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 6 1. (Irreducibility of the cyclotomic polynomial) Let n be a positive integer, and P Z[X] a monic irreducible factor of X n 1
More informationwhere c R and the content of f is one. 1
9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.
More informationMath 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I.
Math 250A, Fall 2004 Problems due October 5, 2004 The problems this week were from Lang s Algebra, Chapter I. 24. We basically know already that groups of order p 2 are abelian. Indeed, p-groups have non-trivial
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
More informationBackground Material in Algebra and Number Theory. Groups
PRELIMINARY READING FOR ALGEBRAIC NUMBER THEORY. HT 2016/17. Section 0. Background Material in Algebra and Number Theory The following gives a summary of the main ideas you need to know as prerequisites
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 informationFILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS.
FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS. Let A be a ring, for simplicity assumed commutative. A filtering, or filtration, of an A module M means a descending sequence of submodules M = M 0
More informationPh.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018
Ph.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018 Do 6 problems with at least 2 in each section. Group theory problems: (1) Suppose G is a group. The
More informationModel Theory of Real Closed Fields
Model Theory of Real Closed Fields Victoria L. Noquez Carnegie Mellon University Logic and Computation Senior Thesis Advisor: Dr. James Cummings May 2008 Abstract An important fact in the application of
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationRINGS: SUMMARY OF MATERIAL
RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 11-13 of Artin. Definitions not included here may be considered
More informationGalois Theory, summary
Galois Theory, summary Chapter 11 11.1. UFD, definition. Any two elements have gcd 11.2 PID. Every PID is a UFD. There are UFD s which are not PID s (example F [x, y]). 11.3 ED. Every ED is a PID (and
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationERRATA. Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on March 4, 2009)
ERRATA Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on March 4, 2009) These are errata for the Third Edition of the book. Errata from previous editions have been fixed
More informationAlgebraic Structures Exam File Fall 2013 Exam #1
Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write
More informationSolutions to practice problems for the final
Solutions to practice problems for the final Holomorphicity, Cauchy-Riemann equations, and Cauchy-Goursat theorem 1. (a) Show that there is a holomorphic function on Ω = {z z > 2} whose derivative is z
More informationMath 203A - Solution Set 1
Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in
More informationModern Computer Algebra
Modern Computer Algebra Exercises to Chapter 25: Fundamental concepts 11 May 1999 JOACHIM VON ZUR GATHEN and JÜRGEN GERHARD Universität Paderborn 25.1 Show that any subgroup of a group G contains the neutral
More informationReducibility of Polynomials over Finite Fields
Master Thesis Reducibility of Polynomials over Finite Fields Author: Muhammad Imran Date: 1976-06-02 Subject: Mathematics Level: Advance Course code: 5MA12E Abstract Reducibility of certain class of polynomials
More informationGALOIS THEORY. Contents
GALOIS THEORY MARIUS VAN DER PUT & JAAP TOP Contents 1. Basic definitions 1 1.1. Exercises 2 2. Solving polynomial equations 2 2.1. Exercises 4 3. Galois extensions and examples 4 3.1. Exercises. 6 4.
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationGraduate Preliminary Examination
Graduate Preliminary Examination Algebra II 18.2.2005: 3 hours Problem 1. Prove or give a counter-example to the following statement: If M/L and L/K are algebraic extensions of fields, then M/K is algebraic.
More informationA MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ
A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In
More informationSection III.6. Factorization in Polynomial Rings
III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)
More informationQuizzes for Math 401
Quizzes for Math 401 QUIZ 1. a) Let a,b be integers such that λa+µb = 1 for some inetegrs λ,µ. Prove that gcd(a,b) = 1. b) Use Euclid s algorithm to compute gcd(803, 154) and find integers λ,µ such that
More information1. For each statement, either state that it is True or else Give a Counterexample: (a) If a < b and c < d then a c < b d.
Name: Instructions. Show all work in the space provided. Indicate clearly if you continue on the back side, and write your name at the top of the scratch sheet if you will turn it in for grading. No books
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
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 information