This paper, published in the Journal of Institute of Science and Technology, provides a comprehensive comparative study of "weakened" commutativity conditions in fixed-point theory. It maps the logical relationships between various types of mappings—such as commuting, weakly commuting, and compatible mappings—across both standard metric spaces and Menger probabilistic metric spaces.
TL;DR
The paper provides a rigorous "roadmap" for fixed-point theorists by categorizing and relating various weakened forms of commutativity. It demonstrates how these definitions translate from standard metric spaces to probabilistic Menger spaces, using counter-examples to show where traditional implications break down.
What Problem Does This Paper Address?
In mathematical analysis, finding a "common fixed point" for two functions $A$ and $B$ (a point $x$ where $Ax = Bx = x$) usually requires the functions to "commute," meaning $AB = BA$. However, strict commutativity is a very high bar that many real-world mathematical models cannot meet.
Over the last 50 years, researchers have introduced "weaker" versions of this condition (like "weakly commuting" or "compatible" mappings) to allow for common fixed point theorems to work under broader conditions. The problem is that the field has become crowded with dozens of similar-sounding definitions. Furthermore, as we move from standard metric spaces (where the distance between two points is a fixed number) to Menger probabilistic metric spaces (where distance is expressed as a probability distribution to account for uncertainty), these definitions become even more complex. This paper addresses the need for a unified comparative study to clarify these interrelationships.
Methods
This is a theoretical survey and comparative analysis. The authors employ two primary mathematical "tools":
- Formal Definition Mapping: They provide side-by-side definitions of properties (like $R$-weakly commuting or semi-compatibility) in both standard metric and Menger space contexts.
- Counter-Example Construction: The core of the paper relies on constructing specific mathematical functions that satisfy one "weak" condition but fail another. For instance, they use polynomial functions (like $Ax = x^3$ and $Bx = 2x^3$) to prove that "compatible" mappings are not necessarily "weakly commuting."
- Logical Proofs: The authors prove "Interrelationship I," demonstrating that every metric space can be represented as a probabilistic metric space by using the Heaviside distribution function.
Datasets
Not discussed in the paper. As a study in pure mathematics and topology, the paper relies on logical proofs and functional examples rather than empirical datasets.
Key Insights and Ideas
- The Hierarchy of "Weakness": The paper establishes a clear hierarchy. Commuting mappings are the most restrictive, followed by weakly commuting, then $R$-weakly commuting, and finally compatible mappings.
- The Metric-to-Probabilistic Bridge: A key insight is the formalization of how a standard distance $d(p, q)$ transforms into a distribution function $F_{p,q}(x)$. By setting $F_{p,q}(x) = H(x - d(p, q))$, any metric theorem can be viewed through a probabilistic lens.
- Coincidence vs. Commutativity: The authors highlight that many "weak" properties only require functions to behave nicely at "coincidence points" (where $Ax = Bx$), rather than across the entire space. This is the basis for "weakly compatible" mappings, which are essential for modern fixed-point theorems.
- Reciprocal Continuity: The paper emphasizes that "reciprocal continuity" is a vital, weaker alternative to standard continuity, allowing for fixed-point solutions in spaces that aren't necessarily complete.
Key Results
- Interrelationship I: Proved that every metric space is a probabilistic metric space.
- Interrelationship II: Demonstrated that while every pair of commuting mappings is weakly commuting, the converse is false (supported by Example 2.3).
- Interrelationship III (The Roadmap): The paper culminates in a visual flow chart (Figure 1) that illustrates the one-way logical implications between:
- Commuting Mappings (1976) $\rightarrow$ Weakly Commuting (1982) $\rightarrow$ $R$-Weakly Commuting (1994) $\rightarrow$ Compatible Mappings (1986).
- Compatibility Variants: The authors clarify the distinctions between "Type (A)," "Type (P)," and "Type (K)" compatible mappings in Menger spaces, which are often confused in the literature.
Limitations and Future Work
The authors acknowledge that while these weaker forms of commutativity expand the reach of fixed-point theory, they often rely on the existence of a "coincidence point" to be useful.
Future Directions: * Applying these clarified "weaker" conditions to solve open problems in non-linear analysis where uncertainty is a primary factor. * Exploring the application of these mappings in "intuitionistic" Menger spaces, which add another layer of complexity to the probabilistic model. * Developing common fixed-point theorems for mapping pairs that are "occasionally weakly compatible" but fail more standard compatibility tests.
Summary updated