Global Continuation of Stable Periodic Orbits in Systems of Competing Predators
Pith reviewed 2026-05-22 21:15 UTC · model grok-4.3
The pith
Global families of stable periodic orbits exist in competing predator systems with Holling type II responses.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We prove the existence of global families of stable periodic orbits in an ecosystem with Holling's type II functional response, delimited by transcritical bifurcations at both ends, by formulating a zero-finding problem whose solutions are the families, defining a Newton-like fixed-point operator, and verifying contraction near a numerically computed approximation via interval arithmetic.
What carries the argument
A Newton-like fixed-point operator whose fixed points are families of periodic orbits, with contraction verified by interval arithmetic inequalities on a numerical approximation.
If this is right
- The same technique proves global families in many other systems that exhibit them numerically.
- The Butler-Waltman stable connection problem is solved for this competing-predator model.
- Periodic orbits persist across open sets of parameters without special restrictions.
- The method works for any system whose numerical data can be fed into the interval-arithmetic verification.
Where Pith is reading between the lines
- The contraction-mapping verification could be adapted to other global continuation problems in population dynamics.
- Similar rigorous-numerics pipelines might track stable orbits through Hopf or pitchfork bifurcations in higher-dimensional food webs.
- One could test the framework first on low-dimensional Lotka-Volterra systems before scaling to the full Holling type II case.
Load-bearing premise
The numerical approximation of the orbit family must lie sufficiently close to a true zero of the operator for the contraction inequalities to hold in a neighborhood, with this closeness established only by interval arithmetic checks rather than an a priori bound.
What would settle it
An explicit parameter value in the Holling type II model where interval arithmetic shows the contraction fails or where no continuous family of stable periodic orbits connects the two transcritical bifurcations.
Figures
read the original abstract
We develop a continuation technique to obtain global families of stable periodic orbits, delimited by transcritical bifurcations at both ends. To this end, we formulate a zero-finding problem whose zeros correspond to families of periodic orbits. We then define a Newton-like fixed-point operator and establish its contraction near a numerically computed approximation of the family. To verify the contraction, we derive sufficient conditions expressed as inequalities on the norms of the fixed-point operator, and involving the numerical approximation. These inequalities are then rigorously checked by the computer via interval arithmetic. To show the efficacy of our approach, we prove the existence of global families in an ecosystem with Holling's type II functional response, and thereby solve a stable connection problem proposed by Butler and Waltman in 1981. Our method does not rely on restricting the choice of parameters and is applicable to many other systems that numerically exhibit global families.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops a computer-assisted continuation technique to prove the existence of global families of stable periodic orbits in a competing-predator ecosystem with Holling type II functional response. It formulates a zero-finding problem whose solutions correspond to such families, constructs a Newton-like fixed-point operator, and rigorously verifies that the operator is contractive in a neighborhood of a numerically computed approximation by checking norm inequalities via interval arithmetic. The method is applied to establish global families delimited by transcritical bifurcations at both ends, thereby resolving the stable connection problem posed by Butler and Waltman in 1981. The approach is presented as parameter-free and extensible to other systems exhibiting similar numerical behavior.
Significance. If the contraction verification is complete and free of gaps, the result supplies a rigorous existence proof for global families of stable periodic orbits without restricting parameters, directly addressing a 1981 open question in mathematical ecology. The combination of numerical approximation with interval-arithmetic validation of a contraction mapping offers a reusable template for computer-assisted proofs in nonlinear dynamical systems where purely analytic methods fail. This strengthens the case for rigorous numerics in population dynamics and provides falsifiable, machine-checkable evidence for the claimed global continuation.
major comments (1)
- [§4] §4 (Fixed-point operator and contraction mapping): The sufficient conditions for the Newton-like operator T to be a contraction are expressed as norm inequalities that are checked by interval arithmetic on the numerically computed approximation. However, the manuscript obtains the required closeness of this approximation to a true zero solely from the computed data and the interval checks themselves, without an independent a priori analytic bound on the discretization, truncation, or floating-point error. If the seed lies outside the ball in which the derived inequalities guarantee contraction, the interval verification can succeed while the actual operator fails to be contractive, undermining the global-family existence claim.
minor comments (2)
- [§3] The notation for the family of periodic orbits and the precise definition of the zero-finding operator could be introduced with an explicit equation number in the methods section to improve readability.
- Figure captions should explicitly state the parameter values and the interval-arithmetic tolerances used in the verification.
Simulated Author's Rebuttal
We thank the referee for the careful reading and the detailed comment on §4. We address the concern regarding the a posteriori nature of the contraction verification below.
read point-by-point responses
-
Referee: [§4] §4 (Fixed-point operator and contraction mapping): The sufficient conditions for the Newton-like operator T to be a contraction are expressed as norm inequalities that are checked by interval arithmetic on the numerically computed approximation. However, the manuscript obtains the required closeness of this approximation to a true zero solely from the computed data and the interval checks themselves, without an independent a priori analytic bound on the discretization, truncation, or floating-point error. If the seed lies outside the ball in which the derived inequalities guarantee contraction, the interval verification can succeed while the actual operator fails to be contractive, undermining the global-family existence claim.
Authors: The validation procedure is deliberately a posteriori and self-contained. Interval arithmetic is used to compute rigorous enclosures of all operator norms and Lipschitz constants that appear in the contraction conditions; these enclosures already incorporate floating-point rounding errors. The zero-finding problem is formulated so that the numerical approximation (obtained, e.g., by a spectral method) is the center of a ball whose radius is chosen large enough for the verified inequalities to hold. When the interval checks succeed, the Banach fixed-point theorem directly guarantees a unique fixed point inside that ball, thereby establishing both existence and the required closeness without any external a priori analytic bound on discretization or truncation. The same interval framework also controls the truncation error once the discretization is fixed. This is the standard mechanism of computer-assisted proofs via contraction mappings and does not create a circularity. We will nevertheless insert a short clarifying paragraph in §4 that explicitly recalls the a posteriori character of the argument and cites the relevant literature on rigorous numerics. revision: partial
Circularity Check
No circularity detected in the derivation chain
full rationale
The paper formulates a zero-finding problem for families of periodic orbits, defines a Newton-like fixed-point operator T, and proves existence by verifying contraction inequalities via interval arithmetic applied to a numerical approximation. This is a standard computer-assisted proof technique relying on external numerical computation and independent rigorous bounds rather than any self-definitional reduction, fitted input renamed as prediction, or load-bearing self-citation. No step reduces the claimed existence result to its own inputs by construction, and the method is self-contained against the external benchmark of interval-arithmetic verification.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The system is a smooth autonomous ODE with Holling type II responses and the periodic orbit family can be represented in a suitable function space where the Newton-like operator is well-defined and Fréchet differentiable.
- standard math Interval arithmetic computations produce rigorous enclosures that correctly bound all rounding and truncation errors in the verification of the contraction inequalities.
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We formulate a zero-finding problem whose zeros correspond to families of periodic orbits. We then define a Newton-like fixed-point operator and establish its contraction near a numerically computed approximation
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Forward citations
Cited by 1 Pith paper
-
Proving the existence of localized patterns, periodic solutions, and branches of periodic solutions in the 1D Thomas model
A general framework using Newton-Kantorovich with explicit contraction bounds and an approximate inverse proves existence of localized and periodic solutions in the 1D Thomas model, handling its non-polynomial nonline...
Reference graph
Works this paper leans on
-
[1]
P. A. Abrams, C. E. Brassil, and R. D. Holt. Dynamics and responses to mortality rates of competing predators undergoing predator-prey cycles.Theoretical Population Biology, 64:163–176, 2003
work page 2003
-
[2]
P. A. Abrams and R. D. Holt. The impact of consumer-resource cycles on the coexistence of competing consumers.Theoretical Population Biology, 62:281–295, 2002
work page 2002
- [3]
- [4]
-
[5]
S. M. Baer, B. Li, and H. Smith. Multiple limit cycles in the standard model of three species competition for three essential resources.Journal of Mathematical Biology, 52:745–760, 2006
work page 2006
-
[6]
L. Benet and D. P. Sanders. IntervalArithmetic.jl.https://github.com/JuliaIntervals/IntervalArithmetic.jl, 2014
work page 2014
-
[7]
J. Bezanson, A. Edelman, S. Karpinski, and V. B. Shah. Julia: a fresh approach to numerical computing. SIAM Review, 59:65–98, 2017
work page 2017
-
[8]
J. Bouwe van den Berg and E. Queirolo. A general framework for validated continuation of periodic orbits in systems of polynomial ODEs.Journal of Computational Dynamics, 8(1):59–97, 2021
work page 2021
-
[9]
M. Breden. A posteriori validation of generalized polynomial chaos expansions.SIAM Journal on Applied Dynamical Systems, 22:765–801, 2023
work page 2023
-
[10]
M. Breden. Computer-assisted proofs for differential equations and dynamical systems. 2025
work page 2025
-
[11]
M. Breden and O. H´ enot. Efficient rigorous continuation via Chebyshev series expansion. In preparation
-
[12]
M. Breden, J.-P. Lessard, and M. Vanicat. Global bifurcation diagrams of steady states of systems of PDEs via rigorous numerics: a 3-component reaction-diffusion system.Acta Applicandae Mathematicae, 128(1):113–152, 2013
work page 2013
-
[13]
M. Breden and M. Payan. Computer-assisted proofs for the many steady states of a chemotaxis model with local sensing.Physica D: Nonlinear Phenomena, 466:134221, 2024
work page 2024
-
[14]
G. J. Butler, S.-B. Hsu, and P. Waltman. Coexistence of competing predators in a chemostat.Journal of Mathematical Biology, 17:133–151, 1983
work page 1983
-
[15]
G. J. Butler and P. Waltman. Bifurcation from a limit cycle in a two predator-one prey ecosystem modeled on a chemostat.Journal of Mathematical Biology, 12:295–310, 1981
work page 1981
-
[16]
R. Calleja, C. Garc´ ıa-Azpeitia, O. H´ enot, J.-P. Lessard, and J. D. Mireles James. From the La- grange triangle to the figure eight choreography: Proof of Marchal’s conjecture.arXiv preprint, https://doi.org/10.48550/arXiv.2406.17564, 2024
-
[17]
R. Castelli and J.-P. Lessard. Rigorous numerics in Floquet theory: Computing stable and unstable bundles of periodic orbits.SIAM Journal on Applied Dynamical Systems, 12(1):204–245, 2013
work page 2013
-
[18]
L. Cesari. Functional analysis and periodic solutions of nonlinear differential equations.Contributions to Differential Equations, 1:149–187, 1963
work page 1963
-
[19]
L. Cesari. Functional analysis and Galerkin’s method.Michigan Mathematical Journal, 11:385–414, 1964. 23
work page 1964
-
[20]
K. E. M. Church and E. Queirolo. Computer-assisted proofs of Hopf bubbles and degenerate Hopf bifurcations.Journal of Dynamics and Differential Equations, 2023
work page 2023
-
[21]
S. Danisch and J. Krumbiegel. Makie.jl: flexible high-performance data visualization for Julia.Journal of Open Source Software, 6:3349, 2021
work page 2021
- [22]
-
[23]
M. Dellala, M. Lakribb, and T. Sari. The operating diagram of a model of two competitors in a chemostat with an external inhibitor.Mathematical Biosciences, 302:27–45, 2018
work page 2018
-
[24]
B. Deng, N. Han, and S.-B. Hsu. Numerical proof for chemostat chaos of Shilnikov’s type.Chaos, 27:033106, 2017
work page 2017
-
[25]
J.-P. Eckmann, H. Koch, and P. Wittwer. A computer-assisted proof of universality for area-preserving maps.Memoirs of the American Mathematical Society, 47:121, 1984
work page 1984
-
[26]
J.-P. Eckmann and P. Wittwer. A complete proof of the Feigenbaum conjectures.Journal of Statistical Physics, 46:455–475, 1987
work page 1987
-
[27]
Z. Galias and P. Zgliczy´ nski. Infinite-dimensional Krawczyk operator for finding periodic orbits of discrete dynamical systems.International Journal of Bifurcation and Chaos, 17:4261–4272, 2007
work page 2007
-
[28]
G. F. Gause.The struggle for existence. Williams & Wilkins Baltimore, 1934
work page 1934
-
[29]
J. G´ omez-Serrano. Computer-assisted proofs in PDE: a survey.SeMA J, 76:459–484, 2019
work page 2019
-
[30]
S. R. Hansen and S. P. Hubbell. Single-nutrient microbial competition: agreement between experimental and theoretical forecast outcomes.Science, 207:1491–1493, 1980
work page 1980
-
[31]
O. H´ enot. On polynomial forms of nonlinear functional differential equations.Journal of Computational Dynamics, 8:307, 2021
work page 2021
-
[32]
F. M. Hilker and H. Malchow. Strange periodic attractors in a prey-predator system with infected prey. Mathematical Population Studies, 13(3):119–134, 2006
work page 2006
-
[33]
S.-B. Hsu, S. P. Hubbell, and P. Waltman. Competing predators.SIAM Journal on Applied Mathe- matics, 35:617–625, 1978
work page 1978
-
[34]
S.-B. Hsu, S. P. Hubbell, and P. Waltman. A contribution to the theory of competing predators. Ecological Monographs, 48:337–349, 1978
work page 1978
-
[35]
S.-B. Hsu, S. Ruan, and T.-H. Yang. On the dynamics of two-consumers-one-resource competing systems with Beddington–Deangelis functional response.Discrete and Continuous Dynamical Systems Series B, 18(9):2331–2353, 2013
work page 2013
-
[36]
J. Huisman and F. J. Weissing. Biodiversity of plankton by species oscillations and chaos.Nature, 402:407–410, 1999
work page 1999
-
[37]
J. Huisman and F. J. Weissing. Biological conditions for oscillations and chaos generated by multispecies competition.Ecology, 82(10):2682–2695, 2001
work page 2001
-
[38]
J. Huisman and F. J. Weissing. Oscillations and chaos generated by competition for interactively essential resources.Ecological Research, 17:175–181, 2002
work page 2002
-
[39]
A. Hungria, J.-P. Lessard, and J. D. M. James. Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach.Mathematics of Computation, 85:1427–1459, 2016
work page 2016
-
[40]
O. H´ enot. Radiipolynomial.jl.https://github.com/OlivierHnt/RadiiPolynomial.jl, 2021. 24
work page 2021
-
[41]
O. H´ enot. BHWPeriodicCoexistence.jl.https://github.com/OlivierHnt/BHWPeriodicCoexistence.jl, 2025
work page 2025
-
[42]
J. P. Keener. Oscillatory coexistence in the chemostat: a codimension two unfolding.SIAM Journal on Applied Mathematics, 43:1005–1018, 1983
work page 1983
-
[43]
J. P. Keener. Oscillatory coexistence in a food chain model with competing predators.Journal of Mathematical Biology, 22:123–135, 1985
work page 1985
-
[44]
H. Koch, A. Schenkel, and P. Wittwer. Computer-assisted proofs in analysis and programming in logic: a case study.SIAM Review, 38:565–604, 1996
work page 1996
-
[45]
S. Kryzhevich, V. Avrutin, and G. S¨ oderbacka. Bistability in a one-dimensional model of a two- predators-one-prey population dynamics system.Lobachevskii Journal of Mathematics, 42:3486–3496, 2021
work page 2021
-
[46]
Y. A. Kuznetsov.Elements of Applied Bifurcation Theory. Springer International Publishing, 2023
work page 2023
-
[47]
Y. Lamontagne, C. Coutu, and C. Rousseau. Bifurcation analysis of a predator-prey system with generalised holling type iii functional response.Journal of Dynamics and Differential Equations, 20:535– 571, 2008
work page 2008
-
[48]
O. E. Lanford III. A computer-assisted proof of the Feigenbaum conjectures.Bulletin of the American Mathematical Society, 6:427–434, 1982
work page 1982
-
[49]
J. A. Le´ on and D. B. Tumpson. Competition between two species for two complementary or substitutable resources.Journal of Theoretical Biology, 50(1):185–201, 1975
work page 1975
- [50]
- [51]
-
[52]
W. Liu, D. Xiao, and Y. Yi. Relaxation oscillations in a class of predator-prey systems.Journal of Differential Equations, 188:306–331, 2003
work page 2003
-
[53]
E. N. Lorenz. Deterministic nonperiodic flow.Journal of Atmospheric Sciences, 20(2):130–141, 1963
work page 1963
-
[54]
A. L´ opez-Nieto, P. Lappicy, N. Vassena, H. Stuke, and J.-Y. Dai. Hybrid bifurcations: Periodicity from eliminating a line of equilibria.Mathematische Annalen, 391:6373–6399, 2025
work page 2025
-
[55]
L. A. Mozo, O. H´ enot, and P. Lappicy. A practical guide to rigorously locate periodic orbits in discrete dynamics.arXiv preprint, https://doi.org/10.48550/arXiv.2510.06373, 2025
-
[56]
J. D. Murray.Mathematical Biology. Springer New York, 2002
work page 2002
-
[57]
M. T. Nakao. Numerical verification methods for solutions of ordinary and partial differential equations. Numerical Functional Analysis and Optimization, 22:321–356, 2001
work page 2001
-
[58]
J. M. Ortega. The Newton–Kantorovich Theorem.The American Mathematical Monthly, 75:658–660, 1968
work page 1968
-
[59]
Y. Sakref and O. Rivoire. On the exclusion of exponential autocatalysts by sub-exponential autocata- lysts.Journal of Theoretical Biology, 579:111714, 2024
work page 2024
-
[60]
H. L. Smith. The interaction of steady state and Hopf bifurcations in a two-predator–one-prey compe- tition model.SIAM Journal on Applied Mathematics, 42:27–43, 1982. 25
work page 1982
-
[61]
H. L. Smith.Monotone dynamical systems: an introduction to the theory of competitive and cooperative systems: an introduction to the theory of competitive and cooperative systems. Number 41. American Mathematical Soc., 1995
work page 1995
-
[62]
L. N. Trefethen.Approximation theory and approximation practice, volume 128. Siam, 2013
work page 2013
-
[63]
W. Tucker. The Lorenz attractor exists.Comptes Rendus de l’Acad´ emie des Sciences - Series I - Mathematics, 328:1197–1202, 1999
work page 1999
-
[64]
J. B. van den Berg and J.-P. Lessard. Rigorous numerics in dynamics.Notices of the AMS, 62:1057–1061, 2015
work page 2015
-
[65]
J. B. van den Berg, J.-P. Lessard, and K. Mischaikow. Global smooth solution curves using rigorous branch following.Mathematics of computation, 79(271):1565–1584, 2010
work page 2010
-
[66]
J. B. van den Berg, J.-P. Lessard, and E. Queirolo. Rigorous verification of Hopf bifurcations via desingularization and continuation.SIAM Journal on Applied Dynamical Systems, 20:573–607, 2021
work page 2021
- [67]
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.