Contractive Iterated-Map Codes

• Contractive Iterated-Map Codes are structured symbolic representations for systems exhibiting nonuniform contraction, characterized by natural coding of orbit itineraries.
• They classify injective piecewise contractions into dichotomies—either ultimately periodic codes or codes isomorphic to topologically transitive interval exchange transformations—illuminating system dynamics.
• The framework extends to logically contractive mappings and operator liftings, providing fixed-point convergence results and explicit complexity bounds in both metric and Hilbert spaces.

Searching arXiv for recent and foundational papers relevant to contractive iterated-map codes and related symbolic/iterative contraction frameworks. “Contractive iterated-map codes” denotes, in the language of the cited works, structured descriptions attached to iterated systems whose contractive behavior is encoded symbolically, eventwise, or operator-theoretically. For piecewise contractions of the interval, the code is the natural coding of an orbit relative to a partition; for logically contractive mappings, the relevant data is an increasing sequence of iterate counts at which contraction occurs; for contractive two-step iterated liftings, the corresponding invariant is the characteristic function together with its factorization. Across these settings, the common theme is that contraction need not appear in a uniform one-step form in order to impose rigid asymptotic or structural consequences on the associated iterated-map description (Pires, 2018, Alpay et al., 9 Aug 2025, Bala et al., 2022).

1. Contractive codings in interval dynamics

A piecewise contraction of $n$ intervals (an $n$-PC) is a map

$f:[0,1)\to[0,1)$

for which there exist a constant $0<\lambda<1$ and a partition of $I=[0,1)$ into non-degenerate intervals

$I_1,\ldots,I_n$

such that each restriction $f|_{I_i}$ is $\lambda$-Lipschitz; equivalently,

$$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$

An important subclass is formed by piecewise $\lambda$-affine contractions, where on each interval $n$0,

$n$1

Given such a partition, the natural coding of a point $n$2 is the infinite word

$n$3

over the alphabet

$n$4

defined by

$n$5

The coding records, at each time step, which continuity piece contains the current iterate. The paper also uses the usual notions of periodic and ultimately periodic words: $n$6 is periodic if $n$7, and ultimately periodic if $n$8 for some finite words $n$9. The language $f:[0,1)\to[0,1)$0 is the collection of all finite subwords appearing in $f:[0,1)\to[0,1)$1 (Pires, 2018).

The notion of isomorphic words is central. Two infinite words $f:[0,1)\to[0,1)$2 and $f:[0,1)\to[0,1)$3 are isomorphic if they use alphabets of the same cardinality and one is obtained from the other by a bijection of symbols. Accordingly, the classification is not a statement of literal word equality, but of equality up to relabeling. This is a precise way to compare codings generated by different partitions or different interval systems.

2. Classification by interval exchange transformations

The central structural statement is a dictionary theorem between codings of injective piecewise contractions and codings of interval exchange transformations. If $f:[0,1)\to[0,1)$4 is an injective $f:[0,1)\to[0,1)$5-PC and $f:[0,1)\to[0,1)$6 is a natural coding of $f:[0,1)\to[0,1)$7, then there exist

$f:[0,1)\to[0,1)$8

and an $f:[0,1)\to[0,1)$9-interval exchange transformation

$0<\lambda<1$0

with no attractive periodic orbits such that, after possibly moving forward along the orbit by some $0<\lambda<1$1, the natural coding of $0<\lambda<1$2 is either periodic or isomorphic to a non ultimately periodic natural coding of $0<\lambda<1$3. In the paper’s exact phrasing: if $0<\lambda<1$4 is a natural coding of an injective $0<\lambda<1$5-PC, then some infinite subword of $0<\lambda<1$6 is either periodic or isomorphic to a natural coding of a topologically transitive $0<\lambda<1$7-IET, where $0<\lambda<1$8 (Pires, 2018).

A key corollary is the clean symbolic-dynamical dichotomy: some infinite subword of a natural coding of an injective $0<\lambda<1$9-PC is either periodic or isomorphic to a non ultimately periodic natural coding of a topologically transitive $I=[0,1)$0-IET, $I=[0,1)$1. In effect, after a finite transient, admissible codes are either eventually periodic or interval-exchange in origin.

