Changeset - 330b6c1a9887
[Not reviewed]
0 1 0
Andras Gilyen - 8 years ago 2017-09-07 18:50:44
gilyen@clayoquot.swat.cwi.nl
nicer proof
1 file changed with 28 insertions and 9 deletions:
main.tex
28
9
0 comments (0 inline, 0 general)
main.tex
Show inline comments
 
@@ -596,6 +596,15 @@ The lemma says that conditioned on $v$ and $w$ not being crossed, the two halves
 
	where there is no longer a condition on the starting state.
 
\end{lemma}
 

	
 
    Some notation: let $P$ be an interval $[a,b]$. We say $P$ is a \emph{patch} when the $\Z{i}$ event holds for all $i \in [a,b]$ and $\NZ{a-1}$ and $\NZ{b+1}$ holds. We denote this event by $P\in\mathcal{P}$, so
 
	\begin{align*}
 
	P\in\mathcal{P} \equiv \NZ{a-1} \cap \Z{a} \cap \Z{a+1} \cap \cdots \cap \Z{b-1} \cap \Z{b} \cap \NZ{b+1} .
 
	\end{align*}
 
	Note that we have the following partition of the event $\Z{v}$ for any vertex $v\in[n]$:
 
	\begin{align*}
 
	\Z{v} = \dot\bigcup_{P : v\in P} (P\in\mathcal{P})
 
	\end{align*}
 

	
 
The intuition of the following lemma is that the far right can only affect the zero vertex if there is an interaction chain forming, which means that every vertex should get resampled to $0$ at least once.
 
\begin{lemma}\label{lemma:probIndepNew}
 
	$\forall n\in \mathbb{N}_+:\P^{[n]}(\Z{1})-\P^{[n+1]}(\Z{1}) = \bigO{p^{n}}$. (Should be true with $\bigO{p^{n+1}}$ as well.)
 
