MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform


 Noah Gilbert
 5 years ago
 Views:
Transcription
1 MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish to study functions defined on a discrete set of points. This is of course how engineers actually use Fourier analysis. We begin with the discrete set (group) Z of all integers. This is certainly a group with respect to the binary operation of +. What should be the definition of the Fourier transform f of a function f on this set? To begin with, what should the domain of the function f be? By analogy with what we did earlier, let us determine the set of homomorphisms of the group Z into the circle group T. Remember, this is the way we decided what the domain of the Fourier transform on the real line should be. THEOREM Let φ be a function on Z that maps into the circle group T and satisfies the law of exponents φ(k + l) = φ(k)φ(l). (φ is a homomorphism of the additive group Z into the multiplicative group T.) Then there exists a unique element x [, 1) such that φ(k) = e 2πikx for all integers k. PROOF. Notice first that φ() = φ( + ) = φ()φ() = φ() 2, so that φ() must be equal to 1. (Why couldn t φ() be?) Now let λ be the element of T for which λ = φ(1), and let x be the unique point in the interval [, 1) such that λ = e 2πix. (Why is there only one such number x?) We have then that φ(1) = λ = e 2πix. Then, φ(2) = φ(1 + 1) = φ(1) φ(1) = λ 2 = e 2πi2x, φ(3) = λ 3 = e 2πi3x, φ(4) = λ 4 = e 2πi4x,.... That is, for any k, we must have φ(k) = λ k = e 2πikx. Now, for k <, we know that 1 = φ() = φ(k k) = φ(k)φ( k) = λ k φ( k), showing that φ( k) = 1 λ k = λ k = e 2πi( k)x. This proves the theorem. The preceding theorem shows that the set of homomorphisms of the group Z into the circle BbbT are parameterized by the numbers x in the interval [, 1). That is, for each element x [, 1), there is a homomorphism φ x of Z into T defined by φ x (k) = e 2πikx, and these are all the homomorphisms of Z into T. In other words, the set of homomorphisms of the group Z into the group T is parameterized by the points in the interval [, 1). So, following our earlier development, we should define the Fourier transform of a function f on Z to be the function f on [, 1) given by f(x) = f(k)φ x (k) = 1 f(k)e kx.
2 2 REMARK. Notice that, just as in the case of the real line, we are only able to define the Fourier transform of a function f on Z if it is absolutely summable. that is, only if f(k) <. EXERCISE (a) Let f be the function on Z given by f(k) = unless k = ±1, and f(1) = f( 1) = 1. What is the Fourier transform of f? (b) Fix a positive integer N, and let f be the function on Z given by f(k) = 1 if N k N and otherwise. Find the Fourier transform of f. What should Fourier s Theorem be in this case? that is, how can we recover the function f on Z from the function f on [, 1). Before giving the answer, we make the following observations: EXERCISE Let f be an absolutely summable function on the group Z of integers, and write f for the function on [, 1) defined by f(x) = f(k)e kx. (a) Use the Weierstrass MTest to show that f is a continuous function on [, 1). The Weierstrass MTest says the following: Suppose {u k } is an infinite sequence of continuous functions, and suppose that {m k } is a corresponding sequence of nonnegative numbers for which u k (x) m k for all x, and for which the infinite series m k converges. Then the infinite series u k (x) converges to a continuous function. (b) Conclude that f is a squareintegrable function on [, 1). Here is Fourier s Theorem in this context: THEOREM Let f be an absolutely summable function on Z. Then, for each integer n, we have f(n) = PROOF. 1 f(x)e 2πinx dx = which proves the theorem. = = = 1 1 f(x)e 2πinx dx. 1 f(k) f(k)δ n,k = f(n), f(k)e kx e 2πinx dx f(k)e 2πi(n k)x dx 1 e 2πi(n k)x dx REMARK. This whole thing looks awfully familiar. It surely must be related to the Fourier transform on the circle. Indeed, is this just the inverse of that transform?
3 EXERCISE (a) If f is a squareintegrable function on [, 1), what is the formula for its Fourier transform, and what is the formula for the inverse transform? (b) If g is a function on Z, what is the formula for its Fourier transform, and what is the formula for the inverse transform? (c) Exactly how are parts (a) and (b) related? Of course, we could now try to do all the same kinds of things we did with the other Fourier transforms. It may be a little less interesting this time, primarily because functions on the discrete set Z are not continuous, and they don t have derivatives. The kinds of problems one encounters with these functions are not differential equations. Perhaps we could work on difference equations. One thing that can be defined in this case is convolution. DEFINITION. Let f and g be two absolutely summable functions on Z. Define the convolution f g of f and g to be the function on Z given by f g(n) = f(n k)g(k). 3 EXERCISE (a) Show that, if f and g are absolutely summable, then so is f g. (b) Prove the convolution theorem in this case: f g(x) = f(x)ĝ(x). (c) Show that, in this case, there is an identity for convolution. That is, there is a function e on Z for which f = f e for every f. (d) Show that f g(n) = f(k)g(l). k,l:k+l=n The Finite Fourier Transform Fix a positive integer N, and let G be the finite set, 1, 2,..., N 1. The set G is a group (actually a ring), where addition and multiplication are computed mod N. It is frequently denoted by Z N. EXERCISE Let N = 64. (a) Compute in this group Z 64. (b) Compute in this ring. We wish to define a Fourier transform on this group. We follow our standard procedure. THEOREM Let φ be a function on G = Z N that maps into the circle group T and satisfies the law of exponents φ(k + l) = φ(k)φ(l). (φ is a homomorphism of the additive group Z N into the multiplicative group T.) Then there exists a unique integer j N 1 such that φ(k) = e 2πi jk N
4 4 for all k G. That is, these homomorphisms are parameterized by the numbers j =, 1, 2,..., N 1. PROOF. Notice first that φ() = φ( + ) = φ() 2, so that φ() must be equal to 1. Now, let z = φ(1). Then, φ(2) = φ(1 + 1) = φ(1) φ(1) = z 2, φ(3) = z 3, φ(4) = z 4,.... That is, for any k N 1 < we must have φ(k) = z k. Now, because N is the same as in the group G, we must have that z N = φ(n) = φ() = 1. That is, z N must equal 1. Write z = e 2πix for some x [, 1). We must have that e 2πiNx = (e 2πix ) N = φ(1) N = φ(n) = 1, implying that xn is equal to some integer j between and N 1. (Why?) Hence, x = j/n, and φ(k) = z k = e 2πixk for all k G, as desired. EXERCISE For each integer j N 1, define a function φ j on G = Z N by φ j (k) = e 2πi jk N. Prove that φ j is a homomorphism of the group G into the circle group T, and use Theorem 11.3 to conclude that these are all such homomorphisms of G. Now we proceed just as we did in the case of Z. Having determined the set of homomorphisms of our group into the circle group T, and having seen that they are parameterized by the numbers j N 1, we define the Fourier transform of a function on Z N. This is a finite set, so we won t need any kind of absolute summability assumption. We can define the Fourier transform for any function on this group. DEFINITION. Let V be the set (vector space) of all complexvalued functions defined on the set G = Z N. If f is an element of the vector space V, we define the finite Fourier transform f of f to be the function, also defined on the set, 1, 2,..., N 1, by f(j) = = k= k= f(k)φ j (k) f(k)e jk N. EXERCISE (a) Let f be define on G by f(k) = 1/2 k. Find the finite Fourier transform f of f. Is this anything like the Fourier transform of the function 1/2 x on the circle? (b) Suppose N > 8, and let f(k) = 1 for k 7, and f(k) = otherwise. Find f.
5 5 EXERCISE For f and g in V, define f g = k= f(k)g(k). (a) Prove that V is a complex inner product space with respect to the above definition. That is, show that (1) c 1 f 1 + c 2 f 2 g = c 1 f 1 g + c 2 f 2 g for all elements f, g V and all complex numbers c 1 and c 2. (2) f g = g f for all f, g V. (3) f f for all f V, and f f = if and only if f is the element of V. (b) Let f, f 1,..., f be the functions in V defined as follows: f n (k) = δ n,k. That is, f n is the function that equals 1 on the integer n and equals on all other integers k. Prove that the collection f,..., f is an orthonormal set in V. That is, show that f n f k = δ n,k. (c) Prove that the functions f,..., f is a basis for the vector space V. That is, show that each f V can be written in a unique way as a linear combination of the vectors (functions) f n. Conclude then that f,..., f is an orthonormal basis for V. (d) If T is a linear transformation of V into itself, recall from Linear Algebra that the entries of the matrix A that represents the transformation T with respect to this orthonormal basis are given by A j,k = T (f k ) f j, where both k and j run from to N 1. THEOREM The Fourier transform on V is a linear transformation from the Ndimensional vector space V into itself. If f,..., f is the orthonormal basis of the preceding exercise, then the entries of the matrix A that represents the Fourier transform with respect to this basis are given by j and k both running from to N 1. A j,k = e jk N, EXERCISE (a) Use Exercise 11.8 to prove this theorem. Of course, you will need to compute the Fourier transforms of the functions f,..., f. (b) Suppose f is a function (thought of as a column vector) in the vector space V. Verify that the jth component of the column vector A f is given by the formula (A f) j = f(j). Here is Fourier s Theorem in this case. It should be easier than the other cases, for this time the Fourier transform is a linear transformation of a finite dimensional vector space into itself. If it is 11, there should be an inverse given by the inverse of the matrix A.
6 6 THEOREM The finite Fourier transform on V is invertible, and in fact we can recover f from f as follows: f(k) j= f(j)e 2πi jk N. PROOF. Let B be the N N matrix whose entries are given by B l,m e2πi lm N. We claim that B is the inverse of the matrix A that represents the finite Fourier transform on V. Thus let us show that BA is the identity matrix. If j = k, then (AB) j,j = A j,m B m,j e jm N e 2πi jm N = 1. Therefore, down the diagonal of AB we have 1 s. Now, if j k, we have (AB) j,k = 1 A j,m B m,k e jm N = 1 (e N =, m(k j) 2πi e N k j 2πi N ) m (k j)n 2πi 1 e N k j 1 e2πi N e 2πi mk N where we have used the formula for the sum of a geometric series at the end of this calculation. Hence, AB has s off the diagonal, and so AB is the identity matrix, and B is A 1.
7 7 Therefore, f = B(A(f), or as claimed. f(k) = (B A f) k j= j= e 2πi jk N (A f)j e 2πi jk N f(j), EXERCISE Let f be a function in V. (a) Suppose N is even, say N = 2M. Show that where and for 1 j M, and f(k) = a + M (a j cos(2π jk N ) + b j sin(2π jk N )), j=1 a = 1 2M ( f() f(m)), a j = 1 2M ( f(j) + f(n j)) b j = i 2M ( f(j) f(n j))). (b) Deduce that, from the point of view of frequency analysis, the highest frequencies present in a signal (function) f on a finite set of N = 2M elements is M 1. Just as in the other cases we have studied, there is a notion of convolution on the space V. DEFINITION. If f and g are functions in V, define a function f g on G by f g(k) = f(l)g(k l). THEOREM Let f and g be elements of V. Then f g(j) = f(j)ĝ(j) for all j N 1. EXERCISE Prove the preceding theorem The Fast Fourier Transform
8 8 Computer designers tell us that all a computer really does is binary additions. Multiplications are just enormous addition calculations. Therefore, when estimating the cost of any computer computation, the designers count the number of multiplications and ignore any simple additions. If f is an element of V, how many multiplications must be carried out to compute the finite Fourier transform f, i.e., f(j) for all j N 1? The formula for f(j) is f(j) = k= f(k)e jk N. So, for each j, we must compute N products. Hence, to compute the entire transform f it appears that we must compute N N = N 2 products. Remarkably, and marvelously, this number N 2 multiplications can be reduced to N log N multiplications if we choose N to be a power of 2. (Here, the logarithm is meant to be taken with respect to the base 2.) This reduction is enormous if N is large. For example if N = 124 = 2 1, then N 2 is on the order of 1 6, a million, while N log N is on the order of 1 4. THEOREM Suppose N = 2 p. Then the finite Fourier transform of any element f in V can be computed using at most N log N = p2 p multiplications. PROOF. We must compute all products of the form jk f(k)e 2 p for both j and k ranging from to 2 p 1. The trick is that some of these products are automatically equal to others, so that a single multiplication can suffice to compute two different products, thereby cutting our work roughly in half. Let s explore this more carefully. Note the following two things: 1. If k is an even integer, say k = 2l, then e (j+2p 1 )k 2 p = e (jk+2p l 2 p jk = e 2 p, so that jk f(k)e 2 p = f(k)e (j+2p 1 )k 2 p, jk and therefore, for even numbers k, we need only compute the product f(k)e 2 p for j 2 p 1 1, i.e., for approximately half the j s. Each of the remaining products equals one of these. Next, if k is odd, say k = 2l + 1, then e (j+2p 1 )k 2 p jk = e 2 p e 2p 1 (2l+1) 2 p jk = e 2 p e πi jk = e 2 p, so that, if k = 2l + 1 is an odd number, again we need only compute the product jk f(k)e 2 p for j 2 p 1 1. The remaining half of the products are just the negatives of these, and the computer guys tell us that it costs nothing to change the sign of a number.
9 Moreover, for even numbers k = 2l, the sums of products we must compute to find the finite Fourier transform of f are of the form 2 p p 1 2lj 1 f(2l)e 2 p = f(2l)e jl 2 p 1, so that if a function g is defined on the set, 1,..., 2 p 1 1 by g(l) = f(2l), then computing the part of f having to do with even numbers k = 2l is exactly the same as if we were computing the discrete Fourier transform on the set, 1, 2,..., 2 p 1 1 of g. (You can probably see a mathematical induction argument coming up here.) In the case when k is odd, the sums of products we must compute look like 2 p p 1 j(2l+1) 1 f(2l + 1)e 2 p = f(2l + 1)e 2 p 1 1 = ( f(2l + 1)e jl 2 p 1 e j 2 p jl 2 p 1 )e j 2 p, and, unlike the case when k was even, this is a bit more complicated than just computing the discrete Fourier transform of a function on the set, 1,..., 2 p 1 1. We again could let h be the function on the set, 1, 2,..., 2 p 1 1 defined by h(l) = f(2l+1). What we are doing first is computing the discrete Fourier transform of the function h, and then we are multiplying each value ĥ(j) by the number e j 2 p, which would be an additional 2 p 1 multiplications. Finally, let M p be the number of multiplications required to compute the discrete Fourier transform when N = 2 p. The theorem asserts that M p p2 p. We have seen above that M p = M p 1 + M p p 1. So, by mathematical induction, if we assume that M p 1 2 p 1 (p 1), then as desired. M p m p 1 + m p p 1 (p 1)2 p 1 + (p 1)2 p p 1 = (2p 2 + 1)2 p 1 < 2p2 p 1 = p2 p, 9
3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus ndimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationMath 4310 Handout  Quotient Vector Spaces
Math 4310 Handout  Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationStudent Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)
NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationv w is orthogonal to both v and w. the three vectors v, w and v w form a righthanded set of vectors.
3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationSolution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationThe Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
More information5.1 Radical Notation and Rational Exponents
Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationVieta s Formulas and the Identity Theorem
Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More information1 Inner Products and Norms on Real Vector Spaces
Math 373: Principles Techniques of Applied Mathematics Spring 29 The 2 Inner Product 1 Inner Products Norms on Real Vector Spaces Recall that an inner product on a real vector space V is a function from
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationMath 115 Spring 2011 Written Homework 5 Solutions
. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence
More informationWavelet analysis. Wavelet requirements. Example signals. Stationary signal 2 Hz + 10 Hz + 20Hz. Zero mean, oscillatory (wave) Fast decay (let)
Wavelet analysis In the case of Fourier series, the orthonormal basis is generated by integral dilation of a single function e jx Every 2πperiodic squareintegrable function is generated by a superposition
More informationCOMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012
Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More information12. Inner Product Spaces
1. Inner roduct Spaces 1.1. Vector spaces A real vector space is a set of objects that you can do to things ith: you can add to of them together to get another such object, and you can multiply one of
More informationThis unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.
Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationDERIVATIVES AS MATRICES; CHAIN RULE
DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Realvalued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationLecture 13  Basic Number Theory.
Lecture 13  Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are nonnegative integers. We say that A divides B, denoted
More information1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal:
Exercises 1  number representations Questions 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: (a) 3012 (b)  435 2. For each of
More informationCONTENTS 1. Peter Kahn. Spring 2007
CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationMatrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a nonempty
More information3 Some Integer Functions
3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple
More informationAnswer Key for California State Standards: Algebra I
Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationFull and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More informationDIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents
DIFFERENTIABILITY OF COMPLEX FUNCTIONS Contents 1. Limit definition of a derivative 1 2. Holomorphic functions, the CauchyRiemann equations 3 3. Differentiability of real functions 5 4. A sufficient condition
More information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving NonConditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More informationLecture 1: Schur s Unitary Triangularization Theorem
Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections
More informationWe can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b
In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should
More informationHomework # 3 Solutions
Homework # 3 Solutions February, 200 Solution (2.3.5). Noting that and ( + 3 x) x 8 = + 3 x) by Equation (2.3.) x 8 x 8 = + 3 8 by Equations (2.3.7) and (2.3.0) =3 x 8 6x2 + x 3 ) = 2 + 6x 2 + x 3 x 8
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More informationChapter 31 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M.
31 Geometric Series Motivation (I hope) Geometric series are a basic artifact of algebra that everyone should know. 1 I am teaching them here because they come up remarkably often with Markov chains. The
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More information[1] Diagonal factorization
8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More information5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1
MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More informationGRE Prep: Precalculus
GRE Prep: Precalculus Franklin H.J. Kenter 1 Introduction These are the notes for the Precalculus section for the GRE Prep session held at UCSD in August 2011. These notes are in no way intended to teach
More informationSECTION 102 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationThe Method of Partial Fractions Math 121 Calculus II Spring 2015
Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationWHERE DOES THE 10% CONDITION COME FROM?
1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay
More information0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup
456 BRUCE K. DRIVER 24. Hölder Spaces Notation 24.1. Let Ω be an open subset of R d,bc(ω) and BC( Ω) be the bounded continuous functions on Ω and Ω respectively. By identifying f BC( Ω) with f Ω BC(Ω),
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationSequences and Series
Sequences and Series Consider the following sum: 2 + 4 + 8 + 6 + + 2 i + The dots at the end indicate that the sum goes on forever. Does this make sense? Can we assign a numerical value to an infinite
More informationChapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twentyfold way
Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or pingpong balls)
More information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each xcoordinate was matched with only one ycoordinate. We spent most
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationLecture 7: Continuous Random Variables
Lecture 7: Continuous Random Variables 21 September 2005 1 Our First Continuous Random Variable The back of the lecture hall is roughly 10 meters across. Suppose it were exactly 10 meters, and consider
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationMathematical Induction. Mary Barnes Sue Gordon
Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationSection 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationRepresentation of functions as power series
Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions
More informationMATH PROBLEMS, WITH SOLUTIONS
MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These
More informationMath 231b Lecture 35. G. Quick
Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the Jhomomorphism could be defined by
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More information