Source and verification

This article explains family 143 of the October 6, 2026 OpenAI collection. Research conclusions are attributed to its manuscripts. The review covers statements, introductions, and selected proof mechanisms; it is not an independent verification of the complete proofs.

🏷️ Limit cycles and return maps

For a planar polynomial vector field

a periodic orbit is the image of a nonconstant periodic solution. A limit cycle is a periodic orbit isolated from all other periodic orbits in some neighborhood. Geometric images are counted once, regardless of multiplicity or stability. A center surrounded by periodic trajectories therefore contributes no limit cycles.

A small transverse interval through a periodic orbit carries a first-return map . Nearby cycles correspond to isolated zeros of . A simple zero has and gives a hyperbolic cycle. Multiple isolated zeros also count.

The two manuscripts address different levels of uniformity: a degree-dependent bound for arbitrary polynomial fields, and an exact bound for a special quintic family. (OpenAI, 2026) (OpenAI, 2026a)

🏷️ Uniform degree bounds and an exact special case

General statement in the first manuscript

For each integer , there is a finite integer bounding the number of limit cycles of every real planar polynomial vector field of degree at most , throughout the plane. No coefficient, stability, or location restriction is imposed. The proof does not provide an effective formula for . (OpenAI, 2026b)

Individual finiteness for every field does not imply a uniform bound over all coefficients. The elementary analogy is a family of finite sets whose cardinalities tend to infinity. Degenerating coefficients and cycles escaping to infinity must both be handled.

The companion concerns the Liénard system

where is a real polynomial of degree at most five. It claims that the exact maximum number of limit cycles is two, without parity, coefficient-sign, amplitude, or hyperbolicity assumptions. (OpenAI, 2026a)

Differentiating the first equation gives

Thus the degree-five hypothesis is on the primitive ; the damping polynomial has degree at most four, and the restoring force is exactly . The result is not an exact count for arbitrary quintic planar fields.

🏷️ A direct two-cycle construction

The companion’s lower bound has an accessible perturbative proof. Set

At , the orbit through is . For , the exact identity is .

Let be the positive-axis return ordinate and the return time. Smooth dependence and transversality give

The integral defines the quotient smoothly even at . Using the integrals of over one period gives

Its positive zeros at and are simple, with derivatives and . The implicit function theorem preserves two distinct roots for small positive . At such a root,

The corresponding cycles are isolated; the inner one repels and the outer one attracts. This proves existence of two cycles. It does not by itself exclude distant additional cycles, which is the separate upper-bound problem. (OpenAI, 2026a)

🏷️ The quintic upper-bound mechanism

The upper proof keeps the positive and negative half-orbits separate. In either half-plane, the substitution gives an arch equation

At a fixed height, the two endpoint ordinates determine a half-width and a midpoint displacement. Even coefficients of contribute the same quadratic part to the two profiles, while odd coefficients change sign.

The manuscript proves that the midpoint data and its width derivative admit a unique global fit by a quadratic comparison profile. Both the range of this fit and its nonvanishing Jacobian matter: a merely local fit would not control all amplitudes.

Transport equations for the fitted slope and curvature reduce comparison of half-orbits to monotonicity. A model estimate uses endpoint variation, a Riccati equation, and a Schwarzian identity. The quintic coefficient structure then gives a sign partition in which the relevant matching function can have at most two isolated zeros. The source counts degenerate zeros directly rather than deleting them through a generic perturbation.

🏷️ Uniformity through degenerations

For the general theorem, a saddle already exhibits competing scales. The system sends to , with flight time . As both and vary, flight time and contraction depth can behave very differently.

The first manuscript encodes passage maps together with asymptotic expansions, derivative bounds, and complex-domain information. It proves separation and implicit-closure properties for that class; formal real asymptotic flatness alone would not suffice. (OpenAI, 2026b)

