Construction and Box-counting Dimension of the Edelstein Hidden Variable Fractal Interpolation Function


Abstract

This paper presents the construction of a hidden variable fractal interpolation function using Edelstein contractions in an iterated function system based on a finite collection of data points. The approach incorporates an iterated function system where variable functions act as vertical scaling factors leading to a generalised vector-valued fractal interpolation function. Furthermore, the paper rigorously examines the smoothness of the constructed function and establishes an upper bound for the box-counting dimension of its graph.

Iterated Function Systems ,Edelstein Contraction ,Fractal Interpolation Function ,Attractor ,Box Dimension

1 Introduction↩︎

The fractal interpolation method is a relatively new approach in approximation theory offering significant advantages for modelling datasets. Unlike traditional interpolation methods, fractal interpolation generates approximating functions that inherently capture nonlinearity and self-similarity.

Barnsley developed the notion of Fractal Interpolation Function(FIF) [1] based on the idea of a function whose graph coincides with the attractor of an Iterated Function System(IFS) of Banach contractions. Subsequent studies have expanded the idea of FIFs. These advancements led to the development of generalised FIFs, further enhancing the flexibility and applicability of the method across complex datasets. This includes the extension to multivariate cases [2], [3], and the development of Super FIFs[4]. Another extension of FIFs incorporated generalised contractions such as Rakotch and Matkowski contractions[5],[6] within the iterated function systems to construct nonlinear FIFs. The most generalised construction form to date is the construction of a nonlinear FIF with Edelstein contractions in the underlying iterated function system[7]. A related development is the construction of histopolating fractal functions, which adapt the fractal approach to approximate histogram-type data instead of pointwise interpolation [8].

In parallel, the Hidden Variable Fractal Interpolation Function(HVFIF) was introduced as a function whose graph represents the projection of the attractor in a subspace of a particular IFS[9]. This construction offered greater flexibility for the fractal functions. This led to the construction of functions such as coalescence hidden variable FIFs[10], hidden variable recurrent FIFs[11] and hidden variable FIFs based on iterated function systems consisting of Rakotch contractions[12]. Various properties of such functions - including dimension[9], smoothness [13],[14], stability[15],[16],and monotonicity properties[17] - were studied. The construction of parametrized \(\mathcal{A}-\) fractal functions based on HVFIF and approximation properties are also discussed in [18].

The article is divided into the following sections: Section 2 presents the definitions of some generalised contractions and fixed point theorems related to these contractions. This section includes the definition of an iterated function system and some results regarding iterated function systems with generalised contractions. Section 3 discusses the construction of the Edelstein hidden variable fractal interpolation function and includes examples to demonstrate the process. Section 4 examines the smoothness of the constructed function. Section 5 provides an upper bound for the box-counting dimension.

2 Preliminaries↩︎

In this section, definitions of some generalised contractions are presented, along with fixed-point theorems concerning these contractions. Furthermore, a few results related to iterated function systems consisting of generalised contractions are also discussed.

Let \((X,\mu)\) be a metric space. The Banach contraction is one of the most commonly discussed contractions.

Definition 1. [19] Let \(h\) be a function on \(X\). Suppose there is a \(k\in[0,1)\) such that \[\nonumber \mu(h(x),h(y))\leq k\mu(x,y), \forall \;x,y\in X.\] Then \(h\) is a Banach contraction.

The fixed point theorem for Banach contractions is considered a fundamental result in functional analysis.

Proposition 1. [20] If \(g\) is a Banach contraction on a complete metric space \(X\), then there exists a unique fixed point for \(g\) in \(X\).

Numerous classes of contractions extend the concept of Banach contractions and the Banach fixed-point theorem. One such class is the Edelstein contractions.

Definition 2. [21] If a function \(g\) on \(X\) satisfies \[\mu(g(x),g(y))<\mu(x,y),~\forall \; x,y\in X,\text{ with }x\neq y,\] then \(g\) is an Edelstein contraction.

It is established that a fixed point exists for an Edelstein contraction within the framework of a compact metric space.

