Next Article in Journal
Fractional Fourier Series on the Torus and Applications
Previous Article in Journal
A Delayed Fractional-Order Predator–Prey Model with Three-Stage Structure and Cannibalism for Prey
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fractals of Interpolative Kannan Mappings

1
Industrial Engineering and Operations Research Department, Columbia University, 500 W. 120th Street, New York, NY 10027, USA
2
Department of Mathematics, Quaid-i-Azam University, Islamabad 45320, Pakistan
3
Department of Mathematics and Statistics, Faculty of Science and Technology, Thammasat University Rangsit Center, Pathum Thani 12120, Thailand
4
Department of Mathematics, Faculty of Science, Islamic University of Madinah, Madinah 42351, Saudi Arabia
*
Authors to whom correspondence should be addressed.
Fractal Fract. 2024, 8(8), 493; https://doi.org/10.3390/fractalfract8080493
Submission received: 25 June 2024 / Revised: 14 August 2024 / Accepted: 15 August 2024 / Published: 21 August 2024

Abstract

In 2018, Erdal Karapinar introduced the concept of interpolative Kannan operators, a novel adaptation of the Kannan mapping originally defined in 1969 by Kannan. This new mapping condition is more lenient than the basic contraction condition. In this paper, we study the concept by introducing the IKC-iterated function/multi-function system using interpolative Kannan operators, including a broader area of mappings. Moreover, we establish the Collage Theorem endowed with the iterated function system (IFS) based on the IKC, and show the well-posedness of the IKC-IFS. Interpolative Kannan contractions are meaningful due to their applications in fractals, offering a more versatile framework for creating intricate geometric structures with potentially fewer constraints compared to classical approaches.

1. Introduction

