Guide to Walter Rudin's Principles Of Mathematical Analysis - Intro

Walter Rudin's principles of Mathematical Analysis is generally considered the de facto standard textbook for the subject. But it is not an easy read. As I am going through several chapters of it, I thought it may be of use to others to post some further details on the material. I am using his third edition textbook. Professor Rudin's style is terse. Although the result is concise and elegant, detailed steps are usually omitted from his proofs. So I plan to post some of those extra details here along with other relevant information.

Besides any supplementary info on Rudin's book, I also plan to post on other topics in analysis.

Comments

Post a Comment

Popular posts from this blog

Fourier Transform of Single Frequency Sines and Cosines

Image
Fourier Transform Of Single Frequency Sines And Cosines The Fourier transform (FT) of function $f(x)$ is defined as follows: $$ F(k) = \frac{1}{\sqrt{2 \pi}} \int_{-\infty}^{\infty} f(x) e^{-ikx} dx $$ The FT is dervived from a Fourier series in complex notation. The Fourier series expands a function into a weighted set of orthogonal basis functions. In case of the FT, the basis functions are sines and cosines. Sines and cosines are periodic on $2\pi$ meaning that the functions repeat themselves at increments of $2 \pi$. The principle idea is that we can represent most functions as a linear combination - a weighted sum - of sine and cosine basis functions. When a function of time $t$ is Fourier transformed, the components of the FT correspond to frequencies of the basis sines and cosines. Frequency is proportional to inverse time. The FT space is often called reciprocal space. If the function transformed were a function of position $x$, the FT is a function of inverse position. I...
Read more

Video Background Subtraction With Dynamic Mode Decomposition

In this UW AMATH582 assignment we will subtract stationary background from videos of moving objects using Dynamic Mode Decomposition (DMD). We approximate the unknown dynamics with a linear system by organizing the image sequence into two sets related by the linear difference equation allowing us to solve for its matrix by least squares. We then discard the low frequency mode corresponding to the static background. Read a detailed explanation of Dynamic Mode Decomposition and its application to video background subtraction here . The Github project is availabe here: https://github.com/aruymgaart/AMATH/tree/master/video_background_dynamic_mode_decomposition_582HW5 . Python implementation of DMD:
Read more

MNIST Classification LDA SVM CART & Generalized Eigenvalue Problems

In this UW assignment report we analyze the MNIST handwritten digit dataset. We start with Principal Component Analysis (PCA) for dimensionality reduction and visualization. Visualization of the digits is accomplished by projection on 3 principal components such that each image is represented by a single 3D point. We next build a few supervised classifiers and compare their accuracy. Classification methods explored in this report include Linear Discriminant Analysis (LDA), Support Vector Machine (SVM) and Classification And Regression Tree (CART) used in the classification mode. Read a detailed explanation of MNIST classification with LDA, SVM & CART in terms of eigenvalue problems here . The Github project is availabe here: https://github.com/aruymgaart/AMATH/tree/master/MNIST_classifier_LDA_SVM_CART_582HW4 . Python implementation of DMD:
Read more