The paper emphasizes that the admissible symbolic sequences are therefore highly constrained. In the broader language of contractive iterated-map codes, this means that injective contractive interval maps do not generate arbitrary low-complexity sequences. Rather, they fall into a dichotomy: either the orbit eventually enters a periodic regime, producing an ultimately periodic coding, or, after discarding a finite prefix and up to symbol relabeling, the coding is a natural coding of a topologically transitive interval exchange transformation. This gives a classification theorem for what can appear from injective contractive interval systems.

3. Realization, semiconjugacy, and invariant structure

The converse direction is equally strong. Every natural coding of a topologically transitive $I=[0,1)$2-IET is also a natural coding of some injective $I=[0,1)$3-PC. More precisely, given any topologically transitive $I=[0,1)$4-IET $I=[0,1)$5, the construction produces an injective piecewise $I=[0,1)$6-affine contraction

$I=[0,1)$7

together with a continuous, surjective, non-decreasing map $I=[0,1)$8 such that

$I=[0,1)$9

In the statement of the paper, this is written as

$I_1,\ldots,I_n$0

meaning that the natural coding of $I_1,\ldots,I_n$1 at $I_1,\ldots,I_n$2 is isomorphic to the natural coding of $I_1,\ldots,I_n$3 at $I_1,\ldots,I_n$4 (Pires, 2018).

The construction is explicit. It uses a dense orbit $I_1,\ldots,I_n$5 of the IET, defines a family of intervals $I_1,\ldots,I_n$6 whose lengths are dyadic,

$I_1,\ldots,I_n$7

and then defines a monotone factor map $I_1,\ldots,I_n$8 collapsing the geometry of the IET orbit into the contraction dynamics. The resulting $I_1,\ldots,I_n$9 is piecewise affine with slope $f|_{I_i}$0 on each piece, and the semiconjugacy relation $f|_{I_i}$1 is established by matching orbit symbols under $f|_{I_i}$2.

The same work also isolates invariant-measure structure behind this correspondence. If $f|_{I_i}$3 is injective and a natural coding has infinite orbit complexity, then the $f|_{I_i}$4-limit set of the orbit supports a non-atomic invariant probability measure. The argument decomposes the dynamics into attractors $f|_{I_i}$5, shows that infinite $f|_{I_i}$6-limit sets are Cantor-like rather than finite, and then constructs a monotone map $f|_{I_i}$7 from the invariant measure. This is the mechanism through which the interval exchange factor is produced. A plausible implication is that the coding theorem is not merely combinatorial; it reflects a measure-theoretic and topological organization of the contractive dynamics.

4. Complexity bounds and Sturmian realizations

For a natural coding $f|_{I_i}$8 of an injective $f|_{I_i}$9-PC, the factor complexity

$\lambda$0

is eventually affine: $\lambda$1 with

$\lambda$2

In the transitive IET case, the slope is exactly the number of exchanged intervals minus one. More precisely, if $\lambda$3 is a natural coding of a topologically transitive $\lambda$4-IET, then

$\lambda$5

eventually, and if the IET is standard and satisfies Keane’s i.d.o.c., then

$\lambda$6

(Pires, 2018).

These formulas give a sharp asymptotic description of subword growth. For periodic codings, the slope is $\lambda$7; for the interval-exchange branch, the slope is positive and bounded above by $\lambda$8. The resulting complexity theorem is one of the main precise consequences of the classification theorem.

The paper also gives a concrete family of examples linking piecewise contractions to classical low-complexity words. For every irrational $\lambda$9, there exists a transcendental $$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$0 such that the $$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$1-PC

$$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$2

with $$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$3 in the construction is semiconjugate to the irrational rotation

$$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$4

and every natural coding of $$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$5 is Sturmian. In the special case

$$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$6

the parameter $$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$7 is expressed using the rabbit constant, and its transcendence follows from the known transcendence of that constant. This places contractive symbolic dynamics in direct contact with the standard Sturmian framework and shows that interval-exchange-type symbolic languages are realizable inside genuinely contractive systems.

5. Event-indexed contraction and fixed-point behavior

A different formalization of contractive iterated-map behavior appears in the notion of a logically contractive mapping. Let $$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$8 be a complete metric space and $$|f(x)-f(y)|\le \lambda |x-y| \quad\text{for every }x,y\in I_i,\ i=1,\dots,n.$$9. The map is nonexpansive if

$\lambda$0

It is logically contractive if $\lambda$1 is nonexpansive and there exist some $\lambda$2 and a strictly increasing sequence of natural numbers

$\lambda$3

such that for all $\lambda$4,