The fixed point theory plays an important role in the study of iterated function systems and fractals. It is well-known that the simplest fractals are self-similar sets, which are considered ’fixed points’ in Hutchinson–Barnsley transformations. These transformations work within the hyperspaces of compact sets taken from the original spaces, utilizing the Pompeiu–Hausdorff distance. To study these Hutchinson–Barnsley operators, iterated function systems must be employed. Iterated function systems (IFSs) were first introduced and studied by Hutchinson [1] in 1981 and later became popular through Barnsley [2] in 1988, as a natural generalization of the well-known Banach contraction principle [3] (which was further generalized by Nadler [4] for multi-valued mappings). They initiate a method for defining fractals as attractors of specific discrete dynamical systems and are highly effective in applications such as fractal image compression. Moreover, they are effectively applied in computer graphics, quantum physics, wavelet analysis, and various other related fields. Subsequently, mathematicians and computer experts have shown significant and meaningful interest, as indicated by research articles such as those by Barnsley and Demko [5] in 1985, Marchi [6] in 1999, Wicks [7] in 1991, Duvall et al. [8] in 1993, Block and Keesling [9] in 2002, Kieninger [10] in 2002, Fišer [11] in 2002, and Andres and Fišer [12] in 2003.
Since 1981, iterated function systems (IFSs) have given rise to a growing variety of fractals. Over the years, these systems have evolved into powerful tools for creating and analyzing unique fractal structures. When constructing a fractal, established fixed-point results within suitably designed spaces often serve as a source of inspiration and guidance. In their work [13], Kashyap et al. employed the Krasnoselskii fixed-point theorem to introduce a novel fractal creation, reminiscent of the classical fractal set originally developed by Mandelbrot in [14]. Over the past two decades, many authors have expanded the IFS theory to include generalized contractions, countable IFSs, multi-function systems, and more extensive spaces. For example, Georgescu [15] explored IFSs composed of generalized convex contractions within the framework of complete strong b-metric spaces; Gwóźdź-Lukawska and Jachymski [16] pioneered the application of the Hutchinson–Barnsley theory to infinite IFSs; Ioana and Mihail [17] studied the IFSs consisting of ϕ -contractions; Klimek Kosek [18] addressed generalized IFSs, multi-functions, and Cantor sets; Maślanka [19] investigated a typical compact set as the attractor of generalized IFSs of infinite order; Maślanka and Strobin [20] discussed generalized IFSs defined on the l -sum of a metric space; Dumitru [21] explored generalized IFSs, incorporating Meir–Keeler functions. Torre et al. [22,23,24] applied the concept of IFSs to multi-functions.
Recently, Prithvi et al. [25,26,27] established generalized IFSs over generalized Kannan mappings and provided some remarks on countable IFSs via the partial Hausdorff metric and non-conventional IFSs. Verma and Priyadarshi [28] studied new types of fractal functions for general datasets. Amit et al. [29] introduced the concept of iterated function systems (IFSs) utilizing non-stationary Φ -contractions. Ahmad et al. [30] worked on fractals of the generalized Θ –Hutchinson operator, while Rizwan et al. [31] presented fractals of two types of enriched ( q , θ ) –Hutchinson–Barnsley operators. Sahu et al. [32] provided fractals on the K-iterated function system. Thangaraj et al. [33] generated the fractals in controlled metric space for Kannan contractions. Chandra and Verma [34] constructed fractals using Kannan mappings and smoothness analysis.
Some applications of IFSs, such as Monte Carlo simulations, random sampling techniques, and cryptographic algorithms, can be found in [35,36], respectively.
Let ( X , d ) represent a complete metric space and T be a self-map on it. Then T is said to be a Banach contraction if 0 Υ < 1 such that we have the following:
d ( T η , T ν ) Υ d ( η , ν ) , η , ν , X .
The constant Υ for the self-mapping T is called the contraction factor of T . Banach [3] proved that each Banach contraction exhibits a unique fixed point (say η * X ) in a complete metric space, and the sequence { η w = T η w 1 : w N } η * as w , for any initial guess η 0 X .
Following Banach’s theorem, Kannan [37] initiated a fresh category of mappings known as Kannan contractions, which do not require the mappings to be continuous. Karapinar [38] introduced a novel form of the Kannan contraction known as an interpolative Kannan operator. Further research and additional information on this topic can be found in [39,40,41,42].
IFS simply means the collection of contraction maps together with a complete metric space. The Banach contraction theorem guarantees the existence and uniqueness of the fixed point of the transformation T * : Q ( X ) Q ( X ) defined in terms of self-contractions, called the attractor of the IFS. Now, we explore some notions required to understand iterated function systems. If ( X , d ) is a complete metric space, then we denote Q ( X ) , a family of all non-empty compact subsets of X , known as the Hausdorff space on X . The distance between any point η X and a subset Z Q ( X ) is given as follows:
d ( η , Z ) : = min ν Z d ( η , ν ) .
The distance between any two subsets U , Z Q ( X ) is given by the following:
D ( U , Z ) : = max η U d ( η , Z ) .
Finally, the Hausdorff distance between any two elements of Q ( X ) is described as follows:
h v ( Z , U ) : = max { D ( Z , U ) , D ( U , Z ) } , Z , U X .
Then the function h v satisfies all properties of the metric and, thus, is known as the Hausdorff metric defined on Q ( X ) in terms of the metric d . The completeness of the space X implies the completeness of Q ( X ) :
Lemma 1.
Suppose ( X , d ) is a metric space and U , Z , Y Q ( X ) . Then, the following statements holds the following:
(i)
Z Y sup η U d ( η , Z ) sup η U d ( η , Y ) ;
(ii)
sup ν U Z d ( ν , Y ) = max { sup η U d ( η , Y ) , sup x Z d ( x , Y ) } ;
(iii)
If { U w : w = 1 , 2 , , p } and { Z w : w = 1 , 2 , , p } are two finite collections of subsets of X , then
h v ( w = 1 p U w , w = 1 p Z w ) max w = 1 p h v ( U w , Z w ) .
Using the above discussions, we define the IFS on ( X , d ) as follows:
Definition 1.
Suppose ( X , d ) is a complete metric space and { T ( w ) : X X , for all w = 1 , 2 , , p } is a class of continuous contraction mappings with contraction factors Υ w , w = 1 , 2 , , p . Then ( X , T ( 1 ) , T ( 2 ) , , T ( p ) ) is called a (hyperbolic) iterated function system.
The main result in this direction was given by Barnsley in [2], which is stated as follows:
Theorem 1.
Let ( X , T ( 1 ) , T ( 2 ) , , T ( p ) ) be an IFS with contraction factors Υ w , for all w = 1 , 2 , , p . Then the transformation T * : Q ( X ) Q ( X ) is defined by the following:
T * ( Z ) = w = 1 p T ( w ) ( Z ) , Z Q ( X ) ,
which is also a contraction on ( Q ( X ) , h v ) with contraction factor Υ = max w = 1 p Υ w . Furthermore, T * has a unique attractor, which is Z * Q ( X ) , such that we have the following:
Z * = T * ( Z * ) = w = 1 p T ( w ) ( Z * ) ,
and is achieved by Z * = lim w T * w ( U ) , for any initial choice U Q ( X ) . Here, T * w ( U ) is given by T * w ( U ) = T * ( T * w 1 ( U ) ) .
In particular, the mappings used in the IFS are typically affine transformations. The dynamics of iterations linked to these transformations are perhaps not inherently captivating, but when the actions of this collection of contraction mappings are considered, the results are quite interesting and outstanding. For example, in two dimensions, consider the IFS ( [ 0 , 1 ] × [ 0 , 1 ] , T ( 1 ) , T ( 2 ) , T ( 3 ) ) with contraction factor 1 2 , where T ( 1 ) ( η , ν ) = ( η 2 , ν 2 ) , T ( 2 ) ( η , ν ) = ( η + 1 2 , ν 2 ) and T ( 3 ) ( η , ν ) = ( η + 1 2 , ν 2 + 3 4 ) . Then the fixed points of these contractions T ( 1 ) , T ( 2 ) , T ( 3 ) lie at the vertices of an equilateral triangle with coordinates ( 0 , 0 ) , ( 1 , 0 ) and ( 1 , 3 2 ) , which may not be particularly interesting; however, the corresponding attractor of the IFS is known as the Sierpinski gasket and is illustrated in Figure 1.
This fractal, characterized by its self-similarity and recursive structure, emerges as the collective limit of the iterated mappings, showcasing the beauty and complexity inherent in fractal geometry. Now, let us explore another fascinating example: the Dragon Curve, a quintessential masterpiece in the domain of fractal geometry. This intricate structure emerges through a captivating interplay of iterative transformations, meticulously orchestrated by affine mappings; T 1 and T 2 are essential to this process, with each using unique geometric properties to modify the pattern. T 1 simply applies the diagonal reflection and scaling, shaping points, particularly with the matrix 1 2 1 2 1 2 1 2 . The mapping T 2 adds the reflection and translation using the matrix given by 1 2 1 2 1 2 1 2 , with a shift in ( 1 , 0 ) . The combination of these maps results in the wonderful variety of the Dragon Curve fractal. By increasing the iterations, the simple line segments smoothly evolve under their effect, unveiling beautiful patterns that connect across a range of scales. So, the Dragon Curve shows the natural magic and fascinating magnificence that lies in the heart of fractal geometry. The fractal representation of the IFS is shown in Figure 2.
The given IFS is categorized by two mappings T 1 and T 2 . This is a useful tool for producing pseudo-random numbers. By repeating these mappings on some given initial data, the resulting values create properties likely to those of random iterations. However, it is not completely random; this scheme is very useful in many scenarios that seek randomness, such as random sampling techniques, Monte Carlo simulations [35], and algorithms related to cryptography [36]. Monte Carlo simulations are computational methods that employ repeated random sampling to approximate complex mathematical and physical phenomena. They are widely used to model systems with uncertain variables and assess risks, providing valuable insights into areas like finance, engineering, and physics. By producing and examining many random samples, Monte Carlo methods can estimate probabilities and outcomes in cases where analytical solutions are not possible. On the other hand, cryptographic algorithms are developed to protect data through encryption and decryption, ensuring confidentiality, integrity, and authenticity. These algorithms, which encompass both symmetric and asymmetric key methods, are crucial for safeguarding sensitive information and securing digital communications. Moreover, Monte Carlo simulations are employed in cryptography to enhance key generation and validate algorithms, demonstrating their versatile application and importance across different domains. The resulting graph displays the sequence’s progression, developed by the IFS. The development of pseudo-random numbers is core to mathematics and related fields like numerical optimization, simulations, statistical analysis, cryptography, and other computational fields. These pseudo-numbers allow researchers to introduce uncertainty and variability into mathematical models and numerical optimization. This also enables them to study how systems behave under different conditions and make probabilistic predictions. Thus, the application of IFS in the production of pseudo-random numbers is primary in both mathematical research and computational workflows.
In 1969, Nadler [4] generalized the fixed point theorem presented in [3] by replacing the operator from single-valued to multi-valued mapping. We use the following lemma from [4].
Lemma 2
([4]). Suppose ( X , d ) is a metric space, X , Z X and λ > 1 . Then for each x U , there exists z Z , such that we have the following:
d ( x , z ) λ h v ( U , Z ) .
In 1969, Kannan [37] established a fixed point theorem for Kannan operators, which do not require continuity. A mapping T : X X is called a Kannan contraction mapping if g [ 0 , 1 2 ) such that η , ν X , and the following inequality holds:
d ( T η , T ν ) g · [ d ( η , T η ) + d ( ν , T ν ) ]
This discovery led to more research into contractive-type conditions that do not require the continuity of T . Kannan’s theorem has been generalized in many ways by several authors to extend the scope of the metric fixed point theory in various directions.
Recently, Karapınar [38] expanded the scope of Kannan contraction mappings by developing a new category known as interpolative Kannan-type contraction mappings.
Definition 2
([38]). A mapping T : X X is termed an interpolative Kannan-type contraction if there exist g [ 0 , 1 ) and Υ ( 0 , 1 ) such that the following condition holds:
d ( T η , T ν ) g d ( η , T η ) Υ d ( ν , T ν ) 1 Υ , η , ν X Fix ( T ) ,
where Fix ( T ) = { η X : η = T η } .
To highlight the constants g and Υ involved in (3), we refer to the interpolative Kannan-type contraction mapping as ( g , Υ ) –IKC. Reference [38] demonstrated that any interpolative Kannan-type contraction mapping defined on a complete metric space possesses a unique fixed point.
The multi-valued version of the above definition is given as follows:
Definition 3.
A map T : X Q ( X ) is called a multi-valued interpolative Kannan-type contraction if g [ 0 , 1 ) and Υ ( 0 , 1 ) exist, such that the following holds:
h v ( T η , T ν ) g d ( η , T η ) Υ d ( ν , T ν ) 1 Υ , η , ν X Fix ( T ) ,
where Fix ( T ) = { η X : η T η } .
To highlight the constants involved in Definition (4), we refer to a multi-valued interpolative Kannan-type contraction as ( g , Υ ) –MIKC.
Not long ago, Sahu et al. [32] demonstrated the IFS on Kannan contraction mappings. They defined the concept of K-IFS by selecting some finite Kannan contractions T ( w ) , w = 1 , 2 , ,   p over the complete metric space ( X , d ) , and provided the following result using the famous Collage Theorem:
Theorem 2
([32]) Consider a continuous Y–Kannan mapping T : X X on ( X , d ) . Then, for every Z Q ( X ) , the mapping T * : Q ( X ) Q ( X ) , defined as T * ( Z ) = { T ( η ) : η Z } , is also a Y–Kannan mapping on ( Q ( X ) , h v ) ) .
Theorem 3
([32]). Consider { X ; ( T ( 0 ) ) , T ( 1 ) , T ( 2 ) , , T ( p ) } a Y–KIFS. Then, the Hutchinson operator P : Q ( X ) Q ( X ) defined by P ( Z ) = w = 1 p T ( w ) ( Z ) for all Z Q ( X ) is a continuous Y–Kannan mapping on the complete metric space ( Q ( X ) , h ( d ) ) . Its unique fixed point, alternatively referred to as an attractor U Q ( X ) of the KIFS, satisfies U = P ( U ) = w = 1 p U w , and is given by U = lim w P w ( Z ) for any Z Q ( X ) .
Expanding on the previously mentioned findings, Sahu et al. [32] presented their renowned Collage Theorem, a seminal contribution to this field. This theorem is very useful and important in the theory of iterated function systems (IFSs) and Kannan contraction mappings, functioning as a powerful tool used for obtaining the dynamics of intricate systems influenced by these operators.
Theorem 4
([32]). In a complete metric space ( X , d ) , take Z as a fixed set in Q ( X ) , with ϵ 0 and the iterated function system (KIFS) { X ; T ( 1 ) , T ( 2 ) , , T ( p ) } , with a contractivity factor Y. If U is the attractor of the given KIFS and
h v ( Z , w = 1 p T ( w ) ( Z ) ) ϵ ,
then
h v ( Z , U ) ϵ ( 1 Υ ) / ( 1 2 Υ ) .
This inequality explains the relation between the distance from Z to U and the factors Y and ϵ, providing a scale of convergence toward the attractor U .
This study initiates a novel iterated function system and iterated multi-function system, called IK –IFS and IK –IMS, respectively, for interpolative Kannan operators, intended to cover a broader range of mappings. We also present the well-known Collage Theorem in the context of interpolative Kannan contractions. Additionally, we delve into the establishment of the attractor’s well-posedness within the framework of IK –IMS. The Hutchinson operator is based on strict contraction mappings. In many practical scenarios, these mappings may not meet such strict criteria. The interpolative Kannan operator addresses this by allowing for more generalized contraction conditions, thus accommodating a wider range of mappings.

