Pith. sign in

REVIEW 2 major objections 5 minor 24 references

Pinched Arnol'd tongues for Families of circle maps

T0 review · 2 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Generic circle-map forcings have no pinched Arnol'd tongues: the paper proves this for PL forcings with $k\ge3$ break points, for Lipschitz forcings, and for $C^r$ ($r>0$) forcings, unlike the two-breakpoint case where every tongue pinches.

desk verdict Genuinely new genericity results with a real hole in the k=3 PL case; fixable, but not correct as written. read the letter →

arxiv 2506.02988 v1 pith:QXRWVHQA submitted 2025-06-03 math.DS

Philip Boyland This is my paper · ORCID
classification math.DS MSC 37E1037C2054E5226A16
keywords Arnol'dtonguescirclemapsmodelockingpiecewiselinearLipschitzforcinggenericityBairecategorypinchpoints
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks how common a specific oddity of forced oscillators is. In the model family $f_{b,\omega}(x) = x + \omega + b\,\phi(x)$, the set $T_{p/q}$ of parameters with rotation number $p/q$ is a tongue that opens out from the $\omega$-axis, and a tongue pinches when it narrows to a single point at some coupling $b > 0$ before widening again. In the triangle-wave (two-breakpoint piecewise-linear) family every rational tongue pinches for large enough $q$, which made pinching look like a robust phenomenon. The paper proves the opposite: for a topologically generic forcing, meaning a dense $G_\delta$ set, in each of three classes — piecewise-linear with $k \ge 3$ break points, Lipschitz, and $C^r$ with $r > 0$ — no rational tongue ever pinches for $b > 0$. If the theorem is right, pinching is a rigid coincidence that generic forcings avoid and only the specially constrained two-breakpoint geometry forces.

What carries the argument

The load-bearing identity is Herman's observation that a $p/q$-tongue pinches at $(\omega,b)$ if and only if the $q$-th iterate equals the translation, $\tilde f^q_{b,\omega,\phi} = R_p$. All arguments flow from it: at such a point the derivative along orbits factors as $\prod_j (1 + b w_j)$, where the $w_j$ are the slope values (weights) of the forcing encountered along the orbit, and a pinch forces several distinct such plausible polynomials to share the same root $b \in [1/n,1]$ (Lemma 6.5). Genericity is then proved by perturbing near a would-be pinch so that the roots of all plausible polynomials become mutually distinct — no shared root, no pinch. For the smooth class the perturbations are trigonometric polynomials, which are dense and never pinch; for Lipschitz forcings, where trigonometric polynomials are not dense, the derivative is discretized into step functions and the weights are perturbed via the implicit function theorem plus a rank argument (Lemmas 6.6 and 6.7); for PL forcings with $k > 2$, the same algebra is combined with the combinatorics of break-point orbits (configurations) and a Baire-category argument over the finite-dimensional space of slopes and interval lengths.

What would settle it

A direct numerical test: for a standard-like forcing with three break points, compute all solutions of $\tilde f^q_{b,\omega,\phi} = R_p$ for $b \in (0,1]$ up to some large $q$; the theorem predicts that for a residual set of forcings none exist, so finding one such parameter and showing it survives every small perturbation of the break-point locations would falsify density. For the stated smooth range, the sharper test is at low regularity: exhibit a $C^r$ standard-like forcing with $0 < r < 1$ whose every $C^r$-neighborhood contains a pinching forcing, which would falsify the density lemma at that regularity; the two-breakpoint check, by contrast, is exact arithmetic — the roots in $(0,1)$ of $(1-y)^j\bigl(1 + \tfrac{\delta}{1-\delta} y\bigr)^{q-j} = 1$ for $1 \le j \le \lceil q\delta\rceil - 1$ should be precisely the coupling values where $T_{p/q}$ has width one.

Watch

Extended reading notes

Core claim

