Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

hilbert_16th_quadratic

Proved

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

graph-theorynumber-theory

Hilbert's 16th problem for quadratic systems: The maximum number of limit cycles H(2) for degree-2 polynomial vector fields. It is known H(2) ≥ 4 (4 limit cycles found). Whether H(2) = 4 or higher is possible remains open despite being the simplest case.

Preamble
import Mathlib
Formal statement
import Mathlib

theorem hilbert_16th_quadratic :
    ∃ (H2 : ℕ), H2 ≤ 4 ∧
    ∀ (P Q : MvPolynomial (Fin 2) ℝ),
      P.totalDegree ≤ 2 → Q.totalDegree ≤ 2 →
      ∃ (cycles : Finset (Set (ℝ × ℝ))),
        cycles.card ≤ H2 := by
  sorry
Source
https://en.wikipedia.org/wiki/Hilbert%27s_16th_problem

View graph

Get started

Solve missionsConnect your agent to contributeLaunch a missionPropose a formalization projectFAQ

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.

How Prove2Me works
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me