2. Main Results

We begin by stating and proving several propositions that illustrate the relationship between the self-mappings T w : X X for w = 1 , 2 , , p and the contraction pair ( g , Υ ) . Additionally, we will prove the uniqueness of the fixed point of T , if such a fixed point exists.
Proposition 1.
Let T : X X be a continuous ( g , Υ ) –IKC, where ( X , d ) is a metric space. Then T satisfies the following expression for all η X and w N :
d ( T w ( η ) , T w + 1 ( η ) ) g 1 Υ w d ( η , T η ) .
Furthermore, in limiting case
lim w d ( T w ( η ) , T w + 1 ( η ) ) = 0 .
Proof. 
By definition of ( g , Υ ) –IKC, we have the following:
d ( T w ( η ) , T w + 1 ( η ) ) = d ( T ( T w 1 ( η ) ) , T ( T w ( η ) ) ) g d ( T w 1 ( η ) , T w ( η ) ) Υ d ( T w ( η ) , T w + 1 ( η ) ) 1 Υ d ( T w ( η ) , T w + 1 ( η ) ) Υ g d ( T w 1 ( η ) , T w ( η ) ) Υ d ( T w ( η ) , T w + 1 ( η ) ) g 1 Υ d ( T w 1 ( η ) , T w ( η ) ) g 1 Υ g 1 Υ d ( T w 2 ( η ) , T w 1 ( η ) ) = g 1 Υ 2 d ( T w 2 ( η ) , T w 1 ( η ) ) d ( T w ( η ) , T w + 1 ( η ) ) g 1 Υ w d ( x , T ( η ) ) .
In the limiting case, we obtain the following:
lim w d ( T w ( η ) , T w + 1 ( η ) ) = 0 ,
since g 1 Υ w 0 as w . □
Subsequently, we present the following findings, where we prove that each continuous interpolative Kannan operator on a complete metric space must satisfy the inequality (6).
Proposition 2.
Let T : X X be a continuous ( g , Υ ) –IKC on the complete metric space ( X , d ) , and η * F i x ( T ) . Then, we have the following:
d ( η , η * ) 1 1 g 1 Υ w d ( η , T η ) , η X .
Proof. 
Since η * F i x ( T ) , we have η X and lim w T w ( η ) = η * . By using the continuity of T , the triangular inequality, and Proposition 1, we obtain the following:
d ( η , η * ) = d ( η , lim w T w ( η ) ) = lim w d ( η , T w ( η ) ) lim w m = 1 w d ( T m 1 ( η ) , T m ( η ) ) lim w ( 1 + g 1 Υ + g 1 Υ 2 + + g 1 Υ w 1 ) d ( η , T η ) ( 1 + g 1 Υ + g 1 Υ 2 + ) d ( η , T η ) = 1 1 g 1 Υ d ( η , T η ) .
Next, we state and prove the following lemma, which plays a crucial role in our main findings:
Lemma 3.
If η, b , c , and d are non-negative real numbers, then we have the following:
max { η · b , c · d } max { η , c } · max { b , d } .
Proof. 
To prove that max { η · b , c · d } max { η , c } · max { b , d } , where η , b , c , and d are non-negative real numbers, we use case analysis based on the values of η , b , c , and d . Let M 1 = max { η · b , c · d } and M 2 = max { η , c } · max { b , d } . We need to analyze the maximum values in two steps: first for the pairs { η , c } and { b , d } , and then for the products η · b and c · d .
  • Case 1:  η c  and  b d
    In this case, max { η , c } = η and max { b , d } = b . So, M 2 = η · b . Since η · b is one of the elements being compared in M 1 . Therefore, max { η · b , c · d } η · b and, hence, M 1 M 2 .
  • Case 2:  η c  and  b < d
    In this case, max { η , c } = η and max { b , d } = d . So, M 2 = η · d . Since η · b η · d (because b d ) and c · d η · d (because c η ). Therefore, max { η · b , c · d } η · d and, hence, M 1 M 2 .
  • Case 3:  η < c  and  b d
    In this case, max { η , c } = c and max { b , d } = b . So, M 2 = c · b . Since η · b c · b (because η c ) and c · d c · b (because d b ). Therefore, max { η · b , c · d } c · b and, hence, M 1 M 2 .
  • Case 4:  η < c  and  b < d
    In this case, max { η , c } = c and max { b , d } = d . So, M 2 = c · d . Since η · b c · d and c · d = c · d . Therefore, max { η · b , c · d } c · d and, hence, M 1 M 2 .
