CoCalc Shared Filestop_brown.tex
Author: boog woogs
Views : 7
1\documentclass{amsart}
2\newcommand{\R}{\mathbf{R}}
3\newcommand{\N}{\mathbf{N}}
4\newcommand{\Z}{\mathbf{Z}}
5\newcommand{\Q}{\mathbf{Q}}
6\newcommand{\I}{\mathbf{I}}
7\newcommand{\ndef}{\overset{\mathrm{def}}{=\joinrel=}}
8\usepackage{amssymb}
9\newtheorem{define}{Definition}
10\let\oldemptyset\emptyset
11\let\emptyset\varnothing
12
13\begin{document}
14\section*{$\R$-analysis (Brown)}
15\emph{$f \in C^0\{a\}$ short for $f$ continuous at $a$} \\
16\emph{intervals $(x - r, x+ r)$ sometimes notated $(x \pm r)$ or $B^r_x$} \\
17\emph{subsets proper unless $\subseteq$}
18\subsection*{1.1}
19    \subsubsection*{1.1.1 Show equivalance of the following:}  \begin{itemize}
20\item (a) $N \in Op(x)$ (a neighborhood of $x$)
21\item (b) $[x \pm \delta] \subset N$
22\item (c) $[x \pm n^{-1}] \subset N$
23    \end{itemize}
24\begin{proof}$\exists \delta': (x - \delta',x+ \delta') \subset N$. \\ Defining $\delta = \frac{1}{3}\delta', [x - \delta, x + \delta] \subset x - \delta', x + \delta') \subset N$ \\
25$(a) \implies (b)$ \\
26
27Fixing $\delta < 1, \exists n: 1 < n\delta \implies n^{-1} < \delta$ and $[x \pm n^{-1}] \subset [x \pm \delta] \subset N$ \\
28$(b) \implies (c)$ \\
29$(c) \implies (a)$ \\ \end{proof}
30    \subsubsection*{1.1.2 Prove $Int(\bold{FinSet}) = \emptyset$}
31\begin{proof} let $x,y$ be distinct points and fix $\epsilon = \frac{1}{3}\inf_{x,y \in S}d(x,y)>0$. \\
32$d(x,x + \epsilon) < \inf_S d(x,y) \implies x \pm \epsilon \notin S$.
33\end{proof}
34    \subsubsection*{1.1.3 Prove $Int(A \cap B ) = Int A \cap Int B$ }
35\begin{proof}Holds trivially for empty sets. elements satifying $x+\epsilon_2 \leq x+\epsilon' \in Int A, x+\epsilon'' \in Int B$ are exactly $Int A \cap Int B$. The interior of the intersection are elements $x+\epsilon_1:\epsilon_1 = \inf\{\epsilon',\epsilon''\}$ ie simultaneously interior $A\cap B$ \\
36Clearly $x + \epsilon_2 \leq x + \epsilon_1 \implies Int A \cap Int B \subset Int(A \cap B )$ and for nonempty $A,B, Int(A \cap B ) \subset Int A \cap Int B$. Therefore, $Int(A \cap B ) = Int A \cap Int B$   \end{proof}
37    \subsubsection*{1.1.4 Does the converse, $Int(A \cup B ) = Int A \cup Int B$ hold? }
38
39No. \\ Consider $A= [0,1),B=[1,2]: Int(A \cup B ) = (0,2) \not= Int A \cup Int B = (0,2) - \{1\}$
40    \subsubsection*{1.1.5 Does $Int\bigcap A_i = \bigcap Int A_i$?}
41\begin{proof}
42Use induction. from 1.1.3, $Int(A \cap B ) = Int A \cap Int B$.\\
43$Int \left(A_i \cap (\bigcap A_{i-1})\right) = Int(\bigcap A_{i})$. Conversely, $Int A_i \cap Int \bigcap A_{i-1} = \bigcap Int A_i$.
44\end{proof}
45    \subsubsection*{1.1.6-8. Show neighborhoods preserve addition, multiplication and inverse operations}
46\begin{proof}
47\emph{1.1.6 (addition)} Setting $$\epsilon_1 = \epsilon_2 = \frac{\epsilon}{3}$$
48$(a+\epsilon_1)+(b+\epsilon_2) = (a+b) + \frac{2}{3}\epsilon < (a+b) + \epsilon \qed$ \\
49\emph{1.1.7 (multiplication)} [works for $\epsilon \leq 1$] Setting $$\epsilon_1 = \epsilon_2 = \inf \left\{????, \frac{\epsilon}{2} \inf \left\{1,\frac{1}{a+b}\right\}\right\}$$
50$(a+\epsilon_1)(b+\epsilon_2) = \begin{cases} ab + \frac{1}{2}\epsilon + \frac{1}{4}\epsilon^2 < ab+\frac{3}{4}\epsilon & \frac{1}{a+b} \leq 1\\ ab + \frac{\epsilon}{2}(a+b) + \frac{1}{4}\epsilon^2 < ab + \frac{\epsilon}{2} + \frac{1}{4}\epsilon^2 &\frac{1}{a+b} > 1 \end{cases} \qed$ \\
51\emph{1.1.8 (multiplicative inverses)}
52 \end{proof}
53    \subsubsection*{1.1.9 Prove $Int(Int A) = Int A$}
54\begin{proof}
55asdf
56\end{proof}
57    \subsubsection*{1.1.10 Show there are exactly 14 subsets generated by the complementation and Int operators from base sets $A_1,A_2,A_3$}
58\subsection*{1.2} $f$ \emph{continuous} at $a$: $\forall V_{f(a)} \exists U_a:f[U_a] \subset V \iff \lim_{x \to a}f(x) = f(a)$
59    \subsubsection*{1.2.1 For $f,g \in C^0\{a\}, \exists? h,h'|a \in C^0: h=f+g, h'=f*g \in C^0, \frac{f}{g}$}
60\begin{proof}
61Fix $\delta := \min\{\delta',\delta''\}, h(x):=f(x)+g(x)$.
62
63Then $h(x + \delta) = f(x+\delta)+g(x + \delta) \leq f(x)+g(x) + \epsilon' + \epsilon''$
64\end{proof}
65    \subsubsection*{1.2.2 Prove squeeze, demonstrate with  $x\sin\frac{1}{x}$}
66\begin{proof}
67asdf
68\end{proof}
69    \subsubsection*{1.2.3 Prove $f|_{A \cap N} \in C^0\{a\} \implies f \in C^0\{a\}$}
70\begin{proof}
71asdf
72\end{proof}
73    \subsubsection*{1.2.4 Show $f(x):= x, x \in [0,1);f(x):=x-1, x \in [2,3]$ continuous and injective but $f^{-1} \not\in C^0\{1\}$}
74\begin{proof}
75asdf
76\end{proof}
77    \subsubsection*{1.2.5 Prove monotone bij function $f: [a,b] \to [c,d]$ continuous}
78\begin{proof}
79asdf
80\end{proof}
81    \subsubsection*{1.2.6 $f \in End(\R)$, show $f \in C^0\R \iff f^{-1}IntA \subset Int f^{-1}[A]$}
82\begin{proof}
83asdf
84\end{proof}
85    \subsubsection*{1.2.7 Show equivalance of the following:}  \begin{itemize}
86\item (a) $f \in C^0\{0\}$
87\item (b) $\forall \epsilon >0, \exists \delta: f(a - \delta, a + \delta) \subset (f(a) - \epsilon, f(a) + \epsilon)$
88\item (c) $\forall n \in \N, \exists m: f(a - m^{-1}, a + m^{-1}) \subset (f(a) - n^{-1}, f(a) + n^{-1})$
89    \end{itemize}
90\begin{proof}
91asdf
92\end{proof}
93    \subsubsection*{1.2.8 (Gluing theorem) Suppose there exists a function}
94    $$f: A \to \R: f|_{A_1,A_2} \in C^0\{0\}, A = \bigcup A_i, a \in \bigcap A_i$$
95\begin{proof}
96poof
97\end{proof}
98    \subsubsection*{1.2.9 Prove $\big| {\hom_{C^0}[\I,\R]} \big| \not\in \aleph_0$}
99\begin{proof}
100Try iso from R to I to R then compound map is an R-automorphism,  the constant functions should be uncountable and continuous.
101\end{proof}
102{    }
103\subsection*{1.3 More Int, Ext and Fr}
104\end{document}
105