Real and complex analysis·OpenAI Math·Result 080

The exact Sobolev endpoint for Schrödinger convergence

One of the 372 results in OpenAI's public mathematics catalogue, filed under real and complex analysis: 2 preprints, the latest dated 24 September 2026. This page quotes OpenAI's own summary of the claim, links the papers and abstracts, and embeds the animation.

In one line: OpenAI reports a result titled ‘The exact Sobolev endpoint for Schrödinger convergence’ (real and complex analysis) in 2 preprints, the latest dated 24 September 2026. It has not been peer reviewed. The channel's animation, Every OpenAI Math Result, Part 3 of 4: Operator Paving, Naimark's Problem and 82 More, is on YouTube.

Compilation · 29:20 · 14 October 2026 · from 28:37Watch on YouTube →

Subscribe on YouTube

Chapter 83 of 84 in Every OpenAI Math Result, Part 3 of 4: Operator Paving, Naimark's Problem and 82 More · starts at 28:37 · watch from there on YouTube →

What OpenAI claims

Proves almost-everywhere convergence eitΔf → f as t↓0 for every f ∈ Hn/(2(n+1))(ℝn) and every dimension n ≥ 2. This attains the sharp Sobolev equality case of Carleson's Schrödinger convergence problem, including the planar endpoint H1/3.

Papers (2)

  1. Endpoint convergence for the planar Schrodinger equation

    · Preprint, not peer reviewed · PDF

    OpenAI's abstract We resolve the planar Sobolev endpoint of Carleson's convergence problem: for initial data in H1/3(ℝ2), the Schrödinger evolution converges almost everywhere to the initial data as t↓0. The evolution is defined by taking the Gaussian regularization limit first; on one full-measure spatial set, this limit exists for every 0 < t < 1, and the resulting evolution is continuous at t = 0.

  2. Endpoint pointwise convergence for the Schrodinger equation in higher dimensions

    · Preprint, not peer reviewed · PDF

    OpenAI's abstract We resolve the Sobolev endpoint of Carleson's pointwise convergence problem in every dimension n ≥ 3. For initial data in Hn/(2(n+1))(ℝn), the free Schrödinger evolution converges almost everywhere to the initial data as t↓0. The evolution is defined by removing Gaussian regularization on one full-measure spatial set, uniformly over the interval 0 < t < 1.

Status

Preprint. The papers have not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.

Quick answers

Is it proven?
Not independently yet. OpenAI posted 2 preprints, the latest dated 24 September 2026; it has not been peer reviewed, so treat the result as OpenAI's claim until other mathematicians have checked it.
What exactly does OpenAI claim?
Proves almost-everywhere convergence eitΔf → f as t↓0 for every f ∈ Hn/(2(n+1))(ℝn) and every dimension n ≥ 2. This attains the sharp Sobolev equality case of Carleson's Schrödinger convergence problem, including the planar endpoint H1/3.
Where is the proof?
In the paper, Endpoint convergence for the planar Schrodinger equation (PDF).
Is there a video?
Yes, on YouTube (29:20, chapter 83).

Also in

The video

Every OpenAI Math Result, Part 3 of 4: Operator Paving, Naimark's Problem and 82 More · Compilation · 29:20 · chapter 83 from 28:37 · description, sources and chapters →

Related results in Real and complex analysis

All 16 results in Real and complex analysis →