The paper's central claim (Theorem 1.2) is that for standard-like forcings — those for which $f_{b,\omega,\phi}$ is strictly increasing for $b < 1$ and fails to be order-preserving for $b > 1$ — the absence of pinched rational tongues is generic, with a different topology in each class: PL forcings with a fixed number $k > 2$ of break points, Lipschitz forcings, and $C^r$ forcings with $r > 0$. A tongue $T_{p/q}$ pinches at $(\omega,b)$ exactly when the $q$-th iterate satisfies $\tilde f^q_{b,\omega,\phi} = R_p$, meaning the whole map, not merely its rotation number, is synchronized; in PL language this forces every break point onto a $p/q$-periodic orbit containing both an up and a down break point, hence a conjugacy to the rigid rotation $R_{p/q}$ by a piecewise-linear homeomorphism. The proof shows this coincidence is fragile whenever there is room to perturb: in the smooth case by approximating with nonconstant trigonometric polynomials (which never pinch), in the Lipschitz case by approximating the derivative by a step function and perturbing the step weights so that the associated plausible polynomials $\prod_j (1 + b w_j)$ no longer share a common root $b$, and in the PL case $k > 2$ by a finite-dimensional perturbation of break-point locations and slopes, closed off by a Baire-category argument. The one irreducible exception is $k = 2$, where the parameter space collapses to a curve and the shared root is forced; Section 8 re-derives the two-breakpoint pinching theorem from the same machinery.

Load-bearing premise

For the $C^r$ part of Theorem 1.2 the proof requires the genuine derivative: it uses the characterization $S^r = \{ \phi : \min \phi' = -1 \}$ (Lemma 3.2) and the closedness of $S^r$ in $C^r$ to run a Baire-category argument, and differentiability is needed for both; the stated range $r > 0$ therefore exceeds what the proof supports for $0 < r < 1$, and the paper itself notes (Remark 4.2) that the $C^0$ case fails this way.

Editorial extensions

If this is right

  • For a typical (residual) forcing in each class, every rational tongue $T_{p/q}$ is a genuine horn: its left and right boundaries meet only at the $\omega$-axis $b=0$ and stay apart for $0 < b \le 1$.
  • The two-breakpoint PL class is the unique exception: for every standard-like such forcing, $T_{p/q}$ pinches at $\lceil q\delta\rceil - 1$ coupling values for large $q$, so the number of pinch points grows linearly with $q$.
  • Pinching can still look stable in experiments: because the rotation number is continuous in the $C^0$ topology, any forcing near a pinching one exhibits near-pinching, so the generic result does not predict what a coarse numerical scan will see.
  • At any pinch parameter the system is maximally synchronized: $\tilde f^q = R_p$, all break points lie on a $p/q$-periodic orbit, and an invariant density that is a step function with at most $\lfloor qk/2 \rfloor$ values exists.

Reading between the lines

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

  • The genericity statement is about Baire category, not measure; since a dense $G_\delta$ set can have a dense complement, the paper leaves open whether pinching forcings have positive measure under any natural probability distribution on, say, Lipschitz or PL forcings — a question the paper itself flags as deserving attention.
  • Symmetry is a plausible loophole: in subspaces of forcings that respect a symmetry (as in the four-breakpoint examples mentioned in the introduction), the symmetry could restore the rigidity that generic perturbations destroy, so pinching may persist inside symmetric subfamilies even though the ambient class is generically pinch-free.
  • The gap between the stated range $r > 0$ and the proof's differentiability requirement suggests a regularity boundary: pinching may become non-rare again below $C^1$ (e.g., for $C^{1/2}$ or Hölder standard-like forcings), where the step-function machinery no longer applies.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper studies the family of circle maps f_{b,ω}(x)=x+ω+bφ(x) and the phenomenon of pinched rational Arnol'd tongues, i.e., parameters where the p/q-tongue collapses to a single point. The main result, Theorem 1.2, claims that for standard-like forcing φ it is generic, in the appropriate topology, that the (ω,b)-bifurcation diagram has no pinched tongues, for three classes: (a) piecewise linear (PL) forcings with k>2 break points, (b) Lipschitz forcings, and (c) C^r forcings with r>0. This contrasts with the known k=2 PL case, where pinching occurs for every standard-like forcing (Campbell-Galeeva-Tresser-Uherka). The paper also gives an alternative proof of the k=2 pinching theorem using the developed framework.

Significance. If correct, the paper shows that pinched rational Arnol'd tongues are a nongeneric phenomenon in the PL k>2, Lipschitz, and C^r classes, making the k=2 PL case exceptional. The proof is self-contained and combines the implicit function theorem, polynomial-derived combinatorics, and Baire category arguments, with a substantial Lipschitz density theorem. It also provides an independent derivation of the CGTU k=2 result. The claimed genericity results, if established, would be a meaningful contribution to the bifurcation theory of circle maps and forced oscillators.

major comments (2)
  1. [§7.5, Lemma 7.6(c)] Lemma 7.6(c) is false as stated for k=3. Consider w=(-1,1/2,0) and ℓ=(1/4,1/2,1/4). Then all conditions of Definition 7.2 hold: w1=-1, all slopes are ≥ -1, adjacent slopes are distinct, and w·ℓ = -1/4 + 1/4 + 0 = 0. The constraint w·ℓ=0 fixes ℓ2 = 2ℓ1, so ℓ1/ℓ2 = 1/2 for every admissible ℓ with this w. Hence no perturbation of ℓ can change ℓ1/ℓ2 while keeping w fixed, contradicting the lemma's assertion. The derivative calculation in the proof of Lemma 7.6(c) gives d(ℓ2/ℓ1)/dℓ1 = w3/(ℓ1^2(w2-w3)), which is zero when w3=0, an allowed value. This lemma is used in the cyclic case of Theorem 7.7 (Section 7.6), where w is fixed and ℓ is perturbed to produce a contradiction from ℓ1/ℓ2 ≠ ℓ̂1/ℓ̂2. Since for k=3 every configuration is cyclic, the proof of Theorem 1.2(a) does not cover k=3 as written. The theorem may still be true, but a different perturbation is needed, for instance varying w as well, or using a different ratio such as ℓ2/ℓ3, which is perturbable in the offending example.
  2. [§3, Lemma 3.2 and §4, Theorem 4.1] Theorem 4.1 and hence Theorem 1.2(c) are stated for C^r with r>0, but the proof only works for r≥1. Lemma 3.2 characterizes the standard-like C^r forcings as those with min φ' = -1. For 0<r<1, C^r functions are generally only Hölder continuous and need not be differentiable, so the expression min φ' is not defined and Lemma 3.2 cannot even be stated. Lemma 5.1 uses the derivative of a trigonometric polynomial, min P', which is fine for r≥1 but does not address the Hölder case. Thus the claimed range r>0 is not supported by the argument. The theorem should be restated for r≥1, or a separate argument must be supplied for 0<r<1.
minor comments (5)
  1. [§7.6, proof of Theorem 7.7] The interval for b in the definition of F_{p/q,C,n} is written as b ∈ [1/n, 0]; it should be b ∈ [1/n, 1].
  2. [§7.6, proof of Theorem 7.7] In the cyclic-case calculation, the second displayed definition reads 'P1(y) = Σβ Qiβ(y)' but should be 'P2(y)'.
  3. [§6.2, Lemma 6.5] The phrase 'there are least three different (1/n)-plausable index sets' contains two typos: 'at least' and 'plausible'.
  4. [Abstract] The word 'multple' should be 'multiple'.
  5. [§7.6, proof of Theorem 7.7] The sets denoted Bc and Cc in the extension from T_{k}^{PL} to S_{k}^{PL} are complements, but the notation is easy to misread as a set named Cc; a standard complement symbol or explicit wording would improve clarity.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular reasoning found: the genericity proofs are self-contained perturbation and density arguments; external results (Herman's lemma) are used independently, not as disguised versions of the conclusion.

full rationale

The paper's central claims are derived from explicit constructions rather than from their own conclusions. The C^r genericity theorem (Theorem 4.1) is obtained from the Baire-space structure of S^r, Herman's Lemma 2.3 as an external non-pinching statement for trigonometric polynomials, and the C^r density Lemma 5.1; no fitted parameter is later relabeled as a prediction. The Lipschitz genericity theorem (Theorem 6.1) is built step by step in Sections 6.1-6.6: discretization of derivatives (Lemma 6.2), the calculus of plausible polynomials (Lemmas 6.4 and 6.5), a linear perturbation lemma (Lemma 6.6), and a nonlinear perturbation lemma (Lemma 6.7). The final contradiction uses Lemma 6.5 only after constructing a perturbation whose plausible roots are all distinct; nothing in that chain assumes the theorem being proved. The PL genericity theorem (Theorem 7.7) likewise proceeds by direct perturbation inside the coordinate space T^PL_k, using allowable configurations and Lemma 7.6, and the k=2 pinching theorem is reproved for completeness rather than imported as an input. The few self-citations, such as [4], are background references and are not load-bearing. No equation or construction reduces to its own input by definition. Two correctness concerns should be recorded separately from circularity: Lemma 3.2 characterizes S^r using min phi' = -1, so the stated range 0 < r < 1 is not supported as written, and the skeptic's counterexample to Lemma 7.6(c) for k=3 would break the cyclic case of Theorem 7.7 as written. Neither concern involves circularity of the derivation chain.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no free parameters fitted to data and no new postulated entities. Its assumptions are standard mathematical tools plus prior theorems from Herman and Campbell et al. The only domain-specific axiom is the standard-like characterization, which is problematic for non-integer r in the C^r case.

assumptions (5)
  • standard math Baire category theorem
    Used to conclude that dense G_delta intersections are generic in S^r, S^{Lip}, and T^{PL}_k; Sections 4 and 7.6.
  • standard math Implicit function theorem
    Used in Lemmas 6.6, 6.7, and 7.6 to solve F(b,w)=1 locally for b=g(w).
  • standard math Density of trigonometric polynomials in C^r
    Used in Lemma 5.1 to prove the C^r density lemma; stated as classical.
  • domain assumption Herman's Lemma 2.3
    Nonconstant trigonometric polynomials are not pinching; used to show A_{p/q,n} is nonempty. This is a prior theorem from Herman [13], accepted as background.
  • domain assumption Characterization of standard-like forcings by min derivative
    Lemma 3.2 proves S^r = {min phi'=-1} for differentiable phi and S^{Lip} via ess inf; the paper applies this to define the Baire space for C^r, which only works for r>=1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Pinched Arnol'd tongues for Families of circle maps." pith.science (2026). https://pith.science/paper/QXRWVHQA

@misc{pith2026250602988,
  author       = {Pith},
  title        = {Pith review of: Pinched Arnol'd tongues for Families of circle maps},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QXRWVHQA}},
  note         = {Machine review of arXiv:2506.02988}
}
abstract

The family of circle maps \begin{equation*} f_{b, \omega} (x) = x + \omega + b\, \phi(x) \end{equation*} is used as a simple model for a periodically forced oscillator. The parameter $\omega$ represents the unforced frequency, $b$ the coupling, and $\phi$ the forcing. When $\phi = \frac{1}{2 \pi} \sin(2 \pi x)$ this is the classical Arnol'd standard family. Such families are often studied in the $(\omega,b)$-plane via the so-called tongues $T_\beta$ consisting of all $(\omega,b)$ such that $f_{b, \omega}$ has rotation number $\beta$. The interior of the rational tongues $T_{p/q}$ represent the system mode-locked into a $p/q$-periodic response. Campbell, Galeeva, Tresser, and Uherka proved that when the forcing is a PL map with $k=2$ breakpoints, all $T_{p/q}$ pinch down to a width of a single point at multple values when $q$ large enough. In contrast, we prove that it generic amongst PL forcings with a given $k\geq 3$ breakpoints that there is no such pinching of any of the rational tongues. We also prove that the absence of pinching is generic for Lipschitz and $C^r$ ($r>0$) forcing.

Figures

Figures reproduced from arXiv: 2506.02988 by the authors.

Figure 1
Figure 1. Boundaries of Arnol’d p/q-tongues for q ≤ 4. Left, standard family; right, triangle wave family showing pinching. b, they pinch down to a point before spreading out again to hit the b = 1 line (see [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Map induced by g on the tangent spaces and error bounds from Taylor’s Theorem. For t > 0, ∥A(tv ′ )∥ = t∥Av ′∥. If θ is the angle Av ′ makes with the nearest V ′ i1,i2 , then the distance from A(tv ′ ) to V ′ i1,i2 is t∥Av ′∥ sin(θ) := c2t. Thus if t is small enough so that c1t 2 < c2t, then by (6.13), g(tv) misses all Vi1,i2 for (i1, i2) ∈ Ω. In addition, shrinking t if necessary so that t∥Av ′∥ + c1t 2 < min{d(0, … view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    On conjugations of circle homeomor- phisms with two break points

    Habibulla Akhadkulov, Akhtam Dzhalilov, and Dieter Mayer. On conjugations of circle homeomor- phisms with two break points. Ergodic Theory Dynam. Systems , 34(3):725–741, 2014

    work page 2014

  2. [2]

    Monotonicity of the entropy for a family of circle maps

    Llu ´ ıs Alsed` a and Francesc Ma˜ nosas. Monotonicity of the entropy for a family of circle maps. InEuropean Conference on Iteration Theory (Batschuns, 1989) , pages 1–5. World Sci. Publ., River Edge, NJ, 1991

    work page 1989

  3. [3]

    V. I. Arnol ' d. Small denominators. I. Mapping the circle onto itself. Izv. Akad. Nauk SSSR Ser. Mat. , 25:21–86, 1961

    work page 1961

  4. [4]

    Philip L. Boyland. Bifurcations of circle maps: Arnol 'd, tongues, bistability and rotation intervals. Comm. Math. Phys. , 106(3):353–381, 1986

    work page 1986

  5. [5]

    Campbell, Roza Galeeva, Charles Tresser, and David J

    David K. Campbell, Roza Galeeva, Charles Tresser, and David J. Uherka. Piecewise linear models for the quasiperiodic transition to chaos. Chaos, 6(2):121–154, 1996

    work page 1996

  6. [6]

    Nombre de rotation presque sˆ ur des endomorphismes du cercle affines par morceaux

    Sylvain Crovisier. Nombre de rotation presque sˆ ur des endomorphismes du cercle affines par morceaux. Bull. Braz. Math. Soc. (N.S.) , 33(1):1–26, 2002

    work page 2002

  7. [7]

    Almost sure rotation number of circle endomorphisms

    Sylvain Crovisier. Almost sure rotation number of circle endomorphisms. In Fractal geometry and appli- cations: a jubilee of Beno ˆ ıt Mandelbrot. Part 1, volume 72, Part 1 of Proc. Sympos. Pure Math. , pages 391–406. Amer. Math. Soc., Providence, RI, 2004

    work page 2004

  8. [8]

    A remark on Denjoy’s inequality for PL circle homeomorphisms with two break points

    Akhtam Dzhalilov, Alisher Jalilov, and Dieter Mayer. A remark on Denjoy’s inequality for PL circle homeomorphisms with two break points. J. Math. Anal. Appl. , 458(1):508–520, 2018

    work page 2018

Show all 24 references
  1. [9]

    Circle homeomorphisms with two break points

    Akhtam Dzhalilov and Isabelle Liousse. Circle homeomorphisms with two break points. Nonlinearity, 19(8):1951–1968, 2006

    1951

  2. [10]

    On the conjugation of piecewise smooth circle homeomorphisms with a finite number of break points

    Akhtam Dzhalilov, Dieter Mayer, and Utkir Safarov. On the conjugation of piecewise smooth circle homeomorphisms with a finite number of break points. Nonlinearity, 28(7):2441–2459, 2015

    2015

  3. [11]

    Teichm¨ uller dynamics, dilation tori and piecewise affine circle homeomorphisms

    Selim Ghazouani. Teichm¨ uller dynamics, dilation tori and piecewise affine circle homeomorphisms. Comm. Math. Phys. , 383(1):201–222, 2021

    2021

  4. [12]

    Piecewise linear circle maps and conjugation to rigid rational rotations, 2025

    Paul Glendinning, Siyuan Ma, and James Montaldi. Piecewise linear circle maps and conjugation to rigid rational rotations, 2025

    2025

  5. [13]

    Sur la conjugaison diff´ erentiable des diff´ eomorphismes du cercle ` a des rotations

    Michael-Robert Herman. Sur la conjugaison diff´ erentiable des diff´ eomorphismes du cercle ` a des rotations. Inst. Hautes ´Etudes Sci. Publ. Math. , (49):5–233, 1979. 26

    1979

  6. [14]

    PL homeomorphisms of the circle which are piecewise C 1 conjugate to irrational rota- tions

    Isabelle Liousse. PL homeomorphisms of the circle which are piecewise C 1 conjugate to irrational rota- tions. Bull. Braz. Math. Soc. (N.S.) , 35(2):269–280, 2004

    2004

  7. [15]

    Nombre de rotation, mesures invariantes et ratio set des hom´ eomorphismes affines par morceaux du cercle

    Isabelle Liousse. Nombre de rotation, mesures invariantes et ratio set des hom´ eomorphismes affines par morceaux du cercle. Ann. Inst. Fourier (Grenoble) , 55(2):431–482, 2005

    2005

  8. [16]

    D. J. W. Simpson. The structure of mode-locking regions of piecewise-linear continuous maps: I. Nearby mode-locking regions and shrinking points. Nonlinearity, 30(1):382–444, 2017

    2017

  9. [17]

    D. J. W. Simpson. The structure of mode-locking regions of piecewise-linear continuous maps: II. Skew sawtooth maps. Nonlinearity, 31(5):1905–1939, 2018

    1905

  10. [18]

    D. J. W. Simpson. The necessity of the sausage-string structure for mode-locking regions of piecewise- linear maps. Phys. D , 462:Paper No. 134142, 9, 2024

    2024

  11. [19]

    D. J. W. Simpson and J. D. Meiss. Neimark-Sacker bifurcations in planar, piecewise-smooth, continuous maps. SIAM J. Appl. Dyn. Syst. , 7(3):795–824, 2008

    2008

  12. [20]

    D. J. W. Simpson and J. D. Meiss. Shrinking point bifurcations of resonance tongues for piecewise- smooth, continuous maps. Nonlinearity, 22(5):1123–1144, 2009

    2009

  13. [21]

    D. J. W. Simpson and J. D. Meiss. Resonance near border-collision bifurcations in piecewise-smooth, continuous maps. Nonlinearity, 23(12):3091–3118, 2010

    2010

  14. [22]

    D. J. W. Simpson and J. D. Meiss. Aspects of bifurcation theory for piecewise-smooth, continuous systems. Phys. D , 241(22):1861–1868, 2012

    2012

  15. [23]

    How the arnol 'd, tongues become sausages in a piecewise linear circle map

    Wei Ming Yang and Bai Lin Hao. How the arnol 'd, tongues become sausages in a piecewise linear circle map. Comm. Theoret. Phys. , 8(1):1–15, 1987

    1987

  16. [24]

    Zhusubaliyev and Erik Mosekilde

    Zhanybai T. Zhusubaliyev and Erik Mosekilde. Bifurcations and chaos in piecewise-smooth dynamical systems, volume 44 ofWorld Scientific Series on Nonlinear Science. Series A: Monographs and Treatises. World Scientific Publishing Co., Inc., River Edge, NJ, 2003. Department of M...

    2003

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.