Rotated Corners in the Integer Lattice
|
|
- Brendan Moore
- 5 years ago
- Views:
Transcription
1 Rotated Corners in the Integer Lattice Hans Parshall Abstract In this paper we prove the existence of rotated corners within positive density subsets of the lattice [, N] for sufficiently large N. We further show that the number of these corners is some positive proportion of the total possible number of corners. Preliminaries Roth in [] proved that for N sufficiently large, a subset of [, N] with positive density will necessarily contain a non-trivial 3-term arithmetic progression. In the integer lattice, we are interested in finding three points that are vertices of an isosceles triangle. To do this, we look for rotated corners. Definition. A rotated corner is a triple x,y, z [, N] such that y x = R(z x), where R = ( 0 0 ). We will eventually show that either N is bounded above in terms of the density of our subset, or our subset has increased density in some lattice. Definition. A lattice is a set P [, N] along with some x [, N], q, k [, N] such that P = {(x + iq, x + q) : i, k}. The approach will be similar to Roth s Fourier analytic proof for 3-term arithmetic progressions. For this we will require some notation and definitions. For a in some -dimensional set A, we will denote its coordinates as (a, a ). Definition. For x, y Z N, we define the dot product x y := x y + x y. Definition. Let f : Z N C and define e(α) := exp(πiα). We define the Fourier transform of f to be bf(ξ) := f(x)e( x ξ/n). For convenience, we will rely on context and hereafter denote the dot product by uxtaposition. Definition. Let f, g : Z N C. We define the convolution of f with g to be f g(x) = f(y)g(x y). y Z N Definition. Given a set A Z N, we denote its characteristic function if x A A(x) = 0 otherwise Finally, we state without proof some fairly standard but useful identities. Proposition. Let f, g : Z N C and let A Z N. Then the following are true. (i) f(x) = f(ξ) N b (ii) f g(ξ) = b f(ξ)bg(ξ) (iii) max f(ξ) b f(x) ξ Z N (iv) A(0) b = A N Identity (i) is frequently referred to as Plancherel s identity. For our proof of existence of rotated corners, we need to consider two cases. The first is when our set is sufficiently random and the second is when it can be shown to be somewhat structured.
2 The Random Case A sufficient notion of randomness for our purposes is that of ε-uniformity. Definition. We say that a set A Z N is ε-uniform if b A(ξ) ε for all ξ (0,0). Let A [, N] with A = δ. If we consider A as a subset of Z N and let B := A (N/3, N/3], it s easily verified that every corner counted by (A) := {(x, y,z) B A : y x R(z x) (modn)}. is a genuine corner in [, N] as well. That is, (A) provides a lower bound on the number of corners contained in A. We can count (A) by (A) = e((y x R(z x))ξ/n) = x B y B z A = = N 4 e(yξ/n) y B z Ae( R(z)ξ/N) x B y B e(yξ/n) z Ae( zr (ξ)/n) x B e( (x R(x))ξ/N) e( x(ξ R (ξ))/n) bb( ξ) bb(ξ R (ξ)) ba(r (ξ)) () With this count for (A), we can make the following observation. Lemma. If A is ε-uniform, then (A) δ B ε B. Proof. By pulling out the terms when ξ = 0, the summation in () provides (A) δ B = N 4 B( ξ) b B(ξ b R (ξ)) b A(R (ξ)) \{0} Utilizing ε-uniformity of A and the Cauchy-Schwarz inequality, we have (A) δ B εn 4 bb( ξ) B(ξ b R (ξ)) 0 εn B( ξ) b A / B(ξ b R (ξ)) A / Finally, noting that both ξ and ξ R (ξ) vary completely over Z N, Plancherel s identity yields ««B (A) δ B εn 4 / B / = ε B N N In particular, Lemma implies that if A is ε-uniform with ε δ B /( ), then A contains at least δ B / corners. This is useful to prove the main result of this section. Lemma. Let A [, N] with A = δ be ε-uniform for some ε δ B /( ). Suppose that A contains no nontrivial rotated corners. Then either N < 5/δ or there exists some lattice P [, N] such that δ + δ 80
3 Proof. First suppose B δ /0. Then, by our lower bound from Lemma, it must be that > δ B δ3 N 4 00 N < 5/δ. Suppose instead B < δ /0. Then the other 8 N/3 by N/3 lattices comparable to (N/3,N/3] must contain at least 9δ /0 elements of A. By the pigeonhole principle, we can conclude that one of them, call it P, has 9δ /80. But then we have = 9 8δ 80 δ + δ 80. The Structured Case For x R, let x denote the distance to the nearest integer from x. Lemma 3. Fix ξ Z N\{0} and let Q [, N / ]. Then there exists some q [, Q ] such that qξ /N /Q, qξ /N /Q Proof. Consider the lattice [, N] modulo. Split this into Q lattices of the form [i/q, (i + )/Q) [/Q, ( + )/Q) for 0 i, Q. If there existed a q such that qξ/n was in one of the four corner lattices, we would be done. Suppose instead that there was no such q. Then there are Q 4 lattices with Q choices of q, so there must exist q < q Q such that q ξ/n and q ξ/n lie within the same lattice. Then we know (q q )ξ /N /Q (mod), (q q )ξ /N /Q (mod). () But q q [, Q], and () implies that (q q )ξ/n lies within the bottom left corner lattice. This contradicts our assumption that there were no such q, and therefore one must exist. Let L N / /8π. By Lemma 3, we can now fix q 64π L such that qξ /N /8πL and qξ /N /8πL for all nonzero ξ. Define P q := {( iq, q) : i,, L} and set η := L /. We can now show that P q has relatively large Fourier coefficients. Fixing ξ Z N \{0}, c P q(ξ) = = = η = η/ e((qξ + kqξ )/N) k= e(qξ /N) e(kqξ /N) k= Re(e(qξ /N)) Re(e(kqξ /N)) k= ( πqξ /N ) ( πkqξ /N ) L π qξ /N «L πl 8πL 4πL3 8πL k=! L π qξ /N! k k= 3
4 Define the balanced function of a set A Z N as f A := A(x) δ. A simple computation shows f A P q(x) = A (x Pq) δη (3) Suppose that A is not ε-uniform. Then we have f A P q(x) max cf A(ξ) cp q(ξ) = max b A(ξ) cp q(ξ) εη ξ Z ξ Z N N \{0} If we let (f A P q) + := max{f A P q,0}, then we see 0 (f A P q) +(x) f A P q(x) + f A P q(x) A But noting P x Z f A P N q(x) = 0, we now have (f A P q) +(x) εη 4 (4) In particular, together with (3) and the pigeonhole principle, we have that there exists some x Z N such that A (x P q) δη εη 4 This allows us to prove the main result of this section. Lemma 4. Suppose A [, N] with A δ is not ε-uniform. Then there exists a genuine lattice P [, N] with p εn/5π such that δ + ε 8 Proof. To begin, we count x Z N where x P q would be an adequate lattice in Z N. Let k := x Z A (x Pq) N : δ + ε P q 8 ff Equivalently, we know k = x Z N : A (x Pq) δη εη 8 ff and hence by (5), we know k. Note that f A P q(x) η always. By (4), we have εη 4 f A P q(x) ( εη k) + kη εn k ε k In order to show that one of these k starting points is for a genuine solution, it would suffice to show that the total size of the lattice is less than k. That is, we need q L ε /8. But we know q L 64π NL 4, so it is sufficient to have 64π NL 4 εn 8 L Thus we can choose our L such that p εn/5π. Existence of a Rotated Corner r εn 5π We now have sufficient machinery to prove the existence of a rotated corner in a positive density subset of the integer lattice. Theorem (Roth for Rotated Corners). Let δ > 0. Then there exists some absolute constant C such that, provided N exp exp(c/δ), any subset A [, N] with A δ will necessarily contain a non-trivial rotated corner. (5) 4
5 Proof. Let A [, N] with A δn such that A contains no non-trivial rotated corners. Set ε := δ /0. By Lemmas and 4, since we are assuming N is sufficiently large, we have that there exists some lattice P [, N] such that cδ N and δ + δ 80 Setting N 0 := N, A 0 := A, δ 0 := δ, we can iterate this argument as follows. Suppose for A we had a lattice P = {(x + iq, x + kq) : i, k p P } that satisfied the density increment above. Then we could set N + p P and «ff a x a x A + =, : a, a A P [, N +] q q First notice that if A + contains some rotated corner, then we have a,b, c A P such that a x b x c x = R b x «a b = R(c b) q q q q Since we have assumed A 0 contains no rotated corners, this implies no A contains a rotated corner. Now, note A + δ + + where δ + δ + δ /80. This iteration cannot continue indefinitely. Indeed, a simple induction argument demonstrates that any δ will double after 80/δ iterations. A finite amount of doubling will cause some δ k+ >, where certainly k i=0 80 = 60. i δ 0 δ 0 But δ k+ > is absurd, so we must have N k < 5/δ k. Letting c vary to denote the appropriate absolute constant, we have 5 5 > N cδ k N / k δ 0 δ cδ k k δ k N / k / cδ 0 0 N 0 < cδ 3 0. An easy calculation provides that log log N 0 < log log(cδ 3 0 ) C/δ for some absolute constant C, contradicting our choice of N 0. Therefore, A must contain a non-trivial rotated corner. Existence of Many Rotated Corners Any two points chosen in [, N] give rise to at least one rotated corner; that is, there are approximately N 4 rotated corners in [, N]. We can apply an argument of Varnavides from [], originally applied to Roth s theorem on 3-term arithmetic progressions, to guarantee that a positive proportion of the total number of rotated corners are in any set with positive density. Theorem (Varnavides for Rotated Corners). Let δ > 0 and let N be sufficiently large. Then any subset A [, N] with A δ will necessarily contain c(δ)n 4 rotated corners, where c(δ) is a constant depending only on δ. Proof. We first choose an integer k := k(δ) sufficiently large to apply Roth for Rotated Corners on a subset of [, k] with density δ/. For u [, N] and d N, we consider lattices P u,d = {(u + id, u + d) : i, k} [, N]. We call P u,d good if A P u,d δk /. Fix d < δn/k and let g d denote the number of good lattices with step size d. For every a A with kd < a, a < N kd, we can choose u {(a id, a d) : i, k} so that a is contained in exactly k lattices. The number of these a is bounded below by A 4Nkd δ 4δ /k = δ( 4/k). Provided k > 6, we have 4 «3 k 4 δk (6) u,d:p u,d [,N] A P u,d k δ 5
6 The most A could intersect with any good lattice is precisely the size of the lattice, k. The most A could intersect with any other lattice is δk /, and certainly the total number of such lattices is less than. Thus, we have u,d:p u,d [,N] A P u,d g d k + δk (7) Then by (6) and (7), we have g d (/4)δ. But then we have at least δ /4 δ /k = c (δ)n 4 good lattices, each of which gives rise to a rotated corner by applying Roth for Rotated Corners. The only concern now is that each corner is being counted multiple times. To account for this, fix some solution in A. Note in the three points in the solution, there must be at least two distinct horizontal coordinates and two distinct vertical coordinates. For the solution to lie in a lattice P u,d, we have at most (k ) choices for u and u, hence at most (k ) choices for u. Further observe that the difference between the two distinct horizontal coordinates, call it d, must be divisible by d. That is, d = d /t for some t. But we must have kd > d or the lattice is not large enough to span our corner. Thus we have at most k choices for t, and so at most k choices for d. Our P u,d is completely determined by our choices of u and d, hence our solution can be contained in at most k(k ) lattices. Therefore we have at least (/k(k ) )c (δ)n 4 = c(δ)n 4 rotated corners in A. References [] K. Roth, On certain sets of integers, J. Lond. Math. Soc., 8 (953), pp [] P. Varnavides, On certain sets of positive density, J. Lond. Math. Soc., 34 (959), pp
ROTH S THEOREM THE FOURIER ANALYTIC APPROACH NEIL LYALL
ROTH S THEOREM THE FOURIER AALYTIC APPROACH EIL LYALL Roth s Theorem. Let δ > 0 and ep ep(cδ ) for some absolute constant C. Then any A {0,,..., } of size A = δ necessarily contains a (non-trivial) arithmetic
More informationARITHMETIC STRUCTURES IN RANDOM SETS. Mariah Hamel Department of Mathematics, University of British Columbia, Vancouver, B.C.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A04 ARITHMETIC STRUCTURES IN RANDOM SETS Mariah Hamel Department of Mathematics, University of British Columbia, Vancouver, B.C. V6T
More informationRoth s Theorem on 3-term Arithmetic Progressions
Roth s Theorem on 3-term Arithmetic Progressions Mustazee Rahman 1 Introduction This article is a discussion about the proof of a classical theorem of Roth s regarding the existence of three term arithmetic
More informationNEIL LYALL A N. log log N
SÁRKÖZY S THEOREM NEIL LYALL. Introduction The purpose of this expository note is to give a self contained proof (modulo the Weyl ineuality) of the following result, due independently to Sárközy [5] and
More informationA PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS
A PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS ERNIE CROOT AND OLOF SISASK Abstract. We present a proof of Roth s theorem that follows a slightly different structure to the usual proofs, in that
More informationRoth s theorem on 3-arithmetic progressions. CIMPA Research school Shillong 2013
Roth s theorem on 3-arithmetic progressions CIPA Research school Shillong 2013 Anne de Roton Institut Elie Cartan Université de Lorraine France 2 1. Introduction. In 1953, K. Roth [6] proved the following
More informationLong Arithmetic Progressions in A + A + A with A a Prime Subset 1. Zhen Cui, Hongze Li and Boqing Xue 2
Long Arithmetic Progressions in A + A + A with A a Prime Subset 1 Zhen Cui, Hongze Li and Boqing Xue 2 Abstract If A is a dense subset of the integers, then A + A + A contains long arithmetic progressions.
More informationA NEW PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS
A NEW PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS ERNIE CROOT AND OLOF SISASK Abstract. We present a proof of Roth s theorem that follows a slightly different structure to the usual proofs, in that
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationA PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO Introduction
A PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO 1 ERNIE CROOT NEIL LYALL ALEX RICE Abstract. Using purely combinatorial means we obtain results on simultaneous Diophantine
More informationII. FOURIER TRANSFORM ON L 1 (R)
II. FOURIER TRANSFORM ON L 1 (R) In this chapter we will discuss the Fourier transform of Lebesgue integrable functions defined on R. To fix the notation, we denote L 1 (R) = {f : R C f(t) dt < }. The
More informationExpansions of quadratic maps in prime fields
Expansions of quadratic maps in prime fields Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract Let f(x) = ax 2 +bx+c Z[x] be a quadratic polynomial with
More informationNumber Theory and Graph Theory. Prime numbers and congruences.
1 Number Theory and Graph Theory Chapter 2 Prime numbers and congruences. By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-1:Primes
More informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More informationHigher-order Fourier analysis of F n p and the complexity of systems of linear forms
Higher-order Fourier analysis of F n p and the complexity of systems of linear forms Hamed Hatami School of Computer Science, McGill University, Montréal, Canada hatami@cs.mcgill.ca Shachar Lovett School
More informationPELL S EQUATION, II KEITH CONRAD
PELL S EQUATION, II KEITH CONRAD 1. Introduction In Part I we met Pell s equation x dy = 1 for nonsquare positive integers d. We stated Lagrange s theorem that every Pell equation has a nontrivial solution
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More information1 Fourier Integrals on L 2 (R) and L 1 (R).
18.103 Fall 2013 1 Fourier Integrals on L 2 () and L 1 (). The first part of these notes cover 3.5 of AG, without proofs. When we get to things not covered in the book, we will start giving proofs. The
More information2 Infinite products and existence of compactly supported φ
415 Wavelets 1 Infinite products and existence of compactly supported φ Infinite products.1 Infinite products a n need to be defined via limits. But we do not simply say that a n = lim a n N whenever the
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
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 informationCongruences involving product of intervals and sets with small multiplicative doubling modulo a prime
Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime J. Cilleruelo and M. Z. Garaev Abstract We obtain a sharp upper bound estimate of the form Hp o(1)
More informationBURGESS INEQUALITY IN F p 2. Mei-Chu Chang
BURGESS INEQUALITY IN F p 2 Mei-Chu Chang Abstract. Let be a nontrivial multiplicative character of F p 2. We obtain the following results.. Given ε > 0, there is δ > 0 such that if ω F p 2\F p and I,
More informationEXTENSIONS OF VARNAVIDES PROOF ON 3-TERM ARITHMETIC PROGRESSIONS. Abstract
EXTESIOS OF VARAVIDES PROOF O 3-TERM ARITHMETIC PROGRESSIOS LUCIA PETITO Abstract Varnavides proved, as a result of Roth s theorem, a lower bound on the number of three term arithmetic progressions in
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More informationIncomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.
More information1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018.
New Zealand Mathematical Olympiad Committee Camp Selection Problems 2018 Solutions Due: 28th September 2018 1. Suppose that a, b, c and d are four different integers. Explain why must be a multiple of
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
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 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 informationBaltic Way 2003 Riga, November 2, 2003
altic Way 2003 Riga, November 2, 2003 Problems and solutions. Let Q + be the set of positive rational numbers. Find all functions f : Q + Q + which for all x Q + fulfil () f ( x ) = f (x) (2) ( + x ) f
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationApproximation of complex algebraic numbers by algebraic numbers of bounded degree
Approximation of complex algebraic numbers by algebraic numbers of bounded degree YANN BUGEAUD (Strasbourg) & JAN-HENDRIK EVERTSE (Leiden) Abstract. To measure how well a given complex number ξ can be
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationPM functions, their characteristic intervals and iterative roots
ANNALES POLONICI MATHEMATICI LXV.2(1997) PM functions, their characteristic intervals and iterative roots by Weinian Zhang (Chengdu) Abstract. The concept of characteristic interval for piecewise monotone
More informationLocal Fields. Chapter Absolute Values and Discrete Valuations Definitions and Comments
Chapter 9 Local Fields The definition of global field varies in the literature, but all definitions include our primary source of examples, number fields. The other fields that are of interest in algebraic
More informationSums of Squares. Bianca Homberg and Minna Liu
Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationPlaces of Number Fields and Function Fields MATH 681, Spring 2018
Places of Number Fields and Function Fields MATH 681, Spring 2018 From now on we will denote the field Z/pZ for a prime p more compactly by F p. More generally, for q a power of a prime p, F q will denote
More informationChapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011)
Chapter Four Gelfond s Solution of Hilbert s Seventh Problem (Revised January 2, 2011) Before we consider Gelfond s, and then Schneider s, complete solutions to Hilbert s seventh problem let s look back
More informationANALYSIS OF SMALL GROUPS
ANALYSIS OF SMALL GROUPS 1. Big Enough Subgroups are Normal Proposition 1.1. Let G be a finite group, and let q be the smallest prime divisor of G. Let N G be a subgroup of index q. Then N is a normal
More informationAlgebraic function fields
Algebraic function fields 1 Places Definition An algebraic function field F/K of one variable over K is an extension field F K such that F is a finite algebraic extension of K(x) for some element x F which
More informationSOLUTIONS FOR 2011 APMO PROBLEMS
SOLUTIONS FOR 2011 APMO PROBLEMS Problem 1. Solution: Suppose all of the 3 numbers a 2 + b + c, b 2 + c + a and c 2 + a + b are perfect squares. Then from the fact that a 2 + b + c is a perfect square
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,
More informationCLASS NOTES FOR APRIL 14, 2000
CLASS NOTES FOR APRIL 14, 2000 Announcement: Section 1.2, Questions 3,5 have been deferred from Assignment 1 to Assignment 2. Section 1.4, Question 5 has been dropped entirely. 1. Review of Wednesday class
More informationSolutions to Chapter 17 exercises
Solutions to Chapter 17 exercises 17.1 Let (x n ) be a Cauchy sequence in a discrete metric space (X, d). There exists N N such that d(x m,x n ) < 1 whenever m>n N,soinfactd(x m,x n ) = whenever m>n N,since
More information1 Functions of Several Variables 2019 v2
1 Functions of Several Variables 2019 v2 11 Notation The subject of this course is the study of functions f : R n R m The elements of R n, for n 2, will be called vectors so, if m > 1, f will be said to
More informationOn two-point configurations in subsets of pseudo-random sets
On two-point configurations in subsets of pseudo-random sets Elad Aigner-Horev 2 Department of Mathematics University of Hamburg Bundesstrasse 55 D-20146 Hamburg, Germany Hiệp Hàn 1,3 Instituto de Matemática
More informationFinite Presentations of Hyperbolic Groups
Finite Presentations of Hyperbolic Groups Joseph Wells Arizona State University May, 204 Groups into Metric Spaces Metric spaces and the geodesics therein are absolutely foundational to geometry. The central
More information= 10 such triples. If it is 5, there is = 1 such triple. Therefore, there are a total of = 46 such triples.
. Two externally tangent unit circles are constructed inside square ABCD, one tangent to AB and AD, the other to BC and CD. Compute the length of AB. Answer: + Solution: Observe that the diagonal of the
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 informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationGEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS
GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS JENNY WANG Abstract. In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions
More informationSum of dilates in vector spaces
North-Western European Journal of Mathematics Sum of dilates in vector spaces Antal Balog 1 George Shakan 2 Received: September 30, 2014/Accepted: April 23, 2015/Online: June 12, 2015 Abstract Let d 2,
More informationEXTENSION OF HÖLDER S THEOREM IN Diff 1+ɛ
EXTENSION OF HÖLDER S THEOREM IN Diff 1+ɛ + (I) Azer Akhmedov Abstract: We prove that if Γ is subgroup of Diff 1+ɛ + (I) and N is a natural number such that every non-identity element of Γ has at most
More informationReview Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which
Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)
More informationAlgebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
More informationInner Product Spaces
Inner Product Spaces Introduction Recall in the lecture on vector spaces that geometric vectors (i.e. vectors in two and three-dimensional Cartesian space have the properties of addition, subtraction,
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More information5. Some theorems on continuous functions
5. Some theorems on continuous functions The results of section 3 were largely concerned with continuity of functions at a single point (usually called x 0 ). In this section, we present some consequences
More informationSOLUTIONS FOR 2012 APMO PROBLEMS
Problem. SOLUTIONS FOR 0 APMO PROBLEMS Solution: Let us denote by XY Z the area of the triangle XY Z. Let x = P AB, y = P BC and z = P CA. From y : z = BCP : ACP = BF : AF = BP F : AP F = x : follows that
More informationBaltic Way 2008 Gdańsk, November 8, 2008
Baltic Way 008 Gdańsk, November 8, 008 Problems and solutions Problem 1. Determine all polynomials p(x) with real coefficients such that p((x + 1) ) = (p(x) + 1) and p(0) = 0. Answer: p(x) = x. Solution:
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationThus f is continuous at x 0. Matthew Straughn Math 402 Homework 6
Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some
More informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More information1.1 Szemerédi s Regularity Lemma
8 - Szemerédi s Regularity Lemma Jacques Verstraëte jacques@ucsd.edu 1 Introduction Szemerédi s Regularity Lemma [18] tells us that every graph can be partitioned into a constant number of sets of vertices
More informationMath Linear Algebra II. 1. Inner Products and Norms
Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationRoth s Theorem on Arithmetic Progressions
September 25, 2014 The Theorema of Szemerédi and Roth For Λ N the (upper asymptotic) density of Λ is the number σ(λ) := lim sup N Λ [1, N] N [0, 1] The Theorema of Szemerédi and Roth For Λ N the (upper
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 informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationArithmetic progressions and the primes
Collect. Math. (2006), 37 88 Proceedings of the 7th International Conference on Harmonic Analysis and Partial Differential Equations El Escorial, Madrid (Spain), June 21-25, 2004 c 2006 Universitat de
More informationFINITE FOURIER ANALYSIS. 1. The group Z N
FIITE FOURIER AALYSIS EIL LYALL 1. The group Z Let be a positive integer. A complex number z is an th root of unity if z = 1. It is then easy to verify that the set of th roots of unity is precisely {
More informationArithmetic progressions in sumsets
ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains
More information9 Brownian Motion: Construction
9 Brownian Motion: Construction 9.1 Definition and Heuristics The central limit theorem states that the standard Gaussian distribution arises as the weak limit of the rescaled partial sums S n / p n of
More informationA proof of Freiman s Theorem, continued. An analogue of Freiman s Theorem in a bounded torsion group
A proof of Freiman s Theorem, continued Brad Hannigan-Daley University of Waterloo Freiman s Theorem Recall that a d-dimensional generalized arithmetic progression (GAP) in an abelian group G is a subset
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 informationHence, (f(x) f(x 0 )) 2 + (g(x) g(x 0 )) 2 < ɛ
Matthew Straughn Math 402 Homework 5 Homework 5 (p. 429) 13.3.5, 13.3.6 (p. 432) 13.4.1, 13.4.2, 13.4.7*, 13.4.9 (p. 448-449) 14.2.1, 14.2.2 Exercise 13.3.5. Let (X, d X ) be a metric space, and let f
More informationThe dichotomy between structure and randomness, arithmetic progressions, and the primes
The dichotomy between structure and randomness, arithmetic progressions, and the primes Terence Tao Abstract. A famous theorem of Szemerédi asserts that all subsets of the integers with positive upper
More informationShort Kloosterman Sums for Polynomials over Finite Fields
Short Kloosterman Sums for Polynomials over Finite Fields William D Banks Department of Mathematics, University of Missouri Columbia, MO 65211 USA bbanks@mathmissouriedu Asma Harcharras Department of Mathematics,
More informationDetermining elements of minimal index in an infinite family of totally real bicyclic biquadratic number fields
Determining elements of minimal index in an infinite family of totally real bicyclic biquadratic number fields István Gaál, University of Debrecen, Mathematical Institute H 4010 Debrecen Pf.12., Hungary
More informationConvergence of a Generalized Midpoint Iteration
J. Able, D. Bradley, A.S. Moon under the supervision of Dr. Xingping Sun REU Final Presentation July 31st, 2014 Preliminary Words O Rourke s conjecture We begin with a motivating question concerning the
More informationSubset sums modulo a prime
ACTA ARITHMETICA 131.4 (2008) Subset sums modulo a prime by Hoi H. Nguyen, Endre Szemerédi and Van H. Vu (Piscataway, NJ) 1. Introduction. Let G be an additive group and A be a subset of G. We denote by
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
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 informationUNIONS OF LINES IN F n
UNIONS OF LINES IN F n RICHARD OBERLIN Abstract. We show that if a collection of lines in a vector space over a finite field has dimension at least 2(d 1)+β, then its union has dimension at least d + β.
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 information4.4 Noetherian Rings
4.4 Noetherian Rings Recall that a ring A is Noetherian if it satisfies the following three equivalent conditions: (1) Every nonempty set of ideals of A has a maximal element (the maximal condition); (2)
More informationSolutions to Homework Set 1
Solutions to Homework Set 1 1. Prove that not-q not-p implies P Q. In class we proved that A B implies not-b not-a Replacing the statement A by the statement not-q and the statement B by the statement
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationIntroduction to Proofs
Real Analysis Preview May 2014 Properties of R n Recall Oftentimes in multivariable calculus, we looked at properties of vectors in R n. If we were given vectors x =< x 1, x 2,, x n > and y =< y1, y 2,,
More informationWriting proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases
Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases September 22, 2018 Recall from last week that the purpose of a proof
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationWhen are Sums Closed?
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Fall 2018 Winter 2019 Topic 20: When are Sums Closed? 20.1 Is a sum of closed sets closed? Example 0.2.2
More informationCHARACTER-FREE APPROACH TO PROGRESSION-FREE SETS
CHARACTR-FR APPROACH TO PROGRSSION-FR STS VSVOLOD F. LV Abstract. We present an elementary combinatorial argument showing that the density of a progression-free set in a finite r-dimensional vector space
More information