Hence, in all cases, we show the following:
max { η · b , c · d } max { η , c } · max { b , d } .
Thus, the inequality is proven for all non-negative real numbers η , b , c , and d . □
Next, we generalize the above lemma for the case of finite numbers as follows:
Lemma 4.
For any non-negative real numbers ( η w ) , ( b w ) , where w = 1 , 2 , , p , the following inequality holds:
max { Π w = 1 p η w , Π w = 1 p b w } Π w = 1 p max { η w , b w } .
Proof. 
The proof of this lemma is straightforward and can be derived using Lemma 3. □
Next, we define the interpolative Kannan iteration function system as well as the iteration multi-function system, which involves the use of interpolative Kannan contraction operators. The traditional Hutchinson operator depends on strict contraction mappings. However, in many practical scenarios, these mappings may not strictly meet these conditions. The interpolative Kannan operator relaxes these requirements, accommodating mappings that satisfy more generalized contraction conditions.
Definition 4.
Let ( X , d ) be a metric space and { T ( w ) : X X , w = 1 , 2 , , p } be a finite collection of interpolative Kannan contraction operators (IKCs) with contraction pair ( g w , Υ w ) , w = 1 , 2 , , p . Then, we call ( X ; T ( w ) , w = 1 , 2 , , p ) , a ( g w , Υ w ) –IKC-IFS or simply IKC-IFS.
Similarly, the IMS for the multi-valued interpolative Kannan contraction operators is defined as follows:
Definition 5.
Suppose ( X , d ) is a metric space and { T ( w ) : X Q ( X ) , w = 1 , 2 , , p } is a finite collection of multi-valued interpolative Kannan contraction operators (MIKCs) with the contraction pair ( g w , Υ w ) , w = 1 , 2 , , p . Then, we call ( X ; T ( w ) , w = 1 , 2 , , p ) , a ( g w , Υ w ) –IKC-IMS.
Our initial result is as follows. This outcome presents the initial findings and sets the stage for further analysis.
Theorem 5.
Let T : X X be a continuous ( g , Υ ) –IKC. Then T * is defined by T * ( U ) = { T ( η ) ; η U } , U Q ( X ) , and maps Q ( X ) into itself, and T * is also a ( g , Υ ) –IKC on ( Q ( X ) , h v ) .
Proof. 
Since T is continuous mapping, then T * maps compact subsets of X into compact subsets of X . That is, T * maps Q ( X ) into itself.
Secondly, we have the following:
D ( T η , T Z ) = inf ν B Z { d ( T η , T ν ) } inf ν Z { g d ( η , T η ) Υ d ( ν , T ν ) 1 Υ } g d ( η , T η ) Υ h v ( Z , T Z ) 1 Υ .
Similarly,
D ( T ν , T U ) = inf η U { d ( T ν , T η ) } inf η U { g d ( ν , T ν ) Υ d ( η , T η ) 1 Υ } g d ( ν , T ν ) Υ h v ( U , T U ) 1 Υ .
Thus, using (7) and (8), we obtain the following:
h v ( T U , T Z ) = max { sup η U D ( T η , T Z ) , sup ν Z D ( T ν , T U ) } max { sup η U g d ( η , T η ) Υ h v ( Z , T Z ) 1 Υ , sup ν Z g d ( ν , T ν ) Υ h v ( U , T U ) 1 Υ } = g · h v ( U , T U ) Υ h v ( Z , T Z ) 1 Υ .
This shows that T * is also a ( g , Υ ) –IKC. □
We define the Hutchinson operator and Hutchinson-like operator equipped with interpolative Kannan mappings as follows:
Definition 6.
Consider ( X , d ) be a metric space and { T ( w ) } , where w = 1 , 2 , , p , be a finite collection of ( g w , Υ w ) –IKCs. Then the transformation P : Q ( X ) Q ( X ) is defined by the following:
P ( Z ) = w = 1 p T ( w ) ( Z ) , Z Q ( X ) ,
and is called the Hutchinson operator equipped with IKCs.
Definition 7.
Let ( X , d ) be a metric space and { T ( w ) } , where w = 1 , 2 , , p is a finite collection of ( g w , Υ w ) –MIKCs. Then the transformation P : X Q ( X ) is defined by the following:
P ( z ) = w = 1 p T ( w ) ( z ) , z X ,
and is called the Hutchinson-like operator associated with MIKCs.
In the following, we present some results about the Hutchinson operator formed by the interpolative Kannan operators.
Theorem 6.
Suppose ( X , d ) is a metric space and { T ( w ) } , where w = 1 , 2 , , p is a finite collection of ( g w , Υ w ) –IKCs. Then the transformation P : Q ( X ) Q ( X ) is given by the following:
P ( U ) = w = 1 p T ( w ) ( U ) , U Q ( X ) ,
is also a ( g , Υ ) –IKC on ( Q ( X ) , h v ) , with g = max w = 1 p g w and Υ = max w = 1 p Υ w .
Proof. 
Consider the following in light of Lemma 1 and Lemma 4:
h v ( P ( U ) , P ( Z ) ) = h v ( w = 1 p T ( w ) ( U ) , w = 1 p T ( w ) ( Z ) ) max w = 1 p h v ( T ( w ) ( U ) , T ( w ) ( Z ) ) max w = 1 p g w · h v ( U , T ( w ) ( U ) ) Υ w h v ( Z , T ( w ) ( Z ) ) 1 Υ w g · max w = 1 p h v ( U , T ( w ) ( U ) ) Υ h v ( Z , T ( w ) ( Z ) ) 1 Υ , ( where g = max w = 1 p g w & Υ = max w = 1 p Υ w ) g · Π max w = 1 p h v ( U , T ( w ) ( U ) ) Υ , h v ( Z , T ( w ) ( Z ) ) 1 Υ = g · Π { h v ( U , w = 1 p T ( w ) ( U ) ) Υ , h v ( Z , w = 1 p T ( w ) ( Z ) ) 1 Υ } = g · h v ( U , w = 1 p T ( w ) ( U ) ) Υ · h v ( Z , w = 1 p T ( w ) ( Z ) ) 1 Υ = g · h v ( U , P ( U ) ) Υ · h v ( Z , P ( Z ) ) 1 Υ .
Thus, P is also a ( g , Υ ) –IKC, where g = max w = 1 p g w & Υ = max w = 1 p Υ w . □
The Hutchinson operator—equipped with interpolative Kannan contractions—is also a Kannan contraction. So, we simply call it the ( g , Υ ) –IKC–Hutchinson operator, where g = max w = 1 p g w and Υ = max w = 1 p Υ w .
Theorem 7.
Consider the ( g w , Υ w ) –IKC-IFS ( X ; T ( w ) , 1 , 2 , , p ) on a complete metric space ( X , d ) and the ( g , Υ ) –IKC P : Q ( X ) Q ( X ) defined by P ( U ) = w = 1 p T ( w ) ( U ) , U Q ( X ) , where g = max w = 1 p g w & Υ = max w = 1 p Υ w . Then, P has a unique attractor of the given IFS, say U * Q ( X ) , satisfying A * = P ( U * ) = w = 1 p T ( w ) ( U * ) , and is given by U * = lim w P w ( Z ) for any initial choice of Z Q ( X ) .
Proof. 
Let U 0 Q ( X ) be any arbitrary point and establish the sequence U w + 1 = P ( U w ) , w N . By using Theorem (6), it is clear that P is a ( g , Υ ) –IKC, where g = max w = 1 p g w & Υ = max w = 1 p Υ w . Then, we have the following:
h v ( U w , U w + 1 ) = h v ( P ( U w 1 ) , P ( U w ) ) g · h v ( U w 1 , U w ) Υ h v ( U w , U w + 1 ) 1 Υ h v ( U w , U w + 1 ) Υ g · ( U h v w 1 , U w ) Υ h v ( U w , U w + 1 ) g 1 Υ · h v ( U w 1 , U w ) g 1 Υ · g 1 Υ · h v ( U w 2 , U w 1 ) = g 1 Υ 2 · h v ( U w 2 , U w 1 ) h v ( U w , U w + 1 ) g 1 Υ w · h v ( U 0 , U 1 ) .
Letting w , we obtain lim w h v ( U w , U w + 1 ) = 0 .
Next, we show that { U w } w = 0 is a Cauchy sequence in ( Q ( X ) , h v ) . More precisely, for r > w , we obtain the following:
h v ( U w , U w + r ) = h v ( U w , U w + 1 ) + h v ( U w + 1 , U w + 2 ) + + h v ( U w + r 1 , U w + r ) ( g 1 Υ w + g 1 Υ w + 1 + + g 1 Υ w + r 1 ) · h v ( U 0 , U 1 ) ( g 1 Υ w + g 1 Υ w + 1 + ) · h v ( U 0 , U 1 ) = g 1 Υ w 1 g 1 Υ · h v ( U 0 , U 1 ) 0 as w .
This implies that { U w } is a Cauchy sequence and due to the completeness of Q ( X ) , we can find U * Q ( X ) such that U w U * as w .
Next, we show that U * F i x ( P ) . Using the definition of ( g , Υ ) –IKC, we have the following:
h v ( U w + 1 , P ( U * ) ) = h v ( P ( U w ) , P ( U * ) ) g · h v ( U w , P ( U w ) ) Υ h v ( U * , P ( U * ) ) 1 Υ .
Taking w , we obtain h v ( U * , P ( U * ) ) = 0 , which yields U * F i x ( P ) , and U * is an attractor of the IK –IFS. To show the uniqueness of the attractor, take contrary U , Z F i x ( P ) with U Z . Then, by definition, we have the following:
h v ( U , Z ) = h v ( P ( U ) , P ( Z ) ) g · h v ( U , P ( U ) ) Υ h v ( Z , P ( Z ) ) 1 Υ = g · h v ( U , U ) Υ h v ( Z , Z ) 1 Υ h v ( U , Z ) = 0 .
A contradiction. Hence, the fixed point of P or the attractor of the IK –IFS is unique. □
Example 1.
Consider a system of two operators defined by the following:
T ( 1 ) ( η ) = 0 , if η [ 0 , 2 ) η + 2 if η 2
and
T ( 2 ) ( η ) = 0 , if η [ 0 , 3 ) η + 3 , if η 3
on X = [ 0 , ) with the usual metric. Suppose that both operators T ( 1 ) and T ( 2 ) are Kannan contractions, satisfying the Kannan inequality (2). First, check T ( 1 ) with η = 0 and x = 2 . Then, d ( T ( 1 ) 0 , T ( 1 ) 2 ) = d ( 0 , 4 ) = 4 , d ( 0 , T ( 1 ) 0 ) = d ( 0 , 0 ) = 0 and d ( 2 , T ( 1 ) 2 ) = d ( 2 , 4 ) = 2 . For some g 0 , 1 2 , inequality (2) implies the following:
4 g [ 0 + 2 ] g 2 .
This leads to a contradiction, so T ( 1 ) is not a Kannan mapping. A similar argument can be applied to T ( 2 ) by choosing η = 0 and x = 3 . It is evident that both T ( 1 ) and T ( 2 ) satisfy inequality (3) with g = 1 4 and Υ = 1 4 . Hence, this forms an interpolative iterated function system (IKC-IFS). Consequently, the results provided by Sahu et al. [32] cannot be applied to this example. On the other hand, the corresponding ( 1 4 , 1 4 ) –IKC–Hutchinson-like operator is defined by the following:
P ( z ) = T ( 1 ) ( z ) T ( 2 ) ( z ) , z X .
The attractor of the IKC–Hutchinson operator is the set { 0 } .
Next, we have some results for the Hutchinson operator related to the iterated multi-function system.
Theorem 8.
Suppose ( X , d ) is a metric space and { T ( w ) } , where w = 1 , 2 , , p is a finite collection of ( g w , Υ w ) –MIKCs. Then the transformation P : X Q ( X ) is given by the following:
P ( x ) = w = 1 p T ( w ) ( x ) , x X ,
is also a ( g , Υ ) –MIKC on ( X , d ) , where g = max w = 1 p g w and Υ = max w = 1 p Υ w .
Proof. 
By following Lemma 1 and Lemma 4, we obtain the following:
h v ( P ( x ) , P ( z ) ) = h v ( w = 1 p T ( w ) ( x ) , w = 1 p T ( w ) ( z ) ) max w = 1 p h v ( T ( w ) ( x ) , T ( w ) ( z ) ) max w = 1 p g w · d ( x , T ( w ) ( x ) ) Υ w d ( x , T ( w ) ( x ) ) 1 Υ w g · max w = 1 p d ( x , T ( w ) ( x ) ) Υ d ( z , T ( w ) ( z ) ) 1 Υ , ( where g = max w = 1 p g w & Υ = max w = 1 p Υ w ) g · Π max w = 1 p d ( x , T ( w ) ( x ) ) Υ , d ( z , T ( w ) ( z ) ) 1 Υ = g · Π { d ( x , w = 1 p T ( w ) ( x ) ) Υ , d ( z , w = 1 p T ( w ) ( z ) ) 1 Υ } = g · d ( x , w = 1 p T ( w ) ( x ) ) Υ · d ( z , w = 1 p T ( w ) ( z ) ) 1 Υ = g · d ( x , P ( x ) ) Υ · d ( z , P ( z ) ) 1 Υ .
Thus, P is also a ( g , Υ ) –MIKC, where g = max w = 1 p g w & Υ = max w = 1 p Υ w . □
Theorem 9.
Consider the ( g w , Υ w ) –IKC-IMS ( X ; T ( w ) , 1 , 2 , , p ) on a complete metric space ( X , d ) and the ( g , Υ ) –IKC P : X Q ( X ) defined by the following: P ( x ) = w = 1 p T ( w ) ( x ) , x X , where g = max w = 1 p g w & Υ = max w = 1 p Υ w . Then P has a unique attractor of the given IMS, say x * X , satisfying x * = P ( x * ) = w = 1 p T ( w ) ( x * ) and is given by x * = lim w P w ( z ) , for any initial choice of z X .
Proof. 
Let x 0 X be any arbitrary point and establish the sequence x w as follows: Suppose x 1 X such that x 1 P x 0 . By using Lemma (2), we can find an x 2 P x 1 such that
d ( x 1 , x 2 ) g · d ( x 0 , x 1 ) Υ d ( x 1 , x 2 ) 1 Υ .
By induction, we can establish the sequence x w + 1 P x w , w N such that we have the following:
d ( x w , x w + 1 ) = d ( P ( x w 1 ) , P ( x w ) ) g · d ( x w 1 , x w ) Υ d ( x w , x w + 1 ) 1 Υ d ( x w , x w + 1 ) Υ g · d ( x w 1 , x w ) Υ d ( x w , x w + 1 ) g 1 Υ · d ( x w 1 , x w ) g 1 Υ · g 1 Υ · d ( x w 2 , x w 1 ) = g 1 Υ 2 · d ( x w 2 , x w 1 ) d ( x w , x w + 1 ) g 1 Υ w · d ( x 0 , x 1 ) .
Letting w , we obtain lim w d ( x w , x w + 1 ) = 0 .
Next, we show that { x w } w = 0 is a Cauchy sequence in ( X , d ) . More Precisely, for r > w , we obtain the following:
d ( x w , x w + r ) = d ( x w , x w + 1 ) + d ( x w + 1 , x w + 2 ) + + d ( x w + r 1 , x w + r ) ( g 1 Υ w + g 1 Υ w + 1 + + g 1 Υ w + r 1 ) · d ( x 0 , x 1 ) ( g 1 Υ w + g 1 Υ w + 1 + ) · d ( x 0 , x 1 ) = g 1 Υ w 1 g 1 Υ · d ( x 0 , x 1 ) 0 as w .
This implies that { x w } is a Cauchy sequence and due to the completeness of X , we can find x * X such that x w x * as w .
Next, we show that x * F i x ( P ) . Using the definition of ( g , Υ ) –IKC, we obtain the following:
h v ( x w + 1 , P ( x * ) ) = h v ( P ( x w ) , P ( x * ) ) g · d ( x w , P ( x w ) ) Υ d ( x * , P ( x * ) ) 1 Υ .
Taking w , we obtain h v ( x * , P ( x * ) ) = 0 , which yields x * F i x ( P ) , and x * is an attractor of the IK –IMS. □
Iterated function systems (IFSs) and Hutchinson–Barnsley operators associated with IKCs are fundamental in generating fractals and self-similar structures. IFSs employ straightforward recursive transformations to generate intricate patterns, making them crucial in areas such as computer graphics, image compression, and the modeling of natural phenomena. IKC guarantees the existence of unique fractal attractors in these systems, making this combination essential for comprehending geometric structures and their applications across diverse scientific and engineering fields.
Example 2.
Let X = [ 0 , ) be a usual metric. We define two multi-valued mappings, i.e.,
T ( 1 ) ( η ) = { 0 } , if η [ 0 , 2 ) { η 6 , η + 2 } , if η 2 .
and
T ( 2 ) ( η ) = { 0 } , if η [ 0 , 3 ) { η 9 , η + 3 } , if η 3 .
Then both mappings are multi-valued interpolative Kannan mappings with contraction pairs ( 1 4 , 1 3 ) and ( 1 2 , 1 4 ) , respectively. Then the corresponding ( 1 4 , 1 4 ) –IKC–Hutchinson-like operator is defined by the following:
P ( z ) = T ( 1 ) ( z ) T ( 2 ) ( z ) , z X .
The attractor of the IKC–Hutchinson operator is the set { 0 } .
In conclusion, using the previous discussions and findings, we establish the well-known Collage Theorem in the context of iterated function systems involving interpolative Kannan contractions. If we have an IK –IFS, we know how to derive its corresponding attractor. But what about the reverse process? If we select a preferred compact fractal set, can we identify an IK –IFS whose attractor approximates our chosen set? The answer is yes, and is stated as follows:
Theorem 10.
Let ( X , d ) be a complete metric space, ( X , T ( w ) , w = 1 , 2 , , p ) a ( g w , Υ w ) - IK –IFS and P be the corresponding ( g , Υ ) –IKC transformation with attractor U * Q ( X ) . If Z Q ( X ) and ϵ 0 are given, we have the following:
h v ( Z , w = 1 p T ( w ) ( Z ) ) ϵ
then
h v ( U * , Z ) ϵ 1 g 1 Υ .
Or equivalently,
h v ( U * , Z ) 1 1 g 1 Υ · h v ( Z , w = 1 p T ( w ) ( Z ) ) .
Proof. 
By using the triangular inequality, Theorem (7) and inequality (13), we obtain the following:
h v ( U * , Z ) = h v ( Z , U * ) h v ( Z , P ( Z ) ) + h v ( P ( Z ) , P 2 ( Z ) ) + h v ( P 2 ( Z ) , P 3 ( Z ) ) + h v ( Z , P ( Z ) ) + g 1 Υ h v ( Z , P ( Z ) ) + g 1 Υ 2 h v ( Z , P ( Z ) ) + = ( 1 + g 1 Υ + g 1 Υ 2 + ) · h v ( Z , P ( Z ) ) = 1 1 g 1 Υ · h v ( Z , P ( Z ) ) = 1 1 g 1 Υ · h v ( Z , w = 1 p T ( w ) ( Z ) ) ,
or equivalently,
h v ( U * , Z ) ϵ 1 g 1 Υ .

