Analysis Qualifying Exam January 21, 2016
|
|
- Laureen Jackson
- 7 years ago
- Views:
Transcription
1 Analysis Qualifying Exam January 21, 2016 INSTRUCTIONS Number all your pages and write only on one side of the paper. Anything written on the second side of a page will be ignored. Write your name at the top of each page. 1. Let f : R R satisfy f(x+y) = f(x)+f(y) for all x, y R and f(1) = 1. Prove: (a) f(x) = x for all rational numbers x. (b) Assume, in addition, that f is continuous at 0. f(x) = x for all x R. Prove that then 2. We say that a family of subsets of a metric space (X, d) is locally finite if for each p X there is an open set V such that p V and V only intersects a finite number of the sets F n. Prove: If {F n } is a locally finite family of closed sets, then F n is closed. n=1 3. Let X be the metric space consisting of all sequences a = (a 1, a 2,...) of real numbers such that n=1 a n <, with the distance function defined by d(a, b) = a n b n if a = (a 1, a 2,...), b = (b 1, b 2,...). n=1 (a) Prove B(0, 1) = {a = (a 1, a 2,...) : d(a, 0) 1} is not compact. (b) Let C = {a = (a 1, a 2,...) : a n 1/n 2 for n N}. compact. Prove C is 4. Let X be a metric space and let f n : X R for each n N. We say that the sequence {f n } is locally uniformly convergent if for every p X there exists an open set U in X such that p U and the sequence of restrictions {f nu } converges uniformly on U. Prove: If X is compact and the sequence {f n } converges locally uniformly, then it is uniformly convergent. 5. Let f : [ 1, 1] R be continuous and even (f( x) = f(x) for all x [ 1, 1]). Prove: For each ϵ > 0 there exists a polynomial p such that f(x) p(x 2 ) < ϵ for all x [ 1, 1]. 6. Prove or disprove: There exists a closed subset F of R such that F has positive measure and F Q =. 7. Evaluate, justifying all steps: 0 n sin x n x(1 + x 2 ) dx. Hint: You may use that sin x/x 1 for all x (0, ).
2 Analysis Qualifying Exam August 28, 2015 INSTRUCTIONS Read the instructions. Number all your pages and write only on one side of the paper. Anything written on the second side of a page will be ignored. Write your name at the top of each page. Clearly indicate which problem you are solving, keep solutions to different problems separate. 1. Let u n 0 for all n N. Prove: If converges. u n converges, then n=1 n=1 un n also 2. Prove there exists a unique differentiable function Φ : R R such that Φ (x) = e x2 for all x R and Φ(0) = Let X be a metric space, let C X have the property that if x, y C, there exists a connected subset A of C such that x, y A. Prove: C is connected. 4. Let E be an equicontinuous and bounded set of functions from [0, 1] to R. Prove: If {f n } is a sequence in E that converges for each rational x [0, 1], then {f n } converges uniformly. 5. Let f : R R be Lebesgue integrable. Prove that f(x) cos nx dx = 0. R 6. Assume f : R R is continuous. Prove: The inverse image under f of a Borel set is a Borel set. 7. Prove that the following it exists: Be sure to justify all steps. Hint: Change variables by t = nx. 0 cos x nx 2 + 1/n dx.
3 Analysis Qualifying Examination Spring 2015 Your Name: Your Z-Number: In some cases partial credit may be given, but you should endeavor to fully complete as many problems as possible. 1. Let {a n } be a sequence of real numbers that converges to a. Show that 2. Consider the series a 1 + a a n n n=1 x (1 + x) n. Show that the series converges for all x 0 and that it converges uniformly on the interval [r, ) for every r>0. Does the series converge uniformly on (0, )? Justify your answer. = a. 3. Let f : R R be a continuous function that satisfies, for each x R, f(x h)+f(x + h) f(x) for all h>0. 2 Show that the maximum value of f on any bounded closed interval [a, b] is attained at one of the endpoints, that is, either f(a) orf(b) isthemaximumvalueoff on the interval [a, b]. 4. (a) Show that the inequalities hold for all x>0. x x +1 < ln(1 + x) <x (b) Define f(x) = ( 1+ x) 1 x ( and g(x) = 1+ x) 1 x+1 for all x>0, where we define x y = e y ln x for all x>0andy>0andeis Euler s number (also known as Napier s constant). Show that f is strictly increasing while g is strictly decreasing on the interval (0, ), and that f(x) <e<g(x) for all x>0. 5. Let {f n } be a sequence of real-valued functions defined on a compact matric space (X, d) such that f n (x n ) f(x) inr whenever x n x in X. Assume that f is continuous. Show that {f n } converges uniformly to f. 6. (a) Show that the sequence of functions f n (x) =e n(nx 1)2 point-wise converges to zero but not uniformly on [0, 1]. (b) Nevertheless show that 1 0 f n (x) dx =0.
4 7. Let (X, d) be a compact metric space. Assume that f : X X is an expansion map, that is, d(f(x),f(y)) d(x, y) for all x, y X. For every x X, define f 2 (x) =f(f(x)), f 3 (x) =f(f 2 (x)), andingeneralf n (x) =f(f n 1 (x)) for n 2. Prove the following statements: (a) For every x X, wehaved(x, f m n (x)) d(f n (x),f m (x)) for all positive integers m and n with m>n, and that the sequence {f n (x)} contains a subsequence {f n k (x)} such that f n k(x) x as k. (b) For every pair of points (x, y), the sequence {f n } contains a subsequence {f n k } such that f n k (x) x and f n k(y) y as k. (Hint: consider the compact metric space X X and the product metric D((x, y), (u, v)) = d(x, u)+d(y, v) andthemapf : X X X X defined by F (x, y) =(f(x),f(y))) (c) For all x, y X, d(f(x),f(y)) = d(x, y), that is, f is an isometry.
5 Analysis Qualifying Examination Fall 2014 In some cases partial credit may be given, but you should endeavor to fully complete as many problems as possible. 1. Let f be a real-valued differentiable function defined on (, + ). Suppose that f has a bounded derivative. Show that there exist nonnegative constants A and B such that f(x) A x + B for all x (, + ). 2. Consider the series n=1 n 2 x 2 1+n 4 x 4. (a) Show that for every δ>0 the series converges uniformly on the set {x : x δ}. (b) Does the series converge uniformly on (, )? Justify your answer. 3. Let f be a continuous real-valued function on [a, b]. Suppose that there exists a constant M 0 such that x f(x) M f(t) dt for all x [a, b]. Show that f(x) = 0 for all x [a, b]. 4. Let A and B be two nonempty subsets of R n,wherer n is the n-dimensional Euclidean space equipped with the usual metric. Define A + B = {a + b : a A, b B}, wherea + b is the sum of vectors a and b in the usual sense. (a) If A and B are compact, show that A + B is compact. (b) If A and B are connected, show that A + B is connected. (b) If one of A and B is open, show that A + B is open. 5. Show that the following it exists and find the it. 0 a cos(x n ) 1+x n dx. 6. Let f be a real-valued measurable function defined on a bounded measurable set E. Suppose that there exists a δ>0such that f < 1 whenever F is a measurable subset of E and m(f ) <δ. F Show that f is Lebesgue integrable on E. Herem denotes the Lebesgue measure. 7. Let E be a measurable subset of R. Define E 2 = {x 2 : x E}. IfE has measure zero, show that E 2 also has measure zero.
6 Analysis Qualifying Examination Spring 2014 [1] Let (M, ρ) be a metric space. Suppose that f : M R is uniformly continuous. Show that if {x n } is a Cauchy sequence in M, then the sequence {f(x n )} is Cauchy in R. Give an example which shows that the result is not necessarily true if f is assumed to be continuous but not uniformly continuous. [2] Show that the set A = {(x, y) R 2 x 2 + y 2 = 1} is a compact, connected subspace of the Euclidean space R 2. [3] A subset A of a metric space (M, ρ) is precompact if its closure cl(a) is compact. Show that if A is precompact, then for every ɛ > 0 there exists a finite covering of A by open balls of radius ɛ with centers in A. [4] Let ɛ > 0. Construct an open subset S of [0, 1] with Lebesgue measure less than ɛ so that the closure of S is [0, 1]. [5] Let λ be the Lebesgue measure on R. Suppose E is a Lebesgue measurable subset of [0, 1] with λ(e) = 1. Show that E is dense in [0, 1]. [6] Let {f n } n=1 be a sequence of Lebesgue measurable functions on a Lebesgue measurable subset E of R which converges pointwise to a function f. Suppose f E n 1 for all n N. Prove f 1. E [7] Compute 1 n 0 sin(u) u e nu sin(nu) du.
7 Analysis Qualifying Exam. Sept 6, 2013 Student Name Print There are 7 questions.
8 Student Name Print 1. Assume that x k is a Cauchy sequence in a metric space, M,, and that a subsequence, x kn, converges. Prove that x k converges.
9 Student Name Print 2. Prove that if 0 s 1 then f x x s is uniformly continuous on 0,.
10 Student Name Print 3. Assume that M, is a compact metric space, and that G is an open cover of M. Prove that there exists 0 so that any ball with radius smaller than is a subset of at least one of the G.
11 Student Name Print 4. Assume that f and g are continuous non-negative functions on a compact metric space, M, and that x:g x 0 x:f x 0. Prove that for any 0there exists K so that for all x M, f x K g x.
12 Student Name Print 5. Assume that M, is a complete metric space and that f : M M is a uniform contraction, that is to say, that there exists 0 q 1sothat x,y M,. f x,f y q x,y Prove that there exists a unique x M so that f x x.
13 Student Name Print 6. Assume that f is a real-valued Lebesgue measurable function on R and for all 0, x:f x x:f x then Note: denotes Lebesgue measure on R. x: f 2e 2 e f x dx.
14 Student Name Print 7. Prove that if f is a Lebesgue measurable function and f x dx then 0 there exists a Lebesgue measurable set, E, so that E, f is bounded on E, and f x dx., \E
15 Analysis Qualifying Examination Spring 2013 Name: 1. Give a proof of Dini s Theorem: let F n : [a, b] R be an increasing sequence of continuous functions (i.e., F n+1 F n for all n) converging pointwise to a continuous function F. Then (F n ) converges to F uniformly 2. Let f : R R + be a continuous integrable function. Show that f is uniformly continuous x f(x) = 0 3. Let f : (0, 1] R be differentiable such that f is bounded on (0, 1]. Prove that f(x) exists. x Show that the series converges uniformly on [ 1, 1]. n 1 x n (1 x) n Let g : R R be a measurable function. Assume that for each measurable set B R gdλ = 0. Show that g 0 a.e. B 6. Compute 1 n 4 u 2 e nu du n 2 u
16 Analysis Qualifying Examination Fall 2012 Solve as many problems as you can. You do not have to solve all to pass the qualifying exam. 1. Suppose that each f n is increasing and continuous on [a, b], and that the series F (x) = f n (x) converges for every x [a, b]. Prove that F is continuous on [a, b]. 2. Let g : R R be a C 2 function. Assume that g and g are both bounded on R. Show that g is bounded on R Hint: Show that there exists a sequence (b n ), n Z such that n < b n n + 1 and (g (b n )) is a bounded sequence. n=1 3. Define u n = (2n 1) 2 4 2n (a) Determine the radius of convergence R of the series n 1 u nx n (b) Study the convergence at x = R (hint: study log(u n )). (c) Study the convergence at x = R. 4. Let (a n ) be a non negative sequence. Show that a n converges n 1 n 1 an n converges. Is the converse true? 5. Compute n 0 ( 1 + x ) n e x dx. 2n 6. Let E be a measurable set of finite measure. For each x R, let f(x) = m(e (, x]). Prove that f is uniformly continuous on R, and that f(n) m(e) as n.
17 Analysis Qualifying Examination Spring 2012 Name: Z-Number: In some cases partial credit may be given, but you should endeavor to fully complete as many problems as possible. 1. Consider the series f(x) = n=1 nx 1+n 3 x 2. (a) Show that the series converges for every real number x. (b) Show that for any δ>0 the series converges uniformly for x δ. (c) Show that the function f defined above for all real numbers x is continuous at every non-zero x. Is it continuous at x = 0? Justify your answer. 2. Let f be a real-valued differentiable function defined on ( r, r), where r is a positive number. Show that f is an even function if and only if its derivative f is an odd function. 3. Let f : R R be a continuous function satisfying the equation f(x + y) =f(x)f(y) for all real numbers x and y. (a) Show that f(0) = 0 or f(0) = 1. (b) Show that if f(0) = 1, then ( m ) f =(f(1)) m n n for all integers m and n, wheren is non-zero. (c) Show that f is either the zero function or there exists a positive number a such that f(x) =a x for all real numbers x. 4. Let f :[0, 1] R be differentiable function satisfying the conditions: f(0) = 0, f (x) f(x) for all 0 <x<1. Prove that f is the zero function. 5. Let f be a real-valued continuous function defined on [0, 1]. Show that 1 0 f(x n ) dx = f(0). 6. Let A be a Lebesgue measurable subset of R with m(a) > 0, where m denotes the Lebesgue measure. Show that for any 0 <δ<m(a) there exists a measurable subset B of A such that m(b) =δ. Hint: consider the function f(x) =m(a [ x, x]) for all x>0.
18 Analysis Qualifying Examination Fall 2011 Your Name: Your Z-Number: In some cases partial credit may be given, but you should endeavor to fully complete as many problems as possible. 1. Prove that the function f(x) = x is uniformly continuous on [0, ). 2. Let a<b. Suppose that the function f :[a, b] R is bounded and Riemann integrable on [c, b] for every a<c<b. Prove that f is Riemann integrable on [a, b] and b b f(x) dx = f(x) dx. a c a c 3. (a) Is there a closed uncountable subset of R which contains no rational numbers? Prove your assertion. (b) Is there an infinite compact subset of Q? Prove your assertion. Here R denotes the set of all real numbers equipped with the usual metric and Q is the set of all rational numbers. 4. Consider the power series n= (2n 1) x n (2n) (a) Prove that the series converges for x < 1 and diverges for x > 1. (b) Investigate the convergence and divergence of the series for x = ±1. 5. Let (X, d) beametricspaceandletaand B be two nonempty subsets of X such that A B =. Prove that if A is closed and B is compact, then d(a, B) > 0, where d(a, B) denotes the distance between A and B. 6. Let a 1 = 0 and for every positive integer n 2, let a n = 0 x 1 n 1+x 2 dx. Show that the sequence {a n } converges and find its it.
19 ANALYSIS QUALIFYING EXAMINATION January 10, 2011 Solutions to the problems are posted at Jan2011sol.pdf 1. Let A, B be non-empty sets of real numbers such that a b for all a A, b B. Prove the following two statements are equivalent: (a) sup A = inf B. (b) For every ɛ > 0 there exist a A and b B such that b a < ɛ. 2. Let f : [0, ) R be uniformly continuous and assume that exists and is finite. Prove that x f(x) = Let ψ : R R be defined by Consider the series k=1 ψ(kx) k(1 + kx 2 ). b b 0 f(x) dx 0 if x < 0, ψ(x) = x if 0 x < 1, 1 if x 1. (a) Prove the series converges for all x R. ψ(kx) (b) Let f(x) = k(1 + kx 2 ). Prove sup x 0+ f(x) > 0. k=1 Hint: f(x) n k=1 ψ(kx) k(1 + kx 2 ; estimate for x = 1/n. ) (c) Prove f is continuous on (, 0) (0, ) but discontinuous at Let A consist of all functions from [0, π] to R that are finite linear combinations of elements of the set {sin(nx) : n N}; that is, f A if and only if f(x) = n k=1 a k sin(kx) for some n N, a 1,..., a n R. (a) Prove: If f : [0, π] R is continuous and satisfies f(0) = f(π) = 0, then f can be approximated uniformly by a sequence in A. Hint: Add the constant function 1 to A; take it away again later on. (b) Prove: If f : [0, π] R is continuous and satisfies x [0, π]. 5. Let f n : R R be measurable for n = 1, 2,.... Let a n = The series n=1 f n converges almost everywhere. 6. Compute, and justify your computation, π R 1 cos(x n ) x n dx. 0 f(x) sin nx dx = 0 for all n N, then f(x) = 0 for all f n for n = 1, 2,... and assume that n=1 a n <. Prove:
20 INSTRUCTIONS: Analysis Qualifier August 19, 2010 Write only on one side of each of the sheets you hand in. Anything written on the back of a sheet might be ignored. Write your name on each sheet. Write clearly. A completely solved problem is worth more than several problems left half done. 1. Let {a n } be a sequence of real numbers and let S be the set of all its of subsequences of {a n }; that is, x S if and only if x R and there exists a sequence of positive integers {n k } such that n 1 < n 2 < n 3 < and such that k a n k = x. Prove: S is a closed subset of R. 2. Let n=1 a n be a convergent series of positive terms. Prove there exists a sequence of real numbers {c n } such that c n = and such that n=1 c na n converges. x 3. Consider the series k(1 + kx 2 ) k=1 (a) Prove the series converges for all x R. x (b) Let f(x) = k(1 + kx 2. Prove f is continuous at all x 0. ) k=1 (c) Is f continuous at 0? Hint: Accept or prove (depending on how much time you have left) 1 k(1 + kx 2 ) x 2 + k=1 1 dt t(1 + tx 2 ). But notice that the integral becomes infinite as x 0. As an additional hint separate prematurely! ( ) 1 1 t(1 + t 2 ) = t x2 1 + x 2. Do not t 4. Let f : R R be differentiable; assume that f(x) 1, f (x) 1 for all x R and that f(0) = 0. Let {a n } be a sequence of non zero real numbers. Prove: The sequence of functions has a subsequence converging to a continuous function. g n (x) = 1 a n f(a n x) 5. Assume f : R R and assume that {x R : f(x) r} is measurable for each rational number r. Prove that f is measurable. 6. Assume f is Lebesgue integrable over the interval [0, 1]. Prove that 1 1 ( log 1 + e nf(x)) dx = n Hint: Prove that log(1 + e t ) log 2 + max(t, 0) for all t R. 0 {x [0,1]:f(x)>0} 7. Let K be a compact subset of R with Lebesgue measure m(k) = 1. Let f(x) dx. K 0 = {A : A is a compact subset of K and m(a) = 1}. Prove m(k 0 ) = 1 and if A is any proper compact subset of K 0, then m(a) < 1. Hint: Prove: The intersection of two, hence of any finite number, of compact subsets of K of measure 1, is again a compact subset of measure 1. Use this to conclude that if V is open in R and K 0 V then V must contain some compact subset of K of measure 1. Then use regularity of the Lebesgue measure; that is, use the fact that the measure of any measurable set is the infimum of the measure of all open sets containing it.
21 Analysis Qualifying Examination Spring 2010 Complete as many problems as possible. 1. Construct a subset of [0, 1] which is compact, perfect, nowhere dense, and with positive Lebesgue measure. (Be sure to prove your set has these four properties.) 2. [i] Suppose A, B are nonempty, disjoint, closed subsets of a metric space X. Show that the function f : X [0, 1] defined by f(x) = dist(x, A) dist(x, A) + dist(x, B) is continuous with f(x) = 0 for all x A, f(x) = 1 for all x B, and 0 < f(x) < 1 for all x X \ (A B). [ii] Show that if X is a connected metric space with at least two distinct points, then X is uncountable. 3. [i] Let {a n } n 1 be a sequence of real numbers. Prove the Root Test: if sup n a n < 1, then an is absolutely convergent, and if sup n a n > 1, then a n is divergent. [ii] Let c n = (the nth digit of the decimal expansion of π) + 1. Prove that the series c n x n has radius of convergence equal to Let {f n } be a sequence of continuously differentiable functions on [0, 1] with f n (0) = f n(0) and f n(x) 1 for all x [0, 1] and n N. Show that if f n (x) = f(x) for all x [0, 1], then f is continuous on [0, 1]. Must the sequence converge? Must there be a convergent subsequence? 5. Suppose that f, g, h : [a, b] R satisfy f(x) g(x) h(x) for all x [a, b] and f(x 0 ) = h(x 0 ) for some x 0 (a, b). Prove that if f and h are differentiable at x 0, then g is differentiable at x 0 with f (x 0 ) = g (x 0 ) = h (x 0 ). 6. Compute n n( n x 1) x 3 log(x) dx 1 7. Suppose f : [a, b] R is Riemann integrable on every subinterval [a + ɛ, b] for 0 < ɛ < b a. Show that if f is Lebesgue integrable on [a, b], then the (improper) Riemann integral exists on [a, b] and is equal to the Lebesgue integral. Is the converse true?
22 FINAL DRAFT: Analysis Qualifying Examination Fall 2009 Complete as many problems as possible. 1. Let u : [a, b + 1] R be a continuous function. For fixed τ [0, 1] define v τ : [a, b] R by v τ (t) = u(t + τ). Show that {v τ τ [0, 1]} is a compact subset of C([a, b], R). 2. Suppose A is a compact subset of R n and f : A R is continuous. Prove that for every ɛ > 0 there exists M > 0 such that f(x) f(y) M x y + ɛ. 3. Suppose U is an open subset of R n and f : U R n is a homeomorphism. Prove that if f is uniformly continuous, then U = R n. 4. Suppose {C n } n 1 is a nested decreasing sequence of nonempty, compact, connected subsets of a metric space. Prove that n 1 C n is nonempty, compact, and connected. 5. For p > 1 compute 1 0 x p x 2 + (1 nx) 2 dx. 6. Let f : R R be a Lebesgue integrable function, E R a measurable set, and ω > 0. Define ωe = {ωx x E}. [a] Show that m(ωe) = ω m(e). [b] Show that the function g : E R defined by g(x) = f(ωx) is Lebesgue integrable and E f(ωx) dx = 1 ω ωe f(x) dx. 7. Prove that if f : [0, ) R is Lebesgue integrable, then ({ 1 n m x n f(x) 1 }) = 0. n
23 Analysis Qualifying Examination January 5, 2009 Name (Please print) 1. Assume that {a n } is a monotone decreasing sequence with a n 0. If that na n = 0. Is the converse true? 2. Let f : R R be defined by x f(x) = p sin 1 q At what points is f continuous? if x is irrational if x = p q in lowest terms (q >0) a n <, show 3. Let f(x) = (x 2 1) n, and g = f (n) (i.e., the nth derivative of f.) Show that the polynomial g has n distinct real roots, all in the interval [ 1, 1]. 4. Let X be a nonempty set, and for any two functions f, g R X (the set of all functions from X to R) let f(x) g(x) d(f, g) = sup x X 1+ f(x) g(x). Establish the following: (a) (R X,d) is a metric space. (b) A sequence {f n } R X satisfies d(f n,f) 0 for some f R X if and only if {f n } converges uniformly to f. 5. Let E = { (x, y) R 2 : 9x 2 + y 4 =1 }. Show that E is compact and connected. 6. If f = 0 for every measurable subset A of a measurable set E, show that f = 0 a.e. in E. A 7. Evaluate ( ) 1 e x2 /n x 1/2 dx. [0,1] n=1
24 Analysis Qualifying Examination August 21, 2008 Name (Please print) 1. If {x n } is a convergent sequence in a metric space, show that any rearrangement of {x n } converges to the same it. 2. Consider the series n=1 1 1+x n. (a) Show that the series diverges for x < 1, and converges for x > 1. 1 (b) Let f(x) =. Find the set where f is continuous. 1+xn n=1 3. Let G be a non-trivial additive subgroup of R. Let a = inf {x G : x>0}. Prove: If a>0 then G = {na : n Z}, otherwise (i.e., if a = 0) G is dense in R. 4. Consider the function f :[ 1, 1] R defined by ( ) x 1 f(x) = 2 + x2 sin, if x 0; x 0, if x =0. Prove that f (0) is positive, but that f is not increasing in any open interval that contains For x [ 1, 1] and n N, define f n (x) = x2n 1+x 2n. (a) Find a function f 0 on [ 1, 1] such that {f n } converges pointwise to f 0. (b) Determine whether {f n } converges uniformly to f 0. (c) Calculate 1 1 f 0(x)dx and determine whether 1 1 f n (x)dx = 1 1 f 0 (x)dx. 6. Let (X, A,µ) be a measurable space and {f n } a sequence of measurable functions. We say that {f n } converges in measure to f if for every ε> 0, µ ({x X : f n(x) f(x) >ε}) = 0. Show that if µ is a finite measure, and f n f a.e., then f n f in measure. Give an example of a sequence which converges in measure, but does not converge a.e. 7. Show that n 0 ( 1+ x n) n e 2x dx =1.
25 Analysis Qualifying Examination Spring 2008 Complete as many problems as possible. ( ) 1 1. Let f(x) = sin for x>0. Prove that f is uniformly continuous on (a, ) for every a>0. Is f x uniformly continuous on (0, )? Justify your answer. 2. Let f be continuous on [0, 1] and differentiable in (0, 1) such that f(0) = f(1). Prove that there exists 0 < c < 1 such that f (1 c) = f (c). 3. Suppose X, Y are metric spaces, X is compact, and f : X Y is a continuous bijection. Prove that f is a homeomorphism. 4. Let C([0, 1], R) ={f [0, 1] R f is continuous} be the metric space of continuous functions on [0, 1] with the metric d(f, g) = f g = sup x [0,1] f(x) g(x). Show that the unit ball {f C([0, 1], R) f 1} is not compact. 5. Let f : [0, 1] R be continuously differentiable on [0, 1] with f(0) = 0. Prove that 1 sup 0 x 1 f(x) f (x) dx f (x) 2 dx Compute Justify your answer xn sin(nx) dx Let f : R R be Lebesgue integrable on R. Prove that f(x + h) f(x) dx =0. h 0 R
26 Analysis Qualifying Examination Fall 2007 Name: Last Four Digits of Your Student Number: In some cases partial credit may be given, but you should endeavor to fully complete as many problems as possible. 1. Give an example of a sequence of Riemann integrable functions f n : [0, 1] R for which f n 0 pointwise on [0,1] but 1 0 f n (x) dx Let k be a fixed positive integer, and let A be the set of all polynomials of the form p(x) =a k x k + a k+1 x k a n x n, where n N,n k, and a i R. Prove that A is dense in C[a, 1] for every 0 <a<1. Is it also dense in C[0, 1]? Prove your conclusion. 3. (a) Suppose that f :[a, b] R is differentiable, and that f is bounded on [a, b]. Prove that f is of bounded variation on [a, b]. (b) Define f(x) =x 2 cos(1/x) for 0 <x 1 and f(0) = 0. Using (a), prove that f is of bounded variation on [0, 1]. 4. Let U be an open subset of R n and let f : U R m. (a) State the definition that f is differentiable at p U. (b) Show that every linear transformation T : R n R m is differentiable at every p R n. What is the derivative of T at p? 5. Define f : [0, 1] R by f(x) = { 0, if x is rational x 2, if x is irrational Prove that f is not Riemann integrable on [0, 1] but it is Lebesgue integrable on [0, 1]. Find the Lebesgue integral of f. 6. Let X be a compact metric space and let {f n } be a sequence of isometries on X. Prove that there exists a subsequence {f nk } that pointwise converges to an isometry f on X. Recall that f : X X is called an isometry if d(f(x),f(y)) = d(x, y) for all x, y X, where d is the metric on X.
27
28
29
30
31
32
1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
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 informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
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 information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More information9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
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 informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
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 informationI. Pointwise convergence
MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
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 informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationMetric Spaces. Lecture Notes and Exercises, Fall 2015. M.van den Berg
Metric Spaces Lecture Notes and Exercises, Fall 2015 M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK mamvdb@bristol.ac.uk 1 Definition of a metric space. Let X be a set,
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
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 informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
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 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 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 informationMATH 132: CALCULUS II SYLLABUS
MATH 32: CALCULUS II SYLLABUS Prerequisites: Successful completion of Math 3 (or its equivalent elsewhere). Math 27 is normally not a sufficient prerequisite for Math 32. Required Text: Calculus: Early
More informationand s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space
RAL ANALYSIS A survey of MA 641-643, UAB 1999-2000 M. Griesemer Throughout these notes m denotes Lebesgue measure. 1. Abstract Integration σ-algebras. A σ-algebra in X is a non-empty collection of subsets
More information4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
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 informationMEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites
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 informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationFIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
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 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 informationThe Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line
The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line D. Bongiorno, G. Corrao Dipartimento di Ingegneria lettrica, lettronica e delle Telecomunicazioni,
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 informationFixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
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 informationMath 104: Introduction to Analysis
Math 104: Introduction to Analysis Evan Chen UC Berkeley Notes for the course MATH 104, instructed by Charles Pugh. 1 1 August 29, 2013 Hard: #22 in Chapter 1. Consider a pile of sand principle. You wish
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 informationLecture Notes on Measure Theory and Functional Analysis
Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata cannarsa@mat.uniroma2.it daprile@mat.uniroma2.it aa 2006/07 Contents
More informationLECTURE NOTES IN MEASURE THEORY. Christer Borell Matematik Chalmers och Göteborgs universitet 412 96 Göteborg (Version: January 12)
1 LECTURE NOTES IN MEASURE THEORY Christer Borell Matematik Chalmers och Göteborgs universitet 412 96 Göteborg (Version: January 12) 2 PREFACE These are lecture notes on integration theory for a eight-week
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 informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationNOV - 30211/II. 1. Let f(z) = sin z, z C. Then f(z) : 3. Let the sequence {a n } be given. (A) is bounded in the complex plane
Mathematical Sciences Paper II Time Allowed : 75 Minutes] [Maximum Marks : 100 Note : This Paper contains Fifty (50) multiple choice questions. Each question carries Two () marks. Attempt All questions.
More informationThe sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
More informationINTRODUCTION TO TOPOLOGY
INTRODUCTION TO TOPOLOGY ALEX KÜRONYA In preparation January 24, 2010 Contents 1. Basic concepts 1 2. Constructing topologies 13 2.1. Subspace topology 13 2.2. Local properties 18 2.3. Product topology
More informationHow To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationCHAPTER 1 BASIC TOPOLOGY
CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is
More informationColumbia University in the City of New York New York, N.Y. 10027
Columbia University in the City of New York New York, N.Y. 10027 DEPARTMENT OF MATHEMATICS 508 Mathematics Building 2990 Broadway Fall Semester 2005 Professor Ioannis Karatzas W4061: MODERN ANALYSIS Description
More informationChapter 5. Banach Spaces
9 Chapter 5 Banach Spaces Many linear equations may be formulated in terms of a suitable linear operator acting on a Banach space. In this chapter, we study Banach spaces and linear operators acting on
More informationIntermediate Value Theorem, Rolle s Theorem and Mean Value Theorem
Intermediate Value Theorem, Rolle s Theorem and Mean Value Theorem February 21, 214 In many problems, you are asked to show that something exists, but are not required to give a specific example or formula
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
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 non-empty
More information1. Let X and Y be normed spaces and let T B(X, Y ).
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 2005-03-14 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
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 informationChapter 7. Continuity
Chapter 7 Continuity There are many processes and eects that depends on certain set of variables in such a way that a small change in these variables acts as small change in the process. Changes of this
More informationTMA4213/4215 Matematikk 4M/N Vår 2013
Norges teknisk naturvitenskapelige universitet Institutt for matematiske fag TMA43/45 Matematikk 4M/N Vår 3 Løsningsforslag Øving a) The Fourier series of the signal is f(x) =.4 cos ( 4 L x) +cos ( 5 L
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationLet H and J be as in the above lemma. The result of the lemma shows that the integral
Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;
More informationDifferentiation and Integration
This material is a supplement to Appendix G of Stewart. You should read the appendix, except the last section on complex exponentials, before this material. Differentiation and Integration Suppose we have
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 informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
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
More informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More informationAn important theme in this book is to give constructive definitions of mathematical objects. Thus, for instance, if you needed to evaluate.
Chapter 10 Series and Approximations An important theme in this book is to give constructive definitions of mathematical objects. Thus, for instance, if you needed to evaluate 1 0 e x2 dx, you could set
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
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 informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
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 information4.3 Lagrange Approximation
206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More informationA power series about x = a is the series of the form
POWER SERIES AND THE USES OF POWER SERIES Elizabeth Wood Now we are finally going to start working with a topic that uses all of the information from the previous topics. The topic that we are going to
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 informationDifferential Operators and their Adjoint Operators
Differential Operators and their Adjoint Operators Differential Operators inear functions from E n to E m may be described, once bases have been selected in both spaces ordinarily one uses the standard
More information5.3 Improper Integrals Involving Rational and Exponential Functions
Section 5.3 Improper Integrals Involving Rational and Exponential Functions 99.. 3. 4. dθ +a cos θ =, < a
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 informationExercises and Problems in Calculus. John M. Erdman Portland State University. Version August 1, 2013
Exercises and Problems in Calculus John M. Erdman Portland State University Version August 1, 2013 c 2010 John M. Erdman E-mail address: erdman@pdx.edu Contents Preface ix Part 1. PRELIMINARY MATERIAL
More informationcorrect-choice plot f(x) and draw an approximate tangent line at x = a and use geometry to estimate its slope comment The choices were:
Topic 1 2.1 mode MultipleSelection text How can we approximate the slope of the tangent line to f(x) at a point x = a? This is a Multiple selection question, so you need to check all of the answers that
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More information(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
More informationRolle s Theorem. q( x) = 1
Lecture 1 :The Mean Value Theorem We know that constant functions have derivative zero. Is it possible for a more complicated function to have derivative zero? In this section we will answer this question
More informationAdaptive Search with Stochastic Acceptance Probabilities for Global Optimization
Adaptive Search with Stochastic Acceptance Probabilities for Global Optimization Archis Ghate a and Robert L. Smith b a Industrial Engineering, University of Washington, Box 352650, Seattle, Washington,
More informationPSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2
PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2 Abstract. We prove a Bruckner-Garg type theorem for the fiber structure of a generic map from a continuum X into the unit interval I. We
More informationFUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES CHRISTOPHER HEIL 1. Elementary Properties and Examples First recall the basic definitions regarding operators. Definition 1.1 (Continuous
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 informationHow To Understand The Theory Of Algebraic Functions
Homework 4 3.4,. Show that x x cos x x holds for x 0. Solution: Since cos x, multiply all three parts by x > 0, we get: x x cos x x, and since x 0 x x 0 ( x ) = 0, then by Sandwich theorem, we get: x 0
More informationPoint Set Topology. A. Topological Spaces and Continuous Maps
Point Set Topology A. Topological Spaces and Continuous Maps Definition 1.1 A topology on a set X is a collection T of subsets of X satisfying the following axioms: T 1.,X T. T2. {O α α I} T = α IO α T.
More informationSection 5.1 Continuous Random Variables: Introduction
Section 5. Continuous Random Variables: Introduction Not all random variables are discrete. For example:. Waiting times for anything (train, arrival of customer, production of mrna molecule from gene,
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
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 informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
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 information