Differential geometry·OpenAI Math·Result 342·Lean formalisation listed

Donaldson's tamed-to-compatible conjecture

One of the 372 results in OpenAI's public mathematics catalogue, filed under differential geometry: 1 preprint, the latest dated 6 October 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and embeds the animation.

In one line: OpenAI reports a proof of Donaldson's tamed-to-compatible conjecture (differential geometry) in a preprint dated 6 October 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 12:34Watch on YouTube →

Subscribe on YouTube

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

What OpenAI claims

Proves Donaldson's tamed-to-compatible conjecture: every smooth almost complex structure on a closed four-manifold that is tamed by a symplectic form admits a compatible symplectic form. The almost complex structure stays fixed; the form's cohomology class may change. (Lean)

Paper

  1. Taming implies compatibility on four-manifolds

    · Preprint, not peer reviewed · PDF

    OpenAI's abstract We prove that every smooth almost complex structure on a closed four-manifold which is tamed by a symplectic form is compatible with a symplectic form. This gives a positive solution to Donaldson's tamed-to-compatible conjecture. We also characterize the compatible cone by strict intersection positivity on the closure of the invariant part of the taming cone.

Status

Preprint. The paper has 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 a preprint on 6 October 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 Donaldson's tamed-to-compatible conjecture: every smooth almost complex structure on a closed four-manifold that is tamed by a symplectic form admits a compatible symplectic form. The almost complex structure stays fixed; the form's cohomology class may change. (Lean)
Where is the proof?
In the paper, Taming implies compatibility on four-manifolds (PDF).
Is there a video?
Yes, on YouTube (29:20, chapter 37).

Also in

The video

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

Related results in Differential geometry

All 29 results in Differential geometry →