REVIEW
Discrete mappings with an explicit discrete Lyapunov function related to integrable mappings
Exactly Solvable and Integrable Systems · Submitted 1 Mar 2006 · 14 references
Pith's verdict: Clean construction, correct algebra, but the Lyapunov convergence theorem is conditional on an unproven inequality that can fail near the fixed point.
T0 · AI review
Why Pith says this
Highlight any text to comment on it.
Referee report
The paper
The paper claims
A modified QRT mapping carries an explicit discrete Lyapunov function—the QRT conserved quantity itself—that converges monotonically to a chosen level and draws every orbit to an attractor.
The reading
What carries the argument
The central object is the QRT conserved quantity $h_n = N(x_{n-1},x_n)/D(x_{n-1},x_n)$, defined by two symmetric $3\times 3$ matrices $A$ and $B$. Its new role is enforced by the identity $h_{n+1}-h_\infty = \kappa_n(h_n-h_\infty)$, where $\kappa_n = 1 - \alpha_n (x_{n+1}-x_{n-1})^2 / (D(x_{n-1},x_n)D(x_n,x_{n+1}))$; the ratio $\kappa_n$ measures how much of the distance $h_n-h_\infty$ survives one step. The construction works because the modified map is engineered so that the numerator's difference $h_{n+1}-h_n$ becomes proportional to $-\alpha_n (x_{n+1}-x_{n-1})^2$ after division by $D(x_{n-1},x_n)D(x_n,x_{n+1})$, and choosing $\alpha_n$ so that $\kappa_n$ stays in $[0,1)$ turns the conserved quantity into a contracting clock. The paper makes the contraction check tractable by restricting to class I and class II QRT matrices, where $D(x,y)$ becomes $1$ or $xy$ respectively and the sufficient conditions on $\alpha_n$ or on the related parameter $\beta_n$ become rational inequalities. This is the machinery that carries all subsequent differential, ultradiscrete, and coupled-system statements.
Extended reading notes
Core claim
For the second-order mapping obtained by adding the term $-\alpha_n x_{n-1}(h_n-h_\infty)$ to the QRT form, the paper's central discovery is the identity $$h_{n+1}-h_\infty = \left(1 - \alpha_n \frac{(x_{n+1}-x_{n-1})^2}{D(x_{n-1},x_n)D(x_n,x_{n+1})}\right)(h_n-h_\infty).$$ Whenever $0 \le \kappa_n < 1-\varepsilon$ for all $n$, $h_n$ decreases or increases monotonically and converges to $h_\infty$; hence $h_n$ is an explicit discrete Lyapunov function and the curve $h_n = h_\infty$ is an attractor. The paper proves the strict contraction condition for special choices of the QRT matrices: a class I case with a rational sufficient bound on $\alpha_n$, and a class II case where positivity of the orbit and nonnegativity of the coefficients are assumed to imply the contraction condition. It then derives a continuum equation and an ultradiscrete piecewise-linear equation as limits of the class II map, each carrying an explicit Lyapunov function obtained from the same $h_n$, and demonstrates applications with adjusted, probabilistic, and coupled coefficients.
Load-bearing premise
The load-bearing premise is that along every orbit the contraction factor $\kappa_n$ stays between 0 and 1, which the paper asserts for its main class of examples from positivity and coefficient assumptions but without giving the proof, and verifies for the other class only by example.
Editorial extensions
If this is right
- Under the stated conditions, every trajectory of the modified map approaches the attractor $h_n = h_\infty$ monotonically, rather than wandering over the whole level set of the QRT conserved quantity.
- The differential limit (36) has an explicit Lyapunov function $\tilde h(y,y')$ whose time derivative is non-positive, so solutions converge to the limit cycle $\tilde h = \tilde h_\infty$.
- The ultradiscrete limit (41) maps points in a region onto the attractor $H_n = H_\infty$ in finitely many steps, although additional attractors can appear because ultradiscretization changes strict inequalities into non-strict ones.
- Parameter adjustment, probabilistic coefficients, and coupled mappings preserve monotone convergence as long as the chosen $\alpha_n$ or $\beta_n$ stays within the stated bounds.
- The modified maps are nonintegrable because they are not reversible, yet they retain an explicit quantity that controls asymptotic behavior, illustrating a controlled bridge from integrable to nonintegrable discrete dynamics.
Reading between the lines
- The construction suggests that any reversible integrable second-order map with an explicit rational conserved quantity could be perturbed in the same way, turning that quantity into a Lyapunov function; the paper lists this generalization as a future problem.
- The class II convergence proof is omitted in the text, so a reader extending the result to new parameters should treat condition (21) as the hypothesis to check rather than as a theorem.
- If the finite-step convergence observed in the ultradiscrete case holds generically, ultradiscrete maps of this type could serve as cellular-automaton models where the attractor is reached after a bounded number of updates, with possible applications in discrete optimization or control.
- The coupled-system example shows a master-slave type arrangement where one map's Lyapunov function controls another map's convergence speed, which could be tested as a model of coordinated relaxation or synchronization.
Original abstract
We propose discrete mappings of second order that have a discrete analogue of Lyapunov function. The mappings are extensions of the integrable Quispel-Roberts-Thompson (QRT) mapping, and a discrete Lyapunov function of the mappings is identical to an explicit conserved quantity of the QRT mapping. Moreover we can obtain a differential and an ultradiscrete limit of the mappings preserving the existence of Lyapunov function. We also give applications of a mapping with an adjusted parameter, a probabilistic mapping and coupled mappings.
The compiled record
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
The abstract, sentence by sentence
We propose discrete mappings of second order that have a discrete analogue of Lyapunov function. The mappings are extensions of the integrable Quispel-Roberts-Thompson (QRT) mapping, and a discrete Lyapunov function of the mappings is identical to an explicit conserved quantity of the QRT mapping. Moreover we can obtain a differential and an ultradiscrete limit of the mappings preserving the existence of Lyapunov function. We also give applications of a mapping with an adjusted parameter, a probabilistic mapping and coupled mappings.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We propose discrete mappings of second order that have a discrete analogue of Lyapunov function. | contribution 1.00 | 0.94 | 0.37 | asserted 1.00 |
| s1 | The mappings are extensions of the integrable Quispel-Roberts-Thompson (QRT) mapping, and a discrete Lyapunov function of the mappings is identical to an explicit conserved quantity of the QRT mapping. | result 0.70 | 0.80 | 0.44 | asserted 1.00 |
| s2 | Moreover we can obtain a differential and an ultradiscrete limit of the mappings preserving the existence of Lyapunov function. | result 0.58 | 0.93 | 0.15 | asserted 0.84 |
| s3 | We also give applications of a mapping with an adjusted parameter, a probabilistic mapping and coupled mappings. | contribution 0.96 | 0.92 | 0.07 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
Figures
Figures reproduced from arXiv:nlin/0603005 by the authors.
References
Discussion
Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.