$\lambda$5

Thus contraction need not occur at each step; it is enough that iterates contract more and more strongly along a designated subsequence of event times (Alpay et al., 9 Aug 2025).

The paper notes an equivalent simplification: logical contractiveness is equivalent to “nonexpansive and at least one iterate $\lambda$6 is a strict contraction.” If $\lambda$7, then taking $\lambda$8 yields

$\lambda$9

From this, the fixed-point theorem follows: if $n$00 is logically contractive, then $n$01 has a unique fixed point $n$02, and for every $n$03, $n$04 as $n$05. Moreover, for every $n$06 and every $n$07,

$n$08

The rate is naturally event-indexed rather than iteration-indexed. To convert it into an explicit bound in terms of the raw iteration counter $n$09, one needs information about event density. If

$n$10

then for any $n$11,

$n$12

The canonical bounded-gap schedule is obtained by repeating the first strict event: if $n$13 is the first strict contraction time, then

$n$14

satisfies

$n$15

This yields

$n$16

The worked example is the piecewise map $n$17

$n$18

It is nonexpansive, but not a strict contraction. In fact,

$n$19

Hence $n$20 is logically contractive with $n$21, and the unique fixed point is $n$22. This example shows that iterated contraction can capture finite-time stabilization even when one-step contraction fails.

The same paper clarifies that logical contractiveness is not identical to familiar generalized contraction notions. It shows that logical contractiveness and Meir–Keeler are incomparable, and it exhibits an asymptotically nonexpansive map that is not logically contractive, namely the identity map. The point is that the framework emphasizes intermittent genuine contraction events rather than merely asymptotic control (Alpay et al., 9 Aug 2025).

6. Variable-factor events and operator-theoretic factorization

The event-indexed framework extends to variable-factor logically contractive mappings. A map $n$23 is VLC if it is nonexpansive and there exist increasing event times $n$24 and factors $n$25 such that for all $n$26,

$n$27

Writing

$n$28

this becomes

$n$29

As soon as some $n$30 occurs, the corresponding iterate $n$31 is a strict contraction, so the Banach argument gives a unique fixed point $n$32, and

$n$33

The crucial criterion is

$n$34

When this holds,

$n$35

If event gaps are bounded by $n$36, then

$n$37

The paper remarks that $n$38 is sufficient, but not necessary for a specific map to converge; if, for example,

$n$39

then $n$40, so $n$41, and the abstract theorem gives no convergence guarantee (Alpay et al., 9 Aug 2025).

An operator-theoretic analogue of contractive iterated-map coding appears in the study of contractive two-step iterated liftings. Let

$n$42

be a row contraction on a Hilbert space $n$43, meaning

$n$44

If $n$45 is a row contraction on $n$46, then a lifting of $n$47 by another row contraction $n$48 on $n$49 is a row contraction

$n$50

on $n$51 with block form

$n$52

Such a lifting is contractive iff $n$53 and $n$54 are row contractions and there exists a contraction

$n$55

such that

$n$56

A lifting is called reduced if $n$57 is completely non-coisometric and $n$58 is resolving; the paper notes that reduced liftings coincide with minimal contractive liftings (Bala et al., 2022).

For a minimal contractive lifting $n$59 of $n$60, the characteristic function

$n$61

is a multi-analytic operator

$n$62

satisfying

$n$63

and it is determined by its symbol

$n$64

The operator has a formal Fourier expansion

$n$65

In the two-step setup,

$n$66

the characteristic function of the full iterated lifting factors through the characteristic functions of the constituent liftings together with the Julia–Halmos matrix

$n$67

which is unitary. The paper proves unitary identifications of defect spaces and then derives a factorization of $n$68 in terms of $n$69, $n$70, and the associated defect-space unitaries. It stresses that the characteristic function of the iterated lifting is not just a naive product of two functions; it is a unitarily corrected product. For the minimal part $n$71, the restriction formula is

$n$72

so the characteristic function of the minimal part is obtained from the product of constituent characteristic functions by restriction to the appropriate defect space (Bala et al., 2022).

Taken together, these works suggest that “contractive iterated-map codes” is best understood as a family of rigorous encodings for systems in which contraction emerges through partitioned orbit itineraries, event-indexed iterates, or lifting-theoretic transfer data. In each setting, the iterated structure is the source of the coding, and contraction is the mechanism that forces strong classification, convergence, or factorization properties.