Contents: Math 414/514 is an introduction to Analysis on Euclidean spaces (). The emphasis is theoretical, as opposed to the more computational approach of calculus. From the Course Description on the Department’s site:

Introduction to fundamental elements of analysis on Euclidean spaces including the basic differential and integral calculus. Topics include: infinite series, sequences and series of function, uniform convergences, theory of integration, implicit function theorem and applications.

Grading: Based on homework. No late homework is allowed. Collaboration is encouraged, although you must turn in your own version of the solutions, and give credit to books/websites/… you consulted and people you talked/emailed/… to.

I do not want to have exams in this course. However, an important component of being proficient in mathematics is a certain amount of mental agility in recalling notions and basic arguments. I plan to assess these by requesting oral presentations of solutions to some of the homework problems throughout the term. If I find you lacking here, it will be necessary to have an exam or two. The final exam is currently scheduled for Wednesday, December 18, 2013, 12:00 – 2:00 pm.

I will use this website to post additional information, and encourage you to use the comments feature. If you leave a comment, please use your full name, which will simplify my life filtering spam out.

On occasion, I post links to supplementary material on Google+. Circle me and let me know if you are interested, and I’ll add you to my Analysis circle. As with this blog, I encourage you to comment there.

This entry was posted on Sunday, August 25th, 2013 at 11:26 pm and is filed under 414/514: Analysis I. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

One Response to 414/514 – Advanced calculus aka Analysis I – Syllabus

[…] for all closed measure zero sets , then is strong measure zero. (Since this was intended for my analysis course, and I do not see how to prove Pawlikowski’s argument without some appeal to results in […]

For positive integers $a_1,\dots,a_n$, recall that the multicolor Ramsey number $R(a_1,\dots,a_n)$ is the smallest integer $N$ such that if the edges of the complete graph $K_N$ are colored with the $n$ colors $1,\dots,n$, then there is some $i\le n$ and a set of $a_i$ vertices, all of whose edges received color $i$. A maximal Ramsey$(a_1,\dots,a_n)$-colorin […]

Georgii: Let me start with some brief remarks. In a series of three papers: a. Wacław Sierpiński, "Contribution à la théorie des séries divergentes", Comp. Rend. Soc. Sci. Varsovie 3 (1910) 89–93 (in Polish). b. Wacław Sierpiński, "Remarque sur la théorème de Riemann relatif aux séries semi-convergentes", Prac. Mat. Fiz. XXI (1910) 17–20 […]

It is not possible to provide an explicit expression for a non-linear solution. The reason is that (it is a folklore result that) an additive $f:{\mathbb R}\to{\mathbb R}$ is linear iff it is measurable. (This result can be found in a variety of places, it is a standard exercise in measure theory books. As of this writing, there is a short proof here (Intern […]

Stefan, "low" cardinalities do not change by passing from $L({\mathbb R})$ to $L({\mathbb R})[{\mathcal U}]$, so the answer to the second question is that the existence of a nonprincipal ultrafilter does not imply the existence of a Vitali set. More precisely: Assume determinacy in $L({\mathbb R})$. Then $2^\omega/E_0$ is a successor cardinal to ${ […]

Marginalia to a theorem of Silver (see also this link) by Keith I. Devlin and R. B. Jensen, 1975. A humble title and yet, undoubtedly, one of the most important papers of all time in set theory.

Equality is part of the background (first-order) logic, so it is included, but there is no need to mention it. The situation is the same in many other theories. If you want to work in a language without equality, on the other hand, then this is mentioned explicitly. It is true that from extensionality (and logical axioms), one can prove that two sets are equ […]

$L$ has such a nice canonical structure that one can use it to define a global well-ordering. That is, there is a formula $\phi(u,v)$ that (provably in $\mathsf{ZF}$) well-orders all of $L$, so that its restriction to any specific set $A$ in $L$ is a set well-ordering of $A$. The well-ordering $\varphi$ you are asking about can be obtained as the restriction […]

Gödel sentences are by construction $\Pi^0_1$ statements, that is, they have the form "for all $n$ ...", where ... is a recursive statement (think "a statement that a computer can decide"). For instance, the typical Gödel sentence for a system $T$ coming from the second incompleteness theorem says that "for all $n$ that code a proof […]

When I first saw the question, I remembered there was a proof on MO using Ramsey theory, but couldn't remember how the argument went, so I came up with the following, that I first posted as a comment: A cute proof using Schur's theorem: Fix $a$ in your semigroup $S$, and color $n$ and $m$ with the same color whenever $a^n=a^m$. By Schur's theo […]

It depends on what you are doing. I assume by lower level you really mean high level, or general, or 2-digit class. In that case, 54 is general topology, 26 is real functions, 03 is mathematical logic and foundations. "Point-set topology" most likely refers to the stuff in 54, or to the theory of Baire functions, as in 26A21, or to descriptive set […]

[…] for all closed measure zero sets , then is strong measure zero. (Since this was intended for my analysis course, and I do not see how to prove Pawlikowski’s argument without some appeal to results in […]