\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 - Noether's theorem: quantum vs stochastic}
This is a [[Blog articles in progress|blog article in progress]], written by [[Ville Bergholm]]. See also [[Blog - quantum network theory (part 1)|Blog - quantum network theory (part 1)]] and [[Blog - quantum network theory (part 2)|Blog - quantum network theory (part 2)]]. To see discussions of the article as it was being written, visit the \href{http://forum.azimuthproject.org/discussion/1321/blog-noethers-theorem-quantum-vs-stochastic}{Azimuth Forum}. For the final polished version, go to the \href{http://johncarlosbaez.wordpress.com/2014/05/03/noethers-theorem-quantum-vs-stochastic/}{Azimuth Blog}.
If you want to write your own article, please read the directions on \href{http://www.azimuthproject.org/azimuth/show/How+to#blog}{How to blog}.
\emph{guest post by }
In 1915 Emmy Noether discovered an important connection between the symmetries of a system and its conserved quantities. Her result has become a staple of modern physics and is known as Noether's theorem.
The theorem and its generalizations have found particularly wide use in quantum theory. Those of you following the series here on Azimuth might recall where John Baez and Brendan Fong proved a version of Noether's theorem for stochastic systems. Their result is now published here:
$\bullet$ John Baez and Brendan Fong, , 54:013301 (2013).
One goal of the network theory series here on Azimuth has been to merge ideas appearing in quantum theory with other disciplines. John and Brendan proved their stochastic version of Noether's theorem by exploiting `stochastic mechanics' which was formulated in the network theory series to mathematically resemble quantum theory. Their result, which we will outline below, was different than what would be expected in quantum theory, so it is interesting to try to figure out .
Recently , and myself have been working to try to get to the bottom of these differences. What we've done is prove a version of Noether's theorem for Dirichlet operators. As you may recall from Parts and of the network theory series, these are the operators that generate both stochastic quantum processes. In the language of the series, they lie in the intersection of stochastic and quantum mechanics. So, they are a subclass of the infinitesimal stochastic operators considered in John and Brendan's work.
The extra structure of Dirichlet operators---compared with the wider class of infinitesimal stochastic operators---provided a handle for us to dig a little deeper into understanding the intersection of these two theories. By the end of this article, astute readers will be able to prove that Dirichlet operators generate processes.
Before we get into the details of our proof, let's recall first how conservation laws work in quantum mechanics, and then contrast this with what John and Brendan discovered for stochastic systems. (For a more detailed comparison between the stochastic and quantum versions of the theorem, see of the network theory series.)
I'll assume you're familiar with quantum theory, but let's start with a few reminders.
In standard quantum theory, when we have a closed system with $n$ states, the unitary time evolution of a state $|\psi(t)\rangle$ is generated by a self-adjoint $n \times n$ matrix $H$ called the Hamiltonian. In other words, $|\psi(t)\rangle$ satisfies :
$i \hbar \displaystyle{\frac{d}{d t}} |\psi(t) \rangle = H |\psi(t) \rangle.$
The state of a system starting off at time zero in the state $|\psi_0 \rangle$ and evolving for a time $t$ is then given by
$|\psi(t) \rangle = e^{-i t H}|\psi_0 \rangle.$
The observable properties of a quantum system are associated with self-adjoint operators. So, we call a self-adjoint $n \times n$ matrix an . The expected value of an observable $O$ in a state $|\psi \rangle$ is
$\langle O \rangle_{\psi} = \langle \psi | O | \psi \rangle$
This expected value is constant in time for all states if and only if $O$ with the Hamiltonian $H$:
$[O, H] = 0 \quad \iff \quad \displaystyle{\frac{d}{d t}} \langle O \rangle_{\psi(t)} = 0 \quad \forall \: |\psi_0 \rangle, \forall t.$
In this case we say $O$ is a . The fact that we have two equivalent conditions for this is a version of Noether's theorem.
In stochastic mechanics, the story changes a bit. Now a state $|\psi(t)\rangle$ is a probability distribution: a vector with $n$ nonnegative entries that sum to one. And now the Hamiltonian $H$ is an operator, i.e. a real-valued $n \times n$ matrix with non-negative off-diagonal entries and columns summing to zero. Schr\"o{}dinger's equation gets replaced by the :
$\displaystyle{\frac{d}{d t}} |\psi(t) \rangle = H |\psi(t) \rangle$
If we start with a probability distribution $|\psi_0 \rangle$ at time zero and evolve it according to the master equation, at some later time we'll have the probability distribution
$|\psi(t)\rangle = e^{t H} |\psi_0 \rangle.$
So, $e^{t H}$ maps the space of probability distributions to itself, and we call it a , or more precisely a .
In this context an $O$ is a real diagonal $n \times n$ matrix, and its expected value is given by
$\langle O\rangle_{\psi} = \langle \hat{O} | \psi \rangle$
where $\hat{O}$ is the vector built from the diagonal entries of $O$. More concretely,
$\langle O\rangle_{\psi} = \displaystyle{ \sum_i O_{i i} \psi_i }$
where $\psi_i$ is the $i$th component of the vector $|\psi\rangle$.
Here is a version of Noether's theorem for stochastic mechanics:
\textbf{Noether's Theorem for Markov Processes (Baez--Fong).} Suppose $H$ is an infinitesimal stochastic operator and $O$ is an observable. Then
$[O,H] =0$
if and only if
$\displaystyle{\frac{d}{d t}} \langle O \rangle_{\psi(t)} = 0$
and
$\displaystyle{\frac{d}{d t}}\langle O^2 \rangle_{\psi(t)} = 0$
for all $t$ and all $\psi(t)$ obeying the master equation.
So, just as in quantum mechanics, whenever $[O,H]=0$ the expected value of $O$ will be conserved:
$\displaystyle{\frac{d}{d t}} \langle O\rangle_{\psi(t)} = 0$
for any $\psi_0$ and all $t$. However, John and Brendan showed that---unlike in quantum mechanics---you need more than just the expectation value of the observable $O$ to be constant to obtain the equation $[O,H]=0$. You really need both
$\displaystyle{\frac{d}{d t}} \langle O\rangle_{\psi(t)} = 0$
together with
$\displaystyle{\frac{d}{d t}} \langle O^2\rangle_{\psi(t)} = 0$
for all initial data $\psi_0$ to be sure that $[O,H]=0$.
So it's a bit subtle, but symmetries and conserved quantities have a rather different relationship than they do in quantum theory.
But what if the infinitesimal generator of our Markov semigroup is also self-adjoint? In other words, what if $H$ is both an infinitesimal stochastic matrix but also its own transpose: $H = H^\top$? Then it's called a \ldots{} and we found that in this case, we get a stochastic version of Noether's theorem that more closely resembles the usual quantum one:
\textbf{Noether's Theorem for Dirichlet Operators.} If $H$ is an infinitesimal stochastic operator with $H = H^\top$, and $O$ is an observable, then
$[O, H] = 0 \quad \iff \quad \displaystyle{\frac{d}{d t}} \langle O \rangle_{\psi(t)} = 0 \quad \forall \: |\psi_0 \rangle, \forall t \ge 0.$
\textbf{Proof.} The $\implies$ direction is easy to show and it follows from John and Brendan's theorem. The point is to show the $\Leftarrow$ direction. Since $H$ is self-adjoint, we may use a spectral decomposition:
$H = \displaystyle{ \sum_k E_k |\phi_k \rangle \langle \phi_k |}$
where $\phi_k$ are an orthonormal basis of eigenvectors, and $E_k$ are the corresponding eigenvalues. We then have:
$\displaystyle{\frac{d}{d t}} \langle O \rangle_{\psi(t)} = \langle \hat{O} | H e^{t H} |\psi_0 \rangle = 0 \quad \forall \: |\psi_0 \rangle, \forall t \ge 0$
$\iff \quad \langle \hat{O}| H e^{t H} = 0 \quad \forall t \ge 0$
$\iff \quad \sum_k \langle \hat{O} | \phi_k \rangle E_k e^{t E_k} \langle \phi_k| = 0 \quad \forall t \ge 0$
$\iff \quad \langle \hat{O} | \phi_k \rangle E_k e^{t E_k} = 0 \quad \forall t \ge 0$
$\iff \quad |\hat{O} \rangle \in \Span\{|\phi_k \rangle | E_k = 0\} = \ker \: H,$
where the third equivalence is due to the vectors $|\phi_k \rangle$ being linearly independent. For any infinitesimal stochastic operator $H$ the corresponding transition graph consists of $m$ connected components iff we may reorder (permute) the states of the system such that $H$ becomes block-diagonal with $m$ blocks. Now it is easy to see that the kernel of $H$ is spanned by $m$ eigenvectors, one for each block. Since $H$ is also symmetric, the elements of each such vector can be chosen to be ones within the block and zeros outside it. Consequently
$|\hat{O} \rangle \in \ker \: H$
implies that we can choose the basis of eigenvectors of $O$ to be $\{|\phi_k \rangle\}_k$, which implies
$[O, H] = 0$.
Alternatively,
$|\hat{O} \rangle \in \ker \, H$
implies that
$|\hat{O^2} \rangle \in \ker \: H \quad \iff \quad \ldots \quad \iff \quad \displaystyle{\frac{d}{d t}} \langle O^2 \rangle_{\psi(t)} = 0 \quad \forall \: |\psi_0 \rangle, \forall t \ge 0,$
where we have used the above sequence of equivalences backwards. Now, using John and Brendan's original proof, we can obtain $[O, H] = 0$. ~
In summary, by restricting ourselves to the intersection of quantum and stochastic generators, we have found a version of Noether's theorem for stochastic mechanics that looks formally just like the quantum version! However, this simplification comes at a cost. We find that the only observables $O$ that remain invariant under a symmetric $H$ are of the very restricted type described above, where the observable has to have the same value in every state in a connected component.
Suppose that a $H$ generates a Markov semigroup as follows:
$U(t) = e^{t H}$
defined for all non-negative times $t$.
\textbf{Puzzle 1.} Suppose that also $H = H^\top$, so that $H$ is a Dirichlet operator and hence $i H$ generates a 1-parameter unitary group. Show the following. Let $n$ label any node of the underlying adjacency matrix corresponding to $H$. Then the of any node $n$ are equal: graphs with this property are called .
\textbf{Puzzle 2.} Show that $U(t) = e^{t H}$ is Markov semigroup, e.g.
$\displaystyle{ \sum_i U(t)_{i j} = \sum_j U(t)_{i j} = 1 }$
and all the matrix entries of $U(t)$ are nonnegative for all $t \ge 0$, if and only if the matrix $H$ obeys
$\displaystyle{\sum_i H_{i j} = \sum_j H_{i j} = 0 }$
and all the off-diagonal entries of $H$ are nonnegative.
\textbf{Puzzle 3.} Prove that any doubly stochastic Markov semigroup $U(t)$ is of the form $e^{t H}$ where $H$ is the graph Laplacian of a balanced graph.
\textbf{Puzzle 4.} Let $O(t)$ be a possibly time-dependent observable, and write $\langle O(t) \rangle_{\psi(t)}$ for its expected value with respect to some initial state $\psi_0$ evolving according to the master equation. Show that
$\displaystyle{ \frac{d}{d t}\langle O(t)\rangle_{\psi(t)} = \langle [O(t), H] \rangle + \left\langle \frac{\partial O(t)}{\partial t}\right\rangle_{\psi(t)} }$
This is a stochastic version of the .
category:blog
[[!redirects Blog - A Noether theorem for doubly stochastic Markov processes]] [[!redirects Blog - Noether's theorem for symmetric Markov processes]] [[!redirects Blog - Noether's theorem for doubly stochastic Markov processes]] [[!redirects Blog - Noether's theorem: quantum versus stochastic]]
\end{document}