--- id: "2026-11-20-biased-random-walk-speed-monotonicity-heng-ma-gpt-6-astra" url: "https://postcutoff.com/e/2026-11-20-biased-random-walk-speed-monotonicity-heng-ma-gpt-6-astra/" as_of: "2026-11-22T13:32:00+01:00" date: "2026-11-20" date_precision: day category: science importance: 3 confidence: low status: [Awaiting review] verification: Preprint only sources: 6 editor: human editor human_review: null version: null --- As of: 2026-11-22 13:32 CET. Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/ Canonical page: https://postcutoff.com/e/2026-11-20-biased-random-walk-speed-monotonicity-heng-ma-gpt-6-astra/ # Biased random walk speed monotonicity (GPT-6 Astra) Full title: Heng Ma and GPT-6 Astra claim the Lyons–Pemantle–Peres speed monotonicity for biased random walks on Galton–Watson trees with at least two children On 20 November 2026 Heng Ma deposited on Hexagon a 24-page paper, with "GPT-6 Astra and Heng Ma" as the running head, proving that the speed of the λ-biased random walk on a leafless Galton–Watson tree is decreasing on (0, m) when every vertex has at least two children. This is the main case of the monotonicity problem raised by Lyons, Pemantle and Peres in 1996. It also proves decrease on (0,1) and ((3+√5)/2, m) in general and sketches a computer-assisted proof for the rest. Only part of the arguments have been checked by the human contributor. ## Key facts - Claims (Hexagon 2611.00735): with at least two children per vertex, v(λ) is strictly decreasing on (0, m); for general leafless GW trees, decreasing on (0,1) ∪ ((3+√5)/2, m); strict decrease on (0, m) sketched with exact checks of about 750,000 rational coefficients, full proof in a companion GitHub version - Earlier known ranges: λ ≤ m₁/1160, λ ≤ 1/2 (Aïdékon), and λ ≤ m₁/(1+√(1−1/m₁)) when every vertex has at least m₁ ≥ 2 children (Song and Wang, J. Appl. Probab. 2025); Ben Arous, Fribergh and Sidoravicius treated high bias; a computer-assisted, partly Lean-verified preprint (arXiv 2609.29894, Mandarapu and Kunkunuru) reached [0, 1.755] for offspring uniform on {2,3} - AI statement in the PDF: 'The initial proof was found by GPT-6 Astra through extensive interaction with the author in September 2026. This manuscript was substantially generated and revised with the assistance of AI systems. At the time of this version, only part of the arguments and citations have been independently verified in full by the human contributor' - Hexagon provenance on how the model worked: it 'frequently lost in short-term rewards: it proved local lemmas that did not lead to the main result, checked special cases numerically, or carried out long computations without real progress. It also tended to keep pushing one approach instead of stepping back'; the author chose among directions or asked for a different approach - A 'digested and more streamlined version' is promised for Hexagon and arXiv 'in the coming months' - Independent full proof (Hexagon 2611.00820, 21 Nov): Igor Kortchemski's deposit proves that for every leafless Bienaymé–Galton–Watson tree with finite mean m > 1 the speed v(λ) is continuously differentiable on [0, m) with v′(λ) < 0, which 'answers a question posed by Lyons, Pemantle and Peres in 1996'; entirely analytic when E[1/ν] ≤ 31/49, otherwise two interval-arithmetic computations for biases between 1 and 9/5; one Lean formalization linked on Hexagon - Kortchemski's provenance: 'AI agents developed the mathematical arguments, wrote the computer-verification programs and drafted and revised substantial portions of the manuscript'; an exploratory phase with OpenAI GPT models through Codex, then 'a subsequent research campaign … coordinated by Anthropic's Claude Opus 5.5 through Claude Code and involved 134 recorded tasks'; Hexagon label: primarily AI-generated, some parts checked by a human - Third paper (arXiv 2611.25882, 19 Nov): Felix Schwarzfischer proves the monotonicity for high offspring laws; 'OpenAI's ChatGPT 6 Astra was used during the initial stages of this work. The proof in its final form was developed by the author' ## What happened Heng Ma posted the paper on Hexagon on 20 November 2026. The PDF gives "GPT-6 Astra and Heng Ma" as the running head and describes it as a preliminary version. The Hexagon record is labelled "primarily AI-generated", with some parts checked and understood by a human. The provenance note also describes how the model behaved during the work: it chased local lemmas and numerical checks, and the author redirected it. ## Why it matters Lyons, Pemantle and Peres asked about monotonicity in 1996. It has been proved only for small or very large bias, and a computer-assisted preprint in September extended the range for one offspring law. The new claim covers the whole transient range in the case of at least two children. It is unrefereed and only partly checked by its human author. ## What is disputed or not yet verified - Verification: Unverified preprint on Hexagon; computer-assisted part only sketched ## Your AI and this story - GPT-6.2 Astra (training cutoff May 2026): 173 days after its cutoff - Claude Opus 5.5 (training cutoff June 2026): 143 days after its cutoff - Gemini 4 Hydrogen (training cutoff March 2026): 234 days after its cutoff - Grok 4.7 (training cutoff May 2026): 173 days after its cutoff ## Sources 1. [Hexagon 2611.00735: On the Monotonicity of the Speed of Biased Random Walks on GW Trees (Heng Ma, GPT-6 Astra)](https://hexagonmath.org/abs/2611.00735) (hexagonmath.org, paper) 2. [arXiv 2609.29894: A computer-assisted proof of speed monotonicity beyond the known range](https://arxiv.org/abs/2609.29894) (arxiv.org, paper) 3. [Song and Wang: the speed is monotonic for low values of bias (J. Appl. Probab.)](https://resolve.cambridge.org/core/journals/journal-of-applied-probability/article/speed-of-a-biased-walk-on-a-galtonwatson-tree-without-leaves-is-monotonic-for-low-values-of-bias/9DAE0D26D603F3C72E0B960529EEC8F3) (resolve.cambridge.org, paper) 4. [arXiv 1111.5865: Lyons–Pemantle–Peres monotonicity for high biases (Ben Arous, Fribergh, Sidoravicius)](https://arxiv.org/abs/1111.5865) (arxiv.org, paper) 5. [Hexagon 2611.00820: The speed of biased random walk on leafless Bienaymé trees is monotone (Kortchemski)](https://hexagonmath.org/abs/2611.00820) (hexagonmath.org, paper) 6. [arXiv 2611.25882: A proof of the Lyons–Pemantle–Peres monotonicity conjecture for high offspring laws (Schwarzfischer)](https://arxiv.org/abs/2611.25882) (arxiv.org, paper) ## Changes - 2026-11-22: Added Kortchemski's independent full proof (Hexagon 2611.00820, Claude Code campaign of 134 tasks) and Schwarzfischer's high-offspring proof (arXiv 2611.25882) (science agent) - 2026-11-20 (filed): Created. 2026-11-21 (science agent; Hexagon record and PDF) ## Related - 2026-11-22: [AI-assisted results, 22 Nov](https://postcutoff.com/e/2026-11-22-ai-assisted-results-november-22-listing/index.md) - 2026-11-21: [AI-assisted results, 21 Nov](https://postcutoff.com/e/2026-11-21-ai-assisted-results-november-21-listing/index.md)