I’m taking algebraic topology by Professor Zworski!

Story 1: Linear Algebra

Relevant Lectures: Lecture 1

We started out by defining cosets and quotient spaces, and then the first isomorphism theorem for vector spaces. Hahaha this is a homework problem I did for COMPSCI 189 yesterday!

We study the rest of mathematics because linear algebra is too hard. - Taylor, according to Zworski.

Zworski’s Favorite Fact from Linear Algebra (Shur’s Complement Formula). Suppose [T11T12T21T22]\begin{bmatrix} T_{11} & T_{12} \\ T_{21} & T_{22}\end{bmatrix} is invertible, so [T11T12T21T22]1=[S11S12S21S22],\begin{bmatrix} T_{11} & T_{12} \\ T_{21} & T_{22}\end{bmatrix}^{-1} = \begin{bmatrix} S_{11} & S_{12} \\ S_{21} & S_{22}\end{bmatrix}, Sij:WjViS_{ij} : W_j \rightarrow V_i. Then [T11T_{11} is invertible if and only if S22S_{22} is invertible]. In that case, T111=S11S12S221S21.T_{11}^{-1} = S_{11} - S_{12} S_{22}^{-1}S_{21}.

Why is this interesting? Suppose we start with P:H1H2P : H_1 \rightarrow H_2 and we can find R:HH2R_{-} : H_- \rightarrow H_2 and R+:H1H+R_+ : H_1 \rightarrow H_+ such that (PRR+0):HHHH+\begin{pmatrix} P & R_{-} \\ R_+ & 0 \end{pmatrix} : H \oplus H_- \rightarrow H\oplus H_+ is invertible and (PRR+0)1=(EE+EE+):H2H+H1H\begin{pmatrix} P & R_- \\ R_+ & 0 \end{pmatrix}^{-1} = \begin{pmatrix} E & E_+ \\ E_- & E_{-+}\end{pmatrix} : H_2 \oplus H_+ \rightarrow H_1 \oplus H_- then PP is invertible if and only if the stuff from the theorem. Then we have reduced the invertibility of PP to something else. It is used in linear algebra for reducing huge systems in linear algebra to much smaller finite ones.

This problem of something is called a Grushih problem. “The key here is stability under perturbations and so on”. Although I have no clue what perturbations he is talking about.

Example. Take P=λJP = \lambda - J where JJ is a Jordan block matrix (has an off-diagonal of ones).

Remark. There are two types of multiplicity for the eigenvalues of the jordan block matrix. The geometric and algebraic multiplicities are 1 and nn. We can try to find R+R_+ and RR_-.

We would lke to compute the determinant of (λJene10)\begin{pmatrix} \lambda - J & e_n \\ e_1 & 0 \end{pmatrix} where ene_n and e1e_1 are the basis vectors. Then this matrix is invertible since it has determinant 1-1, so we can reduce its invertibility so another property. We can choose this RR_- and R+R_+ because one of them lies in the kernel of JJ and the other lies in the kernel of J+J^+. In the generral case though, it is an art.

Story 2: Dimension

Relevant Lectures: 1

Dimension of VV being nn is the same as saying there exists a corresponding basis of nn vectors for VV. This is for finite idmensional vector spaes, and if this is not possible, we say that the dimension is infinite. Hormander actually has another different amusing definition of dimension for vector spaces.

Equivalently, dim\dim is a functor from the category of vector spaces to N\N such that

Example. dim(V1/kerT)=dimIm T\dim (V_1/\ker T) = \dim \text{Im }T.

We say: Rank T=dimIm T=codim kerT\text{Rank }T = \dim \text{Im }T = \text{codim } \ker T where codim W=dimV/W\text{codim } W = \dim V/W with WVW \subseteq V.

Theorem. Suppose WVW \subseteq V. The n dimW+codim W=dimV\dim W + \text{codim } W = \dim V.

Proof.

Since dimWdimV\dim W \le \dim V and codim WdimV\text{codim } W \le \dim V, we can assume that dimW\dim W and codim W\text{codim } W are finite, because otherwise we just have infinities summing together.

T1:KnVT_1 : K^n \rightarrow V and T2:KmV/WT_2 : K^m \rightarrow V/W bijection. There exists T~2:KmV\tilde{T}_2 : K^m \rightarrow V such that T~2π=T2\tilde{T}_2 \circ \pi = T_2, π:VV/W\pi : V \rightarrow V/W. The tilde mappings are called “lifts” of the non-tilde mappings. T2ej=xj+W,T~2(ajej):=ajxjT_2 e_j = x_j + W, \tilde{T}_2(\sum a_j e_j) := \sum a_j x_j eje_j a basis of KmK^m.

