---
id: "2026-10-30-afem-optimal-convergence-any-bulk-parameter-diening-storn-chatgpt"
url: "https://postcutoff.com/e/2026-10-30-afem-optimal-convergence-any-bulk-parameter-diening-storn-chatgpt/"
as_of: "2026-11-09T21:13:00+01:00"
date: "2026-10-30"
date_precision: day
category: science
importance: 3
confidence: medium
status: [Awaiting review]
verification: Preprint only
sources: 2
editor: human editor
human_review: null
version: "2026-10-31"
---

As of: 2026-11-09 21:13 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-10-30-afem-optimal-convergence-any-bulk-parameter-diening-storn-chatgpt/

# AFEM rate-optimal for any bulk parameter θ < 1 (ChatGPT framework)

Full title: Adaptive finite elements: Diening and Storn claim rate-optimal AFEM convergence for every Dörfler bulk parameter θ < 1, with an initial proof framework from a ChatGPT discussion

arXiv 2610.39719 ("Optimal AFEM convergence for any bulk parameter smaller than one", Lars Diening and Johannes Storn) proves rate-optimal convergence of the standard adaptive finite element method with conforming Lagrange elements for the Poisson problem under Dörfler marking with any bulk parameter θ ∈ (0,1), removing the smallness restriction of the classical theory (Stevenson; Cascón, Kreuzer, Nochetto, Siebert; the 'axioms of adaptivity'). The proof framework emerged from a long interactive ChatGPT session.

## Key facts
- Claim (abstract): 'We prove rate-optimal convergence of the standard adaptive finite element method with conforming Lagrange elements for the Poisson problem for Dörfler marking with any bulk parameter θ∈(0,1). This removes the smallness restriction on the bulk parameter that has persisted in the classical theory of optimal adaptive finite element methods.'
- AI statement (verbatim): 'During the final stage of the present work, an extended interactive discussion between Johannes Storn and OpenAI's ChatGPT, motivated in particular by our recent results on L2 and Ritz projection stability, led to an initial framework for the proof. Since the mathematical ideas developed through a long sequence of questions, suggestions, and revisions, we do not attempt to separate the individual contributions of the human and AI participants to this stage. The authors subsequently verified, corrected, generalized, and substantially rewrote the arguments and take full responsibility for all content in this paper.'
- Background (paper, §1): rate-optimality with coarsening by Binev–Dahmen–DeVore (2004), without coarsening by Stevenson (2007), with minimal refinement by Cascón–Kreuzer–Nochetto–Siebert (2008), organised into the 'axioms of adaptivity' by Carstensen–Feischl–Page–Praetorius (2014); all need θ small, although practitioners use larger θ
- Authors: Lars Diening co-authored the 2008 Diening–Kreuzer contraction result cited as a milestone in the paper's history
- Verification status: arXiv preprint, not refereed, no formal proof; no reaction found on 31 Oct

## What happened

Adaptive finite element methods refine a mesh only where an error estimator says the error is large. Dörfler marking refines a set of
elements that carries a fraction θ of the estimated error. Since 2007 proofs that the method converges at the best possible rate have
needed θ to be small, even though larger θ is common in practice.

On 29 Oct Lars Diening and Johannes Storn posted a proof for every θ below 1. They write that an extended discussion between Storn and
ChatGPT gave the initial framework of the proof, and that the human and AI contributions at that stage cannot be separated.

## Why it matters

It removes a long-standing technical restriction in the theory of adaptive methods. The paper also gives a clear first-hand account of
mixed human–AI proof development. It is a preprint.

## What is disputed or not yet verified

- Verification: Unrefereed preprint by specialists of the field

## Your AI and this story

- GPT-6 Astra (training cutoff April 2026): 183 days after its cutoff
- Claude Opus 5.5 (training cutoff June 2026): 122 days after its cutoff
- Gemini 4 Argon (training cutoff March 2026): 213 days after its cutoff
- Grok 4.7 (training cutoff May 2026): 152 days after its cutoff

## Sources

1. [arXiv 2610.39719: Optimal AFEM convergence for any bulk parameter smaller than one (Diening, Storn)](https://arxiv.org/abs/2610.39719) (arxiv.org, paper)
2. [PDF with the AI statement](https://arxiv.org/pdf/2610.39719) (arxiv.org, paper)

## Changes

- 2026-10-31 (filed): Created (science agent; arXiv abstract, introduction and AI statement read)

## Related

- 2026-10-31: [AI-assisted results, 31 Oct: arXiv of 30 Oct and Hexagon of 29–31 Oct](https://postcutoff.com/e/2026-10-31-ai-assisted-results-october-31-listing/index.md)