Hilbert's 16th problem: limit cycles
About this app
Liénard systems ẋ = y − F(x), ẏ = −x: limit cycles found live via the Poincaré return map. For deg F ≤ 5 there are at most two, and two are attained. Plus a degree-7 preview, the LMP conjecture and the bound H(n). openai/math family 143.
What it is about
In the second part of his 16th problem (1900), Hilbert asked how many limit cycles a planar polynomial field of degree n can have. A limit cycle is an isolated closed orbit: nearby orbits spiral towards it or away from it. The classic test case is the Liénard system ẋ = y − F(x), ẏ = −x. In 1977 Lins, de Melo and Pugh conjectured at most ⌊(n−1)/2⌋ cycles for deg F = n; this fails from degree 6 on, and degree 5 stayed open. An AI-generated preprint in github.com/openai/math (family 143) claims that for deg F ≤ 5 there are at most two, and two occur. The catalogue lists this as formalised in Lean; the preprint is not peer-reviewed.
What the app shows
The phase portrait shows the vector field as a particle flow and the limit cycles found as rings, marked stable or unstable. The app starts orbits at (0, s) on the positive y-axis, follows them once around the origin and reads off the return value P(s); where P(s) crosses the diagonal, there is a limit cycle. A bounds panel sets the LMP prediction against known values for each degree. The search is numerical, at 140 points for s between 0.03 and 5, so semi-stable or very closely spaced cycles can be missed.
Try it yourself
Load the “2 cycles” example and click in the phase portrait to start a test orbit; in the return-map panel its staircase runs towards the stable crossing and away from the unstable one. Then change the coefficients and try to create a third cycle. With only even coefficients you get a centre, where every orbit is closed and none is isolated. The degree 7 preview shows three cycles, as the LMP conjecture expects there.
Frequently asked questions
- What is Hilbert’s 16th problem?
- The second part of Hilbert’s 16th problem (1900) asks for the maximum number of limit cycles of a planar polynomial vector field of degree n and how they can be arranged. Even for degree 2 the answer is unknown. It is one of the oldest open questions in the theory of dynamical systems.
- What is a limit cycle?
- A limit cycle is a closed orbit of a system of differential equations that is isolated: there are no other closed orbits nearby. Neighbouring orbits spiral towards it (stable) or away from it (unstable). A well-known example is the Van der Pol oscillator, which has exactly one stable limit cycle.
- How many limit cycles can a quintic Liénard system have?
- An AI-generated preprint in the catalogue github.com/openai/math (family 143) claims that for deg F ≤ 5 there are at most two limit cycles, without sign or parity assumptions, and that two are attained. The catalogue lists this as formalised in Lean; it has not been peer-reviewed. A second preprint in the same family claims a finite but non-explicit bound H(n) for all polynomial fields.
- What can I try out in this app?
- You set the coefficients of F and the strength ε, or load examples such as Van der Pol, and see the limit cycles found in the phase portrait. The return map P(s) shows why a cycle is stable or unstable. A degree 7 preview and a table of known bounds put the result in context.
Subject: Open problems, solved by AI
More from Open problems, solved by AI
- Anderson localisation: 2D vs. 3D (3D)
- Barker sequences and circulant Hadamard matrices
- Barnette's conjecture: a round trip over every polyhedron (3D)
- Birkhoff billiards: only the ellipse has no gaps
- Cardy's formula — percolation in a random tiling
- The plane is not five-colourable (Hadwiger–Nelson)
- Double-dimer loops and CLE₄
- Triangular billiards — irrational angles mix (3D)
A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps