Pith. Sign in

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

How this review was made: An AI referee (deepseek-v4-flash) read the paper on August 28, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 2 major objections · 3 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDnlin/0603005 (version 1)
Pith IDZAKXJYJH, Pith's permanent record of this paper and its review
CitationDaisuke Takahashi, Hironori Inoue, Junta Matsukidaira. "Discrete mappings with an explicit discrete Lyapunov function related to integrable mappings." arXiv:nlin/0603005 (2006). https://pith.science/paper/ZAKXJYJH
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

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

The paper tries to show that integrable QRT mappings can be modified, without destroying their explicit structure, so that their conserved quantity becomes a discrete Lyapunov function. In the modified maps, the quantity $h_n = h(x_{n-1},x_n)$ satisfies the one-step contraction formula $h_{n+1} - h_\infty = \kappa_n(h_n - h_\infty)$ with $\kappa_n \in [0,1)$, so $h_n$ moves monotonically toward the preassigned value $h_\infty$ and every orbit is pulled to the invariant curve $h_n = h_\infty$. Because the same function is conserved in the unmodified QRT case, the construction connects integrable dynamics, where orbits stay on level curves, to nonintegrable dynamics, where those level curves become attractors. The paper further claims that this Lyapunov structure survives differential and ultradiscrete limits and several practical variants, so the asymptotic behavior remains explicitly readable. A sympathetic reader would care because explicit Lyapunov functions for discrete maps are rare, and here one is inherited directly from an integrability structure.

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

Editorial extensions of the paper, not claims the author makes directly.

  • 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.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,572 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.06 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.62 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

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

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
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 kind of paper the classifier reports this is: theoretical result 0.93 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

Figures
Figure 1. Solutions to (24) with αn defined by (28) for (a00, a01, a02, a11, a12, a22) = (1, 2, 3, 1, 1, 0), h∞ = 5 and p = 1. Points (xn−1, xn) (1 ≤ n ≤ 1000) in the phase plane are plotted. (a) (x0, x1) = (3, 2), (b) (x0, x1) = (−0.2, −0.3). (a) (b)
Figure 2. Solutions to (24) with αn defined by (28) for p = 0.02. Parameters other than p are the same as in
Figure 3. Evolution of hn for Figs. 2 (a) and (b). 7
Figure 4. Solutions to (31) from (x0, x1) = (5, 1) and (2, 1) with (a00, a01, a02, a11, a12, a22) = (1, 0, 0, 0, 1, 2), h∞ = 6, βn = 100. Points (xn−1, xn) (1 ≤ n ≤ 1000) in the phase plane are plotted. Moreover, there is a remarkable feature about the mapping (31). Differential and ultradiscrete (piecewise-linear) equations are obtained by two kinds of limiting procedure. 3.1 Differential equation obtained from (31) With regard to a differential equation, we use the following transformation including a small parameter δ. xn = e y(nδ+ξ0) , a02 = c02, a11 = −2c02 + δ 2 c11, a00 = δ 2 c0
Figure 5. Solutions to (36) for (c00, c01, c02, c11, c12, c22) = (2, 1, 1, 0, 1, 1), eh∞ = 8, βe = 0.2 and (a) y(0) = 1, y ′ (0) = 0, (b) y(0) = y ′ (0) = 0. Both solutions are calculated numerically by the fourth-order Runge-Kutta method. Using (36), we can show d dt( eh − eh∞) = −4c 2 02 eβ e2y (y ′ ) 2 ( eh − eh∞). (39) This means eh converges to eh∞ and eh is a Lyapunov function to (36)
Figure 6. Solutions to (41) with (A00, A01, A02, A11, A12, A22) = (13, 71, 11, 17, 43, 23), H∞ = 100. (a) (x0, x1) = (800, 700), (b) (−13, −12). Note that aij = 0 corresponds to Aij → −∞ and the terms including Aij in (42) are eliminated from max functions
Figure 7. Evolution of points (x, y) = (5i, 5j) (−40 ≤ i, j ≤ 40) by the mapping (41). All parameters are the same as in
Figure 8. Mapping (24) with αn of (28) adjusted by p = c0 + (1−c0) sin2 (c1(hn −h∞)). Parameters and initial data are the same as in
Figure 9. Probabilistic mapping (24) with αn of (28) using probabilistic p defined by (44) with c = 0.5 and M = 30. Other parameters are the same as in
Figure 10. Evolution of the discrete Lyapunov function (a)
Figure 11. Solutions in a phase plane for (a) x (1) n and (b) x (2) n . Mappings and initial data are the same as in

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.