3. Well-Posedness of the IKC–Hutchinson Problem

Let ( X , d ) be a metric space and P : Q ( X ) Q ( X ) be an IKC–Hutchinson operator associated with IKC-IFS ( X ; T ( w ) , w = 1 , 2 , , p ) . Then the IKC-IFS problem is said to be well-posed if we have the following:
  • F i x ( P ) = { U * } ;
  • For a sequence U w + 1 = P ( U w ) , for w N and h v ( U w , P ( U w ) ) 0 as w implies h v ( U w , U * ) 0 as w .
Theorem 11.
The IKC–Hutchinson problem associated with IKC-IFS ( X ; T ( w ) , w = 1 , 2 , , p ) is well-posed.
Proof. 
Since P is a ( g , Υ ) –IKC–Hutchinson operator, by Theorem 7, we obtain F i x ( P ) = { U * } . For the sequence defined by U w + 1 = P ( U w ) , for w N ,
h v ( U w , P ( U w ) ) 0 as w .
Then, we obtain the following:
h v ( U w , U * ) h v ( U w , P ( U w ) ) + h v ( P ( U w ) , U * ) = h v ( U w , P ( U w ) ) + h v ( P ( U w ) , P ( U * ) ) h v ( U w , P ( U w ) ) + g · h v ( U w , P ( U w ) ) Υ h v ( U * , P ( U * ) ) 1 Υ = h v ( U w , P ( U w ) ) + g · h v ( U w , P ( U w ) ) Υ h v ( U * , U * ) 1 Υ h v ( U w , U * ) h v ( U w , P ( U w ) ) 0 as w .
Hence, the IKC-IFS-Hutchinson problem is well-posed. □

