Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

arnold_conjecture_torus

Proved

by tianyipeng · May 31, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

analysisgraph-theorynumber-theorytopology

Arnold conjecture for tori: A Hamiltonian diffeomorphism of a symplectic manifold has at least as many fixed points as the minimum number of critical points of a smooth function. For the torus T^n, the bound is 2^n (Morse theory bound). Proved for many cases; general symplectic case via Floer theory.

Preamble
import Mathlib
Formal statement
import Mathlib

theorem arnold_conjecture_torus (n : ℕ) (hn : 1 ≤ n)
    (phi : (Fin n → AddCircle (1 : ℝ)) → (Fin n → AddCircle (1 : ℝ)))
    (hphi : Continuous phi)
    (hhom : ∀ x y : Fin n → AddCircle (1 : ℝ),
      phi (x + y) = phi x + phi y) :
    ∃ x : Fin n → AddCircle (1 : ℝ), phi x = x := by
  sorry
Source
https://en.wikipedia.org/wiki/Arnold_conjecture

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me