T:T1T~2:Kn+m(a,b)T1a+T~2bVT: T_1 \oplus \tilde{T}_2 : K^{n+m} \ni (a,b) \mapsto T_1 a + \tilde{T}_2 b \in V

Claim. TT is an isomorphism.

Theorem. Take T:V1V2T : V_1 \rightarrow V_2. Then, dimIm T+dimkerT=dimV1\dim \text{Im }T + \dim \ker T = \dim V_1, and codim Im T+codim kerT=dimV2\text{codim } \text{Im }T + \text{codim } \ker T = \dim V_2.

Remark. These are both the same infinite dimensions but in infinite dimensions, one might be trivial and the other is useful. Apparently long ago in Zworski’s linear algebra class they did this proof via row and column operations to prove an equivalent statement that the row major is the same as the column major. With algebra we can do it much easier.

If dimVj<\dim V_j < \infty, then we define the index: ind(T)L=dimkerTcodim Im T=dimV1dimV2\text{ind}(T) L= \dim \ker T - \text{codim } \text{Im }T = \dim V_1 - \dim V_2

Story 3: Index of a Transformation

Relevant Lectures: Lecture 1, Lecture 2

Suppose dimkerT<\dim \ker T < \infty or dim(V2/Im T)<\dim (V_2/\text{Im }T) < \infty. Then ind(T)=dimkerTcodim Im T\text{ind}(T) = \dim \ker T - \text{codim } \text{Im }T

Theorem 1. Suppose that T1:V1V2T_1 : V_1 \rightarrow V_2 and T2:V2V3T_2 : V_2 \rightarrow V_3. Suppose that dimkerTj<\dim \ker T_j < \infty or dimcokerTj<\dim \text{coker} T_j < \infty (cokerT=V2/Im T\text{coker} T = V_2/\text{Im }T). Then the index of T2T1T_2T_1 is well defined and ind(T2T1)=ind(T1)+ind(T2)\text{ind}(T_2T_1) = \text{ind}(T_1) + \text{ind}(T_2) follows from the definition of the index.

Theorem 2. If S:V1V2S : V_1 \rightarrow V_2 has finite rank and ind T\text{ind }T is defined, then ind\text{ind} of T+ST+ S is well defined and ind(T+S)=ind(T)\text{ind}(T+ S) = \text{ind}(T).

0V0T0V1T1TN1VN00 \rightarrow V_0 \xrightarrow{T_0} V_1 \xrightarrow{T_1} \dots \xrightarrow{T_{N-1}} V_N \rightarrow 0 is called a complex if Tk+1Tk=0T_{k+1}T_k = 0 or kerTk+1Im Tk\ker T_{k+1} \supseteq \text{Im }T_k.

An example of a complex from MATH 53:

Example. V0=V3=C(R3,R)V_0 = V_3 = C^\infty(\R^3, \R), V1=V2=C(R3,R3)V_1 = V_2 = C^\infty(\R^3, \R^3), T0=T_0 = \nabla, T1=×T_1 = \nabla \times, T2=T_2 = \nabla \cdot. For sophisticated people, this is a special example of the de Rham complex.

A complex is called exact if Im Tk=kerTk+1\text{Im }T_k = \ker T_{k+1}.

Example. The complex from the previous example is actually exact! Lol this is related to the question I asked the quantum mechanics professor.

Example (Exact sequences).

Theorem. For exact complexes, dimV2j=dimV2j+1.\sum \dim V_{2j} = \sum \dim V_{2j +1}. If dimVj<\dim V_j < \infty, then (1)jdimVj=0\sum (-1)^j \dim V_j = 0.

This result will allow us to show Theorem 2 by constructing an appropriate exact complex.

Proof.

Let Rk+1=kerTk+1=Im TkR_{k+1} = \ker T_{k+1} = \text{Im }T_k. Then dimVk=dimRk+dimRk+1\dim V_k = \dim R_k + \dim R_{k+1} Now, dimV2k=dimR2k+dimR2k+1==dimV2k+1\sum \dim V_{2k} = \sum \dim R_{2k} + \dim R_{2k+1} == \sum \dim V_{2k+1}

Remark. Another method is to actually shorten the exact sequence by taking quotients and then do stuff.

Story 4: Fedholm Operations

