Math 2.0

Ordinary differential equations Qualitative theory Theorem

Dulac's theorem on finiteness of limit cycles

Builds on Limit cycleAutonomous system

Statement

Let PP and QQ be real polynomials in two variables. Then the planar autonomous system x′=P(x,y),y′=Q(x,y)x' = P(x, y), \qquad y' = Q(x, y) has only finitely many limit cycles.

Remarks

Henri Dulac published a proof in 1923, but a gap was found in it much later. Complete proofs were given independently by Yulij Ilyashenko and by Jean Écalle around 1991–1992. The hard part is to exclude limit cycles that accumulate on a polycycle, a closed chain of equilibria joined by orbits. Limit cycles cannot accumulate on a periodic orbit of an analytic field, because the Poincaré return map near that orbit is analytic.

The theorem bounds the number of limit cycles of each single system. It gives no bound in terms of the degree of PP and QQ. Whether such a bound exists, even for degree 22, is the second part of Hilbert's sixteenth problem, and it is open. For example, the van der Pol system x′=y−(x3/3−x)x' = y - (x^3/3 - x), y′=−xy' = -x has exactly one limit cycle.

Going deeper

For a student

The theorem is the finiteness part of the study of Hilbert's sixteenth problem on limit cycles. Near a periodic orbit, finiteness follows from the analyticity of the return map. The difficulty lies at polycycles, where the return map has an asymptotic expansion that is not convergent. Ilyashenko and Écalle overcame this with a theory of such expansions.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Autonomous system concept
  2. Limit cycle concept
  3. Dulac's theorem on finiteness of limit cycles statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Hilbert%27s_sixteenth_problem
About this page
TagNEYHC1XZ14
URIm2://NEYHC1XZ14
Kindstatement, theorem
WritingW0 stub
MSC34C07
StatusThis copy of the site has no build data. Run m2 status NEYHC1XZ14.
AboutLimit cycle
UsesLimit cycle, Autonomous system
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.