% Created 2026-04-13 Mon 14:43
% Intended LaTeX compiler: lualatex
\documentclass[a4paper, 11pt]{article}
\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{fontspec}
\directlua{luaotfload.add_fallback("mainfallback", {
  "TeX Gyre Termes:mode=node;",
  "Apple Color Emoji:mode=harf;",
})}
\setmainfont{Latin Modern Roman}[Ligatures=TeX, RawFeature={fallback=mainfallback}]
\setmonofont{Menlo}[Scale=0.9]
\usepackage{graphicx}
\usepackage{longtable}
\usepackage{wrapfig}
\usepackage{rotating}
\usepackage[normalem]{ulem}
\usepackage{capt-of}
\usepackage[dvipsnames]{xcolor}
\usepackage{hyperref}

% Paragraph heading formatting (for deep headline levels)
\usepackage{titlesec}
\titleformat{\paragraph}{\normalfont\normalsize\bfseries}{\theparagraph}{1em}{}
\titlespacing*{\paragraph}{0pt}{2.5ex plus 1ex minus .2ex}{1ex plus .2ex}
\setcounter{secnumdepth}{6}
\setcounter{tocdepth}{6}

% Paragraph spacing (no indent, vertical skip between paragraphs)
\usepackage[skip=10pt, indent=0pt]{parskip}

% Page margins
\usepackage[top=20mm,bottom=20mm,left=20mm,right=20mm]{geometry}

% List formatting
\usepackage{enumitem}
\setlist[description]{leftmargin=!,labelwidth=1.5em,itemindent=0pt}
\setlist[itemize]{leftmargin=1.5em,topsep=0pt}