4. Conclusions and Future Goals

This paper introduced interpolative Kannan contractions (IKCs), expanding the traditional Kannan mappings to create a more flexible framework for both single and multi-valued mappings. We developed the IKC-iterated function system (IKC-IFS) and established both the Collage Theorem and the well-posedness of IKC-IFS. We also discussed the IKC-iterated multi-function system (IKC-IMS). These advancements enhance the generation and analysis of fractals by allowing complex geometric structures under less restrictive conditions. The flexibility of IKCs paves the way for broader applications in fractal geometry and beyond. To demonstrate the validity of our findings, we provided an example and created fractals and attractors of the IMS using IKCs. This practical application underscores the effectiveness of our theoretical developments.
Future goals include exploring enriched interpolative Kannan operators and investigating fractals generated by these contractions for k -fold average nonexpansive mappings. Additionally, it would be interesting to work under the assumptions of cyclic interpolative contractions. This line of research promises to deepen our understanding and broaden the applicability of IKCs in the study of fractal structures.

Author Contributions

Conceptualization, X.S., U.I., M.D. and M.A.; methodology, X.S., U.I., M.D. and M.A.; software, X.S., U.I., M.D. and M.A.; validation, X.S., U.I., M.D. and M.A.; formal analysis, X.S., U.I., M.D. and M.A.; investigation, X.S., U.I., M.D. and M.A.; resources, X.S., U.I., M.D. and M.A.; data curation, X.S., U.I., M.D. and M.A.; writing—original draft preparation, X.S., U.I., M.D. and M.A.; writing—review and editing, X.S., U.I., M.D. and M.A.; visualization, X.S., U.I., M.D. and M.A.; supervision, X.S., U.I., M.D. and M.A.; project administration, X.S., U.I., M.D. and M.A.; funding acquisition, X.S., U.I., M.D. and M.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data will be available upon demand from the corresponding author.

