1 · The essentials
A moving point in a plane can sometimes return to its starting position and repeat the same closed path forever. The question here is how many separate repeating paths can occur, counting only those that have no other repeating paths arbitrarily close to them. The rules of motion are given by polynomials, whose degree measures their algebraic complexity. The main manuscript shows that fixing this degree puts a finite ceiling on the number of these paths, regardless of the polynomial coefficients. It identifies this as the uniform boundedness assertion in the second part of Hilbert’s sixteenth problem. A companion manuscript treats a special class of equations with polynomial degree at most five: the exact maximum there is two. That companion result has a Lean formalization; the supplied source does not identify a formalization of the broader assertion.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, imagine drawing closed tracks under a set of design rules. The broad result says that fixing the complexity of those rules limits how many separate tracks can occur, while the special result gives an exact allowance of two for one particular design. Actual repeating paths must arise from the equations of motion, rather than being freely drawn.
Why it matters
A bound depending only on degree controls an entire family of equations, not just one chosen equation. The main manuscript establishes this uniform boundedness assertion from Hilbert’s sixteenth problem. The companion result goes further within a restricted family by giving an exact maximum and stating that it is attained.
2 · Going further
For a real planar polynomial vector field, the objects being counted are isolated periodic orbits, also called limit cycles. The precise uniformity question is whether, for each degree , there is a finite number such that every vector field of that degree has at most limit cycles. The main manuscript shows that such a bound exists and identifies this as the uniform boundedness assertion in the second part of Hilbert’s sixteenth problem.
The main abstract describes two ingredients in its argument: separation of asymptotic expansions on nested complex domains, and a finite-dimensional counting argument. Thus, the stated approach connects the analysis of expansions on complex domains with a counting step. The supplied abstract does not give the intermediate constructions or an explicit formula for .
The companion manuscript considers classical Liénard systems , , where is an arbitrary real polynomial of degree at most five. It states that every such system has at most two geometrically distinct isolated periodic orbits, and that the bound is attained. The source identifies this as the degree-five case of the Lins Neto–de Melo–Pugh conjecture and marks this manuscript as Lean-formalized. This is an exact bound for a special family, whereas the main manuscript gives a degree-dependent finite bound for general planar polynomial vector fields.
Useful notions
- Polynomials and their degree
- Differential equations as rules of motion
- Motion in the plane
- Periodic orbits and isolation
- Bounds that hold across a family
What was known before / what is new
Before
The source places the general question within the second part of Hilbert’s sixteenth problem. It places the special Liénard question within the Lins Neto–de Melo–Pugh conjecture. It does not describe earlier bounds or earlier partial results.
New
The main manuscript shows that the number of limit cycles of a real planar polynomial vector field has a finite bound depending only on its degree. The companion manuscript supplies an exact maximum of two for classical Liénard systems with , and states that this maximum is attained. The companion result has a Lean formalization.
Limits and assumptions
The general assertion concerns real planar polynomial vector fields and counts isolated periodic orbits, not all periodic motion. The exact maximum of two applies only to the stated classical Liénard equations with a real polynomial F of degree at most five; it is not an asserted maximum for all degree-five planar polynomial vector fields. The supplied source identifies Lean formalization for the companion result, not for the general uniform boundedness manuscript. The abstracts provide neither an explicit general bound nor an example attaining the special bound. They do not specify which further questions remain open.
Mini glossary
- Planar polynomial vector field —
- A rule of motion in the plane whose two velocity components are polynomials in the coordinates.
- Limit cycle —
- A periodic orbit that is isolated from other periodic orbits.
- Uniform bound —
- A common ceiling valid for every system in the specified family, here depending only on polynomial degree.
- Classical Liénard system —
- The system , considered in the companion manuscript.
- Geometrically distinct periodic orbits —
- Periodic orbits that trace different closed paths in the plane.
- Lean formalization —
- A mathematical result expressed and checked in the Lean proof assistant.
Keywords : Limit cycles · Hilbert’s sixteenth problem · Liénard systems
AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.
3 · Technical details and sources
Claim made in the manuscript (source text)
Resolves the uniform boundedness assertion in Hilbert's sixteenth problem: the number of isolated periodic orbits of a real planar polynomial vector field is bounded by a finite constant depending only on its degree. For classical quintic Liénard systems, the exact maximum is two limit cycles.
Verified by Lean: the Lean software checked the part of the reasoning described below, sometimes only part of the manuscript. This does not mean independent mathematicians have validated the result.
Manuscripts in this family
Uniform bounds for planar polynomial limit cycles
24/09/2026For every degree, we prove that the number of isolated periodic orbits of a real planar polynomial vector field is bounded by a finite constant depending only on that degree. This establishes the uniform boundedness assertion in the second part of Hilbert's sixteenth problem. The proof uses separation of asymptotic expansions on nested complex domains and a finite-dimensional counting argument.
Two limit cycles for quintic Liénard systems
24/09/2026Every classical Liénard system , , with F an arbitrary real polynomial of degree at most five, has at most two geometrically distinct isolated periodic orbits, and the bound is attained. This proves the degree-five case of the Lins Neto–de Melo–Pugh conjecture.