\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{gensymb}
\setlength{\headheight}{13.59999pt}
\definecolor{linkblue}{HTML}{00007B}
\definecolor{exampleblue}{HTML}{4169E1}
\definecolor{highlightred}{HTML}{B22222}
\definecolor{highlightblue}{HTML}{0000FF}
\definecolor{notegray}{HTML}{7F807F}
\definecolor{highlightsalmon}{HTML}{F08080}
\definecolor{highlightgreen}{HTML}{006400}
\definecolor{examplebarbg}{rgb}{0.255, 0.41, 0.884}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{thmtools}
\usepackage{mathrsfs}
\usepackage{bm}
\usepackage{fancyhdr}
\pagestyle{fancy}
\fancyhf{}
\lhead{\textit{A.B}}
\rhead{\thepage}
\renewcommand{\headrulewidth}{0pt}
\usepackage{tikz}
\usepackage{caption}
\usetikzlibrary{arrows.meta, positioning, shapes.geometric, calc}
\usepackage{mdframed}
\usepackage[bottom]{footmisc}
\setlength{\parskip}{0pt plus 1pt}
\usepackage{titlesec}
\titleformat{\section}{\normalfont\normalsize\centering}{\thesection}{1em}{\scshape}
\titleformat{\subsection}{\normalfont\bfseries\fontsize{12}{14.4}\selectfont}{\thesubsection}{1em}{}
\titleformat{\subsubsection}{\normalfont\bfseries}{\thesubsubsection}{1em}{}
\newtheoremstyle{italicbody}{3pt}{3pt}{\itshape}{}{\bfseries}{.}{ }{}
\newtheoremstyle{uprightbody}{3pt}{3pt}{}{}{\bfseries}{.}{ }{}
\theoremstyle{italicbody}
\newtheorem{theorem}{Theorem}[subsection]
\newtheorem{lemma}{Lemma}[subsection]
\newtheorem{corollary}{Corollary}[subsection]
\newtheorem{proposition}{Proposition}[subsection]
\theoremstyle{uprightbody}
\newtheorem{definition}{Definition}[subsection]
\newtheorem{examplesinner}{Examples}[subsection]
\newtheorem{remark}{Remark}[subsection]
\newtheorem{result}{Result}[subsection]
\newmdenv[leftline=true,rightline=false,topline=false,bottomline=false,linewidth=3pt,linecolor=examplebarbg,innerleftmargin=10pt,innerrightmargin=0pt,innertopmargin=2pt,innerbottommargin=2pt,skipabove=3pt,skipbelow=3pt]{examplebox}
\newenvironment{examples}[1][]{\begin{examplebox}\refstepcounter{examplesinner}{\color{exampleblue}\sffamily\bfseries Examples~\theexamplesinner\ifx\\#1\\\else\ (#1)\fi.}\,}{\end{examplebox}}
\renewcommand{\theHtheorem}{\thesection.\thesubsection.\arabic{theorem}}
\renewcommand{\theHlemma}{\thesection.\thesubsection.\arabic{lemma}}
\renewcommand{\theHcorollary}{\thesection.\thesubsection.\arabic{corollary}}
\renewcommand{\theHproposition}{\thesection.\thesubsection.\arabic{proposition}}
\renewcommand{\theHdefinition}{\thesection.\thesubsection.\arabic{definition}}
\renewcommand{\theHexamplesinner}{\thesection.\thesubsection.\arabic{examplesinner}}
\renewcommand{\theHremark}{\thesection.\thesubsection.\arabic{remark}}
\renewcommand{\theHresult}{\thesection.\thesubsection.\arabic{result}}
\newcommand{\E}{\mathbb{E}}
\newcommand{\Var}{\operatorname{Var}}
\newcommand{\Cov}{\operatorname{Cov}}
\renewcommand{\P}{\mathbb{P}}
\newcommand{\Q}{\mathbb{Q}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\N}{\mathcal{N}}
\newcommand{\F}{\mathcal{F}}
\newcommand{\G}{\mathcal{G}}
\newcommand{\A}{\mathcal{A}}
\newcommand{\B}{\mathcal{B}}
\newcommand{\Sc}{\mathcal{S}^c}
\newcommand{\Lp}{\mathcal{L}}
\newcommand{\indic}{\mathbf{1}}
\DeclareMathOperator{\sgn}{sgn}
\newcommand{\hblue}[1]{{\color{highlightblue}#1}}
\newcommand{\hred}[1]{{\color{highlightred}#1}}
\newcommand{\hgray}[1]{{\color{notegray}#1}}
\newcommand{\hsalmon}[1]{{\color{highlightsalmon}#1}}
\newcommand{\hgreen}[1]{{\color{highlightgreen}#1}}
\renewcommand{\qedsymbol}{$\blacksquare$}
\pagestyle{empty}
\geometry{a4paper, top=2cm, left=1cm, right=1cm}
\date{}
\title{Informal Measure Theory Notes}
\makeatletter\@ifpackageloaded{xcolor}{}{\usepackage{xcolor}}\makeatother
\definecolor{DeepNavy}{HTML}{00007B}
\hypersetup{
 pdfauthor={Aayush Bajaj},
 pdftitle={Informal Measure Theory Notes},
 pdfkeywords={},
 pdfsubject={},
 pdfcreator={Emacs 30.2 (Org mode 9.7.11)},
 pdflang={English},
 colorlinks=true,
 linkcolor=DeepNavy,
 urlcolor=DeepNavy
}\begin{document}

\pagestyle{fancy}
\begin{center}
{\bfseries \large Informal Measure Theory Notes} \\[0.5em]
April 2026
\end{center}
\tableofcontents
\dotfill
\newpage
\section{Warm-up}
\label{sec:org61cc80f}

To start I think it might be worth-while to prove some basic limits:
\subsection{Epsilons and Limits}
\label{sec:org4e4d6e8}

\begin{definition}
The statement $\lim_{x\to\infty} x_n = x$ means that for any real $\epsilon > 0 $, there is a number $N>0$ for which $n\ge N$ implies $|x_n-x|<\epsilon$.
\end{definition}

\begin{theorem}[Archimedean Property]
\label{thm:archimedean}
If $x\in\R$, $y\in\R$, and $x>0$, then there is a positive integer $n$ such that \begin{equation}\label{eq:1}nx>y\end{equation}
\end{theorem}
\begin{proof}
Let $A$ be the set of all $nx$, where $n$ runs through the positive integers. If \ref{eq:1} were false ($nx\le y$), then $y$ would be an upper-bound of $A$. But then $A$ has a least upper bound in $\R$. Put $\alpha = \sup A$. Since $x>0$, $\alpha - x < \alpha$, and $\alpha - x$ is not an upper bound of $A$. Hence $\alpha - x < mx$ for some positive integer $m$. But then $\alpha < (m+1)x\in A$, which is impossible, since $\alpha$ is an upper bound of $A$.

\end{proof}

\begin{proposition}
  \[ \lim_{n\to \infty} \frac{1}{n} = 0\]
\end{proposition}

\begin{proof}
  Let $N\in\mathbb{N}$ such that $\tfrac1N < \epsilon$ (By \hyperref[thm:archimedean]{the Archimedean Property}). Then let $n\ge N$ such that:
  \begin{align*}
    n \ge N &> \tfrac1\epsilon\\
    \tfrac1n \le \tfrac1N &< \epsilon \qquad\text{taking reciprocals} \\
    |\tfrac1n - 0| = |\tfrac1n| &= \tfrac1n\qquad\text{since $\tfrac1n$ is always positive for $n\in\mathbb{N}$}\\
    &<\epsilon
  \end{align*}
\end{proof}

\begin{proposition}
  \begin{align*}
    \lim_{n\to\infty}\frac{1}{n^k} &= 0\qquad\text{for any $k>0$}.\\
                                  &\iff |\frac{1}{n^k} - 0| < \epsilon, \epsilon > 0, n > N \in \mathbb{N} \\
                                  &\iff \frac{1}{n^k} < \epsilon\qquad\text{since $n^k > 0$}
  \end{align*}
\end{proposition}

\begin{proof}
  Let $N > \epsilon^{-\frac{1}{k}}$ (by Archimedean Property of Natural Numbers) and $n \ge N$.
  Then
  \begin{align*}
    n&> \left( \frac{1}{\epsilon} \right)^{\frac{1}{k}}\\
    \Rightarrow n^k &> \left( \frac{1}{\epsilon} \right) \\
    \Rightarrow \frac{1}{n^k} &< \epsilon
  \end{align*}
\end{proof}


\begin{proposition}
$$\lim_{n\to\infty}2^{\frac{1}{n}} = 1$$
\end{proposition}

\begin{proof}
  Let $\epsilon > 0$. Since $2^{1/n} > 1$ for all $n \in \mathbb{N}$, 
  we have $|2^{1/n} - 1| = 2^{1/n} - 1$.
  Since $\epsilon > 0$, we have $\epsilon + 1 > 1$, so $\log(\epsilon+1) > 0$.
  Let $n \ge N > \log_{\epsilon+1} 2 = \frac{\log 2}{\log(\epsilon+1)}$
  (by \hyperref[thm:archimedean]{Archimedean Property}). Then
  \begin{align*}
    n &> \frac{\log 2}{\log(\epsilon+1)} \\
    \Rightarrow \frac{1}{n} &< \frac{\log(\epsilon+1)}{\log 2} \\
    \Rightarrow \log\left(2^{\frac{1}{n}}\right) &< \log(\epsilon+1) \\
    \Rightarrow 2^{\frac{1}{n}} &< \epsilon + 1 \\
    \Rightarrow \left|2^{\frac{1}{n}} - 1\right| &< \epsilon. \qedhere
  \end{align*}
\end{proof}


\begin{proposition}
If $\lim_{n\to\infty} x_n = x$ and $a \in \mathbb{R}$, then $\lim_{n\to\infty} ax_n = ax$.
\end{proposition}
\begin{proof}
  If $a = 0$ then $ax_n = 0 = ax$ for all $n$ and the result is immediate.
  Now suppose $a \neq 0$ and let $\epsilon > 0$. Since $\lim_n x_n = x$, there exists $N \in \mathbb{N}$
  such that $n \ge N$ implies, $|x_n -x | < \frac{\epsilon}{|a|}$. Then for $n\ge N$,
  \[
    |ax_n - ax| = |a||x_n - x| < |a| \cdot \frac{\epsilon}{|a|} = \epsilon.
  \]
\end{proof}


\begin{proposition}
If $\lim_{n\to\infty} x_n = x$ and $\lim_{n\to\infty} y_n = y$, then $\lim_{n\to\infty} (x_n + y_n) = x + y$.
\end{proposition}

\begin{proof}
  Let $\epsilon > 0$. Since $\lim_n x_n = x$, there exists $N_1 \in \mathbb{N}$ 
  such that $n \ge N_1$ implies $|x_n - x| < \frac{\epsilon}{2}$.
  Since $\lim_n y_n = y$, there exists $N_2 \in \mathbb{N}$ such that 
  $n \ge N_2$ implies $|y_n - y| < \frac{\epsilon}{2}$.
  Let $N = \max(N_1, N_2)$. Then for $n \ge N$, by the triangle inequality,
  \[
    |(x_n + y_n) - (x+y)| \le |x_n - x| + |y_n - y| 
    < \frac{\epsilon}{2} + \frac{\epsilon}{2} = \epsilon. \qedhere
  \]
\end{proof}

\begin{proposition}
If $\lim_{n\to\infty} x_n = x$ and $\lim_{n\to\infty} y_n = y$, then $\lim_{n\to\infty} (x_n \cdot y_n) = x\cdot y$.
\end{proposition}

\begin{proof}
  Let $\epsilon > 0$. Consider
  \begin{align*}
    x_n y_n - xy &= x_n y_n - x_n y + x_n y - xy \\
                 &= x_n(y_n -y ) + y(x_n -x)
  \end{align*}
  Then by the Triangle inequality and by the boundedness of convergent sequences we obtain:
  \begin{align*}
    |x_n y_n -xy| &\le |x_n | | y_n -y | + |y| |x_n - x| \\
                  &< M \frac{\epsilon}{2M} + |y| \frac{\epsilon}{2|y|}\\
    &=\epsilon
  \end{align*}
  where $M>0$.
\end{proof}

\begin{proof}
  Let $\epsilon > 0$. If $y = 0$ then $x_n y_n = 0 = xy$ for all $n$ and the result is immediate.
  Now suppose $y \neq 0$. Since $x_n \to x$, the sequence $(x_n)$ is bounded, so there exists 
  $M > 0$ such that $|x_n| \le M$ for all $n$. Since $\lim_n x_n = x$, there exists 
  $N_1 \in \mathbb{N}$ such that $n \ge N_1$ implies $|x_n - x| < \frac{\epsilon}{2|y|}$.
  Since $\lim_n y_n = y$, there exists $N_2 \in \mathbb{N}$ such that $n \ge N_2$ implies 
  $|y_n - y| < \frac{\epsilon}{2M}$. Let $N = \max(N_1, N_2)$. Then for $n \ge N$, 
  by the add-and-subtract identity and the triangle inequality,
  \begin{align*}
    |x_n y_n - xy| &= |x_n(y_n - y) + y(x_n - x)| \\
                   &\le |x_n||y_n - y| + |y||x_n - x| \\
                   &< M \cdot \frac{\epsilon}{2M} + |y| \cdot \frac{\epsilon}{2|y|} \\
                   &= \frac{\epsilon}{2} + \frac{\epsilon}{2} = \epsilon. \qedhere
  \end{align*}
\end{proof}

\begin{proposition}
  If $\lim_{n\to\infty} x_n = x$ and $x \neq 0$, then $\lim_{n\to\infty} \frac{1}{x_n} = \frac{1}{x}$.
\end{proposition}
\begin{proof}
  Let $\epsilon > 0$. Since $x_n \to x$ and $|x| > 0$, there exists $N_1 \in \mathbb{N}$ 
  such that $n \ge N_1$ implies $|x_n - x| < \frac{|x|}{2}$. By the reverse triangle 
  inequality this gives $|x_n| \ge |x| - |x_n - x| > \frac{|x|}{2}$, so 
  $\frac{1}{|x_n|} < \frac{2}{|x|}$ for all $n \ge N_1$.
  There also exists $N_2 \in \mathbb{N}$ such that $n \ge N_2$ implies 
  $|x_n - x| < \frac{|x|^2 \epsilon}{2}$.
  Let $N = \max(N_1, N_2)$. Then for $n \ge N$,
  \begin{align*}
    \left|\frac{1}{x_n} - \frac{1}{x}\right| &= \frac{|x_n - x|}{|x_n||x|} \\
                                              &< \frac{2}{|x|^2} |x_n - x| \\
                                              &< \frac{2}{|x|^2} \cdot \frac{|x|^2 \epsilon}{2} 
                                              = \epsilon. \qedhere
  \end{align*}
\end{proof}
\end{document}