ROTH S THEOREM THE FOURIER ANALYTIC APPROACH NEIL LYALL
|
|
- Shon Hubbard
- 5 years ago
- Views:
Transcription
1 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 progression of length three.. Embedding the problem in Z and the Fourier transform If, y, z are natural numbers and + y = 2z then they form an arithmetic progression of length three, which we ll call briefly a 3-progression. Instead of counting these directly we shall instead first count the number of triples, y, z chosen from the set A which satisfy the same equation in Z, that is modulo. Although in doing this we lose some information about the arithmetic progessions in A, the up side is that we have now embedded the problem in a group on which we can do Fourier analysis. Recall that the (discrete) Fourier transform ˆf, of a function f : Z C is defined by () ˆf(k) = =0 f()e 2πi k. It is clear from the definition that ˆf(0) = f() and that for any k the Fourier coefficients satisfy the inequality (2) ˆf(k) f(). Using this and the fact that the Fourier transform of y f(y)g(y ) is ˆf(k)ĝ(k) we see that (3) ˆf(k) ĝ(k) f(y)g(y ). y This inequality will be of crucial importance to us, it allows us to conclude that if two functions f and g have at least one large Fourier coefficient in common, by which we mean they have size proportional to, then f must have a large inner product with at least one translate of g. We shall also make use of Plancherel s identity (4) f() 2 = ˆf(k) 2, which is, at least in this setting, an immediate consequence of the orthogonality relation { (5) e 2πi k 0 mod = 0 otherwise. k
2 2 EIL LYALL 2. Outline of the Proof We begin with A {0,,..., } with A = δ. We will take the liberty of assuming that is odd, if is even we can always consider A instead as a subset of {0,,..., }, this has the effect of only changing the density very slightly. Our stratagy could be roughly summarized as follows; (i) If A is suitably random, then we shall be able to conclude that A contains many arithmetic progressions of length three. (ii) If A is not suitably random, then we shall show that there eists a long arithmetic progression P such that A has increased density on P, that is for some ε > 0 that depends only on δ. A P (δ + ε ) P, So if A is not suitably random then we turn our attention to a subset A A (namely A P ) which has higher density in some sub-progression of the integers. We must then determine if A is suitably random or not, we iterate this argument until the theorem is proven. We shall show that if A contains no 3-progressions then there must be a progression on which a subset of A has density greater than one, which is absurd. For this argument to work, we must count the number of necessary iterations to reach this density and ensure that we have not eliminated too many elements in the process (in order to arrive at our contradiction we must ensure that our final progression is non-empty). 3. A suitable notion of randomness With the aid of the Fourier transform we can now count the number of solutions to the congruence + y 2z mod, with, y, z A. Let 0 denote the number of triples solving the above congruence, then by the orthogonality relation (5) and the definition of the Fourier transform one has 0 = A y A z A e 2πi (+y 2z)k = A (k) 2 A ( 2k), where A () denotes the characteristic function of the set A. Using the fact that A (0) = A = δ we see that 0 = δ k= A (k) 2 A ( 2k). The leading term δ 3 2 above is instructive as it is the number of solutions of the congruence if the set A were random, obtained by selecting each natural number from to independently with probability δ. Indeed after choosing say and z arbitrarily from the set A, which can be done δ 2 2 ways, the probability that y 2z mod is in A is equal to δ. Thus if A is very uniformly distributed among the numbers {0,,..., } then we epect it to contain a lot of 3-progressions mod. The new density δ satisfies ( )δ < δ < δ.
3 ROTH S THEOREM 3 otice that if A (k) ε for all k 0, then it would follow from Plancherel s identity that A (k) 2 A ( 2k) ma k= and hence that A ( 2k) k 0 (6) 0 δ 3 2 εδ 2. A (k) 2 ε 2 =0 A () 2 = εδ 3, We therefore see that the parameter ε that we introduced is, in the particular sense above, measuring how close A is to being random. With this in mind we make the following definition. Definition. We say that A is ε-uniform (or suitably random) if for all k =,...,. A (k) ε, 4. Sets which are suitably random It is clear from the discussion above, in particular inequality (6), that if ε < δ 2 /2 and A is ε- uniform, then 0 δ 3 2 /2, that is A contains at least δ 3 2 /2 3-progressions mod (including the trivial ones). We must however distinguish between arithmetic progressions mod (which we shall refer to as Z -progressions) and genuine arithmetic progressions (which we shall refer to as Z-progressions). Let denote the number of solutions in A of the equation + y = 2z, that is the number of Z-progressions of length three that are contained in A. The key observation is that if, z M A = A [/3, 2/3), then any Z -progression will also be a Z-progression. Using this fact and a slight modification of the argument above gives the following. Lemma. If A is ε-uniform with ε < δ2 8 and M A δ 4, then δ Proof. As before we can write MA (k) A (k) MA ( 2k) = δ M A 2 + It follows from the Cauchy-Schwarz inequality and Plancherel s identity that k= MA (k) A (k) MA ( 2k). MA (k) A (k) MA ( 2k) ma A (k) MA (k) MA ( 2k) k 0 k= ( ε MA (k) 2) /2( MA ( 2k) 2) /2 = ε k k MA (k) 2 k = ε 2 MA () ε 2 M A. It now follows that if we take ε < δ 2 /8, then 2 δ M A 2 δ 3 2 /32.
4 4 EIL LYALL So far we have not ecluded the trivial 3-progressions = y = z, fortunately there are only A = δ of them. It is then easy to check that Lemma guarantees the eistence of a non-trivial 3-progression as long as one insists that 8 δ 2. Let us summarize what we have shown so far. Proposition. Let A {0,,..., } with A = δ. If A contains no non-trivial Z- progressions of length three, then one of the following must hold. (i) 8δ 2 (ii) There eists a Z-progression P of length P /3 such that (iii) A is not ε-uniform for any ε δ 2 /8 A P (δ + δ/8) P Proof. Parts (i) and (iii) follow from Lemma and the discussion above. Possiblity (ii) is simply the observation that if M A < δ 4 then ma{ A [0, /3), A [2/3, ) } 3δ/8 = 9δ/8 (/3). 5. Sets which are not suitably random ow we arrive at the heart of the proof, where we show that a set A which is not ε-uniform necessarily has increased density on an arithmetic progression of large size. We say that a Z -progression P is non-overlapping if its length L and common difference d satisfy dl <, the point of such a definition being that a non-overlapping Z -progression is a union of two Z-progressions. Lemma 2. Suppose that B is a non-overlapping Z -progression on which A has density δ + ε. Then there is a Z-progression P of length at least 2 ε B on which A has density at least δ + 2 ε. Proof. Write B = P P 2, with P P 2. If P 2 ε B, then A P 2 (δ + ε ) B P (δ + 2 ε ) B (δ + 2 ε ) P 2, while if this is not the case then both P and P 2 must have length at least 2 ε B and consequently A must have density at least δ + ε on one of them. So we now know how to pass from non-overlapping Z -progressions to Z-progressions. Lemma 3. If A (r) ε for some r 0, then there eists a non-overlapping Z -progression B of length at least /4 such that A B (δ + 4 ε) B. For technical reasons it shall be convenient in the proof of Lemma 3 to consider functions of mean value zero. We define the balanced function of A to be { δ A f A () = A () δ = δ / A. We note that indeed f A (0) = f A() = 0 and that f A (k) = A (k) for all k 0.
5 ROTH S THEOREM 5 Proof of Lemma 3. The key observation here is that if we write B = B +, then A (B + ) (δ + 4 ε) B y f A (y) B (y ) 4 ε B. Therefore our aim is now to find a long arithmetic progression B whose Fourier transform at r is also large, since by (3) this would imply that A () has a large inner product with a translate of B (), which as we have just observed is eactly what we want. Step : For any r there eists a non-overlapping progression B of length at least /4 with the property that B (r) 2 B. Proof of Step : Fi r. If we partition [0, ] 2 into less than (say 2 ) equal squares it follows from the principle of the pigeons, by considering either of the collections of pairs {(0, 0), (, r),..., (, ( )r)} or {(, 0), ( 2, r),..., (0, ( )r)}, that there eist integers 0 l < k such that both k l and r(k l) mod. Let d = k l. Define B to be the following progression of length B = /π with common difference d; We then have {..., 2d, d, 0, d, 2d,...}. c B(r) B X X B()[e 2πi r ] l 2 B e 2πi < 2 B 2π B 2 ldr 2 B. Step 2: As advertised our Z -progression B will be a translate of the Z -progression B obtained in Step. We must therefore now show that there is indeed a value of for which f A (y) B (y ) 4 ε B. y P Proof of Step 2: Let G() = y fa(y)b(y ). It follows from Step, the assumption that A is not ε-uniform, and (3) that X G() b G(r) 2 ε B. Using the fact that G has mean value zero we the see that X and hence for some we must have { G() + G()} 2 ε B, G() + G() 2 ε B, which in turn implies that G() ε B as required. 4 Combining the two lemmata of this section we obtain Proposition 2. If A (r) ε for some r 0, then there eists a Z-progression P of length at least 32 ε such that A P (δ + 8ε) P.
6 6 EIL LYALL 6. Putting it all together and proving Roth s theorem Combining Propositions and 2 gives the following. Proposition 3. Let A {0,,..., } with A = δ and 8δ 2. Then either A contains a non-trivial Z-progression of length three, or there eists a Z-progression P of length P 256 δ2 such that A P (δ + 64 δ2 ) P. An easy iteration argument now concludes the proof of Roth s theorem - with constant C < 00. Proof of Roth s Theorem. We assume that A contains no non-trivial 3-progressions. This will, for large enough, lead us to a contradiction. Denote by P the Z-progression guaranteed to us by Proposition 3. We now identify P {0,,... } and A A P - by simply enumerating the elements of P in increasing order. We know, by assumption, that A contains no (non-trivial) 3-progression. In addition we know that A = δ, where 256 δ2 and δ (δ + 64 δ2 ). We now iterate this argument. In doing so k = 64 δ times we arrive at a set A k {0,,..., k } with density δ k δ + δ = 2δ since the density at each step is increasing by at least δ2 64. After another 64 2δ steps the density is increasing from 2δ to 4δ,... A density of at least 2 l δ is reached in no more than 64 δ ( ) steps and 2 l consequently a density eceeding one (in fact it grows to infinity) in no more than 28 δ steps. It is of course impossible for any subset of A to have density greater than one in a non-empty Z-progression. We now calculate what bound must be imposed on in order to guarantee that after this number of steps we have not eliminated all of our elements. At each step of the iteration the size of the subprogression chosen is about the square root of the progression of the previous step. After the first step the size of the progression is at least 256 δ2. After k steps we are reduced to a progression of length at least δ 4 /2k. It therefore remain to show that if k = 28 /2k δ, then 2 6 δ 4. Taking logs we see that this inequality is equivalent to insisting that It is then an easy eercise to see that log [6 log log δ ]2 28δ. 6 log log δ 2 4δ, and hence that in order to arrive at a contradiction (a non-empty Z-progression on which a subset of A has density greater than one) it is sufficient to have ep ep(32 log 2 δ ).
Roth 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 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 informationRotated Corners in the Integer Lattice
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
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 informationRoth s Theorem on Arithmetic Progressions
Roth s Theorem on Arithmetic Progressions Ernie Croot April 3, 004 1 Introduction Here we give a proof of the following classical theorem of K. F. Roth: Theorem 1 There exists a constant c > 0 so that
More information. In particular if a b then N(
Gaussian Integers II Let us summarise what we now about Gaussian integers so far: If a, b Z[ i], then N( ab) N( a) N( b). In particular if a b then N( a ) N( b). Let z Z[i]. If N( z ) is an integer prime,
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
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 informationQuadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin
Quadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin mcadam@math.utexas.edu Abstract: We offer a proof of quadratic reciprocity that arises
More informationNONABELIAN GROUPS WITH PERFECT ORDER SUBSETS
NONABELIAN GROUPS WITH PERFECT ORDER SUBSETS CARRIE E. FINCH AND LENNY JONES Abstract. Let G be a finite group and let x G. Define the order subset of G determined by x to be the set of all elements in
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationA remark on a conjecture of Chowla
J. Ramanujan Math. Soc. 33, No.2 (2018) 111 123 A remark on a conjecture of Chowla M. Ram Murty 1 and Akshaa Vatwani 2 1 Department of Mathematics, Queen s University, Kingston, Ontario K7L 3N6, Canada
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 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 informationRiemann sphere and rational maps
Chapter 3 Riemann sphere and rational maps 3.1 Riemann sphere It is sometimes convenient, and fruitful, to work with holomorphic (or in general continuous) functions on a compact space. However, we wish
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More information7: FOURIER SERIES STEVEN HEILMAN
7: FOURIER SERIES STEVE HEILMA Contents 1. Review 1 2. Introduction 1 3. Periodic Functions 2 4. Inner Products on Periodic Functions 3 5. Trigonometric Polynomials 5 6. Periodic Convolutions 7 7. Fourier
More informationThe Green-Tao Theorem on arithmetic progressions within the primes. Thomas Bloom
The Green-Tao Theorem on arithmetic progressions within the primes Thomas Bloom November 7, 2010 Contents 1 Introduction 6 1.1 Heuristics..................................... 7 1.2 Arithmetic Progressions.............................
More informationHilbert Spaces. Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space.
Hilbert Spaces Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space. Vector Space. Vector space, ν, over the field of complex numbers,
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 informationLet R be the line parameterized by x. Let f be a complex function on R that is integrable. The Fourier transform ˆf = F f is. e ikx f(x) dx. (1.
Chapter 1 Fourier transforms 1.1 Introduction Let R be the line parameterized by x. Let f be a complex function on R that is integrable. The Fourier transform ˆf = F f is ˆf(k) = e ikx f(x) dx. (1.1) It
More informationA LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES. 1. Introduction
A LOWER BOUND FOR THE SIZE OF A MINKOWSKI SUM OF DILATES Y. O. HAMIDOUNE AND J. RUÉ Abstract. Let A be a finite nonempty set of integers. An asymptotic estimate of several dilates sum size was obtained
More informationHartogs Theorem: separate analyticity implies joint Paul Garrett garrett/
(February 9, 25) Hartogs Theorem: separate analyticity implies joint Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ (The present proof of this old result roughly follows the proof
More informationIntroduction to Metalogic 1
Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationOn the counting function for the generalized Niven numbers
On the counting function for the generalized Niven numbers Ryan Daileda, Jessica Jou, Robert Lemke-Oliver, Elizabeth Rossolimo, Enrique Treviño Abstract Given an integer base q 2 and a completely q-additive
More informationTHESIS. Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University
The Hasse-Minkowski Theorem in Two and Three Variables THESIS Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University By
More informationOn some inequalities between prime numbers
On some inequalities between prime numbers Martin Maulhardt July 204 ABSTRACT. In 948 Erdős and Turán proved that in the set of prime numbers the inequality p n+2 p n+ < p n+ p n is satisfied infinitely
More informationVector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.
Vector Spaces Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms. For each two vectors a, b ν there exists a summation procedure: a +
More informationApplication 3.2 (Ruzsa). Let α R and A be a finite non-empty set in a commutative group. Suppose that A + A α A. Then for all positive integers h 2
Application 3.2 (Ruzsa). Let α R and A be a finite non-empty set in a commutative group. Suppose that A + A α A. Then for all positive integers h 2 Proof. ( ) α 4 + h 2 ha A α 2 A. h 1 Later on in the
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
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 informationEquidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationSection 7.2: One-to-One, Onto and Inverse Functions
Section 7.2: One-to-One, Onto and Inverse Functions In this section we shall developed the elementary notions of one-to-one, onto and inverse functions, similar to that developed in a basic algebra course.
More informationSUMS PROBLEM COMPETITION, 2000
SUMS ROBLEM COMETITION, 2000 SOLUTIONS 1 The result is well known, and called Morley s Theorem Many proofs are known See for example HSM Coxeter, Introduction to Geometry, page 23 2 If the number of vertices,
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 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 informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationGenerating p-extremal graphs
Generating p-extremal graphs Derrick Stolee Department of Mathematics Department of Computer Science University of Nebraska Lincoln s-dstolee1@math.unl.edu August 2, 2011 Abstract Let f(n, p be the maximum
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 informationFilters in Analysis and Topology
Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into
More informationMATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6
MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION Extra Reading Material for Level 4 and Level 6 Part A: Construction of Lebesgue Measure The first part the extra material consists of the construction
More informationProclaiming Dictators and Juntas or Testing Boolean Formulae
Proclaiming Dictators and Juntas or Testing Boolean Formulae Michal Parnas The Academic College of Tel-Aviv-Yaffo Tel-Aviv, ISRAEL michalp@mta.ac.il Dana Ron Department of EE Systems Tel-Aviv University
More informationTopics in Fourier analysis - Lecture 2.
Topics in Fourier analysis - Lecture 2. Akos Magyar 1 Infinite Fourier series. In this section we develop the basic theory of Fourier series of periodic functions of one variable, but only to the extent
More informationThe Lebesgue Integral
The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters
More informationOn Convergence of Sequences of Measurable Functions
On Convergence of Sequences of Measurable Functions Christos Papachristodoulos, Nikolaos Papanastassiou Abstract In order to study the three basic kinds of convergence (in measure, almost every where,
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 informationPoisson summation and the discrete Fourier transform John Kerl University of Arizona, Math 523B April 14, 2006
Poisson summation and the discrete Fourier transform John Kerl University of Arizona, Math 523B April 4, 2006 In Euclidean space, given a vector,... 2 ... we can put down a coordinate frame (say an orthonormal
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 informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date April 29, 23 2 Contents Motivation for the course 5 2 Euclidean n dimensional Space 7 2. Definition of n Dimensional Euclidean Space...........
More informationAn Exploration of the Arithmetic Derivative
An Eploration of the Arithmetic Derivative Alaina Sandhu Final Research Report: Summer 006 Under Supervision of: Dr. McCallum, Ben Levitt, Cameron McLeman 1 Introduction The arithmetic derivative is a
More informationSpanning and Independence Properties of Finite Frames
Chapter 1 Spanning and Independence Properties of Finite Frames Peter G. Casazza and Darrin Speegle Abstract The fundamental notion of frame theory is redundancy. It is this property which makes frames
More informationThe Advantage Testing Foundation Solutions
The Advantage Testing Foundation 2016 Problem 1 Let T be a triangle with side lengths 3, 4, and 5. If P is a point in or on T, what is the greatest possible sum of the distances from P to each of the three
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationThe Dirichlet s P rinciple. In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation:
Oct. 1 The Dirichlet s P rinciple In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation: 1. Dirichlet s Principle. u = in, u = g on. ( 1 ) If we multiply
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 informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More informationFourier Sin and Cos Series and Least Squares Convergence
Fourier and east Squares Convergence James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University May 7, 28 Outline et s look at the original Fourier sin
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 informationNOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES
NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES JONATHAN LUK These notes discuss theorems on the existence, uniqueness and extension of solutions for ODEs. None of these results are original. The proofs
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationarxiv: v1 [math.fa] 14 Jul 2018
Construction of Regular Non-Atomic arxiv:180705437v1 [mathfa] 14 Jul 2018 Strictly-Positive Measures in Second-Countable Locally Compact Non-Atomic Hausdorff Spaces Abstract Jason Bentley Department of
More informationbe a sequence of positive integers with a n+1 a n lim inf n > 2. [α a n] α a n
Rend. Lincei Mat. Appl. 8 (2007), 295 303 Number theory. A transcendence criterion for infinite products, by PIETRO CORVAJA and JAROSLAV HANČL, communicated on May 2007. ABSTRACT. We prove a transcendence
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 informationNATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA4247 Complex Analysis II Lecture Notes Part II
NATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA4247 Complex Analysis II Lecture Notes Part II Chapter 2 Further properties of analytic functions 21 Local/Global behavior of analytic functions;
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 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 information9 Sequences of Functions
9 Sequences of Functions 9.1 Pointwise convergence and uniform convergence Let D R d, and let f n : D R be functions (n N). We may think of the functions f 1, f 2, f 3,... as forming a sequence of functions.
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if
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 informationSCALE INVARIANT FOURIER RESTRICTION TO A HYPERBOLIC SURFACE
SCALE INVARIANT FOURIER RESTRICTION TO A HYPERBOLIC SURFACE BETSY STOVALL Abstract. This result sharpens the bilinear to linear deduction of Lee and Vargas for extension estimates on the hyperbolic paraboloid
More informationPerfect matchings in highly cyclically connected regular graphs
Perfect matchings in highly cyclically connected regular graphs arxiv:1709.08891v1 [math.co] 6 Sep 017 Robert Lukot ka Comenius University, Bratislava lukotka@dcs.fmph.uniba.sk Edita Rollová University
More informationHarmonic Analysis Homework 5
Harmonic Analysis Homework 5 Bruno Poggi Department of Mathematics, University of Minnesota November 4, 6 Notation Throughout, B, r is the ball of radius r with center in the understood metric space usually
More informationPrimes in arithmetic progressions
(September 26, 205) Primes in arithmetic progressions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/mfms/notes 205-6/06 Dirichlet.pdf].
More informationC 1 DENSITY OF AXIOM A FOR 1D DYNAMICS
C 1 DENSITY OF AXIOM A FOR 1D DYNAMICS DAVID DIICA Abstract. We outline a proof of the C 1 unimodal maps of the interval. density of Axiom A systems among the set of 1. Introduction The amazing theory
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationLecture 6 January 21, 2016
MATH 6/CME 37: Applied Fourier Analysis and Winter 06 Elements of Modern Signal Processing Lecture 6 January, 06 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long, Edited by E. Bates Outline Agenda: Fourier
More informationMeasures and Measure Spaces
Chapter 2 Measures and Measure Spaces In summarizing the flaws of the Riemann integral we can focus on two main points: 1) Many nice functions are not Riemann integrable. 2) The Riemann integral does not
More informationTHE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p. Mario Huicochea CINNMA, Querétaro, México
#A8 INTEGERS 15A (2015) THE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p Mario Huicochea CINNMA, Querétaro, México dym@cimat.mx Amanda Montejano UNAM Facultad de Ciencias
More informationTesting Problems with Sub-Learning Sample Complexity
Testing Problems with Sub-Learning Sample Complexity Michael Kearns AT&T Labs Research 180 Park Avenue Florham Park, NJ, 07932 mkearns@researchattcom Dana Ron Laboratory for Computer Science, MIT 545 Technology
More informationProof. We indicate by α, β (finite or not) the end-points of I and call
C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending
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 informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationStab(t) = {h G h t = t} = {h G h (g s) = g s} = {h G (g 1 hg) s = s} = g{k G k s = s} g 1 = g Stab(s)g 1.
1. Group Theory II In this section we consider groups operating on sets. This is not particularly new. For example, the permutation group S n acts on the subset N n = {1, 2,...,n} of N. Also the group
More informationThe Impossibility of Certain Types of Carmichael Numbers
The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the
More informationOn the counting function for the generalized. Niven numbers
On the counting function for the generalized Niven numbers R. C. Daileda, Jessica Jou, Robert Lemke-Oliver, Elizabeth Rossolimo, Enrique Treviño Introduction Let q 2 be a fied integer and let f be an arbitrary
More informationFRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES
FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most
More informationFirst-Return Integrals
First-Return ntegrals Marianna Csörnyei, Udayan B. Darji, Michael J. Evans, Paul D. Humke Abstract Properties of first-return integrals of real functions defined on the unit interval are explored. n particular,
More informationMATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST
MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More information14 Equivalence Relations
14 Equivalence Relations Tom Lewis Fall Term 2010 Tom Lewis () 14 Equivalence Relations Fall Term 2010 1 / 10 Outline 1 The definition 2 Congruence modulo n 3 Has-the-same-size-as 4 Equivalence classes
More informationThe natural numbers. Definition. Let X be any inductive set. We define the set of natural numbers as N = C(X).
The natural numbers As mentioned earlier in the course, the natural numbers can be constructed using the axioms of set theory. In this note we want to discuss the necessary details of this construction.
More informationMATH 1010E University Mathematics Lecture Notes (week 8) Martin Li
MATH 1010E University Mathematics Lecture Notes (week 8) Martin Li 1 L Hospital s Rule Another useful application of mean value theorems is L Hospital s Rule. It helps us to evaluate its of indeterminate
More informationNon-Extendible Latin Cuboids
Non-Extendible Latin Cuboids Darryn Bryant db@maths.uq.edu.au, Barbara Maenhaut bmm@maths.uq.edu.au Nicholas J. Cavenagh nicholas cavenagh@yahoo.co.uk Ian M. Wanless ian.wanless@monash.edu Kyle Pula jpula@math.du.edu
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationLECTURE 22: COUNTABLE AND UNCOUNTABLE SETS
LECTURE 22: COUNTABLE AND UNCOUNTABLE SETS 1. Introduction To end the course we will investigate various notions of size associated to subsets of R. The simplest example is that of cardinality - a very
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 information