Proposition 2. [22] Every Edelstein contraction \(g\) on a compact metric space \(X\) has a unique point \(x'\in X\) such that \(g(x')=x'\).

The construction of any FIF relies on an iterated function system and its attractor.

Definition 3. [19] An iterated function system, \(\mathcal{I}\), is a complete metric space \(X\) with a finite number of contraction maps, \(f_1, f_2,\ldots,f_N,\) defined on \(X\) and is represented as \(\mathcal{I}=\left\{X;f_j,j=1,2,\ldots,N\right\}\).

Let \(\mathcal{H}(X)\) denote the set of all non-empty compact subsets of the metric space \(X\).

Definition 4. [19] A set \(A\in \mathcal{H}(X)\) is an attractor for IFS  \(\mathcal{I}\) if it is the unique set in \(\mathcal{H}(X)\) satisfying \[A=\bigcup_{j=1}^N f_j(A).\]

Proposition 3. [7] Let \((X,\mu)\) be a compact metric space and \(\mathcal{I}\) be an IFS with Edelstein contractions. Then, \(\mathcal{I}\) possess an attractor.

Box-counting dimension is one of the most widely used dimensions.

Definition 5. [23] Let \(F\) be a bounded subset of \(\mathbb{R}^n\) and \(N_{\epsilon}\) be the number of \(\;epsilon\)-mesh squares that intersect \(F\). Then, the upper box-counting dimension of \(F\) is defined as \[\overline{dim}_B(F)=\overline{\lim\limits_{\epsilon\rightarrow 0}}\frac{log N_\epsilon}{-log \epsilon}.\]

3 Construction of Edelstein Hidden Variable Fractal Interpolation Function↩︎

The hidden variable fractal interpolation function based on Edelstein contractions is constructed in this section.Let \(V= \left\{(t_j,v_j)\in I\times \mathbb{R} : j=0,1,\ldots N \right\}\) be the given data set where  \(t_0<t_1<\ldots <t_N\). The generalised data set corresponding to \(V\) is \[V^*=\left\{(t_j,v_j,w_j)\in I\times \mathbb{R}^2 : j=0,1,\ldots N \right\},\] Denote \([t_0,t_N]\) by \(I\) and \([t_{j-1}, t_j]\) as \(I_j\) for all \(j=1,2,\ldots N\). Let \(L_j:I\rightarrow I_j\) be contractive homeomorphisms given by \(L_j(t)=a_jt+f_j\) such that \(L_j(t_0)=t_{j-1}\) and \(L_j(t_N)=t_j\) for all \(j\in \left\{1,2,\ldots, N\right\}\). For any real valued function \(g\), denote \(\|g\|_{\infty}=\sup\limits_t|g(t)|\) and \(l_g\) be the Lipschitz constant for a Lipschitz function \(g\). Let \(b_j,c_j,d_j\) and \(e_j\) be real valued Lipschitz functions on \(I\) such that \[\|b_j\|_{\infty}+\|d_j\|_{\infty}\leq 1 \text{ and } \|c_j\|_{\infty}+\|e_j\|_{\infty}\leq 1\;\forall \;j\in\left\{1,2,\ldots N\right\}.\] Let \(s_j\) and \(r_j\) be functions on \(\mathbb{R}\) such that they are Edelstein contractions. Further, define \(F_j:I\times \mathbb{R}^2 \rightarrow \mathbb{R}^2\) as \[F_j(t,v,w)=D_j(t)S_j(v,w)+Q_j(t) \label{fidefn}\tag{1}\] where, \[D_j(t)= \begin{bmatrix} b_j(t) & c_j(t)\\ d_j(t) & e_j(t) \end{bmatrix}, \quad S_j(v,w)= \begin{bmatrix} s_j(v) \\ r_j(w) \end{bmatrix}, \;\text{ and } Q_j(t)= \begin{bmatrix} p_j(t) \\ q_j(t) \end{bmatrix}~\text{ for }~j=1,\ldots N.\] Here, \(p_j(t)\) and \(q_j(t)\) are real-valued Lipschitz functions defined on \(I\) such that \[F_j(t_0,v_0,w_0)=(v_{j-1},w_{j-1}) \text{ and } F_j(t_N,v_N,w_N)=(v_{j},w_{j})~\text{ for }~j=1,2,\ldots ,N.\] \(F_j\) are Edelstein contractions with respect to the Manhattan metric in the second and third variables.Let \(K\subset \mathbb{R}^2\) be the compact set containing \(\left\{(v_j,w_j)\;:\;j=0,1,\ldots N\right\}\) such that \(F_j(t,v,w)\in K\) for all \((t,v,w)\in I\times K\). Define the IFS \(\mathcal{I}=\left\{I\times K, g_j, j=1,\ldots N\right\}\) where, \[g_j(t,v,w)=(L_j(t),F_j(t,v,w))~\text{ for all }~(t,v,w)\in I\times K~and \;j=1,2,\ldots, N.\label{defw95i}\tag{2}\] Consider the space of \(\mathbb{R}^2\) valued functions on \(I\), \(\mathcal{C}(I)\) equipped with the metric \(d_C\) induced by the Manhattan metric.Let \(C_e(I)=\{h\in C(I):h(t_0)~=~(v_0,w_0),~ h(t_N)~=~(v_N,w_N) \}\) and \(C_d(I)=\{ h\in C_e(I)~:~h(t_j)~=~(v_j,w_j) ,\\ j =1,2,\ldots N-1 \}\). Then \(C(I)\), \(C_e(I)\) and \(C_d(I)\) are complete metric spaces with respect to the metric \(d_C\). Define the Read-Bajraktrević (R.B.) operator \(\mathcal{R} : C(I)\rightarrow C(I)\) as \[\mathcal{R}h(t)=F_j(L_j^{-1}(t),h(L_j^{-1}(t)))~\text{ for }~t\in I_j~\text{ and }~j=1,2,\ldots, N. \label{RBdefn}\tag{3}\]