@@ -676,14 +685,26 @@ The intuition of the following lemma is that the far right can only affect the z
 
		$R^{(n)}-R^{(m)}=\bigO{p^{\min(n,m)}}$.
 
	\end{theorem}
 
	\begin{proof}
 
        Some notation: let $P$ be an interval $[a,b]$. We say $P$ is a \emph{patch} when the $\Z{i}$ event holds for all $i \in [a,b]$ and $\NZ{a-1}$ and $\NZ{b+1}$ holds. We denote this event by $P\in\mathcal{P}$, so
 
        \begin{align*}
 
            P\in\mathcal{P} \equiv \NZ{a-1} \cap \Z{a} \cap \Z{a+1} \cap \cdots \cap \Z{b-1} \cap \Z{b} \cap \NZ{b+1} .
 
        \end{align*}
 
        Note that we have the following partition of the event $\Z{v}$ for any vertex $v\in[n]$:
 
		Let $N\geq \max(2n,2m)$, then
 
		\vskip-3mm
 
		\begin{align*}
 
            \Z{v} = \dot\bigcup_{P : v\in P} (P\in\mathcal{P})
 
			R^{(n)}
 
			&= \E^{(n)}(\Res{0}) \tag{by translation invariance}\\
 
			&= \sum_{k=1}^{\infty}\P^{(n)}(\Res{0}\!\geq\! k) \\		
 
			&= \sum_{k=1}^{\infty}\sum_{\underset{v+w\leq n+1}{v,w\in [n]}}\P^{(n)}(\Res{0}\!\geq\! k\,\&\, \underset{P_{v,w}:=}{\underbrace{[-v\!+\!1,w\!-\!1]}}\in\mathcal{P}) \tag{partition}\\[-1mm]
 
			&= \sum_{k=1}^{\infty}\sum_{\underset{v+w\leq n}{v,w\in [n]}}\P^{(n)}(\Res{0}\!\geq\! k\,\&\, P_{v,w}\!\in\!\mathcal{P}) +\bigO{p^{n}}\\[-1mm]
 
			&= \sum_{k=1}^{\infty}\smash{\sum_{\underset{v+w\leq n}{v,w\in [n]}}}\P^{[-v,w]}_{b_{-v}=b_{w}=1}(\Res{0}\!\geq\! k\,\&\, P_{v,w}\!\in\!\mathcal{P}) \P^{[w,n-v]}(\NZ{w,n-v}) +\bigO{p^{n}} \tag{by Lemma~\ref{lemma:eventindependenceNew}}\\
 
			&= \sum_{k=1}^{\infty}\smash{\sum_{\underset{v+w\leq n}{v,w\in [n]}}}\P^{[-v,w]}_{b_{-v}=b_{w}=1}(\Res{0}\!\geq\! k\,\&\, P_{v,w}\!\in\!\mathcal{P})  \left(\left(\P^{[w,n-v]}(\NZ{w})\right)^{\!\!2}\!+\!\bigO{p^{n-v-w+1}}\right) +\bigO{p^{n}} \tag{by Lemma~\ref{lemma:independenetSidesNew}}\\
 
			&= \sum_{k=1}^{\infty}\smash{\sum_{\underset{v+w\leq n}{v,w\in [n]}}}\P^{[-v,w]}_{b_{-v}=b_{w}=1}(\Res{0}\!\geq\! k\,\&\, P_{v,w}\!\in\!\mathcal{P})  \left(\P^{[-N,-v]}(\NZ{-v})\P^{[w,N]}(\NZ{w})\!+\!\bigO{p^{n-v-w+1}}\right) +\bigO{p^{n}} \tag{by Lemma~\ref{lemma:independenetSidesNew}}\\	
 
			&= \sum_{k=1}^{\infty}\smash{\sum_{\underset{v+w\leq n}{v,w\in [n]}}}\P^{[-v,w]}_{b_{-v}=b_{w}=1}(\Res{0}\!\geq\! k\,\&\, P_{v,w}\!\in\!\mathcal{P}) \P^{[-N,-v]}(\NZ{-v})\P^{[w,N]}(\NZ{w}) +\bigO{p^{n}} \tag{$|P_{v,w}|=v+w-1$}\\
 
			&= \sum_{k=1}^{\infty}\sum_{\underset{v+w\leq n}{v,w\in [n]}}\P^{[-N,N]}(\Res{0}\!\geq\! k\,\&\, P_{v,w}\!\in\!\mathcal{P}) +\bigO{p^{n}} \tag{by Lemma~\ref{lemma:eventindependenceNew}}\\[-1mm]
 
			&= \sum_{k=1}^{\infty}\sum_{\underset{|P|<n}{P\text{ patch}:0\in P}}\P^{[-N,N]}(\Res{0}\!\geq\! k\,\&\, P\in\mathcal{P}) +\bigO{p^{n}} \\[-1mm]
 
			&= \sum_{k=1}^{\infty}\sum_{P\text{ patch}:0\in P}\P^{[-N,N]}(\Res{0}\!\geq\! k\,\&\, P\in\mathcal{P}) +\bigO{p^{n}} \\
 
			&= \E^{[-N,N]}(\Res{0})+\bigO{p^{n}}.\\[-3mm]										
 
		\end{align*}  
 
		\noindent Repeating the same argument with $m$ and comparing the results completes the proof.
 
	\end{proof} 	
 
\begin{comment}
 
		Let $N\geq \max(2n,2m)$, then
 
		\begin{align*}
 
		R^{(n)}
 
@@ -701,9 +722,7 @@ The intuition of the following lemma is that the far right can only affect the z
 
		&= \sum_{k=1}^{\infty}\sum_{P\text{ patch}:1\in P}\P^{[-N,N]}(\Res{1}\geq k\,\&\, P\in\mathcal{P}) +\bigO{p^{n}} \tag{by Lemma~\ref{lemma:eventindependenceNew}}\\
 
		&= \E^{[-N,N]}(\Res{1})+\bigO{p^{n}}.
 
		\end{align*}	
 
		
 
		Repeating the same calculation with $m$, and comparing the two expressions completes the proof.
 
	\end{proof} 	
 
\end{comment}			
 

	
 
Old:
 

	
0 comments (0 inline, 0 general)