Cyclical Contraction Mapping Theory
- Cyclical contraction mapping is a generalization of Banach’s principle where mappings cycle through subsets under nonstandard contractivity conditions.
- The approach guarantees convergence to a unique fixed point or best-proximity point using classical, Kannan-type, and pseudocontractive conditions.
- Applications include alternating projections, periodic boundary value problems, and modeling cyclic phenomena in physical, economic, and engineering systems.
A cyclical contraction mapping is a generalization of Banach’s contraction principle to mappings that cycle through a family of subsets of a metric or generalized metric space, often under nonstandard contractivity or pseudocontractivity conditions. These mappings and their fixed point or best-proximity point theory form a rapidly developing branch of nonlinear analysis, with deep connections to approximation algorithms, best-approximation theory, and the study of nonlinear oscillatory or cyclic phenomena.
1. Definition and Formulations
A cyclical contraction mapping typically acts on a union of closed subsets of a metric space , with a mapping satisfying (indices mod ). The contraction condition is imposed not globally but between elements of adjacent cyclical blocks. In generalizations, can “linger” in a given block for finitely many steps or skip more than one block, as in -cyclic operators and -cyclic self-mappings (Sen, 2012, Sen, 2012, Sales, 18 Feb 2026, Pacurar, 2022).
Contractivity is imposed via various possible conditions:
- Classical cyclic contraction: , for 0, 1
- Kannan-type cyclic contraction: 2
- Intermediate-sense (pseudo)contractions: Quadratic forms bounding 3 with iteration-dependent parameters and error terms
- 4–5–cyclic contraction: 6, with 7 an 8-type metric and 9 strictly increasing (Sales, 18 Feb 2026).
Cyclical contraction notions also generalize to partial metric spaces (Abdeljawad et al., 2011) and G-metric spaces (Mohsenialhosseini, 2020), where the contraction is expressed via the partial or G-metric.
2. Main Fixed Point and Best-Proximity Theorems
Standard Results
If the intersection 0 is nonempty, cyclical contractions often admit a unique fixed point in the intersection, with Picard iterates 1 converging to it for all 2. If the intersection is empty, “best-proximity” points—elements 3 such that 4—replace classical fixed points (Sen, 2012, Sen, 2012, Sales, 18 Feb 2026).
Representative Theorems
| Context | Existence/Uniqueness Result | Reference |
|---|---|---|
| Complete metric spaces with cyclical contraction | Unique fixed point in 5; Picard convergence | (Sales, 18 Feb 2026, Chakraborty et al., 2013, Pacurar, 2022) |
| Uniformly convex Banach spaces | Convergence to unique finite limiting cycle of best-proximity points; collapse to fixed point if all 6 intersect | (Sen, 2012, Sen, 2012) |
| Partial metric/G-metric spaces | Existence/theory of approximate fixed points, or unique solution in intersection if contractivity is strict | (Abdeljawad et al., 2011, Mohsenialhosseini, 2020) |
Proof schemes typically combine boundedness and Cauchy properties of the (possibly interleaved) Picard sequences, closedness/convexity of the subsets, and analysis of asymptotic regularity or nonexpansiveness from the contractive inequalities, to ensure convergence.
3. Advanced Cyclical Contractive and Pseudocontractive Conditions
Intermediate-Sense Cyclic Pseudocontraction
The inequalities studied in (Sen, 2012, Sen, 2012) involve iteration-dependent parameters and error terms: 7 with conditions on limit behaviors of 8, 9, 0, 1, 2. This encompasses asymptotically strictly pseudocontractive, strictly contractive, and Meir–Keeler-type conditions.
Cyclic 3–4–Contraction
This unifies 5-averaged distance control and non-linear contractivity (through function 6). For example, with 7, 8,
9
This encompasses the Eldred–Veeramani best-proximity cyclic contraction as a special case (Sales, 18 Feb 2026).
Synchronous and Asynchronous 0-Cyclic Contractions
1-cyclic operators generalize the phase-jumping phenomenon (e.g., 2), with results for both synchronous (skipped-phase contraction) and asynchronous (contraction imposed between adjacent phases, mapping skips 3 sets) formulations (Pacurar, 2022).
4. Extensions to Generalized Settings
Partial Metric Spaces
Cyclical Banach contraction principles are extended to partial metric spaces, with suitable completeness assumptions (“0-complete” spaces) and the partial metric inequalities replacing metric ones. The fixed point lies in the intersection of the sets, with “0-self-distance” (Abdeljawad et al., 2011).
G-Metric Spaces
Cyclical contraction mappings generalize via inequalities such as, for a G-4-cyclical contraction,
5
where 6 is the ternary metric. Main results concern the approximate fixed point property: for all 7 there exists 8 with 9, even if exact fixed points do not exist (Mohsenialhosseini, 2020).
5. Structure of Orbits, Invariant Circuits, and Convergence Phenomena
Cyclical contraction fixed-point problems reduce, via combinatorial properties of the covering and the operator (e.g., via the value 0 in 1-cyclic cases), to collections of classical contraction problems on invariant “circuits”; convergence behavior is dictated by this decomposition (Pacurar, 2022). In uniformly convex or strictly convex Banach spaces, uniqueness of the limiting sequence or point is guaranteed; in more general settings one may obtain only approximate solutions or multiple fixed points corresponding to the decomposition.
Block-by-block analysis and reduction to (asymptotic) nonexpansiveness are central in the proof architectures. The general principle is that the orbit (or interleaved orbits) generated by a cyclical contraction mapping is bounded, Cauchy under suitable conditions, and converges—either to a unique point in the intersection, a best-proximity point, or, in the generalized-metric or partial metric context, to an approximate fixed point (Sen, 2012, Sen, 2012, Chakraborty et al., 2013, Abdeljawad et al., 2011, Mohsenialhosseini, 2020).
6. Practical Applications and Theoretical Significance
Cyclical contraction theory models and underpins convergence in applications with periodicity, alternation, or cycling constraints—including alternating projections, best-approximation algorithms, periodic boundary value problems, and cyclic phenomena in physical, economic, and engineering systems (Pacurar, 2022, Sen, 2012). The theory extends the Banach–Picard paradigm to a wide class of settings, including partial and G-metric spaces, with relaxed or non-linear control conditions.
Error-controlling terms, as in Kannan–type and Pata–type generalizations, increase the theory’s flexibility, covering mappings with small, controlled violations of strict contractivity, and unifying numerous earlier fixed point theorems (Chakraborty et al., 2013).
7. Further Generalizations and Open Directions
Recent work expands the scope of cyclical contraction mapping:
- Nonlinear (e.g., 2-controlled) contraction conditions (Sales, 18 Feb 2026).
- More general covering structures (e.g., 3-cyclic, or with possible “stalls” in blocks).
- Use in spaces lacking standard completeness or convexity (partial metric, G-metric, modular etc.).
- Approximate fixed point theory in G-metric and more exotic frameworks (Mohsenialhosseini, 2020).
Open research areas include best-proximity versions in non-classical settings, coupled fixed point or multivalued operator generalizations, and the analysis of stability and convergence rates for complex cyclic dynamical systems (Pacurar, 2022).