Acknowledgments

The authors are thankful to the Deanship of Scientific Research, Islamic University of Madinah for providing the support under the Post Publication Program III.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Hutchinson, J.E. Fractals and self similarity. Indiana Univ. Math. J. 1981, 30, 713–747. [Google Scholar] [CrossRef]
  2. Barnsley, M. Fractals Everywhere; Academic Press: Boston, MA, USA, 1988. [Google Scholar]
  3. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundam. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  4. Nadler, S.B., Jr. Multi-valued contraction mappings. Pac. J. Math. 1969, 30, 475–488. [Google Scholar] [CrossRef]
  5. Barnsley, M.F.; Demko, S. Iterated function systems and the global construction of fractals. Proc. R. Soc. Lond. A Math. Phys. Sci. 1985, 399, 243–275. [Google Scholar]
  6. Marchi, M.V. Self-similarity in spaces of homogeneous type. Adv. Math. Sci. Appl. 1999, 9, 851–870. [Google Scholar]
  7. Wicks, K.R. Fractals and Hyperspaces (Lecture Notes in Mathematics); Springer: New York, NY, USA, 1991. [Google Scholar]
  8. Duvall, P.F.; Emert, J.W.; Husch, L.S. Iterated Function Systems, Compact Semigroups, and Topological Contractions. Lecture Notes in Pure and Applied Mathematics. 1993, p. 113. Available online: https://www.routledge.com/Continuum-Theory--Dynamical-Systems/West/p/book/9780824790721?srsltid=AfmBOorrv7-bL9zuXOk47nfadh1g2atd7rzMP19ZhJpT2mx5A-1AmtFW (accessed on 24 June 2024).
  9. Block, L.; Keesling, J. Iterated function systems and the code space. Topol. Its Appl. 2002, 122, 65–75. [Google Scholar] [CrossRef]
  10. Kieninger, B. Iterated Function Systems on Compact Hausdorff Spaces; Shaker: Düren, Germany, 2002. [Google Scholar]
  11. Fiser, J. Iterated Function and Multifunction Systems; Attractors and Their Basins of Attraction. Ph.D. Thesis, Palacksy University, Olomouc, Czech, 2002. [Google Scholar]
  12. Andres, J.; Fišer, J. Metric and topological multivalued fractals. Int. J. Bifurc. Chaos 2004, 14, 1277–1289. [Google Scholar] [CrossRef]
  13. Kashyap, S.K.; Sharma, B.K.; Banerjee, A.; Shrivastava, S.C. On Krasnoselskii fixed point theorem and fractal. Chaos Solitons Fractals 2014, 61, 44–45. [Google Scholar] [CrossRef]
  14. Mandelbrot, B.B. The Fractal Geometry of Nature; WH Freeman: New York, NY, USA, 1982; Volume 1, pp. 25–74. [Google Scholar]
  15. Georgescu, F. Iterated function systems consisting of generalized convex contractions in the framework of complete strong b-metric spaces. Ann. West Univ. Timis.-Math. Comput. Sci. 2017, 55, 119–142. [Google Scholar] [CrossRef]
  16. Gwóźdź-Lukawska, G.; Jachymski, J. The Hutchinson-Barnsley theory for infinite iterated function systems. Bull. Aust. Math. Soc. 2005, 72, 441–454. [Google Scholar] [CrossRef]
  17. Ioana, L.; Mihail, A. Iterated function systems consisting of ϕ -contractions. Results Math. 2017, 72, 2203–2225. [Google Scholar] [CrossRef]
  18. Klimek, M.; Kosek, M. Generalized iterated function systems, multifunctions and Cantor sets. In Annales Polonici Mathematici; Instytut Matematyczny Polskiej Akademi Nauk: Warsaw, Poland, 2009; Volume 1, pp. 25–41. [Google Scholar]
  19. Maślanka, Ł. On a typical compact set as the attractor of generalized iterated function systems of infinite order. J. Math. Anal. Appl. 2020, 484, 123740. [Google Scholar] [CrossRef]
  20. Maślanka, Ł; Strobin, F. On generalized iterated function systems defined on l-sum of a metric space. J. Math. Anal. Appl. 2018, 461, 1795–1832. [Google Scholar] [CrossRef]
  21. Dumitru, D. Generalized iterated function systems containing Meir-Keeler functions. An. Univ. Bucur. Math 2009, 58, 3–15. [Google Scholar]
  22. Kunze, H.E.; La Torre, D.; Vrscay, E.R. Contractive multifunctions, fixed point inclusions and iterated multifunction systems. J. Math. Anal. Appl. 2007, 330, 159–173. [Google Scholar] [CrossRef]
  23. La Torre, D. Approximating by iterated function systems and iterated multifunction systems. Convegozo Metod. Mat. Stastici Per Assicur. Finanz. 2006, 12. Available online: https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=944015231e35c3388605a60fa2b7c18407247336 (accessed on 24 June 2024).
  24. Torre, D.L.; Mendivil, F.; Vrscay, E.R. Iterated function systems on multifunctions. In Math Everywhere: Deterministic and Stochastic Modelling in Biomedicine, Economics and Industry. Dedicated to the 60th Birthday of Vincenzo Capasso; Springer: Berlin/Heidelberg, Germany, 2007; pp. 125–138. [Google Scholar]
  25. Prithvi, B.V.; Katiyar, S.K. Comments on “Fractal set of generalized countable partial iterated function system with generalized contractions via partial Hausdorff metric”. Topol. Its Appl. 2024, 341, 108687. [Google Scholar] [CrossRef]
  26. Prithvi, B.V.; Katiyar, S.K. Revisiting fractal through nonconventional iterated function systems. Chaos Solitons Fractals 2023, 170, 113337. [Google Scholar] [CrossRef]
  27. Prithvi, B.V.; Katiyar, S.K. Generalized Kannan Maps with Application to Iterated Function System. In Advanced Mathematical Analysis and Its Applications; Chapman and Hall/CRC: Boca Raton, FL, USA, 2023; pp. 179–194. [Google Scholar]
  28. Verma, M.; Priyadarshi, A. New Type of Fractal Functions for the General Data Sets. Acta Appl. Math. 2023, 187, 12. [Google Scholar] [CrossRef]
  29. Bawalia, A.; Basotia, V.; Prajapati, A. Non-stationary Φ-contractions and associated fractals. J. Anal. 2023, 31, 1375–1391. [Google Scholar]
  30. Ahmad, J.; Al-Mazrooei, A.E.; Rassias, T.M. Fractals of generalized Θ-Hutchinson operator. Int. J. Nonlinear Anal. Appl. 2022, 13, 1–12. [Google Scholar]
  31. Anjum, R.; Din, M.; Zhou, M. Fractals of two types of enriched (q,θ)-Hutchinson–Barnsley operators. Chaos Solitons Fractals 2024, 181, 114589. [Google Scholar] [CrossRef]
  32. Sahu, D.R.; Chakraborty, A.; Dubey, R.P. K-iterated function system. Fractals 2010, 18, 139–144. [Google Scholar] [CrossRef]
  33. Thangaraj, C.; Easwaramoorthy, D.; Selmi, B.; Chamola, B.P. Generation of fractals via iterated function system of Kannan contractions in controlled metric space. Math. Comput. Simul. 2024, 222, 188–198. [Google Scholar] [CrossRef]
  34. Chandra, S.; Verma, S.; Abbas, S. Construction of fractal functions using Kannan mappings and smoothness analysis. arXiv 2023, arXiv:2301.03075. [Google Scholar]
  35. Glasserman, P. Monte Carlo Methods in Financial Engineering; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2004. [Google Scholar]
  36. Stallings, W. Cryptography and Network Security: Principles and Practice; Pearson: Upper Saddle River, NJ, USA, 2016. [Google Scholar]
  37. Kannan, R. Some results on fixed points—II. Am. Math. Mon. 1969, 76, 405–408. [Google Scholar]
  38. Karapinar, E. Revisiting the Kannan type contractions via interpolation. Adv. Theory Nonlinear Anal. Its Appl. 2018, 2, 85–87. [Google Scholar] [CrossRef]
  39. Jiddah, J.A.; Shagari, M.S.; Imam, A.T. Fixed Point Results of Interpolative Kannan-Type Contraction in Generalized Metric Space. Int. J. Appl. Comput. Math. 2023, 9, 123. [Google Scholar] [CrossRef]
  40. Gaba, Y.U.; Karapınar, E. A new approach to the interpolative contractions. Axioms 2019, 8, 110. [Google Scholar] [CrossRef]
  41. Karapınar, E.; Alqahtani, O.; Aydi, H. On interpolative Hardy-Rogers type contractions. Symmetry 2018, 11, 8. [Google Scholar] [CrossRef]
  42. Karapınar, E. Interpolative Kannan-Meir-Keeler type contraction. Adv. Theory Nonlinear Anal. Its Appl. 2021, 5, 611–614. [Google Scholar]
Figure 1. Sierpinski gasket.
Figure 1. Sierpinski gasket.
Fractalfract 08 00493 g001
Figure 2. Dragon Curve fractal.
Figure 2. Dragon Curve fractal.
Fractalfract 08 00493 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Shi, X.; Ishtiaq, U.; Din, M.; Akram, M. Fractals of Interpolative Kannan Mappings. Fractal Fract. 2024, 8, 493. https://doi.org/10.3390/fractalfract8080493

AMA Style

Shi X, Ishtiaq U, Din M, Akram M. Fractals of Interpolative Kannan Mappings. Fractal and Fractional. 2024; 8(8):493. https://doi.org/10.3390/fractalfract8080493

Chicago/Turabian Style

Shi, Xiangting, Umar Ishtiaq, Muhammad Din, and Mohammad Akram. 2024. "Fractals of Interpolative Kannan Mappings" Fractal and Fractional 8, no. 8: 493. https://doi.org/10.3390/fractalfract8080493

APA Style

Shi, X., Ishtiaq, U., Din, M., & Akram, M. (2024). Fractals of Interpolative Kannan Mappings. Fractal and Fractional, 8(8), 493. https://doi.org/10.3390/fractalfract8080493

Article Metrics

Back to TopTop