Theorem 1. Let \(h\) be a function in \(C_e(I)\). Then \(\mathcal{R}h\) belong to \(C_d(I)\). Moreover, \(\mathcal{R}\) has a fixed point \(f\) in \(C_d(I)\).

Theorem 2. The maps \(g_j\) defined in Eq. 2 are Edelstein contractions with respect to the metric equivalend to the Euclidean metric. Moreover, the graph of the fixed point of the R.B. operator \(\mathcal{R}\) defined in Eq. 3 is the attractor of the IFS \(\mathcal{I}\).

Definition 6 (Edelstein Hidden Variable Fractal Interpolation Function). The first component of the vector-valued continuous function \(f\) denoted as \(f_1\) is the Edelstein hidden variable fractal interpolation function(EHVFIF) associated with the data set \(\left\{(t_j, v_j)\in \mathbb{R}^2: j=0,1,\ldots N \right\}\).

4 Smoothness of the Edelstein Hidden Variable Fractal Interpolation Function↩︎

Theorem 3. Consider the EHVFIF \(f_1:I\rightarrow\mathbb{R}\) as defined in the preceding section. For appropriate choices of entries in \(D_j,~\forall j=1,\ldots,N\) there exists positive real numbers \(K\) and \(\alpha\) such that \[|f_1(t)-f_1(t')|<K|t-t'|^{\alpha}\quad \forall \;t,t'\in I.\label{holderf951}\qquad{(1)}\]

5 Box Dimension of the Edelstein Hidden Variable Fractal Interpolation Function↩︎

Theorem 4. Consider the EHVFIF \(f_1: I \rightarrow \mathbb{R}\) as defined in Theorem 3. Let \(\alpha\) denote the same quantity as obtained in Theorem 3. Then \[\overline{dim}_B(G(f_1))\leq 2-\alpha.\]

References↩︎

[1]
M. F. Barnsley, “Fractal functions and interpolation,” Constructive approximation, vol. 2, pp. 303–329, 1986.
[2]
L. Dalla, “Bivariate fractal interpolation functions on grids,” Fractals, vol. 10, no. 1, pp. 53–58, 2002.
[3]
H. Xie and H. Sun, “The study on bivariate fractal interpolation functions and creation of fractal interpolated surfaces,” Fractals, vol. 5, no. 4, pp. 625–634, 1997.
[4]
Kapoor G.P. and Prasad S.A., “Super fractal interpolation functions,” International Journal of Nonlinear Science, vol. 19, no. 1, pp. 20–29, 2015.
[5]
S. Ri, “A new nonlinear fractal interpolation function,” Fractals, vol. 25, no. 6, p. 1750063, 2017.
[6]
S. Ri, “New types of fractal interpolation surfaces,” Chaos, Solitons & Fractals, vol. 119, pp. 291–297, 2019.
[7]
R. Pasupathi and R. Miculescu, “A very general framework for fractal interpolation functions,” Journal of Mathematical Analysis and Applications, vol. 534, no. 2, p. 128093, 2024.
[8]
M. F. Barnsley and P. Viswanathan, “Histopolating fractal functions,” Journal of Computational and Applied Mathematics, vol. 425, p. 115073, 2023.
[9]
M. F. Barnsley, J. Elton, D. Hardin, and P. Massopust, “Hidden variable fractal interpolation functions,” SIAM Journal on Mathematical Analysis, vol. 20, no. 5, pp. 1218–1242, 1989.
[10]
A. K. B. Chand and G. P. Kapoor, “Smoothness analysis of coalescence hidden variable fractal interpolation functions,” International Journal of Non-Linear Science, vol. 3, pp. 15–26, 2007.
[11]
C. Yun, “Hidden variable recurrent fractal interpolation functions with function contractivity factors,” Fractals, vol. 27, no. 7, p. 1950113, 2019.
[12]
J. Kim, H. Kim, and H. Mun, “Construction of nonlinear hidden variable fractal interpolation functions and their stability,” Fractals, vol. 27, no. 6, p. 1950103, 2019.
[13]
M. Ri and C. Yun, “Smoothness and fractional integral of hidden variable recurrent fractal interpolation function with function vertical scaling factors,” Fractals, vol. 29, no. 6, p. 2150136, 2021.
[14]
G. P. Kapoor and S. A. Prasad, “Smoothness of coalescence hidden-variable fractal interpolation surfaces,” International Journal of Bifurcation and Chaos, vol. 19, no. 7, pp. 2321–2333, 2009.
[15]
C. Yun and M. Ri, “Box-counting dimension and analytic properties of hidden variable fractal interpolation functions with function contractivity factors,” Chaos, Solitons & Fractals, vol. 134, p. 109700, 2020.
[16]
G. P. Kapoor and S. A. Prasad, “Stability of coalescence hidden variable fractal interpolation surfaces,” International Journal of Nonlinear Science, vol. 9, no. 3, pp. 265–275, 2010.
[17]
S. K. Katiyar, A. K. B. Chand, and M. A. Navascués, “Hidden variable a-fractal functions and their monotonicity aspects,” Rev. R. Acad. Cienc. Zaragoza, vol. 71, pp. 7–30, 2016.
[18]
A. K. Chand, S. K. Katiyar, and P. V. Viswanathan, “Approximation using hidden variable fractal interpolation function,” Journal of Fractal Geometry, vol. 2, no. 1, pp. 81–114, 2015.
[19]
M. F. Barnsley, Fractals everywhere. Academic press, 2014.
[20]
S. Banach, “Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales,” Fundamenta mathematicae, vol. 3, no. 1, pp. 133–181, 1922.
[21]
M. Edelstein, “On fixed and periodic points under contractive mappings,” Journal of the London Mathematical Society, vol. s1–37, no. 1, pp. 74–79, 1962, doi: https://doi.org/10.1112/jlms/s1-37.1.74.
[22]
V. Berinde, Iterative approximation of fixed points, vol. 1912. Springer.
[23]
K. Falconer, Fractal geometry: Mathematical foundations and applications. John Wiley & Sons, 2013.