You can discuss the questions with other people, but you must be able to write down the solution on your own.
Be ready to answer similar questions on quizzes/exams
Click to see previous assignments
Homework I
on Sequences and Series: Due Tue, Jan 21 in class For this set of questions, you should try all the questions 1-4. But turn in only one well written solution of your choice. (Be sure to include "all" the details!). (In my opinion, the difficulty of the questions, from easiest to hardest, is 3,1,2a, 2b,4. But, like most of math, this is a subjective judgement)
If $(\vec x_n)$ is a sequence in $\mathbf{R}^p$ such that $\vec x_n\to \vec a$, show that the sequence of arithmetic means converges to the same limit, $\lim_{n\to\infty} \frac{1}{n}\sum_{k=1}^n \vec x_k =\vec a$. Hint:
$\vec a=\vec 0$.
It is known that the root test is stronger (=better) than the ratio test. To confirm this, prove one of the following claims:
If $(a_n)$ is a bounded sequence of strictly positive real numbers, show that $\limsup_{n\to\infty}\sqrt[n]{a_n}
\leq \limsup_{n\to\infty} \frac{a_{n+1}}{a_n}$. (Bartle Exercise 18.F:).
Alternative version: If $(a_n)$ is a bounded sequence of strictly positive real numbers such that $r=\lim_{n\to\infty} \frac{a_{n+1}}{a_n}$ exists, then $\lim_{n\to\infty}\sqrt[n]{a_n}=r$.
.
The Cauchy Condensation Test (Barlet Exercise 34.K, or Rudin Theorem 3.27) is a theorem that says that if a sequence $(a_n)$ of real numbers is monotone decreasing and positive, then series $\sum_{n=1}^\infty a_n$ converges iff series $\sum_{k=0}^\infty 2^k a_{2^k}$ converges.
Use The Cauchy Condensation Test to prove both of the following statements:
For $p\in\mathbf{R}$ the series $\sum_n\frac{1}{n^p}$ converges iff $p>1$.
For $p\in\mathbf{R}$ the series $\sum_{n=2}^\infty\frac{1}{n (\log n)^p}$ converges iff $p>1$.
Bartle Exercise 34.K has a hint in the back of the book. Without looking into Rudin's book, use this hint to write the proof of The Cauchy Condensation Test.
Homework II on integration Due Tue, Jan 28 in class
Compute one of the following integrals: $\int_{-1}^1 x d|x|$ (with respect to absolute value function), $\int_{0}^2 x^3 d\lfloor x\rfloor$ (with respect to the greatest integer/floor function as in Bartle Example 29.9(e)).
Hint: It is easier to use properties than the definition of the RS-integral.
If $f $ is positive and continuous on $[0,1]$ and $M=\sup_{x\in[0,1]}f(x)$, show that
$\lim_{n\to\infty}\sqrt[n]{ \int_0^1 (f(x))^n dx}=M$.
Hint: One can use "the squeeze theorem" from calculus or from Bartle Thm 14.9. To put it differently, inequality $\limsup_{n\to\infty}\sqrt[n]{ \int_0^1 (f(x))^n dx}\leq M$ is obvious/easy. Inequality $\liminf_{n\to\infty}\sqrt[n]{ \int_0^1 (f(x))^n dx}\geq M$ may require a lemma which is somewhere in Bartle, but it maybe quicker to prove it than to find it.
Prove that $\lim_{n\to\infty}\int_0^1 \frac{sin (nx)}{nx} dx=0$. (Compare Bartle 31.D). Alternatively, you may choose one of the problems 31.C, 31.E, 31F from Bartle.
Homework III on improper integrals Due Tue, Feb 4 in class
Bartle 32.D - choose one
Bartle 32.F - choose one
Discuss convergence/divergence/absolute convergence:
(a) $\int_1^\infty \frac{dx}{x(1+\sqrt{x})}$
(b) $\int_1^\infty \frac{x+2}{x^2+1}dx$
(c) $\int_1^\infty \frac{\sin(1/x)}{x} dx$
(d) $\int_1^\infty \frac{\cos x}{\sqrt{x}}dx$
(e) $\int_0^\infty \frac{x \sin x}{1+x^2} dx$
(f) $\int_0^\infty\frac{\sin x \sin 2 x}{x} dx$
Bartle 32.G (chose one) For what values of $p$ and $q$ are the following convergent? Absolutely convergent?
(a) $\int_1^\infty \frac{x^p}{1+x^q}dx$
(b) $\int_1^\infty \frac{\sin x}{x^q} dx$
(c) $\int_1^\infty \frac{\sin x^p}{x} dx$
(d) $\int_1^\infty \frac{1-\cos x}{x^q} dx$
Bartle 32.J; If $f$ is monotone and $\int_0^\infty f$ exists then $x f(x)\to 0$ as $x\to\infty$ Hints: 1. WLOG we can assume $f$ is decreasing (= nonincreasing). 2. Consider proof by contradiction. (Maybe not here? But for the alternative version below.) * You may solve instead an easier question (from one of the past qualifying exams) to prove that under the above assumptions $f(x)\to 0$ as $x\to\infty$
New You may replace any of the above questions with the following "dominated convergence theorem":
Suppose that for every $k=1,2,\dots$ $\lim_{n\to\infty}a_{n,k}=b_k$ exists and that $|a_{n,k}|\leq m_k$, where $\sum_{k=1}^\infty m_k<\infty$. Prove that the series in the formula below exist and we have the limit:
$$\lim_{n\to\infty}\sum_{k=1}^\infty a_{n,k}=\sum_{k=1}^\infty b_k$$
Homework IV on power series due Tue, Feb 11 in class:
Choose 2 of the following 3 questions.
Show that the series $\sum_{n=1}^\infty (-1)^n \frac{x^2+n}{n^2}$ converges uniformly in every bounded interval but does not converge absolutely for any value of $x$.
Bartle, Exercise 37.H: Determine the radius of convergence for as many of the following as you can (turn in one or two that you found more interesting/challenging):
(a) $\sum_{n=1}^\infty \frac{x^n}{n^n}$,
(b) $\sum_{n=0}^\infty \frac{n^\alpha x^n}{n!}$,
(c) $\sum_{n=0}^\infty \frac{n^n x^n}{n!}$,
(d) $\sum_{n=2}^\infty \frac{x^n}{\log n}$,
(e) $\sum_{n=0}^\infty \frac{(n!)^2}{(2n)!}x^n$,
(f) $\sum_{n=0}^\infty \frac{x^n}{n^{\sqrt{n}}}$.
Bartle Exercise 37.T: Use Abel's theorem 37.20 to prove that if $A=\sum a_n$, $B=\sum b_n$ and $C=\sum c_n$ converge, where $c_n=\sum_{k=0}^n a_k b_{n-k}$, then $C=AB$. Try to do get the proof without looking at "a solution" in the back of the book. Even if you do look there, be sure to add missing details and quote the actual theorem that you need to use! Why do the power series converge absolutely on $(0,1)$?
Homework Vdue Tue, Feb 25 in class
Use Banach fixed point theorem (Als known as contraction mapping theorem, compare ) to establish convergence of one of the following sequences converges: define appropriate function $f$ that maps an appropriate set $K\subset\mathbb{R}$ into itself, and verify that contraction property holds on $K$. Choose one sequence to turn in. (No ad-hoc solutions, please! This is intended as an exercise on how to use the contractive mapping and how to choose the appropriate "complete metric space".)
(a) $a_n=\cos(\cos(\dots(\cos(0))\dots))$ . More precisely, $a_0=0$, $a_{n+1}=\cos a_n$.
(b) $a_n=\sqrt{2+\sqrt{2+\dots\sqrt{2}}}$. More precisely, $a_0=0$, $a_{n+1}=\sqrt{2+a_n}$.
(c) $a_0=1$, $a_{n+1}=\frac{1}{1+a_n}$ which converges to the following continued fraction:  
$ \frac{1}{1+\tfrac{1}{1+\tfrac{1}{1+\dots}}}$
Partial derivatives and derivatives: Choose one of the Bartle Exercises 39 A, B, C, D, E (Exercises (39.D/E) are re-written here )
Show that the directional derivative of $f$ at $(0,0)$ with respect to any (nonzero) vector $\vec u=\begin{bmatrix}a \\ b \end{bmatrix}$
exists,
If $a^2+b^2>0$ then $D_{\vec {u}}f(0,0)=ab^2/(a^2+b^2)$,
$f$ is continuous
the derivative $f'(0,0)$ does not exist.
Coordinate-free differentiation in (finite dimensional) vector spaces: compute one of the following derivatives
If $f:\mathcal{M}_{2\times 2}\to \mathcal{M}_{2\times 2}$ is $f(X)=XAX$, where $A=\begin{bmatrix}a_{11} & a_{12} \\a_{21} & a_{2,2}\end{bmatrix}$ is given, what is $f'(X)(H)$?
If $f:\mathcal{P}_{2}\to \mathcal{P}_{3}$ is $f(p)=p p'$, what is $f'(p)(h)$?
If you really do not like coordinate-free differentiation, you can choose to do one of these problems in coordinates!
(A choice of $A=\begin{bmatrix}1& 2 \\3& 4\end{bmatrix}$ seems harmless enough.)
Homework Vdue Tue, March 4 in class
To be posted
Homework VIdue Tue, March 11 in class
To be posted
This is a direct continuation of Math 6001 with the emphasis on the calculus of mappings between general Euclidean spaces. Material covered
includes: linear maps, differentiability, partial derivatives, differentiability of functions whose partial derivatives are continuous, chain rule, Jacobian,
inverse and implicit function theorems. Uniform convergence of sequences of functions, Arzela-Ascoli theorem. Basics of Fourier series. Students
will be expected to have completed MATH 6001 or the equivalent. Credit Level:U,G Credit Hrs:4 Pre-req: See your college advisor for details.
Baccalaureate Competency: Critical Thinking, Effective Communication, Information Literacy, Knowledge Integration.
Instructor: Wlodek Bryc
Office French West 4316
E-mail:
Office Hours
Phone: 513-556-4098
Main Textbook: R. Bartle, The Elements of Real Analysis, 2nd edition. Secondary: W. Rudin, Principles of Mathematical Analysis, 3rd edition.
The course grade will be assigned based on two exams, final, and the average of the quizzes/homeworks.
Grading scale: 93% A, 90% A-, 87%, B+, 83% B, 80% B-, etc.
Topics
According to course description, material covered
includes: linear maps, differentiability, partial derivatives, differentiability of functions whose partial derivatives are continuous, chain rule, Jacobian,
inverse and implicit function theorems. Uniform convergence of sequences of functions, Arzela-Ascoli theorem. Basics of Fourier series.
However, we will start with some topics from the previous semester.
Sequences and series
Sequences $(x_n)$ in metric spaces: Dr. Speight notes Ch 4, Bartle Ch III (pg 90), Rudin Ch 3 and Ch 7
Numerical Series $\sum_n a_n$: root test, Dirichlet test Dr. Speight notes Ch 4, Bartle Ch VI, Rudin Ch 3 and Ch 7
Sequences and series of functions $f_n:\mathbf{R}^p\to\mathbf{R}^q$. Uniform convergence, completeness of $C[0,1]$. Bartle Sect 26, Sect. 37, Rudin Ch 7, Dr. Speight notes end of Ch 5.
Improper integrals, including comparison tests and Dirichlet's Test (Bartle Thm 32.9), "integral test for series" (Bartle Thm. 35.12).
Some topics that were omitted in Adv. Calc I:
Power series Bartle Sect. 37, Rudin Ch. 8, Dr. Speight notes Ch 6 pgs $\geq 22$
Radius of convergence, term-by-term integration, term-by-term differentiation
Multiplication of series
The Stone-Weierstrass Theorem (Rudin Thm 7.26, Bartle Thm 24.7/24.8. Do we want Bartle, Thm 26.2? No!$C[0,1]$ is a complete and separable metric space!
Exam 1 will be over the material that we manage to cover. You should know how to do problems similar to homework as well as proofs of selected theorems.
Proofs required in 2025:
Uniform convergence of continuous functions: Bartle, Theorem 24.1
Limits of integrals: Bartle, Theorem 31.2
Absolute convergence of series of vectors: Bartle Thm 34.7
Root test for absolute convergence of numerical series: Bartle Thm 35.3 +Corollary 35.4 (Oops, I meant Corollary 35.5. )
Dirichlet's test for series: Bartle, Thm 36.2
Radius of convergence for power series: Bartle, Thm 37.13 (Cauchy-Hadamard)
Uniform convergence: Bartle, Thm 37.14
Term by term differentiation: Bartle, Thm 37.16
Uniqueness: Bartle, Thm 37.17
Improper integrals:
Thm 32.5 Cauchy Criterion
Thm 32.7 Comparison Test
Thm 32.8 Limit Comparison Test
More topics that were moved from Adv. Calc I:
Equicontinuity and The Arzela-Ascoli Theorem. Bartle Thm 26.7 Rudin Ch 7, Thm 7.25
Orthogonal expansions - a prequel to Fourier series.
Exam 2 The exam will be over the material that we manage to cover. You should know how to do problems similar to homework as well as proofs of selected theorems.
Proofs required in 2024 - to be updated for 2025:
Banach fixed point theorem (Bartle Thm 23.5 )
Continuity theorem (Bartle, Lemma 39.5)
Partial derivatives theorem (Bartle Thm 39.6 and Corollary 39.7)
Additional topics.
To be decided later. Currently under consideration:
A sequel to Fourier series - Intro to orthogonal polynomials.
Problems from past Advanced Calculus Qualifying Exams.
Final Exam: Thursday, May 1, 12:30- 2:30 pm, Room 115 W. Charlton The final exam will be cumulative over all the material covered. You should know how to do problems similar to homework as well as proofs of selected theorems. (4 questions)
Required proofs:
List of proofs from Exam 1
Uniform convergence of continuous functions: Bartle, Theorem 24.1
Absolute convergence of series of vectors: Bartle Thm 34.7
Root test for absolute convergence of numerical series: Bartle Thm 35.3+Corollary 35.4
Dirichlet's test for series: Bartle, Thm 36.2
Radius of convergence for power series: Bartle, Thm 37.13 (Cauchy-Hadamard)
Uniform convergence: Bartle, Thm 37.14
Term by term Differentiation: Bartle, Thm 37.16
Uniqueness: Bartle, Thm 37.17
Improper integrals:
Thm 32.5 Cauchy Criterion
Thm 32.7 Comparison Test
Thm 32.8 Limit Comparison Test
List of proofs from Exam 2
Banach fixed point theorem (Bartle Thm 23.5 )
Continuity theorem (Bartle, Lemma 39.5)
Partial derivatives theorem (Bartle Thm 39.6 and Corollary 39.7)
Theorem For sequences of real numbers, the following are equivalen:
$(a_n)$ converges
$(a_n)$ is a Cauchy sequence
Definition $(a_n)$ converges, if $\forall_{\epsilon>0} \exists_{M}\forall_{n,m>M} |a_n-a_m|<\epsilon$. (Is this an "incorrect" definition?)
Geometric progression: Definition + two formulas
If $b_{n+1}=r b_n$ then $b_n=b_0 r^n$. (Proof?)
If $b_n=b_0 r^n$ and $r\ne 1$ then $b_0+b_1+\dots+b_n=b_0 \frac{1-r^{n+1}}{1-r}$. (Proof?)
Binomial law behind a proof of Theorem 24.7 in Bartle.
If $p_k(n):=P(X=k)=\begin{pmatrix}n \\ k \end{pmatrix} p^k q^{n-k}$ for $k=0,\dots ,n$ then
$\sum_k p_k(n)=1$
$E(X):=\sum_{k} k p_k(n)= n p$
$Var(X)=\sum_{k} (k-np)^2 p_k(n)= n p q$
Chebyshev inequality $P(|X/n-p|>\epsilon)<\frac{p(1-p)}{n \epsilon^2}$ for $\epsilon>0$ imples the law of large numbers:
$\forall \epsilon>0$ $\lim_{n\to\infty}P(|X/n-p|>\epsilon)=0$
Norms and metrics: Convergent sequences in $\mathbb{R}^p$, $C[0,1]$, $\ell_2$, $\ell_1$, $c$.
Norms etc are in exercises/projects for Section 8 in Bartle. Limits in $\mathbb{R}^p$ are in exercises/projects for Secton 15. Series are in exercises for Section 34. Chose an exercise that you find interesting/puzzling and be ready to present it in class.
Separable complete metric spaces are the nicest spaces to work with. (What is "metric space"? What is "separable"? What is "complete"?)
Consider $C[0,1]$, the space of all continuous functions on $[0,1]$ with the norm $\|f\|_\infty=\max_{x\in[0,1]}|f(x)$. Can we prove that $C[0,1]$ with metric $d(f,g)=\|f-g\|_\infty$ is a separable complete metric space? [Yes, we can!]
Consider $C[0,1]$, the space of all continuous functions on $[0,1]$ with the norm $\|f\|_1=\int_0^1|f(x)|dx$. Can we prove that $C[0,1]$ with metric $d_1(f,g)=\|f-g\|_1$ is a separable complete metric space? [No, we cannot prove completeness]
Hint: One can find a sequence $(f_n)$ that is Cauchy in metric $d_1$ but does not converge to a continuous function.
Jan 23:
We may want to discuss the Homework questions
Exercise 24.H in BartleDini's Theorem Let $(f_n)$ be a monotone decreasing sequence of continuous functions on $[-1,1]$.
(That is $f_1(x)\geq f_2(x)\geq \dots$ for all $x\in[-1,1]$.) If $f_n$ converges pointwise to a function $f$ that is continuous on $[-1,1]$ then convergence is uniform. Hint:
$f\equiv 0$.
One can find examples that illustrate the importancve of each of the assumptions in Dini's theorem: (I think one can cook up piecewise linear functions for each case)
Give an example of a monotone decreasing sequence $(f_n)$ of continuous functions on $[-1,1]$ such that $f_n$ converges pointwise to a function $f$ that is not continuous on $[-1,1]$.
Give an example of a sequence $(f_n)$ of continuous functions on $[-1,1]$ such that $f_n$ converges pointwise to a function $f$ that is continuous on $[-1,1]$ but the convergence is not uniform.
Give an example of a monotone decreasing sequence $(f_n)$ of continuous functions on $(-1,1)$ such that $f_n$ converges pointwise to a function $f$ that is continuous on $(-1,1)$ but the convergence is not uniform.
Binomial law behind a proof of Theorem 24.7 in Bartle.
If $p_k(n):=P(X=k)=\begin{pmatrix}n \\ k \end{pmatrix} p^k q^{n-k}$ for $k=0,\dots ,n$ then
$\sum_k p_k(n)=1$
$E(X):=\sum_{k} k p_k(n)= n p$
$Var(X)=\sum_{k} (k-np)^2 p_k(n)= n p q$
Chebyshev inequality $P(|X/n-p|>\epsilon)<\frac{p(1-p)}{n \epsilon^2}$ for $\epsilon>0$ imples the law of large numbers:
$\forall \epsilon>0$ $\lim_{n\to\infty}P(|X/n-p|>\epsilon)=0$
If you never saw a proof of Holder's inequality perhaps we should go over some of Bartle's Project 8$\beta$. Given $p,q>1$ such that $\frac{1}{p}+\frac{1}{q}=1$, for continuous $f,g$ we have
$$\left|\int_0^1 f(x)g(x) dx\right|\le \sqrt[p]{\int_0^1 |f(x)|^p} \sqrt[q]{\int_0^1 |f(x)|^q}$$
Given sequences $(a_n)$ and $(b_n)$ of real numbers such that $\sum_n |a_n|^p<\infty$ and $\sum_n |b_n|^q<\infty$, the series $\sum_na_nb_n$ converges and
$$\left|\sum_{n=1}^\infty a_n b_n\right|\leq
\sqrt[p]{\sum_n |a_n|^p}\sqrt[q]{\sum_n |b_n|^q}$$
The hard part is to prove inequality in Bartle's Project 8$\beta$(a). But we can just accept "an elementary inequality" $a b\leq \frac{a^p}{p}+\frac{b^q}{q}$ for $a,b>0$ without proof, and use it.
Note: The inequalities hold also for $p=1,q=\infty$. The best known and most important case is of course $p=q=2$.
Exercises for Euler's formula $e^{i x}=\cos x + i \sin x$ and geometric sum that we will need for Fourier series: There are "nice" formulas for $\sum_{k=1}^n \sin kx$ and $\sum_{k=1}^n \cos k x$ which give an identity
$$\tfrac12+\sum_{k=1}^n \cos k x=\frac{\sin (n+\tfrac12)x}{2 \sin \tfrac12 x}$$
Another geometric sum exercise: If $A$ is a square matrix with no eigenvalue 1, then $I+A+\dots+A^n = ??$
Jan 30:We will probably want to discuss some of the homework solutions.
It is time to go over the binomial identities behind a proof of Theorem 24.7 in Bartle.
If $p_k(n):=P(X=k)=\begin{pmatrix}n \\ k \end{pmatrix} p^k q^{n-k}$ for $k=0,\dots ,n$, where $q=1-p$, then
$\sum_{k=0}^n p_k(n)=1$
$E(X):=\sum_{k=0}^n k p_k(n)= n p$
$Var(X):=\sum_{k=0}^n (k-np)^2 p_k(n)= n p q$
Bartle Example 32.10 lists a couple of improper integrals, including $\int_0^\infty \sin (x^2) dx$ and $\Gamma(p):=\int_0^\infty x^{p-1}e^{-x}dx$. (The latter is continued as "Project 33" in next section.)
Feb 6: (with Dr. Speight) Please prepare to present your solution of one homework problem. If possible, I would like to have someone present the solution of:
Discuss convergence/divergence/absolute convergence of
(a) $\int_1^\infty \frac{dx}{x(1+\sqrt{x})}$
(b) $\int_1^\infty \frac{x+2}{x^2+1}dx$
(c) $\int_1^\infty \frac{\sin(1/x}{x} dx$
(d) $\int_1^\infty \frac{\cos x}{\sqrt{x}}dx$
(e) $\int_0^\infty \frac{x \sin x}{1+x^2} dx$
(f) $\int_0^\infty\frac{\sin x \sin 2 x}{x} dx$
For what values of $p$ and $q$ are the following convergent? Absolutely convergent?
(a) $\int_1^\infty \frac{x^p}{1+x^q}dx$
(b) $\int_1^\infty \frac{\sin x}{x^q} dx$
(c) $\int_1^\infty \frac{\sin x^p}{x} dx$
(d) $\int_1^\infty \frac{1-\cos x}{x^q} dx$
If $f$ is monotone and $\int_0^\infty f$ exists then $ f(x)\to 0$ as $x\to\infty$
A stronger version: If $f$ is monotone and $\int_0^\infty f$ exists then $x f(x)\to 0$ as $x\to\infty$
Feb 13: Exam 1
11AM to 1PM Room 215 W. Charlton
Feb 20 Linear Algebra. Continuity. Derivatives. Note: Lets concentrate on (*) questions that have not been covered in class.
Find the matrix representation of one of the following linear functions:
$L:\mathbb{R^2}\to\mathbb{R}^2$ that maps vector $\begin{bmatrix}1 \\1 \end{bmatrix}$ to $\begin{bmatrix}1\\0 \end{bmatrix}$
and vector $\begin{bmatrix}1 \\-1 \end{bmatrix}$ to $\begin{bmatrix}0\\1 \end{bmatrix}$
(*) $R_\alpha:\mathbb{R}^2\to \mathbb{R}^2$: rotation by angle $\alpha$
Properties of linear functions
(*) If there is a linear transformation $L:\mathbb{R}^p\to\mathbb{R}^q$ that is one-to-one (injective) then $p\leq q$.
(*) If a linear transformation $L:\mathbb{R}^p\to\mathbb{R}^p$ is invertible, then there is $\delta>0$ such that
$\|L(\vec x)\| \geq \delta \|x\|$ for all $\vec x$.
Compute the partial derivative $D_{\vec u}f(\vec x)$ for $f:\mathbb{R}^2\to\mathbb{R}^2$ given by $f(x,y)=(x^2-y^2 , x y)$ in the direction $\vec u=(a,b)$
Determine continuity at $(0,0)$ of the functions $f:\mathbb{R}^2\to \mathbb{R}$ given below.
(*) $f(x,y)=\begin{cases} \frac{x^2}{x^2+y^2} & x^2+y^2>0 \\
0 & x^2+y^2=0 \end{cases}$. Can we compute $D_{\vec u}(f)(0,0)$?
Coordinate-free differentiation in (finite dimensional) vector spaces of matrices $\mathcal{M}_{m\times n}$ and polynomials $\mathcal{P}_n$:
(*) If $f:\mathcal{M}_{m\times m}\to \mathcal{M}_{m\times m}$ is $f(X)=AX+XB$ with fixed matrices $A,B\in\mathcal{M}_{m\times m}$ then $f'(X)(H)=?$
What are the derivatives of $f:\mathcal{M}_{m\times m}\to \mathcal{M}_{m\times m}$ given by
$f(X)=X^T$
$f(X)=XX^T$
(*) What are the derivatives of
$f:\mathcal{P}_n\to\mathcal{P}_{n-1}$ given by $f(p)=\frac{d}{dx}p$
$g:\mathcal{P}_n\to\mathcal{P}_{2n}$ given by $g(p)=p^2$
Feb 27 More Derivatives.
If $f:E\to\mathbb{R}$ is differentiable, find the direction of its steepest growth:
find unit vector $\vec u=\vec{u}(\vec x)\in\mathbb{R}^p$ such that $\frac{d}{dt} f(\vec x+t \vec u)$ is largest.
(Hint: the answer is $\vec u= \nabla f (\vec x)/\|\nabla f (\vec x)\|$, so just prove that this works. For more hints, see Bartle Exercise 39.J)
(*) Determine $D_{\vec u}\phi(0,0)$ for $\phi(x,y)=xy^2/(x^2+y^2)$, $\phi(0,0)=0$. Does $\phi'(0,0)$ exist? (no) Is $\phi$ continuous? (yes, keep $x$ in the numerator, $x=0$ in the denominator)
If $f:\mathcal{M}_{2\times 2}\to \mathbb{R}$ is $f(X)=\det X$, what is $f'(I)$ (I'd use the coordinates!)
What is the derviative of $h:\mathcal{P}_n\to\mathcal{P}_{2n-1}$ given by $h(p)=p \frac{d}{dx}p$
This syllabus will be updated with additional information as it becomes available. Please refresh your browser to make sure that the updates are visible. (Revision date is at the top and at the bottom of this page!)
$\uparrow$