\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 5)}
This page is a [[blog article in progress]], written by [[John Baez]]. To see the final polished article, \href{http://johncarlosbaez.wordpress.com/2011/04/11/network-theory-part-5/}{go to the Azimuth Blog}.
Last time we saw clues that stochastic Petri nets are a lot like quantum field theory, but with probabilities replacing amplitudes. There's a powerful analogy at work here, which can help us a lot. So, this time I want to make that analogy precise.
But first, let me quickly sketch why it could be worthwhile.
Consider this stochastic Petri net with rate constant $r$:
It describes rabbits roaming around randomly and getting caught by a trap. In any short time $\Delta t$ there's a chance of about $r \Delta t$ of a rabbit getting caught. There's also a chance of two or more rabbits getting caught, but this becomes negligible by comparison as $\Delta t \to 0$. Moreover, the chance of a rabbit getting caught during this interval of time is independent of what happens before or afterwards. This sort of process is called a .
Problem. - Suppose we start out knowing for sure there are no rabbits in our trap. What's the probability of having caught $n$ rabbits at time $t$?
At any time there will be some probability of having caught $n$ rabbits; let's call this probability $\psi_n(t)$, or $\psi_n$ for short. Borrowing a trick from quantum theory, we can summarize all these probabilities in a single power series:
\begin{displaymath}
\psi = \sum_{n=0}^\infty \psi_n \, x^n
\end{displaymath}
In quantum theory we use this trick when talking about collections of photons rather than rabbits, but then the numbers $\psi_n$ are complex `amplitudes' rather than probabilities. Let's use this trick to write down and solve the master equation
\begin{displaymath}
\frac{d}{d t} \psi(t) = H \psi(t)
\end{displaymath}
describing how the probability of having caught any given number of rabbits changes with time.
What's the operator $H$? Well, in quantum theory we describe the creation of photons using a certain operator on power series called the :
\begin{displaymath}
a^\dagger \psi = x \psi
\end{displaymath}
We can try to apply this to our rabbits. If at some time we're 100\% sure we have $n$ rabbits, we have
\begin{displaymath}
\psi = x^n
\end{displaymath}
so applying the creation operator gives
\begin{displaymath}
a^\dagger \psi = x^{n+1}
\end{displaymath}
One more rabbit! That's good. So, an obvious wild guess is
\begin{displaymath}
H = r a^\dagger
\end{displaymath}
where $r$ is the rate at which we're catching rabbits. Let's see how well this guess works.
If you know how to exponentiate operators, you know to solve this equation:
\begin{displaymath}
\frac{d}{d t} \psi(t) = H \psi(t)
\end{displaymath}
It's easy:
\begin{displaymath}
\psi(t) = \mathrm{exp}(t H) \psi(0)
\end{displaymath}
Since we start out knowing there are no rabbits in our trap, we have
\begin{displaymath}
\psi(0) = 1
\end{displaymath}
so with our guess for $H$ we get
\begin{displaymath}
\psi(t) = \mathrm{exp}(r t a^\dagger) 1
\end{displaymath}
But $a^\dagger$ is the operator of multiplication by $x$, so $\mathrm{exp}(r t a^\dagger)$ is multiplication by $e^{t r x}$, and
\begin{displaymath}
\psi(t) = e^{r t x} = \sum_{n = 0}^\infty \frac{(r t)^n}{n!} \, x^n
\end{displaymath}
So, if our guess is right, the probability of having caught $n$ rabbits at time $t$ is
\begin{displaymath}
\frac{(r t)^n}{n!}
\end{displaymath}
Unfortunately, this can't be right, because these probabilities don't sum to 1! Instead their sum is
\begin{displaymath}
\sum_{n=0}^\infty \frac{(r t)^n}{n!} = e^{r t}
\end{displaymath}
We can try to wriggle out of the mess we're in by dividing our answer by this fudge factor. It sounds like a desperate measure, but we've got to try something!
This amounts to guessing that the probability of having caught $n$ rabbits by time $t$ is
\begin{displaymath}
\frac{(r t)^n}{n!} \, e^{-r t }
\end{displaymath}
And this is This is called the : it's famous for being precisely the answer to the problem we're facing.
So on the one hand our wild guess about $H$ was wrong, but on the other hand it was not so far off. We can fix it as follows:
\begin{displaymath}
H = r (a^\dagger - 1)
\end{displaymath}
The extra $-1$ gives us the fudge factor we need.
So, a wild guess corrected by an ad hoc procedure seems to have worked! But what's really going on?
What's really going on is that $a^\dagger$, or any multiple of this, is not a legitimate Hamiltonian for a master equation: if we define a time evolution operator $\exp(t H)$ using a Hamiltonian like this, probabilities won't sum to 1. But $a^\dagger - 1$ is okay. So, we need to think about which Hamiltonians are okay.
In quantum theory, self-adjoint Hamiltonians are okay. But in probability theory, we need some other kind of Hamiltonian. Let's figure it out.
Suppose we have a system of any kind: physical, chemical, biological, economic, whatever. The system can be in different states. In the simplest sort of model, we say there's some set $X$ of states, and say that at any moment in time the system is definitely in one of these states. But I want to compare two other options:
$\bullet$ In a model, we may instead say that the system has a $\psi(x)$ of being in any state $x \in X$. These probabilities are nonnegative real numbers with
\begin{displaymath}
\sum_{x \in X} \psi(x) = 1
\end{displaymath}
$\bullet$ In a model, we may instead say that the system has an $\psi(x)$ of being in any state $x \in X$. These amplitudes are complex numbers with
\begin{displaymath}
\sum_{x \in X} | \psi(x) |^2 = 1
\end{displaymath}
Probabilities and amplitudes are similar yet strangely different. Of course given an amplitude we can get a probability by taking its absolute value and squaring it. This is a vital bridge from quantum theory to probability theory. Today, however, I don't want to focus on the bridges, but rather the between these theories.
We often want to replace the sums above by integrals. For that we need to replace our set $X$ by a , which is a set equipped with enough structure that you can integrate real or complex functions defined on it. Well, at least you can integrate so-called functions---but I'll neglect all issues of analytical rigor here. Then:
$\bullet$ In a model, the system has a $\psi : X \to \mathbb{R}$, which obeys $\psi \ge 0$ and
\begin{displaymath}
\int_X \psi(x) \, d x = 1
\end{displaymath}
$\bullet$ In a model, the system has a $\psi : X \to \mathbb{C}$, which obeys
\begin{displaymath}
\int_X | \psi(x) |^2 \, d x= 1
\end{displaymath}
In probability theory, we integrate $\psi$ over a set $S \subset X$ to find out the probability that our systems state is in this set. In quantum theory we integrate $|\psi|^2$ over the set to answer the same question.
We don't need to think about sums over sets and integrals over measure spaces separately: there's a way to make any set $X$ into a measure space such that by definition,
\begin{displaymath}
\int_X \psi(x) \, d x = \sum_{x \in X} \psi(x)
\end{displaymath}
In short, integrals are more general than sums! So, I'll mainly talk about integrals, until the very end.
In probability theory, we want our probability distributions to be vectors in some vector space. Ditto for wave functions in quantum theory! So, we make up some vector spaces:
$\bullet$ In probability theory, the probability distribution $\psi$ is a vector in the space
\begin{displaymath}
L^1(X) = \{ \psi: X \to \mathbb{C} \; : \; \int_X |\psi(x)| \, d x < \infty \}
\end{displaymath}
$\bullet$ In quantum theory, the wavefunction $\psi$ is a vector in the space
\begin{displaymath}
L^2(X) = \{ \psi: X \to \mathbb{C} \; : \; \int_X |\psi(x)|^2 \, d x < \infty \}
\end{displaymath}
You may wonder why I defined $L^1(X)$ to consist of functions when probability distributions are real. I'm just struggling to make the analogy seem as strong as possible. In fact probability distributions are not just real but nonnegative. We need to say this somewhere\ldots{} but we can, if we like, start by saying they're complex-valued functions, but then whisper that they must in fact be nonnegative (and thus real). It's not the most elegant solution, but that's what I'll do for now.
Now:
$\bullet$ The main thing we can do with elements of $L^1(X)$, besides what we can do with vectors in any vector space, is integrate one. This gives a linear map:
\begin{displaymath}
\int : L^1(X) \to \mathbb{C}
\end{displaymath}
$\bullet$ The main thing we can with elements of $L^2(X)$, besides the besides the things we can do with vectors in any vector space, is take the inner product of two:
\begin{displaymath}
\langle \psi, \phi \rangle = \int_X \overline{\psi}(x) \phi(x) \, d x
\end{displaymath}
This gives a map that's linear in one slot and conjugate-linear in the other:
\begin{displaymath}
\langle - , - \rangle : L^1(X) \to \mathbb{C}
\end{displaymath}
First came probability theory with $L^1(X)$; then came quantum theory with $L^2(X)$. Naive extrapolation would say it's about time for someone to invent an even more bizarre theory of reality based on $L^3(X).$ In this, you'd have to integrate the product of wavefunctions to get a number! The math of is already well-developed, so give it a try if you want. I'll stick to $L^1$ and $L^2$ today.
Now let's think about time evolution:
$\bullet$ In probability theory, the passage of time is described by a map sending probability distributions to probability distributions. This is described using a
\begin{displaymath}
U : L^1(X) \to L^1(X)
\end{displaymath}
meaning a linear operator such that
\begin{displaymath}
\int U \psi = \int \psi
\end{displaymath}
and
\begin{displaymath}
\psi \ge 0 \quad \implies \quad U \psi \ge 0
\end{displaymath}
$\bullet$ In quantum theory the passage of time is described by a map sending wavefunction to wavefunctions. This is described using an
\begin{displaymath}
U : L^2(X) \to L^2(X)
\end{displaymath}
meaning a linear operator such that
\begin{displaymath}
\langle U \psi , U \phi \rangle = \langle \psi , \phi \rangle
\end{displaymath}
In quantum theory we usually want time evolution to be reversible, so we focus on isometries that have inverses: these are called operators. In probability theory we often consider stochastic operators that are invertible.
Sometimes it's nice to think of time coming in discrete steps. But in theories where we treat time as continuous, to describe time evolution we usually need to solve a differential equation. This is true in both probability theory and quantum theory:
$\bullet$ In probability theory we often describe time evolution using a differential equation called the :
\begin{displaymath}
\frac{d}{d t} \psi(t) = H \psi(t)
\end{displaymath}
whose solution is
\begin{displaymath}
\psi(t) = \exp(t H)\psi(0)
\end{displaymath}
$\bullet$ In quantum theory we often describe time evolution using a differential equation called :
\begin{displaymath}
i \frac{d}{d t} \psi(t) = H \psi(t)
\end{displaymath}
whose solution is
\begin{displaymath}
\psi(t) = \exp(-i t H)\psi(0)
\end{displaymath}
In fact the appearance of $i$ in the quantum case is purely conventional; we could drop it to make the analogy better, but then we'd have to work with `skew-adjoint' operators instead of self-adjoint ones in what follows.
Let's guess what properties an operator $H$ should have to make $\exp(-i t H)$ unitary for all $t$. We start by assuming it's an isometry:
\begin{displaymath}
\langle \exp(-i t H) \psi, \exp(-i t H) \phi \rangle = \langle \psi, \phi \rangle
\end{displaymath}
Then we differentiate this with respect to $t$ and set $t = 0$, getting
\begin{displaymath}
\langle -i H \psi, \phi \rangle + \langle \psi, -i H \phi \rangle = 0
\end{displaymath}
or in other words
\begin{displaymath}
\langle H \psi, \phi \rangle = \langle \psi, H \phi \rangle
\end{displaymath}
Physicists call an operator obeying this condition . Mathematicians know there's , but today is not the day to discuss such subtleties, intriguing though they are. All that matters now is that there is, indeed, a correspondence between self-adjoint operators and well-behaved `one-parameter unitary groups' $\exp(-i t H)$. This is called .
But now let's copy this argument to guess what properties an operator $H$ must have to make $\exp(t H)$ stochastic. We start by assuming $\exp(t H)$ is stochastic, so
\begin{displaymath}
\int \exp(t H) \psi = \int \psi
\end{displaymath}
and
\begin{displaymath}
\psi \ge 0 \quad \implies \quad \exp(t H) \psi \ge 0
\end{displaymath}
We can differentiate the first equation with respect to $t$ and set $t = 0$, getting
\begin{displaymath}
\int H \psi = 0
\end{displaymath}
for all $\psi$.
But what about the second condition,
\begin{displaymath}
\psi \ge 0 \quad \implies \quad \exp(t H) \psi \ge 0?
\end{displaymath}
It seems easier to deal with this in the special case when integrals over $X$ reduce to sums. So let's suppose that happens\ldots{} and let's start by seeing what the condition says in this case.
In this case, $L^1(X)$ has a basis of `Kronecker delta functions': The Kronecker delta function $\delta_i$ vanishes everywhere except at one point $i \in X$, where it equals 1. Using this basis, we can write any operator on $L^1(X)$ as a matrix.
As a warmup, let's see what it means for an operator
\begin{displaymath}
U: L^1(X) \to L^1(X)
\end{displaymath}
to be stochastic in this case. We'll take the conditions
\begin{displaymath}
\int U \psi = \int \psi
\end{displaymath}
and
\begin{displaymath}
\psi \ge 0 \quad \implies \quad U \psi \ge 0
\end{displaymath}
and rewrite them using matrices. For both, it's enough to consider the case where $\psi$is a Kronecker delta, say $\delta_j$.
In these terms, the first condition says
\begin{displaymath}
\sum_{i \in X} U_{i j} = 1
\end{displaymath}
for each column $j$. The second says
$U_{i j} \ge 0$
for all $i, j$.
So, in this case, a stochastic operator is just a square matrix where each column sums to 1 and all the entries are nonnegative. (Such matrices are often called .)
Next, let's see what we need for an operator $H$to have the property that $\exp(t H)$is stochastic for all $t \ge 0$. It's enough to assume $t$ is very small, which lets us use the approximation
\begin{displaymath}
\exp(t H) = 1 + t H + \cdots
\end{displaymath}
and work to first order in $t$. Saying that each column of this matrix sums to 1 then amounts to
\begin{displaymath}
\sum_{i \in X} \delta_{i j} + t H_{i j} + \cdots = 1
\end{displaymath}
which requires
\begin{displaymath}
\sum_{i \in X} H_{i j} = 0
\end{displaymath}
Saying that each entry is nonnegative amounts to
\begin{displaymath}
\delta_{i j} + t H_{i j} + \cdots \ge 0
\end{displaymath}
When $i = j$ this will be automatic when $t$ is small enough, so the meat of this condition is
\begin{displaymath}
H_{i j} \ge 0 \; \mathrm{if} \; i \ne j
\end{displaymath}
So, let's say a matrix $H$ is if its columns sum to zero and its off-diagonal entries are nonnegative.
I don't love this terminology: do you know a better one? There should be some standard term. People here say they've seen the term `stochastic Hamiltonian', but then a stochastic Hamiltonian is not a stochastic operator, which makes me nervous. The idea behind my term is that any infintesimal stochastic operator should be the of a stochastic process.
In other words, when we get the details straightened out, any 1-parameter family of stochastic operators
\begin{displaymath}
U(t) : L^1(X) \to L^1(X) \qquad t \ge 0
\end{displaymath}
obeying
\begin{displaymath}
U(0) = I
\end{displaymath}
\begin{displaymath}
U(t) U(s) = U(t+s)
\end{displaymath}
and continuity:
\begin{displaymath}
t_i \to t \quad \implies \quad U(t_i) \psi \to U(t)\psi
\end{displaymath}
should be of the form
\begin{displaymath}
U(t) = \exp(t H)
\end{displaymath}
for a unique `infinitesimal stochastic operator' $H$.
When $X$ is a finite set, this is true---and an infinitesimal stochastic operator is just a square matrix whose columns sum to zero and whose off-diagonal entries are nonzero. But do you know a theorem characterizing infinitesimal stochastic operators for general measure spaces $X$? Someone must have worked it out.
Luckily, for our work on stochastic Petri nets, we only need to understand the case where $X$ is a countable set and our integrals are really just sums. This should be almost like the case where $X$ is a finite set---but we'll need to take care that all our sums converge.
Now we can see why a Hamiltonian like $a^\dagger$ is no good, while $a^\dagger - 1$ is good. (I'll ignore the rate constant $r$ since it's irrelevant here.) The first one is not infinitesimal stochastic, while the second one is!
In this example, our set of states is the natural numbers:
\begin{displaymath}
X = \mathbb{N}
\end{displaymath}
The probability distribution
\begin{displaymath}
\psi : \mathbb{N} \to \mathbb{C}
\end{displaymath}
says the probability of having any number of rabbits in the trap.
The creation operator is not infinitesimal stochastic: in fact, it's stochastic! Why? Well, when we apply the creation operator, what was the probability of having $n$ rabbits now becomes the probability of having $n+1$ rabbits. So, the probabilities remain nonnegative, and their sum over all $n$ is unchanged. Those two conditions are all we need for a stochastic operator.
To see this in a more complicated way, suppose we reinterpret $\psi$ as a power series, using our trick from quantum field theory:
\begin{displaymath}
\psi = \sum_{n = 0}^\infty \psi_n x^n
\end{displaymath}
Then the total probability, which we're abstractly calling $\int \psi$, is just the sum of the probabilities $\psi_n$:
\begin{displaymath}
\int \psi = \sum_{n=0}^\infty \psi_n
\end{displaymath}
On the other hand
\begin{displaymath}
a^\dagger \psi = \sum_{n = 0}^\infty \psi_n x^{n+1}
\end{displaymath}
so the creation operator is stochastic:
\begin{displaymath}
\int a^\dagger \psi = \int \psi
\end{displaymath}
and
\begin{displaymath}
\psi \ge 0 \; \implies \; a^\dagger \psi \ge 0
\end{displaymath}
Precisely by virtue of being stochastic, the creation operator fails to be infinitesimally stochastic:
\begin{displaymath}
\int a^\dagger \psi \ne 0
\end{displaymath}
So, it's a bad Hamiltonian for our stochastic Petri net.
On the other hand, $a^\dagger - 1$ infinitesimally stochastic. Its off-diagonal entries are nonnegative, and
\begin{displaymath}
\int (a^\dagger - 1) \psi = 0
\end{displaymath}
precisely because
\begin{displaymath}
\int a^\dagger \psi = \int \psi
\end{displaymath}
You may be thinking: all this fancy math just to understand a single stochastic Petri net, the simplest one of all! But next time I'll explain a general recipe which will let you write down the Hamiltonian for stochastic Petri net. All the lessons we've so painfully learned today will make this much easier. And pondering the analogy between probability theory and quantum theory will also be good for our bigger project of unifying the applications of in different subjects.
category: blog
\end{document}