Recall that an operator T:V1V2T : V_1 \rightarrow V_2 is Fredholm when dimkerT<\dim \ker T < \infty and dimcoker T<\dim \text{coker } T < \infty.

ind(T)=dimkerTdimcoker T\text{ind}(T) = \dim \ker T - \dim \text{coker } T

Example. V1=V2={a=a1a2a3...ajK}V_1 = V_2 = \{a = a_1a_2a_3...a_j \in K\}.

Tna=an+1an+2...nZ,al=0,l0T_na = a_{n+1}a_{n+2}...\qquad n \in \Z, a_l = 0, l \le 0
To be honest I’m a bit unsure on what was going on here.

\dim \ker T_n = \left\{ \begin{array}\{0\} & n \le 0 \\ n & n > 0 \end{array} \right.

Last time, we said V1VV_1 \supseteq V and x∉V1x \not\in V_1 implies there is a hyperplane V2V_2 such that V2V_2 contains V1V_1 and xx isn’t in V2V_2.

Theorem. Suppose W1VW_1 \subseteq V, dimW1<α\dim W_1 < \alpha. Then \exists W2W_2 such that W1W2={0}W_1 \cap W_2 = \{0\}, W1+W2=VW_1 + W_2 = V, and codim W2=dimW1\text{codim }W_2 = \dim W_1.

Proof Sketch.

Take xW1\{0}x \in W_1 \backslash \{0\}. There is a hyperplane H1H_1 such that x∉H1x \not \in H_1, so that H1+W1=VH_1 + W_1 = V, and so

dim(W1H1)+codim H1=codim (W1+H1)+dimW1\dim (W_1 \cap H_1) + \text{codim }H_1 = \text{codim }(W_1 + H_1) + \dim W_1
so dim(W1H1)=dimW11\dim(W_1 \cap H_1) = \dim W_1 - 1. So now repeating this process, we can find:
dim(W1H1H2...Hk)=dimW1k\dim(W_1 \cap H_1 \cap H_2 \cap ... \cap H_k) = \dim W_1 - k
for 0kdimW1=d0 \le k \le \dim W_1 = d, so that W2=H1...HdW_2 = H_1 \cap ... \cap H_d. Now we get:
dim(W1W2)+codim W2=codim(W1+W2)+dimW1\dim (W_1 \cap W_2) + \text{codim }W_2 = \text{codim}(W_1 + W_2) + \dim W_1
and now dim(W1W2)=0\dim (W_1 \cap W_2) = 0. Also,
codim(H1H2)codim(H1H2)+codim(H1+H2)=codim(H1)+codim(H2)\text{codim}(H_1 \cap H_2) \le \text{codim}(H_1 \cap H_2) + \text{codim}(H_1 + H_2) = \text{codim}(H_1) + \text{codim}(H_2)
so inductively,
codim W2j=1dcodim Hj=d\text{codim }W_2 \le \sum_{j=1}^d \text{codim }H_j = d
and also
codim W2dimW1=d\text{codim }W_2 \ge \dim W_1 = d
so codim W2=d\text{codim }W_2 = d.

Theorem. T:V1V2T : V_1 \rightarrow V_2 is a Fredholm operator if and only if there exist R:VV2R_- : V_- \rightarrow V_2, R+:V+V1R_+ : V_+ \rightarrow V_1 such that (TRR+0)1=(EE+EE+)\begin{pmatrix} T & R_- \\ R_+ & 0 \end{pmatrix}^{-1} = \begin{pmatrix} E & E_+ \\ E_- & E_{-+}\end{pmatrix} exists and E+E_{-+} is a Fredholm operator in which case ind T=ind E+\text{ind }T = \text{ind }E_{-+}

For the first direction, we use Theorem 1 to get a W2W_2 satisfying kerTW2=0\ker T \cap W_2 = 0, W2+kerT=VW_2 + \ker T = V, dimkerT=n+\dim \ker T = n_+. Lte x1,,xn+x_1,\dots,x_{n_+} be a basis of kerT\ker T. There exists Lj:V1KL_j : V_1 \rightarrow K such that Lj(xi)=δijL_j(x_i) = \delta_{ij}, yV1y \in V_1, y=ajxj+yy = \sum a_j x_j + \overline{y}, yW2\overline{y} \in W_2, Lj(y)=ajL_j(y) = a_j.

V+:=Kn+V_+ := K^{n_+}, R+:V1Kn+R_+ : V_1 \rightarrow K^{n_+}. y(L1(y),...,Ln+(y))y \mapsto (L_1(y),...,L_{n_+}(y)).

Choose a basis of V2/Im TV_2/\text{Im }T.

Similarly, we do V=:=KnV_= := K^{n_-}, and (b1,...,bn)j=1nbjyj(b_1,...,b_{n_-}) \mapsto \sum_{j=1}^{n_-} b_j y_j.

We now wish to show that R+R_+ is surjective. So

(TRR+0):V1VV2V+\begin{pmatrix} T & R_{-} \\ R_{+} & 0\end{pmatrix} : V_1 \oplus V_- \rightarrow V_2 \oplus V_+
is surjective. So what we have shown (I’ve omitted most of the proof about Tu+j=1nbjyj=0Tu + \sum_{j=1}^n b_j y_j = 0 and stuff) is that if the operator is Fredholm, then we can set up this thing so that it is invertible. We also get that E+:Kn+KnE_{-+} : K^{n_+} \rightarrow K_{n_-} is clearly Fredholm since n+n_+ and nn_- are finite.

To show the other direction, first we observed that R+R_+ is surjective and RR_- is injective by actually multiplying out (TRR+0)(EE+EE+)\begin{pmatrix}T & R_- \\ R_+ & 0 \end{pmatrix}\begin{pmatrix} E & E_+ \\ E_- & E_{-+} \end{pmatrix} and (EE+EE+)(TRR+0).\begin{pmatrix} E & E_+ \\ E_- & E_{-+} \end{pmatrix}\begin{pmatrix}T & R_- \\ R_+ & 0 \end{pmatrix}.

Then, we took (uu)V1V\begin{pmatrix} u \\ u_-\end{pmatrix} \in V_1 \oplus V_- and (vv+)V2V+\begin{pmatrix} v \\ v_+\end{pmatrix} \in V_2 \oplus V_+, and saw that Tu=vTu = v, u=0u_- = 0, Ev+E+v+=uEv + E_+ v_+ = u and Ev+E+v+=0E_- v + E_{-+} v_+ = 0.

Since vv is in the image of TT, EvE_-v is in the image of E+E_{-+}. This allows us to make a well defined map from E:Im TIm E+E_- : \text{Im }T \rightarrow \text{Im }E_{-+}:

E#:V2/Im TV/Im E+E_-^\# : V_2/\text{Im }T \rightarrow V_- / \text{Im }E_{-+}
Then by playing around with the above results, we get injectivity. It is also surjective, so the dimensions of V/Im E+V_-/\text{Im }E_{-+} and V2/Im TV_2/\text{Im }T are isomorphic.

Now we can define a map E+:kerE+kerTE_+ : \ker E_{-+} \rightarrow \ker T. We get E+E_+ is injective on all of V+V_+ and thus on kerE+\ker E_{-+} from the fact that R+E+R_+ E_+ is identity. Surjectivity comes from the same two equations in the iff statement.

The main helpful idea was that Tu=v,u=0Tu = v, u_- = 0 was equivalent to Ev+E+v+=uEv + E_+ v_+ = u and Ev+E+v+=0E_- v + E_{-+} v_+ = 0.

Theorem. If ind T=0\text{ind }T = 0, then there exists SS finite rank such that T+ST + S is invertible.

We can purturb our operator by a finite rank operator and stuff.

Proof similar to above.

We can write V1kerTW1V_1 \simeq \ker T \oplus W_1 and V2W2Im TV_2 \simeq W_2 \oplus \text{Im }T, so that the matrix of TT is

T=(000T~)T = \begin{pmatrix} 0 & 0 \\ 0 &\tilde{T} \end{pmatrix}
S=(S~000)S = \begin{pmatrix} \tilde{S} & 0 \\ 0 & 0 \end{pmatrix}
with T~:W1Im T\tilde{T} : W_1 \rightarrow \text{Im }T and S~:kerTW2\tilde{S} : \ker T \rightarrow W_2 invertible.

Convex Sets

Now we take K=RK = \R.

A convex set AVA \subseteq V, K=RK = \R is convex if for all x,yAx, y\in A, R{tR:x+tyA}\R \supseteq \{t \in \R : x + ty \in A\} is an interval in R\R.

The reason we define it weirdly like this as opposed to the canonical definition is that we want to say that a convex set is linearly open if that interval is open.

Geometric Hahn-Banach Theorem. If {0}∉A\{0 \} \not\in A and AA is a convex linearly open set, then there exists a hyperplane VV such that VA=V \cap A = \varnothing. In more generality, if V1A=V_1 \cap A = \varnothing and ..,

Hahn-Banach Theorem

This one was taught by Zhongkai.

Theorem. Let VV be a vector space over R\R. AVA \subseteq V convex and linearly open.

Theorem. V1VV_1 \subseteq V linear subspace, V1A=V_1 \cap A = \varnothing, then there exists a hyperplane V2V_2, V1V2V_1\subseteq V_2, and V2A=V_2 \cap A = \varnothing.

Proof.

First looked at V=R2V = \R^2 and made observation that for any V \in V, half line {tx:t ge0}\{t x : t\ ge 0\} if it intersects AA, then {tx:t0}A=\{tx : t\le 0\} \cap A = \varnothing (or else 0A0 \in A by convexity).

He did a ton of stuff and then had to use Zorn’s Lemma.

Now we will stop this topic for a while and go back to Hahn Banach with a version in topology or something.

Metrics and Topologies

Defined topological space and topological structure. Defined Metric space as well, and how metric space induces a topology.

Defined closed and also what it means for a set to be complete.

Theorem (Baire Category Theorem). If (E,d)(E,d) is complete metric space, {Un}n=1\{U_n\}_{n=1}^\infty a countable family of dense open sets then n=1Un\bigcap_{n=1}^\infty U_n is dense in EE.

A set AEA\subseteq E is called nowhere dense if its closure A\overline{A} doesn’t have interior. A set is called first category if it is a countable union of nowhere dense sets. A set is called second category if it is NOT first category.

Baire Category Theorem

(E,d)(E,d) is a complete metric space, {Un}n=1\{U_n\}_{n=1}^\infty countable family of open dense sets. Then n=1Un\cap_{n=1}^\infty U_n is dense in EE.

Definition. AEA \subseteq E is called generic if it contains the countable intersection of open dense sets.

Example. E=C0([0,1];R)E = C^0([0,1]; \R), d(f,g)=supx[0,1]f(x)g(x)d(f,g) = \sup_{x\in [0,1]}|f(x)-g(x)|

AA is nowhere differentiable functions as a subset of EE.

Fn={fE:x0[0,1], s.t. f(x)f(x0)nxx0}F_n = \{f \in E : \exists x_0 \in [0,1], \text{ s.t. } |f(x) - f(x_0)|\le n|x-x_0|\}

When discussing something, he did a proof by picture where he drew a zig zaggy function with slope on any interval being either 2n2n or 2n-2n.

Tychonov Theorem

Locally convex, balanced, absorbing.

Theorem. A Housedorff, first countable, TBS is locally convex if and only if the topology is given countable family of seminorms. In this case, the topology is metrizable.

Locally convex: NN is open, balanced, and absorbing. Pn(x):=inf{t>0:xtN}P_n(x) := \inf\{t > 0 : \frac{x}{t} \in N\}

Seminorms Ni,j={xV:pi(x)<ϵj}N_{i,j} = \{x \in V : p_i(x) < \epsilon_j\}, ϵj0\epsilon_j \rightarrow 0. Hausdorff implies i,jNij={0}\cap_{i,j}N_{ij} = \{0\}, which is how we can guarantee that d(x,y)=0pi(xy)=0xy=0d(x,y) = 0 \Rightarrow p_i(x-y) = 0\Rightarrow x - y = 0. Some classical consutrction d(x,y)=n=126npn(xy)(1+pn(xy))d(x,y) = \sum_{n=1}^\infty 26{-n} \frac{p_n(x-y)}(1+p_n(x-y)) Triangle inequality is a bit tricky but we can show it from the regular triangle inequality on pnp_n.

TBS is a supset of locally convex TBS which is a supset of seminorm space which is a supset of Frechet space which is a supset of Banach space is a supset of Hilbert space.

Metrizable Locally Convex Topological Veector Spaces

As a consequence of a bunch of theorems, a topology is defined using a countable family of seminorms pj:V[,)p_j : V \rightarrow [,\infty), pj(x+y)pj(x)+pj(y)p_j(x+y) \le p_j(x) + p_j(y), pj(ax)=apj(x)p_j(a_x) = |a|p_j(x), i.e., xnxx_n \rightarrow x is equivalent to pj(xnx)0p_j(x_n - x) \rightarrow 0 as nn \rightarrow \infty for all jj.

V,{pj}V, \{p_j\} is called a Frechet space if and only if it is complete.

Seminormal space (i.e. top space defined by one seminorm).

The fp\|f\|_p norm is a seminorm based on Minkowski’s theorem or something.

WVW \subseteq V, we would like to define a norm on V/WV/W. p~(x+W):=infyx+Wp(y)\tilde{p}(x+W) := \inf_{y \in x + W} p(y) p~\tilde{p} is continuous if and only if WW is closed.

Issue in theorem statement, basically we have a seminorm, but we want to show that when we divide it by points that go to zero, we get a norm.

Claim. p~\tilde{p} is a norm on V/WV/W if and only if WW is closed.

Now notice that C(Rn)C(\R^n) is not a normed space. Why? Suppose there exists a norm pp such that jcj\forall j \exists c_j such that pj(x)cjp(x)p_j(x) \le c_j p(x). Just take f(j)=jcjf(j) = jc_j (connected by linear pieces in between), and then the condition would be jcjcjp(f)j c_j \le c_j p(f) which is impossible if it has to happen over all jj.

We have a whole bunch of different Hahn-Banach theorems. These are all based on the geometric version. There is one version though here:

Theorem. Suppose VV is a locally convex topological vector space. WVW \subseteq V is a linear subspace. Then xWx \in \overline{W} if and only if for all f:VKf : V \rightarrow K such that fW=0f|_W = 0, f(x)=0f(x) = 0.

Theorem (The Runge Approximation Theorem). Suppose KCK \subseteq \mathbb{C} and uu is holomorphic in an open neighborhood of KK. If C\K\mathbb{C} \backslash K is connected, then for every ϵ\epsilon there exists a polynomial pp such thatsupKp(x)u(x)<ϵ\sup_K |p(x) - u(x)| < \epsilon.

In Rudin’s Real and Complex Analysis, in an appendix, there is a proof that you only need it to be holomorphic on the interior of KK. u=supxKu(x)\|u\| = \sup_{x \in K} |u(x)|.

There exists a nontrivial fact which is that every continuous linear functional ff from … f(u)=u(z)  dμ(z)f(u) = \int u(z) \; d\mu(z) for a finite complex supported something. (I think he’s saying we can find μ\mu so that this works for any functional ff). The proof is also in the book by Rudin that he mentioned apparently.

Suppose vv is compactly supported and smooth in C\mathbb{C}.

=12(x+iy)\overline{\partial} = \frac{1}{2}(\partial_x + i\partial_y) uC1(U)u \in C^1(U) uO(U)u=0u \in \mathcal{O}(U) \Leftrightarrow \overline{\partial} u = 0

Cv(z)  dm(z)=0\int_{\mathbb{C}} \overline{\partial}v(z) \; dm(z) = 0 1πCv(z)(ζz)1  dm(z)=v(ζ)-\frac{1}{\pi}\int_{\mathbb{C}} \overline{\partial} v(z) (\zeta - z)^{-1} \; dm(z) = v(\zeta) Basically proved using Green’s formula to reduce it to Cauchy’s integral formula.

From Hahn-Banach, we need that ζn  dμ(ζ)=0\int \zeta^n \; d\mu(\zeta) = 0 finite for all measure supported in KK for all nn implies u(ζ)dμ(ζ)=0\int u(\zeta) d\mu(\zeta) = 0. This left hand side of the implication is the condition that it vanishes on the sapce of polynomials.

Eventually, z(ζz)1dμ(ζ)z \rightarrow \int (\zeta - z)^{-1} d\mu(\zeta) is holomorphic on KcK^c.

Next time we’ll solve PDEs using Hahn-Banach theorem :eyes:.

Recollection of Theorems

Geometric Version of Heine-Borel. Let VV be a real vector space and AVA \subseteq V be a convex linearly open set. Then if FF is an affine set FA=F \cap A =\varnothing, there exists an affine hyperplane HH such that HA=H \cap A = \varnothing, HFH \supseteq F, xHx \in H.

Theorem. If VV is a topological vector space over K=R,CK = \R,\mathbb{C}, AA convex and open which are nonempty, FF is an affine subspace such that FA=F \cap A = \varnothing, then H\exists H a closed affine hyperspace FHF \subseteq H and HA=H \cap A = \varnothing.

Theorem. If AVA \subseteq V, VV is locally convex topological vector space, AA is a closed convex set, x∉Ax \not\in A. Then there exists f:VKf : V \rightarrow K, continuous? and linear such that

infyAf(x)f(y)>0\inf_{y\in A} |f(x) - f(y)| > 0
(in particular, the affine hyperplane H={y:f(x)=f(y)}H = \{y : f(x) = f(y)\} satisfies HA=H \cap A = \varnothing).

As a corollary,

Corollary. WVW \subseteq V linear subspace, xWf:VKx \in \overline{W} \Leftrightarrow \forall f : V \rightarrow K continuous, fW=0f |_W = 0, we have f(x)=0f(x) = 0.

Theorem. IF WVW \subseteq V, pp is a seminorm of VV, f:WKf : W \rightarrow K, f(x)p(x)|f(x)| \le p(x), then f1:VK\exists f_1 : V \rightarrow K such that f1(x)p(x)|f_1(x)| \le p(x) and f1W=ff_1|_W = f.

Remark. We defined Hilbert space and discussed inner products, and in the definition he said (ax,y)=a(x,y)(ax, y) = a(x,y). I pointed out that isn’t it nicer to have (x,ay)=a(x,y)(x,ay) = a(x,y), to which he asked if I was a physicist. Apparently that is the physics notation and this version he is using is the math notation, and to my surprise, he’s right, even Linear Algebra Done Right actually used that convention! It’s funny that my mind has been rewired in this way to think of inner products as applications of linear functionals via the notation itself.

Theorem (Riesz). Suppose L:HKL : H \rightarrow K, linear and continuous, then !\exists ! yHy \in H such that L(x)=(x,y)L(x) = (x,y).

Remark. By constructing linear functionals, we can actually obtain elements of the Hilbert space. Differential equations students seminar at 2 oclock on Tuesday.

Theorem (Application of Hein Borel and R\R). For φC2(C)\varphi \in C^2(\mathbb{C}), suppose φ:CR\varphi : \mathbb{C} \rightarrow \R such that Δφ(z)=κ(z)>0\Delta \varphi(z) = \kappa(z) > 0 for all zCz \in \mathbb{C}. Then for all fL2(C,κ1eeφ  dm(z))f \in L^2 (\mathbb{C}, \kappa^{-1}ee^{-\varphi}\; dm(z)), (fψ2:=Cf(z)2eψ(z)  dm(z)\|f\|_\psi^2 := \int_{\mathbb{C}} |f(z)|^2e^{-\psi(z)}\;dm(z), ψ(z)=φ(z)+logκ(z)\psi(z) = \varphi(z) + \log \kappa(z)), u=f\boxed{\overline{\partial} u = f}, uφfφ+logκ\|u\|_\varphi \le \|f\|_{\varphi + \log \kappa}.

Remark. In our Hilbert space setting, Cauchy-Schwarz inequality implies the triangle inequality.

Theorem. Suppose AA is a closed convex subset of HH and x∉Ax \not \in A. Then !\exists ! yAy \in A such that xy=infzAxz\|x-y\| = \inf_{z\in A} \|x-z\| and L(z):=z,xyL(z) := \langle z, x-y\rangle satisfies L(zy)0\Re L(z-y) \le 0, zAz\in A. This implies L(z)L(x)L(y)L(x)=xy2>0|L(z) - L(x)| \ge |L(y) - L(x)| = \|x-y\|^2 > 0, zAz \in A.

Remark. For next theorem, 1 dimensional case was he forget who showed it. The 2 dimensional case was proved in Berkeley, and the nn dimensional case was shown by Hormander.

Remark. “Old mathematicians are like old boxers, they can still dish out punishment but they cannot take any.” he says as he remarks that he doesn’t actually know how to solve three of the problems on the homework.

… (I may have missed some things in here)

Analytic Fredholm Theory

We say that zB(z)z \rightarrow B(z) is meromorphic with a pole of finite rank at z=z0z = z_0 if there exists finite rank operators B1,...,BJB_1, ..., B_J and an analytic family of open zB~(z)z \rightarrow \tilde{B}(z), for zz near z0z_0 such that B(z)=j=1JBj(zz0)j+B~(z)B(z) = \sum_{j=1}^J \frac{B_j}{(z - z_0)^j} + \tilde{B}(z).

Theorem. Suppose z0Ωz_0 \in \Omega at which A(z0)1:B2B1A(z_0)^{-1} : B_2 \rightarrow B_1 exists. Then zA(z)1z \mapsto A(z)^{-1} is a meromorphic family of open ? with poles of finite rank.

Example. B=B1=B2B = B_1 = B_2, SLc(B,B)S \in \mathcal{L}_c(B,B), A(z)=SzIA(z) = S - z I, Ω=C\{0}\Omega = \mathbb{C} \backslash \{0\}.

Proof.

Notice ind(A(z))=ind(A(z0))=0\text{ind}(A(z)) = \text{ind}(A(z_0)) = 0. Fix wΩw \in \Omega. dimkerA(w)=n(q)=n=dimcoker A(w)\dim \ker A(w) = n(q) = n = \dim\text{coker }A(w). There exists R:KnB2R_- : K^n \rightarrow B_2 and R+:BKnR_{+} : B_ \rightarrow K^n such that ?? E+W(z):KnKnE_{-+}^W (z) : K^n \rightarrow K^n

(A(w)RR+0):B1KnB2Kn\begin{pmatrix} A(w) & R_{-} \\ R_+ & 0\end{pmatrix} : B_1 \oplus K^n \rightarrow B_2 \oplus K^n is invertible. There exists U(w)U(w) neighborhood of ww wsuch that we have the schur’s complement thing. Now A(z)1A(z)^{-1} exists is equivalent to E+2(z)E_{-+}^2(z)^{-} existing, and then A(z)1=Ew(z)E+w(z)E+w(z)1Ew(z)A(z)^{-1} = E^w(z) - E_{+}^w(z) E_{-+}^w(z)^{-1} E_-^w(z)

Strat. The idea in this lecture is in part about how we can exapnd things into Laurant series and work with those.

Theorem. Suppose P:B1B2P : B_1 \rightarrow B_2, B1B2B_1 \subseteq B_2, PzIP - zI is Fredholm for zΩz \in \Omega connected open ?. Assume z0Ω\exists z_0 \in \Omega such that (Pz0I)1(P- z_0 I)^{-1} exists. Then z(PzI)1z \rightarrow (P-zI)^{-1} is meromorphic in Ω\Omega with poles of finite rank. Moreover, Πz:=12πiz(wIP)1dw\Pi_z :=\frac{1}{2\pi i} \oint_z (wI - P)^{-1} dw where integral is over a positive orientation circle containing only a pole, satisfies:

Πz2=Πz,rank Πz<\Pi_z^2 = \Pi_z,\quad \text{rank }\Pi_z < \infty

Proof.

Πz=12πiγj(wP)1  dw\Pi_z = \frac{1}{2\pi i} \int_{\gamma_j} (w - P)^{-1}\;dw w=wIw = wI, Πz2=(12πi)2γ1γ2(w1P)1(w2P)1  dw1  dw2\Pi_z^2 = \left(\frac{1}{2\pi i}\right)^2 \int_{\gamma_1}\int_{\gamma_2} (w_1 - P)^{-1} (w_2 - P)^{-1}\; dw_1 \; dw_2 (w1P)1(w2P)1=(w1P)1((w2P)(w1P))(w2P)1(w_1 - P)^{-1} - (w_2 - P)^{-1} = (w_1 - P)^{-1}((w_2 - P) - (w_1 - P))(w_2 - P)^{-1} =(w1P)1(w2w1)(w2P)1 = (w_1 - P)^{-1}(w_2 - w_1)(w_2 - P)^{-1} (w1P)1(w2P)1=1w2w1((w1P)1(w2P)1)(w_1 - P)^{-1}(w_2 - P)^{-1} = \frac{1}{w_2 - w_1}((w_1 - P)^{-1} - (w_2 - P)^{-1}) Πz2=1(2πi)2γ1γ2(w1P)11w2w1  dw1  dw2  1(2πi)2γ1γ2(w2P)11w2w1  dw1  dw2\Pi_z^2 = \frac{1}{(2 \pi i)^2} \int_{\gamma_1} \int_{\gamma_2} (w_1 - P)^{-1}\frac{1}{w_2 - w_1}\;dw_1 \;dw_2\;\frac{1}{(2 \pi i)^2} \int_{\gamma_1} \int_{\gamma_2} (w_2 - P)^{-1}\frac{1}{w_2 - w_1}\;dw_1 \;dw_2 Integral outside is zero.

Weak Topology and Weak Star Topology and Other things

Fact: If L:FKL : F \rightarrow K is continuous iwth respect to σ(F,G)\sigma(F,G) where σ(F,G)\sigma(F,G) is the topology on FF by seminorms xx,yx \mapsto |\langle x, y\rangle|, yGy \in G, then yG\exists y \in G such that L(x)=x,yL(x) = \langle x, y\rangle.

Theorem. \exists a positive finite measure 1πImf(x+iy)φ(x)  dxφ(x)  dμ(x)\frac{1}{\pi} \int \mathrm{Im} f(x+iy) \varphi(x)\;dx \rightarrow \int \varphi(x) \; d\mu(x) and f(z)=1xz  dμ(x)f(z) = \int \frac{1}{x-z}\;d\mu(x).