\documentclass[a4paper,12pt]{article} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage[english]{babel} \usepackage{mathpazo} \usepackage{tikz} \usepackage{amsmath,amsthm,amssymb,mathtools,graphicx} \usepackage[top=2.5cm,bottom=2.5cm,left=2cm,right=2cm]{geometry} \usepackage[unicode,colorlinks=true,linkcolor=blue,citecolor=red, urlcolor=blue,pdfencoding=auto,psdextra,pdfusetitle]{hyperref} \linespread{1.1} \usepackage[numbers,sort&compress]{natbib} \usepackage{enumitem} \setlist[itemize]{leftmargin=2em,itemsep=0.25em,topsep=0.35em} \setlist[enumerate]{leftmargin=2.25em,itemsep=0.25em,topsep=0.35em} \numberwithin{equation}{section} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \renewcommand{\P}{\mathbb P} \newcommand{\E}{\mathbb E} \newcommand{\dd}{\,\mathrm d} \newcommand{\Cost}{\mathcal C} \title{The speed of biased random walk on leafless Bienaymé trees is monotone} \author{ChatGPT, directed by Igor Kortchemski \thanks{CNRS \& DMA, \'Ecole normale sup\'erieure, PSL University, 75005 Paris, France, \texttt{igor.kortchemski@math.cnrs.fr}}} \date{} \begin{document} \maketitle \begin{abstract} Let $\nu$ be the offspring variable of a Bienaymé tree without leaves, with finite mean $m>1$. We prove that the speed $v(\lambda)$ of the $\lambda$-biased random walk is continuously differentiable on $[0,m)$, with $v'(\lambda)<0$ for every $0<\lambdam$. For $0\le\lambda0$ such that almost surely, for almost every tree, $|X_n|/n\to v(\lambda)$, where $|X_n|$ is the distance from the root \cite{LPP95,LPP96}. On the regular tree with $k$ children per vertex, the speed for $0\le\lambda0$, he uses a computer-assisted argument for $1<\lambda<\min\{m,(3+\sqrt{5})/2\}$. Our proof is analytic for $9/5\le\lambda1$. Anthropic's Claude Opus~5.5, running in Claude Code, coordinated the work. The campaign recorded 134 tasks, including proof searches, independent reviews, computational checks and the preparation of the first draft. The agents used OpenAI's GPT-6.2 Astra and GPT-6.2 Sol through Codex, and Anthropic's Claude Opus~5.5, Claude Fable~5.2 and Claude Sonnet~5.5. The author also submitted six questions to ChatGPT Pro and incorporated the replies into the investigation. By the end of this second step, the first draft contained a complete proof of the conjecture, including the computational verifications needed to cover the full range of biases. In a third step, the author revised the 75-page first draft over several rounds with OpenAI's GPT-6.2 Astra through Codex. ChatGPT Pro reviewed intermediate drafts and suggested ways to simplify the computations or replace them with analytic arguments. For example, the first proof for $2\le\lambda0$. Let $J$ have the law of $\nu$ given $\nu\ge2$. Write $\varrho$ for the root of the Bienaymé tree $\mathcal T$, $|x|$ for the generation of a vertex $x$, $\nu(x)$ for its number of children, and $\mathcal T_x$ for its descendant tree. We add a parent $\varrho_*$ to the root, with $|\varrho_*|=-1$. On the resulting tree the walk jumps from a vertex with $j$ children to its parent with probability $\lambda/(\lambda+j)$ and to each child with probability $1/(\lambda+j)$. From $\varrho_*$ it returns to $\varrho$. At bias zero its speed is one. Let $P_x^{\mathcal T}$ denote the law of the walk started at $x$ given the tree. We write $\P$ for the joint law of the tree and the walk started at $\varrho$. The escape probability of the tree is \[ \beta=\beta_\lambda(\mathcal T) =P_\varrho^{\mathcal T}(X_n\ne\varrho_*\text{ for all }n\ge0). \] We use $\beta,\beta'$ for the escapes of two independent trees and $\mathcal T_1,\ldots,\mathcal T_\nu$ for the child subtrees of the root. For $|x|\le n$, let $\beta^{(n)}(x)$ be the probability of reaching generation $n$ from $x$ before visiting its parent. Its value at the root is denoted by $\beta^{(n)}$. \begin{lemma}\label{lem:escape} Let $\lambda>0$ and let $\mathcal T$ be a tree without leaves. \begin{enumerate}[label=(\roman*)] \item With $S=\sum_{i=1}^{\nu}\beta(\mathcal T_i)$, one has $\beta(\mathcal T)=S/(\lambda+S)$. Likewise $\beta^{(n)}(x)=S^{(n)}(x)/(\lambda+S^{(n)}(x))$ for $|x|0$. With the notation above, \begin{equation}\label{eq:aidekon} v(\lambda)=\frac{\E[(\nu-\lambda)\beta_0/(a+\beta_0+S)]} {\E[(\nu+\lambda)\beta_0/(a+\beta_0+S)]}=\frac NZ . \end{equation} \end{theorem} \begin{proof} First note the bounds \begin{equation}\label{eq:kernel-bounds} \min(1,\lambda)\max(\beta,\beta')\le D=\lambda-(1-\beta)(1-\beta')\le\lambda . \end{equation} For $\lambda\ge1$ we have $D\ge\tau\ge\beta$. Below one, Lemma~\ref{lem:escape}(iii) gives $1-\beta'\le\lambda$ and hence $D\ge\lambda\beta$. By symmetry the bounds follow. Since $0<\beta\beta'<\tau\le2\max(\beta,\beta')$, we have $00$ and $\lambda U<1$, then $\E[1/\beta_\lambda]\le(1-\lambda U)^{-1}$. This includes a neighbourhood of bias one since $1/m\le U<1$. \end{lemma} \begin{proof} Starting at $R_0=1$, the finite-depth reciprocals $R_n=1/\beta^{(n)}$ satisfy \[ R_n=1+\frac{\lambda}{\sum_{i=1}^\nu 1/R_{n-1,i}} \le1+\frac{\lambda}{\nu^2}\sum_{i=1}^\nu R_{n-1,i}. \] Taking expectations and iterating gives $\E R_n\le\sum_{j=0}^n(\lambda U)^j$. Let $n\to\infty$ by monotone convergence. Jensen and $\P(\nu\ge2)>0$ give the bounds on $U$. \end{proof} We call $u=-\lambda\partial_\lambda\beta$ the \emph{response} of the tree. Aïdékon~\citep[Section~1]{Aid13} differentiated the escape recursion below bias one. For the finite-depth argument see Song, Wang and Xiang~\citep[Section~2]{SWX25}, and for its expansion along a path see Schwarzfischer~\citep[Remark~2.7]{Sch26}. \begin{proposition}[Escape response]\label{prop:regularity} Almost surely the escape of every subtree is $C^1$ on $(0,m)$. On each compact interval $I\subset(0,m)$ there is an integrable $K_I\ge0$ such that $0\le-\partial_\lambda\beta\le K_I\beta$ throughout $I$. Writing $S=\sum_i\beta_i$ and $u_i$ for the child responses, we have \[ u=\beta(1-\beta)+\frac{\lambda}{(\lambda+S)^2}\sum_i u_i . \] In particular $u\ge\beta(1-\beta)$, and $2u\ge1-\beta$ for $\lambda\le1$. \end{proposition} \begin{proof} At finite depth write $b_x=\beta^{(n)}(x)$ and $w_x=-\lambda\partial_\lambda\log b_x$. Differentiating the recursion gives \[ w_x=(1-b_x)\Big(1+\sum_{y}\frac{b_y}{\sum_z b_z}\,w_y\Big), \] where $y,z$ run over the children of $x$ and $w_x=0$ at the boundary. Follow a downward path by choosing a child with probability proportional to $b_y$. Iteration expresses $w_\varrho$ as the sum, over $1\le k\le n$, of the path averages of the product of $1-b_x$ along its first $k$ edges, one factor at the parent end of each edge. Fix $I=[\lambda_-,\lambda_+]\subset(0,m)$. On the edge to child $y$, bound its factor by $\sigma(y)=\lambda_+/(\lambda_++\sum_z\beta_{\lambda_+}(\mathcal T_z))$, where the sum is over the siblings of $y$. This bound is independent of the subtree at $y$ and holds for every $n$ and $\lambda\in I$. Let $M_k$ be the largest product of $\sigma$ along a path of length $k$ from the root. Let $\gamma\ge1$ be an integer. Bounding $M_k^\gamma$ by the sum of the $\gamma$th powers and conditioning successively on the siblings of a marked child gives \[ \E M_k^\gamma\le r_\gamma^k,\qquad r_\gamma=\E\!\left[\nu\left(\frac{\lambda_+}{\lambda_+ +\sum_{i=2}^\nu\beta_{\lambda_+}(\mathcal T_i)}\right)^\gamma\right]. \] Since the escapes are positive and $\E[\nu]<\infty$, dominated convergence gives $r_\gamma\to\P(\nu=1)<1$. Choose $\gamma\ge1$ with $r_\gamma<1$. Then $\E M_k\le r_\gamma^{k/\gamma}$ and $K_I=\lambda_-^{-1}\sum_{k\ge1}M_k$ is integrable. It follows that $0\le-\partial_\lambda\log b_\varrho\le K_I$ uniformly in depth. On every subtree the same bound gives equicontinuity, hence uniform convergence of the escapes on $I$ to their positive limits. Each path average of fixed length now converges uniformly, since it involves finitely many positive child sums. Their summable bounds $M_k$ give uniform convergence of $w_\varrho$. Passing to the limit in the logarithmic derivatives proves the first assertions on a countable compact exhaustion of $(0,m)$. The recursion for $u$ follows by differentiation. At finite depth take $u_x=-\lambda\partial_\lambda b_x$, $S=\sum_y b_y$ and $d_x=2u_x-(1-b_x)$. Then $(\lambda+S)^2d_x/\lambda=\nu(x)-\lambda+\sum_y d_y$. For $\lambda\le1$ each source is nonnegative and the boundary values are zero. Induction and passage to the limit give $2u\ge1-\beta$. \end{proof} \subsection{Differentiating the speed}\label{ssec:prelim-cost} Write $D(b,b')=a+b+b'-bb'$ as before. The speed is the unique $c$ for which $F_c(b,b')=(bb'-c(b+b'-bb'))/D(b,b')$ has mean zero at $(b,b')=(\beta,\beta')$. A change of bias acts both on $D$ and on the two escapes. For $b$ in the range $[\max(0,1-\lambda),1]$, set \[ H=\E\frac{\beta\beta'-v\tau}{D^2},\qquad \Gamma(b)=\E\frac{P(\beta')}{D(b,\beta')^2},\qquad P(t)=t^2+a(1+v)t-av. \] \begin{proposition}[Derivative of the speed]\label{prop:cost} The functions $N$, $Z$ and $v$ are $C^1$ on $(0,m)$. The speed is $C^1$ up to zero with $v'_+(0)=-2\E[1/\nu]$. For $0<\lambda0$, and the last inequality is Lemma~\ref{lem:inverse-moment}. It remains to relate this drift comparison to $v'$. Put $t=1-\lambda$. Since $b'\ge t$ on the escape law, $P(b')=b'(b'-t)+vt(1-b')\ge0$, so $\Gamma\ge0$ there. The bound $2u\ge1-\beta$ of Proposition~\ref{prop:regularity} and \eqref{eq:half-response} give $-\lambda Z v'\ge K_1-vK_0$. For each $b'\ge t$, the function $b/D(b,b')$ has derivative $(b'-t)/D(b,b')^2\ge0$. Its covariance with $1/b$ is therefore nonpositive. Conditioning on $\beta'$ gives $K_0\le K_1\E[1/\beta]$. The strict drift bound above now gives $K_1-vK_0>0$. \end{proof} \section{Comparison of escapes above bias one}\label{sec:ward} Throughout this section $1<\lambda0$ for every integer $j\ge0$. \end{enumerate} \end{lemma} \begin{proof} (i) For $0\le w\le b$ let \[ \mathcal H_w(y,t)=\frac{ayt-w(y+t-(1+\lambda)yt)}{1-\lambda yt}, \qquad B_w(t)=at-w(1-t)(1-\lambda t). \] By Proposition~\ref{prop:collapse}, $\E\mathcal H_w(Y,Y')=N-wZ$. For an independent variable $\xi\in[0,1/\lambda]$ the expansion \begin{equation}\label{eq:kernel-shape} \E\mathcal H_w(y,\xi)=-w\E\xi+ \sum_{n\ge1}\lambda^{n-1}\E[\xi^{n-1}B_w(\xi)]\,y^n \end{equation} converges uniformly for $0\le y\le1/\lambda$, since $\lambda y\xi\le1/\lambda$. All its nonconstant coefficients are nonnegative as soon as $0\le w\le b_0:=am_0/(1-m_0)$, where $m_0=\E\xi>0$. Indeed $\E B_w(\xi)\ge\E B_{b_0}(\xi)=\lambda b_0(m_0-\E\xi^2)>0$, and $\xi^{n-1}$ and $B_w(\xi)$ are increasing functions of $\xi$. Thus increasing the moments in either escape variable increases the expectation of the kernel whenever the other variable satisfies the mean condition. By Lemma~\ref{lem:convex-order} we may replace $Y,Y'$ in turn by independent copies of $Y_*=\lambda^{-G_*}$, since their means agree. Write $q=1-b$ and $S_*=S(q)$. To compute the quotient for the geometric law, group the pairs of lengths $(G_*,G_*')$ by $k=G_*+G_*'-1$. The $k$ pairs each have probability $b^2(1-b)^{k-1}$, and $\sum_{i=1}^k\lambda^{-i}=(1-\lambda^{-k})/a$. Consequently \[ \E\frac{Y_*}{1-\lambda Y_*Y_*'}=\frac ba,\qquad \E\frac{Y_*Y_*'}{1-\lambda Y_*Y_*'}=\frac{b^2S_*}{a\lambda}. \] The quotient for the geometric comparison law is $v_*=abS(q)/[2\lambda-(1+\lambda)bS(q)]$. Let $U$ be uniform on $[1,\lambda]$. Since $Q_j/j=\E U^{j-1}$, Jensen's inequality gives $Q_j/j\ge ((1+\lambda)/2)^{j-1}$ and hence \begin{equation}\label{eq:geometric-sum} S(q)\le\frac{1+\lambda}{1+\lambda-2q}. \end{equation} It follows that $v_*\le b(1+\lambda)/(2\lambda-ab)0$, then $v'(\lambda)<0$. The same conclusion holds whenever $\theta=1$ is admissible. \end{corollary} \begin{proof} Set $\theta=1-(1+v)R_0/(2\mu)\in(0,1)$. Substitution gives $2\E f_\theta(Y)=\mu Q$. In particular $Q>0$ makes $\theta$ admissible. The alternative assumption $\E f_1(Y)\ge0$ also gives $\E f_\theta(Y)>0$, since $\theta<1$. Take $\underline u=s_\beta=\beta(1-\beta)$ in Theorem~\ref{thm:ward}. Then $R_W-\E[s_\beta\Gamma_2(\beta)]=\E[s_\beta s_{\beta'}/D^2]$. Since $\E[(\beta\beta'-v\tau)/D]=0$, replace $\lambda$ in $\lambda H$ by $\lambda-D=(1-\beta)(1-\beta')$. Substituting $P(t)=\lambda[t-v(1-t)]+(1-t)(v-t)$ and using symmetry gives \[ \Cost\ge\E\!\left[\frac{s_\beta}{D^2} \{2\lambda[\beta'-v(1-\beta')]+(2\theta-1+v)s_{\beta'}\}\right]. \] Indeed the remaining terms simplify by $\beta\beta'-v\tau+\beta(v-\beta')+\beta'(v-\beta)=(v-1)\beta\beta'$. In the transformed variables the lower bound is \[ \E\!\left[Y(1-\lambda Y)\frac{g(Y')}{(1-\lambda YY')^2}\right], \qquad g(y)=2\lambda f_\theta(y)+\lambda(1+v)y(c-y) . \] Our choice of $\theta$ makes the last summand in $g(Y')$ centered. The quadratic $g$ is negative at zero and positive at $1/\lambda$. Conditionally on $Y$ the weight $(1-\lambda YY')^{-2}$ increases with $Y'$ and is at least one. Lemma~\ref{lem:single-crossing} thus bounds the preceding expectation below by $R_0\E g(Y')$, which is positive. \end{proof} \subsection{An analytic test for high bias}\label{sec:far-above} The next test will be used twice. A large bias suffices on its own. For smaller biases, the first branching vertex will give a lower bound on the geometric parameter $p_{\rm eff}$ in Corollary~\ref{cor:analytic-law}. \begin{theorem}\label{thm:above-two} Let $1<\lambda0$ in \eqref{eq:source-test}. The expression $Q$ decreases in $c$ and $r$. Indeed the bracket increases in $c$ and at $c=\mu$ equals $(1-L\mu)(2-2\mu-a\mu^2)/\mu>0$. Write $q=1-b$. Lemmas~\ref{lem:convex-order} and~\ref{lem:speed-ceiling} give $c\le(L-q)/(L^2-q)$ and $r\le bS(q)/[2L-(1+L)bS(q)]$. Substitution, using $\mu=b/(L-q)$, reduces the assertion to $F(S(q))>0$, where $F$ is the decreasing affine function \[ F(t)=L(2L^3-Lq-q^2)-(L-q)\{L^2(L+1)-Lq-q^2\}t . \] Since $(1-L^{-j})j/Q_j=ajL^{-j}$, summing over $j$ gives \[ S(q)=\frac{aL}{(L-q)^2}+\frac1L S(q/L). \] Iterating once more and applying~\eqref{eq:geometric-sum} to the remainder gives $S(q)\le S_2$, where \[ S_2=\frac{aL}{(L-q)^2}+\frac{aL^2}{(L^2-q)^2} +\frac{L+1}{L^2(L+1)-2q}. \] It remains to prove $F(S_2)>0$. Set $z=aL/(a+b)$ and $C=1+3z+z^2$. Then $a\le z\le L$ and $b=(L-1)(L-z)/z$. Substitution gives $F(S_2)=aL^2(C-L)\Phi/z^2$, where \[ \Phi=L-z-\frac{Lz}{(1+z)^2}-\frac{1+L}{2+(L+2)z} +\frac{Lz^2}{C-L}. \] Here $C-L\ge2z+z^2>0$. At fixed $z$, the last term increases with $L$. The derivative of the preceding terms is \[ 1-\frac{z}{(1+z)^2}-\frac{2+z}{[2+(L+2)z]^2} \ge 1-\frac14-\frac12>0. \] As $L$ decreases towards $\max(1,z)$, the product $b=(L-1)(L-z)/z$ decreases to zero. We therefore reach either the line $24b+10a=8$ or the boundary $b=0$ while $24b+10a\ge8$. At $b=0$ we have $L=z\ge9/5$, and $\Phi>0$ amounts to \[ \frac{z^2(z-1)}{(z+1)^2}>\frac{z+1}{(z+1)^2+1}. \] The left side increases and the right side decreases for $z\ge1$. At $9/5$ their values are $81/245>70/221$. On $24b+10a=8$ put $u=8b/(3a)$, so $(a,b)=(8,3u)/(10+9u)$. After clearing positive denominators, put \[ H(u)=\frac{(10+9u)^{12}}{2^{20}\cdot10^5} (L-q)(L^2-q)^2\{L^2(L+1)-2q\}F(S_2). \] This polynomial has degree eleven. Expanding and rounding each coefficient down to the nearest integer gives, in increasing degree, \[ (23,47,0,-70,-59,3,31,21,7,1,0,0). \] Let $h$ be the polynomial with these coefficients. In $h(u)/u^3$ the two negative terms are affine, so this function is convex for $u>0$. Its tangent at $1$ is $2+2u$. Thus $H(u)\ge h(u)>0$ for $u\ge0$, with $h(0)=23$. Since $F$ decreases, $F(S(q))\ge F(S_2)>0$ as required. \end{proof} \section{The first branching vertex}\label{sec:scaled} Fix $1<\lambda0$, $V\le c$ and $1-pA=(1+ps)U$ gives \[ Ah\Cost\ge e/3-s(5+2ps)U/3+c\,[Aq(1+p)/4+sq^2/2]. \] Split $U=q+pe$ and use $e/3=pe/3+qe/3$. The coefficient of $pe$ is at least $1/3-7/32>0$. The terms containing $pq$ have coefficient $c(A-2s)/4-2s^2/3\ge0$, since $c\ge1/3$ and $A-2s\ge1/8$. The remaining coefficient of $q$ is at least \[ \frac e3-\frac{5s}3+\frac{c(1-e+s)}4 \ge \frac{32e^2-28e+7}{96}>0 . \] The minimum in $s$ is at $1/8$, and the quadratic has negative discriminant. We have proved $\Cost=-\lambda Zv'>0$, which rules out a first zero of $v'$. \end{proof} \subsection{Differentiation at the first split} We now keep the offspring law fixed and vary $x=p/(\lambda-1)$. Increasing $x$ decreases the bias, so the desired sign is $\partial_x V>0$. Let $\eta_n=\E W^n$ and put \[ A_n=k^{n-1}\iota_n,\qquad m_n=A_n\eta_n,\qquad S=\sum_{n\ge1}m_n^2,\qquad T=\sum_{n\ge1}m_nm_{n+1}. \] Here $\E Y^n=xk^{1-n}m_n$ by the independence of the prefix and the first split. Thus $m_n$ is the terminal moment with its prefix factor included. \begin{lemma}[Differentiating the speed in its moments]\label{lem:scaled-mark} Let $h=m_1-x[(1+\lambda)S/2-kT]$ and $\gamma=(1+\lambda)/(2k)$. Then $V=S/(2h)$, $m_1/2\le h\le m_1$, and \begin{equation}\label{eq:scaled-mark} h\partial_x V =V(S-\gamma T)+\sum_{n\ge1}D_n\partial_x m_n, \qquad D_n=m_n-VC_n,\quad 0\le D_n\le m_n , \end{equation} where $m_0=0$ and \[ C_n=\mathbf1_{\{n=1\}}+ x\big[k(m_{n-1}+m_{n+1})-(1+\lambda)m_n\big]. \] Moreover $S-\gamma T\ge a S/(2\lambda)>0$. \end{lemma} \begin{proof} Expand $(1-\lambda YY')^{-1}$ in Proposition~\ref{prop:collapse}. Substitution of $\E Y^n=xk^{1-n}m_n$ gives $N/p=xS$ and $Z=2xh$. Since $\E Y=xm_1$, the bounds on $h$ follow from $\E Y\le Z\le2\E Y$. We differentiate the quotient $S/(2h)$ first with respect to $x$ at fixed moments, then with respect to its individual coordinates. Since $x\partial_x\lambda=-a$, the first derivative is $V(S-\gamma T)/h$. For the coordinate derivatives, $\partial_{m_n}h=C_n$, so $h\partial_{m_n}V=m_n-VC_n$. To see the signs, expand the two deficit factors to obtain \[ C_n=k^{n-1}\E[Y^{n-1}(1-Y)(1-\lambda Y)]\ge0 . \] Since $m_n=k^{n-1}\E[Y^n]/x$ and $Vx=v/a$, the positivity in Lemma~\ref{lem:speed-ceiling}(ii) gives $D_n\ge0$. Also $x+Q_{n+1}=\lambda(x+Q_n)+q$ implies $m_{n+1}\le m_n/k$, so $T\le S/k$. This gives the stated bound on $S-\gamma T$. On a compact subinterval of $(1,m)$ the prefix factors decay geometrically in $n$, also after differentiation up to a factor of order $n$. Conditionally on a branching root, $W=\lambda Y$ has integrably bounded derivative by Proposition~\ref{prop:regularity}. Thus the chain rule applies to the series. \end{proof} \begin{lemma}[Response at the first split]\label{lem:scaled-two-children} Let $M=2\E[(1-W)^2]$, $t=\E W^2/w$ and \[ c_n=\frac{a^2n(n^2-1)}{12x\lambda^{3/2}} . \] Then \[ \partial_xm_1\ge w A_1\big[(1-t)/x-A_1\big],\qquad \partial_xm_n\ge m_n A_n(c_n-1+nA_n M)\quad(n\ge2). \] Let $Y_i$ be the transformed escape of child $i$ at the first split and put \[ \delta_i=\left(1+\sum_{j\ne i}\frac{Y_j}{1-Y_j}\right)^{-1}, \qquad M_*=\E\sum_{i=1}^J\delta_i^2 . \] We have $M_*\ge M$. At every bias where $M_*\ge1$, $\partial_xm_n\ge0$ for all $n\ge1$. \end{lemma} \begin{proof} Write $A_n^{-1}=xk^{1-n}+U_n$, where $U_n=\sum_{j=0}^{n-1}k^{2j-n+1}$. Since $x\partial_x\lambda=-a$ and $\log\lambda\ge a/\lambda$, the first term has derivative $k^{1-n}(1+(n-1)a/(2\lambda))\le1$. In $U_n$ pair the exponents $r$ and $-r$. For $r>0$, the arithmetic--geometric mean inequality gives $k^r-k^{-r}\ge r(k-k^{-1})$. Summing $r^2$ over the positive exponents gives $n(n^2-1)/6$. Hence \[ -\partial_xU_n =\frac{a}{2x\lambda}\sum_{r>0}r(k^r-k^{-r})\ge c_n, \qquad \partial_x A_n\ge A_n^2(c_n-1). \] Put $B=-s\partial_s W$ and $B_n=\E[W^{n-1}B]$. As $s=1/x$, $x\partial_x\eta_n=n B_n$. At the split $W=S_0/(s+S_0)$ with $S_0$ decreasing in $s$, so $B\ge W(1-W)$. This proves the first bound because $\partial_x A_1=-A_1^2$. To use the child responses, differentiate $W/(1-W)=\sum_iY_i/(1-Y_i)$, with $Y_i=L_iW_i$. This gives \[ B=\sum_i\left(\frac{1-W}{1-Y_i}\right)^2 [L_iB_i+(a/\lambda)G_iY_i]. \] We have $(1-W)/(1-Y_i)\ge\delta_i\ge1-W$ and $W^{n-1}\ge Y_i^{n-1}$. Conditionally on the siblings and $J$, the selected child's subtree retains its original law. Since $\E L^n=x\iota_n$ and $(a/\lambda)\E[GL^n]=xA_n^2$, averaging gives \[ B_n\ge M_*x(\iota_nB_n+A_n^2\eta_n),\qquad M_*\ge2\E[(1-W)^2]=M . \] Now $B_n\ge M x A_n^2\eta_n$ gives the second bound. If $M_*\ge1$, then $(1-x\iota_n)B_n\ge x A_n^2\eta_n$. Since $\partial_x(x\iota_n)=n A_n^2$, this gives $\partial_x[(1-x\iota_n)\eta_n]\ge0$ at the bias under consideration. Also $\partial_x(1/U_n)\ge0$ by the paired sum above. The product of these two nonnegative factors is $m_n$, so $\partial_xm_n\ge0$. \end{proof} \begin{corollary}\label{cor:small-terminal} For every transient $\lambda>1$, if $w\le4/9$ then $v'(\lambda)<0$. In particular the conclusion holds whenever $(m-\lambda)\E J\le (4/5)m(\lambda-1)$. \end{corollary} \begin{proof} By Lemma~\ref{lem:scaled-two-children}, $M_*\ge1$ gives $\partial_xm_n\ge0$ for every $n\ge1$. The first term in~\eqref{eq:scaled-mark} is positive and $\partial_xV=-s^2v'$, so it suffices to show that $M_*\ge1$. For fixed child odds put $z=W$. Jensen applied to $u\mapsto(1+z/(1-z)-u)^{-2}$ across the $J$ child odds gives $\sum_i\delta_i^2\ge f_J(z)$, where $f_j(z)=j^3(1-z)^2/(j-z)^2$. The derivative in $j$ has the sign of $j-3z$, so the minimum over real $j\ge2$ is at $j=\max(2,3z)$. Its excess over $2-9z/4$ equals \[ \begin{cases} z(3z-2)^2/[4(2-z)^2],& z\le2/3,\\ (3z-2)^3/4,&z\ge2/3. \end{cases} \] Averaging gives $M_*\ge2-9w/4\ge1$. Finally $W=U/(a+U)$ for $U=\sum_{i=1}^J\beta_i$. Jensen gives $w\le\E U/(a+\E U)$, where $\E U=\E J\,\E\beta \le (m-\lambda)\E J/m$ by Remark~\ref{rem:critical-bias}. The stated condition gives $\E U\le4a/5$, hence $w\le4/9$. \end{proof} \begin{corollary}[Offspring laws with an analytic proof]\label{cor:analytic-law} If $\E[1/\nu]\le31/49$, the analytic estimates in this paper give $v'(\lambda)<0$ throughout the transient interval $0<\lambda1$ and $w>4/9$. Set $e=\E[1/J]$, $C=1-\E[1/\nu]=p(1-e)$ and $b=p_{\rm eff}$. With $d=1-w$, Lemma~\ref{lem:prefix-terminal} gives $(1-e)d\le se$. Hence $b=psw/(s+d)\ge Cw$, and $b+ae\ge Cw+pse\ge C$. Since $e\le1/2$, \[ 24b+10a=20(b+a/2)+4b\ge(20+4w)C\ge\frac{196}{9}C\ge8 . \] The last inequality uses $C\ge18/49$. Theorem~\ref{thm:above-two} gives the conclusion. \end{proof} \begin{theorem}\label{thm:upper-bands} If $1<\lambda4/9$. The coefficients $D_n$ in~\eqref{eq:scaled-mark} are nonnegative, so we may use the lower bounds on $\partial_xm_n$ from Lemma~\ref{lem:scaled-two-children} term by term. Lemma~\ref{lem:large-finite} then gives $\partial_xV>0$. Since $\partial_xV=-s^2v'$, the result follows. \end{proof} \section{The intermediate range of scaled bias}\label{sec:joint} For intermediate $s$ we need an upper bound on the speed and a lower bound on $-\lambda Z v'$. Both use the first two moments of the escape $W$ at the first split. We write $h_1=\E L=x/(1+x)$, $k=\sqrt\lambda$ and $r=v/a$. \begin{theorem}\label{thm:joint} If $1<\lambda4/9$. The binary comparison restricts $d,\eta$, since $\E Y=h_1(1-d)$ and $\E Y^2=\E L^2(1-2d+d\eta)$. Lemma~\ref{lem:terminal-speed} bounds $r=v/a$ in terms of the same parameters. For every $y\in[0,1/\lambda]$, both $f_\theta(y)$ and $g_\theta(y)$ decrease as $r$ increases. An upper bound on $r$ thus suffices both to choose an admissible $\theta$ and to bound the two factors $\mu_j(f_\theta),\mu_j(g_\theta)$ from below. After averaging in $L$, the factors in~\eqref{eq:scaled-profile} are expectations of polynomials in $X=1-W$. A quadratic lower bound $P(u)\ge c_0+c_1u+c_2u^2$ on $[0,1]$ gives $\E P(X)\ge c_0+c_1d+c_2d\eta$. An upper bound works in the same way. For polynomial bounds under moment constraints see Bertsimas and Popescu~\citep[Section~2]{BP05}. On each box we bound the products in~\eqref{eq:scaled-profile} from below. For the nonnegative factors $P_j,F_j,\mu_j(f_\theta)$ we take the larger of zero and the computed lower bound. If the lower bound for $\mu_j(g_\theta)$ is negative, we multiply it by an upper bound for $P_j$. Once a lower bound for $\mu_K(g_\theta)$ is nonnegative throughout the box, Proposition~\ref{prop:ward-ranks} allows us to use zero as a lower bound for $\mu_j(g_\theta)$ at every later rank. A strictly positive lower bound for the partial sum through any rank $j\ge K$ then proves $v'(\lambda)<0$ for every law and bias in the box. Lemma~\ref{lem:joint-finite} combines this criterion with three analytic tests to cover the intermediate range. \end{proof} \begin{proof}[Proof of Theorem~\ref{thm:main}] Theorems~\ref{thm:below-one} and~\ref{thm:above-two} cover $0<\lambda\le1$ and $9/5\le\lambda4/9$, the right-hand side of~\eqref{eq:scaled-mark} is positive. \end{lemma} \begin{proof} To handle the mean $w$ without subdividing its interval, put $e_n=\eta_n/w$, $u_n=m_n/w=A_ne_n$, $P=S/w^2$, $Q=T/w^2$ and $H=h/w$. Under the law tilted by $W$, the mean of $W$ is $t=e_2$. Thus $w\le t$ and, by Jensen's inequality, \[ t^{n-1}\le e_n\le t\quad(n\ge2),\qquad 0\le e_n-e_{n+1}\le1-t\quad(n\ge1). \] The latter difference is exactly $1-t$ at $n=1$. For $G_n=2Hu_n-PC_n=2HD_n/w$, \eqref{eq:scaled-mark} gives \[ \frac{2h^2}{w^3}\partial_xV =wP(P-\gamma Q)+\sum_{n\ge1}G_n\frac{\partial_xm_n}{w}. \] For the first term, Lemma~\ref{lem:scaled-mark} gives $P-\gamma Q\ge aP/(2\lambda)$. At the given law $0\le G_n\le2u_1u_n$. By Lemma~\ref{lem:scaled-two-children} we may therefore bound the sum below by replacing $\partial_xm_n/w$ with \[ \ell_1=A_1[(1-t)/x-A_1],\qquad \ell_n=u_n A_n[c_n-1+2nA_n(1-w(2-t))]\quad(n\ge2). \] Both $G_n$ and $\ell_n$ are affine in $w$ once the normalized moments are fixed. Indeed $H=u_1-xw[(1+\lambda)P/2-kQ]$ and $C_n$ is affine by its definition. We retain $K=16$ terms. For $d_n=u_n-u_{n+1}$, \[ 2(P-Q)=u_1^2+\sum_{n\ge1}d_n^2,\qquad d_n=(A_n-A_{n+1})e_n+A_{n+1}(e_n-e_{n+1}). \] Here $A_n-A_{n+1}=A_n(k-1+q\iota_{n+1})/k\ge0$. Telescoping bounds the tail of $\sum d_n^2$ after $K$ by $u_{K+1}^2$. Likewise $R_K:=\sum_{n>K}u_n^2\le e_{K+1}^2\iota_K$, since $A_n^2\le\iota_{n-1}-\iota_n$. As $A_n\le1/n$ we have $\ell_n\ge-u_n/n$ for $n>K$. The omitted derivative terms thus sum to at least $-2u_1R_K/(K+1)$. The program bisects the box $[0,1/4]\times[0,13/16]\times[7/16,1]$ in $(x,a,t)$, visiting both closed children at each split. On a box with upper endpoint $t_+$ we have $7/162^{-24}$ on all $41\,396$ leaves. \end{proof} \subsection*{The intermediate range} \begin{lemma}\label{lem:joint-finite} At every transient bias with $1/4\le x\le8$, $04/9$, the bounds of Section~\ref{sec:joint} give $v'(\lambda)<0$. \end{lemma} \begin{proof} The program starts with $[1/4,8]\times[0,13/16]$ in $(x,a)$. It discards rectangles on which $ax>1$, since $ax=p$. On each remaining rectangle it starts with $0\le d\le\min(5/9,1/x)$ and $d\le\eta\le1$, by Lemma~\ref{lem:prefix-terminal} and Jensen's inequality. Lemma~\ref{lem:scaled-binary} narrows the interval for $\eta$. In each box let $d_0$ be the lower endpoint for $d$ and $\eta_0$ the upper endpoint for $\eta$. Lemma~\ref{lem:terminal-speed} bounds the speed using only \[ \E W_+^j=1-d_0\sum_{i=0}^{j-1}(1-\eta_0)^i,\qquad \E[W_+^j(1-W_+)]=d_0(1-\eta_0)^j . \] These formulas extend to $d_0=\eta_0=0$. For the two-point law write $\mu_j^+(f)=\E[(kY_+)^j f(Y_+)]$. The speed computation retains the numerator ranks $1,\ldots,K$ and the denominator ranks $0,\ldots,K-1$ with $K=128$ in the expansions \[ N_+/a=\lambda^{-1}\sum_{j\ge1}\mu_j^+(1)^2,\qquad Z_+=\sum_{j\ge0}\mu_j^+(y)\big[\mu_j^+(1-y)+\mu_j^+(1-\lambda y)\big]. \] For the numerator tail, use $\E W_+^j\le\E W_+^{K+1}$ for $j>K$ and sum $\lambda^{j-1}\iota_j^2\le\iota_{j-1}-\iota_j$. This bounds the tail in $N_+/a$ by $x^2\iota_K(\E W_+^{K+1})^2$. For the denominator, multiply the pointwise inequality $\tau/D\ge Y_+$ of Proposition~\ref{prop:collapse} by $(\lambda Y_+Y_+')^K$ and average. The tail in $Z_+$ is thus at least $\mu_K^+(y)\mu_K^+(1)$. We also use $Z_+\ge\E Y_+\ge\E Y$ and $r\le\E Y/(1-\E Y)$. When a box in $(d,\eta)$ is split, its upper bound on $R=r/h_1$ remains valid on both children. A child that computes a local bound keeps the smaller of that bound and the inherited one. Three analytic tests can settle a box. They are $2d\eta=M\ge1$ by Lemma~\ref{lem:scaled-two-children} and~\eqref{eq:scaled-mark}, $24b+10a\ge8$ with $b=a\E Y/(1-\E Y)$ by Theorem~\ref{thm:above-two}, and admissibility of $\theta=1$ by Corollary~\ref{cor:ward-source}. Elsewhere we use a value of $\theta\in[0,1]$ certified by the moment bounds, with $\theta=0$ always admissible. The program divides each of the four factors in~\eqref{eq:scaled-profile} by $h_1=x/(1+x)$, so each partial sum is divided by $h_1^2$. For each polynomial $P$ in $X=1-W$ write \[ P(u)=\sum_{i=0}^B p_i\binom Bi u^i(1-u)^{B-i},\qquad B=28 . \] A quadratic $c_0+c_1u+c_2u^2$ has Bernstein coefficient $c_0+c_1 i/B+c_2 i(i-1)/[B(B-1)]$ at $i$. If these coefficients are at most $p_i$ for every $i$, nonnegativity of the basis functions gives $\E P(X)\ge c_0+c_1d+c_2d\eta$. Applying the same comparison to $-P$ gives an upper bound. For $n+h\le B$ the Bernstein coefficient of $(1-u)^nu^h$ at $i$ is $(B-i)_n(i)_h/(B)_{n+h}$, with $(k)_j$ the falling factorial, by multiplying by $[u+(1-u)]^{B-n-h}$. Writing the quadratic coefficients as $c_0+li+ci^2$, the program chooses $l,c$ approximately and checks the minorant at all $29$ coefficients. It rounds $l+ci$ upward and then $p_i-i(l+ci)$ downward. It tests partial sums through rank $22$, stopping as soon as the criterion in the proof of Theorem~\ref{thm:joint} holds. For $0\le k\le4$ divide $[2^k/4,2^{k+1}/4]$ into eight equal $x$-intervals, and divide $[0,13/16]$ into thirteen equal $a$-intervals. On each of the resulting $520$ rectangles, the file \texttt{joint/subdivisions.txt} records a finite binary tree. Each branch bisects either $x$ or $a$ at its exact dyadic midpoint. Thus the closed leaves cover their root rectangle. The replay verifies every leaf and compares the digest of the outcomes with the recorded value. The partition has $8\,405$ rectangles, of which $220$ have $ax>1$ throughout. On the other rectangles the verification excludes $3\,532$ moment boxes and proves strict positivity on $2\,102\,159$, including $12\,634$ by the three analytic tests. \end{proof} \setlength{\bibsep}{4pt plus 1pt minus 1pt} \bibliographystyle{plain} {\small \begin{thebibliography}{10} \bibitem{Aid13} Elie A{\"{\i}}d{\'e}kon. \newblock Monotonicity for {$\lambda \leq 1/2$}. \newblock Unpublished note, 20 September 2013, 2013. \bibitem{Aid14} Elie A{\"{\i}}d{\'e}kon. \newblock Speed of the biased random walk on a {Galton}--{Watson} tree. \newblock {\em Probab. Theory Relat. Fields}, 159(3--4):597--617, 2014. \bibitem{BAF14} G{\'e}rard Ben~Arous and Alexander Fribergh. \newblock Biased random walks on random graphs. \newblock In Vladas Sidoravicius and Stanislav Smirnov, editors, {\em Probability and Statistical Physics in {St. Petersburg}}, volume~91 of {\em Proceedings of Symposia in Pure Mathematics}, pages 99--153. American Mathematical Society, Providence, RI, 2016. \bibitem{BAFGH12} G{\'e}rard Ben~Arous, Alexander Fribergh, Nina Gantert, and Alan Hammond. \newblock Biased random walks on {Galton}--{Watson} trees with leaves. \newblock {\em Ann. Probab.}, 40(1):280--338, 2012. \bibitem{BAFS14} G{\'e}rard Ben~Arous, Alexander Fribergh, and Vladas Sidoravicius. \newblock {Lyons}--{Pemantle}--{Peres} monotonicity problem for high biases. \newblock {\em Commun. Pure Appl. Math.}, 67(4):519--530, 2014. \bibitem{BAHOZ13} G{\'e}rard Ben~Arous, Yueyun Hu, Stefano Olla, and Ofer Zeitouni. \newblock Einstein relation for biased random walk on {Galton}--{Watson} trees. \newblock {\em Ann. Inst. Henri Poincar{\'e}, Probab. Stat.}, 49(3):698--721, 2013. \bibitem{BP05} Dimitris Bertsimas and Ioana Popescu. \newblock Optimal inequalities in probability theory: {A} convex optimization approach. \newblock {\em SIAM J. Optim.}, 15(3):780--804, 2005. \bibitem{BT20} Adam Bowditch and Yuki Tokushige. \newblock Differentiability of the speed of biased random walks on {Galton}--{Watson} trees. \newblock {\em ALEA, Lat. Am. J. Probab. Math. Stat.}, 17(1):609--642, 2020. \bibitem{BJS92} Bernard Bru, Fran{\c c}ois Jongmans, and Eugene Seneta. \newblock {I. J. Bienaym{\'e}: Family information and proof of the criticality theorem}. \newblock {\em Int. Stat. Rev.}, 60(2):177--183, 1992. \bibitem{DDL99} Michel Denuit, Etienne De~Vylder, and Claude Lef{\`e}vre. \newblock Extremal generators and extremal distributions for the continuous {$s$}-convex stochastic orderings. \newblock {\em Insur. Math. Econ.}, 24(3):201--217, 1999. \bibitem{GM26} {GPT-6 Astra} and Heng Ma. \newblock Monotonicity of the speed of biased random walks on {Galton}--{Watson} trees. \newblock \href{https://hexagonmath.org/2611.00735v1}{Hexagon:2611.00735v1}, 2026. \newblock \href{https://github.com/hengmamath/monotone-speed-biased-RW/blob/main/paper/github.pdf}{Full version} and \href{https://github.com/hengmamath/monotone-speed-biased-RW/tree/main/paper/supplement}{exact computations}. \bibitem{Lin19} Shen Lin. \newblock Harmonic measure for biased random walk in a supercritical {Galton}--{Watson} tree. \newblock {\em Bernoulli}, 25(4B):3652--3672, 2019. \bibitem{Lyo90} Russell Lyons. \newblock Random walks and percolation on trees. \newblock {\em Ann. Probab.}, 18(3):931--958, 1990. \bibitem{LPP95} Russell Lyons, Robin Pemantle, and Yuval Peres. \newblock Ergodic theory on {Galton}--{Watson} trees: speed of random walk and dimension of harmonic measure. \newblock {\em Ergodic Theory Dyn. Syst.}, 15(3):593--619, 1995. \bibitem{LPP96} Russell Lyons, Robin Pemantle, and Yuval Peres. \newblock Biased random walks on {Galton}--{Watson} trees. \newblock {\em Probab. Theory Relat. Fields}, 106(2):249--264, 1996. \bibitem{LPP97} Russell Lyons, Robin Pemantle, and Yuval Peres. \newblock Unsolved problems concerning random walks on trees. \newblock In Krishna~B. Athreya and Peter Jagers, editors, {\em Classical and Modern Branching Processes}, volume~84 of {\em The IMA Volumes in Mathematics and its Applications}, pages 223--237. Springer, New York, 1997. \bibitem{MK26} Madhulatha Mandarapu and Sandeep Kunkunuru. \newblock A {Computer}-{Assisted} {Proof} of {Speed} {Monotonicity} for the {Biased} {Random} {Walk} on a {Galton}--{Watson} {Tree} {Beyond} the {Known} {Range}. \newblock Preprint, {arXiv}:2609.29894, 2026. \bibitem{MSZ15} Behzad Mehrdad, Sanchayan Sen, and Lingjiong Zhu. \newblock The speed of a biased walk on a {Galton}--{Watson} tree without leaves is monotonic with respect to progeny distributions for high values of bias. \newblock {\em Ann. Inst. Henri Poincar{\'e}, Probab. Stat.}, 51(1):304--318, 2015. \bibitem{Rou18} Pierre Rousselin. \newblock Invariant measures, {Hausdorff} dimension and dimension drop of some harmonic measures on {Galton}--{Watson} trees. \newblock {\em Electron. J. Probab.}, 23:1--31, 2018. \newblock Paper No. 46. \bibitem{Sch26} Felix Schwarzfischer. \newblock A proof of the {Lyons}--{Pemantle}--{Peres} monotonicity conjecture for high offspring laws. \newblock Preprint, {arXiv}:2611.25882, 2026. \bibitem{SWX25} He~Song, Longmin Wang, and Kainan Xiang. \newblock The speed of a biased walk on a {Galton}--{Watson} tree without leaves is monotonic for low values of bias. \newblock {\em J. Appl. Probab.}, 62(3):1044--1052, 2025. \end{thebibliography} } \end{document}