\documentclass[12pt,titlepage]{article}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}
%----Macros----------
%
% Unresolved issues:
%
% \righttoleftarrow
% \lefttorightarrow
%
% \color{} with HTML colorspec
% \bgcolor
% \array with options (without options, it's equivalent to the matrix environment)
% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}
% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.
% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother
% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
\ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
\else \append@sup#2 \@suptrue \fi%
\expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
\reset@sup\mk@scripts#3_/}
\makeatother
% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
\@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
\copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother
% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
% http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}
% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}
% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}
% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}
% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
<-6> MnSymbolE5
<6-7> MnSymbolE6
<7-8> MnSymbolE7
<8-9> MnSymbolE8
<9-10> MnSymbolE9
<10-12> MnSymbolE10
<12-> MnSymbolE12}{}
% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
\let#1=\undefined
\DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother
% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
\if\relax\noexpand#1%
\let#1\undefined
\fi
\DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother
% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
\setbox\z@\hbox{\m@th$#1#2$}%
\setbox\tw@\hbox{\m@th$#1%
\widehat{%
\vrule\@width\z@\@height\ht\z@
\vrule\@height\z@\@width\wd\z@}$}%
\dp\tw@-\ht\z@
\@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
\setbox\tw@\hbox{%
\raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
{\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother
% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter
% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother
%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}
%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}
% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}
%-------------------------------------------------------------------
\begin{document}
%-------------------------------------------------------------------
\section*{Blog - network theory (part 24)}
This page is a [[Blog articles in progress|blog article in progress]], written by [[John Baez]]. To see discussions of this article while it was being written, go to the \href{http://forum.azimuthproject.org/discussion/1028/blog-network-theory-part-24/}{Azimuth Forum}. For the final polished version, go to the \href{http://johncarlosbaez.wordpress.com/2012/08/23/network-theory-part-24/}{Azimuth Blog}.
Now we've reached the climax of our story so far: we're ready to prove the deficiency zero theorem. First let's talk about it informally a bit. Then we'll review the notation, and then---hang on to your seat!---we'll give the proof.
The crucial trick is to relate a bunch of chemical reactions, described by a `reaction network' like this:
to a simpler problem where a system randomly hops between states arranged in the same pattern:
This is sort of amazing, because we've thrown out lots of detail. It's also amazing because this simpler problem is . In the original problem, the chance that a reaction turns a B + E into a D is proportional to the number of B's the number of E's. That's nonlinear! But in the simplified problem, the chance that your system hops from state 4 to state 3 is just proportional to the probability that it's in state 4 to begin with. That's linear.
The wonderful thing is that, at least under some conditions, we can an find an for our chemical reactions starting from an equilibrium solution of the simpler problem.
Let's roughly sketch how it works, and where we are so far. Our simplified problem is described by an equation like this:
\begin{displaymath}
\displaystyle{ \frac{d}{d t} \psi = H \psi }
\end{displaymath}
where $\psi$ is a function that the probability of being in each state, and $H$ describes the probability per time of hopping from one state to another. We can easily understand quite a lot about the equilibrium solutions, where $\psi$ doesn't change at all:
\begin{displaymath}
H \psi = 0
\end{displaymath}
because this is a linear equation. We did this in . Of course, when I say `easily', that's a relative thing: we needed to use the Perron--Frobenius theorem, which Jacob introduced in . But that's a well-known theorem in linear algebra, and it's easy to apply here.
In , we saw that the original problem was described by an equation like this, called the `rate equation':
\begin{displaymath}
\displaystyle{ \frac{d x}{d t} = Y H x^Y }
\end{displaymath}
Here $x$ is a vector whose entries describe the amount of each kind of chemical: the amount of A's, the amount of B's, and so on. The matrix $H$ is the same as in the simplified problem, but $Y$ is a matrix that says how many times each chemical shows up in each spot in our reaction network:
The key thing to notice is $x^Y$, where we take a vector and raise it to the power of a matrix. We explained this operation back in . It's this operation that says how many B + E pairs we have, for example, given the number of B's and the number of E's. It's this that makes the rate equation nonlinear.
Now, we're looking for equilibrium solutions of the rate equation, where the rate of change is zero:
\begin{displaymath}
Y H x^Y = 0
\end{displaymath}
But in fact we'll do even better! We'll find solutions of this:
\begin{displaymath}
H x^Y = 0
\end{displaymath}
And we'll get these by taking our solutions of this:
\begin{displaymath}
H \psi = 0
\end{displaymath}
and adjusting them so that
\begin{displaymath}
\psi = x^Y
\end{displaymath}
while $\psi$ remains a solution of $H \psi = 0$.
But: how do we do this `adjusting'? That's the crux of the whole business! That's what we'll do today.
Remember, $\psi$ is a function that gives a probability for each `state', or numbered box here:
The picture here consists of two pieces, called `connected components': the piece containing boxes 0 and 1, and the piece containing boxes 2, 3 and 4. It turns out that we can multiply $\psi$ by a function that's constant on each connected component, and if we had $H \psi = 0$ to begin with, that will still be true afterward. The reason is that there's no way for $\psi$ to `leak across' from one component to another. It's like having water in separate buckets. You can increase the amount of water in one bucket, and decrease it another, and as long as the water's surface remains flat in each bucket, the whole situation remains in equilibrium.
That's sort of obvious. What's not obvious is that we can adjust $\psi$ this way so as to ensure
\begin{displaymath}
\psi = x^Y
\end{displaymath}
for some $x$.
And indeed, it's not always true! It's only true if our reaction network obeys a special condition. It needs to have `deficiency zero'. We defined this concept back in , but now we'll finally use it for something. It turns out to be precisely the right condition to guarantee we can tweak any function on our set of states, multiplying it by a function that's constant on each connected component, and get a new function $\psi$ with
\begin{displaymath}
\psi = x^Y
\end{displaymath}
When all is said and done, that is the key to the deficiency zero theorem.
The battle is almost upon us---we've got one last chance to review our notation. We start with a :
This consists of:
$\bullet$ finite sets of $T$, $K$ and $S$,
$\bullet$ a map $r: T \to (0,\infty)$ giving a for each transition,
$\bullet$ and maps $s,t : T \to K$ saying where each transition starts and ends,
$\bullet$ a one-to-one map $Y : K \to \mathbb{N}^S$ saying how each complex is made of species.
Then we extend $s, t$ and $Y$ to linear maps:
Then we put inner products on these vector spaces as described , which lets us `turn around' the maps $s$ and $t$ by taking their adjoints:
\begin{displaymath}
s^\dagger, t^\dagger : \mathbb{R}^K \to \mathbb{R}^T
\end{displaymath}
More surprisingly, we can `turn around' $Y$ and get a map using `matrix exponentiation':
\begin{displaymath}
\begin{array}{ccc} \mathbb{R}^S &\to& \mathbb{R}^K \\
x &\mapsto& x^Y \end{array}
\end{displaymath}
This is most easily understood by thinking of $x$ as a row vector and $Y$ as a matrix:
\begin{displaymath}
\begin{array}{ccl} x^Y &=& {\left( \begin{array}{cccc}
x_1 , & x_2 , & \dots, & x_k \end{array} \right)}^{
\left( \begin{array}{cccc}
Y_{11} & Y_{12} & \cdots & Y_{1 \ell} \\
Y_{21} & Y_{22} & \cdots & Y_{2 \ell} \\
\vdots & \vdots & \ddots & \vdots \\
Y_{k1} & Y_{k2} & \cdots & Y_{k \ell} \end{array} \right)}
\\
\\
&=& \left( x_1^{Y_{11}} \cdots x_k^{Y_{k1}} ,\; \dots, \; x_1^{Y_{1 \ell}} \cdots x_k^{Y_{k \ell}} \right)
\end{array}
\end{displaymath}
Remember, complexes are made out of species. The matrix entry $Y_{i j}$ says how many things of the $j$th species there are in a complex of the $i$th kind. If $\psi \in \mathbb{R}^K$ says how many complexes there are of each kind, $Y \psi \in \mathbb{R}^S$ says how many things there are of each species. Conversely, if $x \in \mathbb{R}^S$ says how many things there are of each species, $x^Y \in \mathbb{R}^K$ says how many ways we can build each kind of complex from them.
So, we get these maps:
Next, the
\begin{displaymath}
\partial : \mathbb{R}^T \to \mathbb{R}^K
\end{displaymath}
describes how each transition causes a change in complexes:
\begin{displaymath}
\partial = t - s
\end{displaymath}
As we saw , there is a
\begin{displaymath}
H : \mathbb{R}^K \to \mathbb{R}^K
\end{displaymath}
describing a Markov processes on the set of complexes, given by
\begin{displaymath}
H = \partial s^\dagger
\end{displaymath}
But the star of the show is the rate equation. This describes how the number of things of each species changes with time. We write these numbers in a list and get a vector $x \in \mathbb{R}^S$ with nonnegative components. The says:
\begin{displaymath}
\displaystyle{ \frac{d x}{d t} = Y H x^Y }
\end{displaymath}
We can read this as follows:
$\bullet$ $x$ says how many things of each species we have now.
$\bullet$ $x^Y$ says how many complexes of each kind we can build from these species.
$\bullet$ $s^\dagger x^Y$ says how many transitions of each kind can originate starting from these complexes, with each transition weighted by its rate.
$\bullet$ $H x^Y = \partial s^\dagger x^Y$ is the rate of change of the number of complexes of each kind, due to these transitions.
$\bullet$ $Y H x^Y$ is the rate of change of the number of things of each species.
We are looking for of the rate equation, where the number of things of each species doesn't change at all:
\begin{displaymath}
Y H x^Y = 0
\end{displaymath}
In fact we will find equilibrium solutions, where even the number of complexes of each kind doesn't change:
\begin{displaymath}
H x^Y = 0
\end{displaymath}
More precisely, we have:
\textbf{Deficiency Zero Theorem (Child's Version).} Suppose we have a reaction network obeying these two conditions:
\begin{enumerate}%
\item It is , meaning that whenever there's a transition from one complex $\kappa$ to another $\kappa'$, there's a directed path of transitions going back from $\kappa'$ to $\kappa$.
\item It has , meaning $\mathrm{im} \partial \cap \mathrm{ker} Y = \{ 0 \}$.
\end{enumerate}
Then for any choice of rate constants there exists a complex balanced equilibrium solution of the rate equation where all species are present in nonzero amounts. In other words, there exists $x \in \mathbb{R}^S$ with all components positive and such that:
\begin{displaymath}
H x^Y = 0
\end{displaymath}
\emph{Proof.} Because our reaction network is weakly reversible, the theorems in show there exists $\psi \in (0,\infty)^K$ with
\begin{displaymath}
H \psi = 0
\end{displaymath}
This $\psi$ may not be of the form $x^Y$, but we shall adjust $\psi$ so that it becomes of this form, while still remaining a solution of $H \psi = 0$. To do this, we need a couple of lemmas:
\textbf{Lemma 1.} $\mathrm{ker} \partial^\dagger + \mathrm{im} Y^\dagger = \mathbb{R}^K$.
\emph{Proof.} We need to use a few facts from linear algebra. If $V$ is a finite-dimensional vector space with inner product, the $L^\perp$ of a subspace $L \subseteq V$ consists of vectors that are orthogonal to everything in $L$:
\begin{displaymath}
L^\perp = \{ v \in V : \quad \forall w \in L \quad \langle v, w \rangle = 0 \}
\end{displaymath}
We have
\begin{displaymath}
(L \cap M)^\perp = L^\perp + M^\perp
\end{displaymath}
where $L$ and $M$ are subspaces of $V$ and $+$ denotes the sum of two subspaces: that is, the smallest subspace containing both. Also, if $T: V \to W$ is a linear map between finite-dimensional vector spaces with inner product, we have
\begin{displaymath}
(\mathrm{ker} T)^\perp = \mathrm{im} T^\dagger
\end{displaymath}
and
\begin{displaymath}
(\mathrm{im} T)^\perp = \mathrm{ker} T^\dagger
\end{displaymath}
Now, because our reaction network has deficiency zero, we know that
\begin{displaymath}
\mathrm{im} \partial \cap \mathrm{ker} Y = \{ 0 \}
\end{displaymath}
Taking the orthogonal complement of both sides, we get
\begin{displaymath}
(\mathrm{im} \partial \cap \mathrm{ker} Y)^\perp = \mathbb{R}^K
\end{displaymath}
and using the rules we mentioned, we obtain
\begin{displaymath}
\mathrm{ker} \partial^\dagger + \mathrm{im} Y^\dagger = \mathbb{R}^K
\end{displaymath}
as desired. ~
Now, given a vector $\phi$ in $\mathbb{R}^K$ or $\mathbb{R}^S$ with all positive components, we can define the of such a vector, componentwise:
\begin{displaymath}
(\ln \phi)_i = \ln (\phi_i)
\end{displaymath}
Similarly, for any vector $\phi$ in either of these spaces, we can define its in a componentwise way:
\begin{displaymath}
(\exp \phi)_i = \exp(\phi_i)
\end{displaymath}
These operations are inverse to each other. Moreover:
\textbf{Lemma 2.} The nonlinear operator
\begin{displaymath}
\begin{array}{ccc} \mathbb{R}^S &\to& \mathbb{R}^K \\
x &\mapsto& x^Y \end{array}
\end{displaymath}
is related to the linear operator
\begin{displaymath}
\begin{array}{ccc} \mathbb{R}^S &\to& \mathbb{R}^K \\
x &\mapsto& Y^\dagger x \end{array}
\end{displaymath}
by the formula
\begin{displaymath}
x^Y = \exp(Y^\dagger \ln x )
\end{displaymath}
which holds for all $x \in (0,\infty)^S$.
\emph{Proof.} A straightforward calculation. By the way, this formula would look a bit nicer if we treated $\ln x$ as a row vector and multiplied it on the right by $Y$: then we would have
\begin{displaymath}
x^Y = \exp((\ln x) Y)
\end{displaymath}
The problem is that we are following the usual convention of multiplying vectors by matrices on the left, yet writing the matrix on the right in $x^Y$. Taking the transpose $Y^\dagger$ of the matrix $Y$ serves to compensate for this. ~
Now, given our vector $\psi \in (0,\infty)^K$ with $H \psi = 0$, we can take its logarithm and get $\ln \psi \in \mathbb{R}^K$. Lemma 1 says that
\begin{displaymath}
\mathbb{R}^K = \mathrm{ker} \partial^\dagger + \mathrm{im} Y^\dagger
\end{displaymath}
so we can write
\begin{displaymath}
\ln \psi = \alpha + Y^\dagger \beta
\end{displaymath}
where $\alpha \in \mathrm{ker} \partial^\dagger$ and $\beta \in \mathbb{R}^S$. Moreover, we can write
\begin{displaymath}
\beta = \ln x
\end{displaymath}
for some $x \in (0,\infty)^S$, so that
\begin{displaymath}
\ln \psi = \alpha + Y^\dagger (\ln x)
\end{displaymath}
Exponentiating both sides componentwise, we get
\begin{displaymath}
\psi = \exp(\alpha) \; \exp(Y^\dagger (\ln x))
\end{displaymath}
where at right we are taking the componentwise product of vectors. Thanks to Lemma 2, we conclude that
\begin{displaymath}
\psi = \exp(\alpha) x^Y
\end{displaymath}
So, we have taken $\psi$ and written it in the form $x^Y$---but not quite! We can adjust $\psi$ to make it be of this form:
\begin{displaymath}
\exp(-\alpha) \psi = x^Y
\end{displaymath}
Clearly all the components of $\exp(-\alpha) \psi$ are positive, since the same is true for both $\psi$ and $\exp(-\alpha)$. So, the only remaining task is to check that
\begin{displaymath}
H(\exp(-\alpha) \psi) = 0
\end{displaymath}
We do this using two lemmas:
\textbf{Lemma 3.} If $H \psi = 0$ and $\alpha \in \mathrm{ker} \partial^\dagger$, then $H(\exp(-\alpha) \psi) = 0$.
\emph{Proof.} It is enough to check that multiplication by $\exp(-\alpha)$ commutes with the Hamiltonian $H$, since then
\begin{displaymath}
H(\exp(-\alpha) \psi) = \exp(-\alpha) H \psi = 0
\end{displaymath}
Recall from that $H$ is the Hamiltonian of a Markov process associated to this `graph with rates':
As noted here:
$\bullet$ John Baez and Brendan Fong, .
multiplication by some function on $K$ commutes with $H$ if and only if that function is constant on each connected component of this graph. Such functions are called .
So, it suffices to show that $\exp(-\alpha)$ is constant on each connected component. For this, it is enough to show that $\alpha$ itself is constant on each connected component. But this will follow from the next lemma, since $\alpha \in \mathrm{ker} \partial^\dagger$. ~
\textbf{Lemma 4.} A function $\alpha \in \mathbb{R}^K$ is a conserved quantity iff $\partial^\dagger \alpha = 0$. In other words, $\alpha$ is constant on each connected component of the graph $s, t: T \to K$ iff $\partial^\dagger \alpha = 0$.
\emph{Proof.} Suppose $\partial^\dagger \alpha = 0$, or in other words, $\alpha \in \mathrm{ker} \partial^\dagger$, or in still other words, $\alpha \in (\mathrm{im} \partial)^\perp$. To show that $\alpha$ is constant on each connected component, it suffices to show that whenever we have two complexes connected by a transition, like this:
\begin{displaymath}
\tau: \kappa \to \kappa'
\end{displaymath}
then $\alpha$ takes the same value at both these complexes:
\begin{displaymath}
\alpha_\kappa = \alpha_{\kappa'}
\end{displaymath}
To see this, note
\begin{displaymath}
\partial \tau = t(\tau) - s(\tau) = \kappa' - \kappa
\end{displaymath}
and since $\alpha \in (\mathrm{im} \partial)^\perp$, we conclude
\begin{displaymath}
\langle \alpha, \kappa' - \kappa \rangle = 0
\end{displaymath}
But calculating this inner product, we see
\begin{displaymath}
\alpha_{\kappa'} - \alpha_{\kappa} = 0
\end{displaymath}
as desired.
For the converse, we simply turn the argument around: if $\alpha$ is constant on each connected component, we see $\langle \alpha, \kappa' - \kappa \rangle = 0$ whenever there is a transition $\tau : \kappa \to \kappa'$. It follows that $\langle \alpha, \partial \tau \rangle = 0$ for every transition $\tau$, so $\alpha \in (\mathrm{im} \partial)^\perp$.
And thus concludes the proof of the lemma! ~
And thus concludes the proof of the theorem! ~
And thus concludes this post!
category:blog
\end{document}