A finite geometric decomposition for bounded-degree fields supplies passage templates. Matching endpoints gives auxiliary equation systems. The proposed counting principle converts absolute isolated-zero finiteness for the required differentiated systems into uniform bounds on connected components of parameter fibers.

The finite templates are chosen before the sequences used in asymptotic contradiction arguments. Sequence-dependent local charts are not treated as a finite cover of coefficient space. Finally, a signed rotation transfers the hyperbolic count to arbitrary isolated cycles, and spatial rescaling addresses the whole plane.

🏷️ Key steps and proof outlines

An integrating factor reduces the quintic count to one sign change

Write the two half-plane profiles as , where and after reflection and time reversal. The even coefficients remain unrestricted. Let be the fitted midpoints at height zero and the fitted curvatures. The source’s global quadratic-fit theorem supplies a smooth model function satisfying , , and .

In the case ,

The transport theorem then makes nondecreasing. For , subtraction and the fundamental theorem of calculus yield

Here averages along the midpoint segment and averages along the curvature segment. Multiplying by gives a derivative with the sign of . The transformed function decreases, may be constant on an interval, then increases. It therefore has at most two isolated zeros. A zero interval contributes no isolated cycles, and a multiple minimum zero is counted correctly. This is the decisive zero-counting mechanism in “The quintic upper bound.” (OpenAI, 2026a)

The other coefficient cases retain strict boundary information

For , either and the half-profile matching function vanishes identically, or for all . In the latter case, two arches with the same endpoints would have difference satisfying a linear equation with strictly positive forcing and zero values at both endpoints. The integrating-factor formula rules that out.

For , the identity separates the fitted curvatures. At every matching zero, gives , so there is at most one zero. Two upward crossings would require an intervening non-upward crossing.

For , the relevant quantity is . The transport theorem gives opposite strict inequalities for the fitted intercepts at positive height . Strictness cannot be preserved merely by taking . Along a fixed-peak characteristic, the derivative of the intercept has the sign of . The fitted parameters stay bounded, whereas and . Integrating from one small positive height preserves a definite strict gap at zero. The resulting slope ordering again forces the curvature ordering at a matching zero and hence .

Signed rotation transfers a hyperbolic bound to all isolated cycles

The general-degree manuscript first bounds hyperbolic cycles through its finite passage templates and component-counting theorem. To include degenerate isolated cycles, perturb by . For a periodic solution , its parameter variation satisfies , where is a quarter-turn. The transverse determinant obeys

Thus the return displacement has . Its zero set is locally , with because the original cycle is isolated. An odd yields one simple nearby root for either sign of ; an even yields two for its favorable sign.

For a finite collection, let count odd-order cycles and the even-order cycles favoring each sign. One common small perturbation produces at least or hyperbolic cycles. The larger count is at least the original total. This does not claim every original cycle persists for the chosen sign. Disjoint neighborhoods keep the resulting cycles distinct, and the perturbation preserves polynomial degree.

Finally, any finite collection anywhere in the plane can be moved inside one fixed square by affine spatial scaling, again preserving degree. A uniform square bound therefore bounds every finite collection, hence the whole set. This closes the global and degenerate-cycle interfaces; the finite-template and component-counting results remain the substantive source inputs behind that uniform bound. (OpenAI, 2026b)

See Also

Entropy for the standard map also requires control of degenerating derivative growth. Mass-action permanence studies global bounds for another structured class of polynomial differential equations.

🏷️ Manuscripts and verification scope

The family scope page describes selected formalization coverage. Despite its general heading, the scope selects only the exact two-cycle theorem for quintic Liénard systems. The arbitrary-degree uniform bound is outside the documented selection. No Lean build, axiom audit, or manuscript-to-formal-statement equivalence check was performed for these notes.

OpenAI collection provides prerequisites and the reading sequence; coverage register records completed and pending families.

🐻  OpenAI 2026a. Two limit cycles for quintic Liénard systems.
🐻  OpenAI 2026b. Uniform bounds for planar polynomial limit cycles.