A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Donaldson's tamed-to-compatible conjecture
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Egyptian Fractions <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:curvy surfaces Levels:1
Category:Differential geometry Lean version:YES! ✔
Rate this game! 4.9 out of 5 (8,047 votes)

>>> How to Play <<<
Donaldson's tamed-to-compatible conjecture. 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.

>>> Level Select <<<
released 2026-10-06  |  3 theorems · 12 lemmas · 20 proofs · 9,449 words  |  PLAY LEVEL 1 »  (pdf)
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.

More Differential geometry Games!
Yau's uniformization conjectureKatok's entropy rigidity conjectureA counterexample to the nearby Lagrangian conjectureDonaldson's hypersymplectic deformation conjecture
Sharp symplectic ball-packing criteria in higher dimensionsThe metric Blaschke conjectureInfinitely many closed geodesics on spheres and three-manifoldsSharp singular-set bounds for stationary integral varifolds

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games