Scinovex

Research article · 2018 · Full text

International Journal of Statistics and Applied Mathematics

Common fixed point theorem in digital spaces using contraction mappings

Rashmi Rani

Volume 3(4) · Pages 140–142

Research areasDigital Image Processing TechniquesFixed Point Theorems Analysis

↓ Read full-text PDF3 citations

Abstract

Author-written

In this paper, we prove common fixed point theorem in digital metric spaces using contraction mappings. We also give example to prove validity of proved results.

Summary

Source-checked

Plain-language reading of the full paper, prepared with AI and checked against the text. Each point links to the authors' own words.

  1. Why it matters

    • Digital topology is an evolving field that applies general topology and functional analysis to study the characteristics of 2D and 3D digital images. View evidence ↗

      Why it matters

      Digital topology is an evolving field that applies general topology and functional analysis to study the characteristics of 2D and 3D digital images.

      In the paper's own words

      “Digital topology is a developing area based on general topology and functional analysis which studies features of 2D and 3D digital images.”

      Page 1

      Found in: Introduction

      Read it in the full textOpen PDF at page 1 ↗
    • Previous research by Ege and Karaca has established several fixed point theorems specifically within digital metric spaces. View evidence ↗

      Why it matters

      Previous research by Ege and Karaca has established several fixed point theorems specifically within digital metric spaces.

      In the paper's own words

      “Ege and Karaca [5, 8] give various fixed point theorems in digital metric spaces.”

      Page 1

      Found in: Introduction

      Read it in the full textOpen PDF at page 1 ↗
  2. The question

    • The objective of this paper is to prove a common fixed point theorem in digital metric spaces by utilizing contraction mappings. View evidence ↗

      The question

      The objective of this paper is to prove a common fixed point theorem in digital metric spaces by utilizing contraction mappings.

      In the paper's own words

      “In this paper, we prove common fixed point theorem in digital metric spaces using contraction mappings.”

      Page 1

      Found in: Introduction

      Read it in the full textOpen PDF at page 1 ↗
  3. What they did

    • The study utilizes a digital metric space (X, d, k) where the distance 'd' is defined as the standard Euclidean metric for ℤⁿ. View evidence ↗

      What they did

      The study utilizes a digital metric space (X, d, k) where the distance 'd' is defined as the standard Euclidean metric for ℤⁿ.

      In the paper's own words

      “Let (X, d, 𝑘) denote the digital metric space with 𝑘 -adjacency where d is usual Euclidean metric for ℤ 𝑛.”

      Page 2

      Found in: Preliminaries

      Read it in the full textOpen PDF at page 2 ↗
    • The proofs assume a complete digital metric space, meaning every Cauchy sequence within the space converges to a point inside that space. View evidence ↗

      What they did

      The proofs assume a complete digital metric space, meaning every Cauchy sequence within the space converges to a point inside that space.

      In the paper's own words

      “A digital metric space (X, d, 𝑘) is a complete digital metric space if any Cauchy sequence {𝑥𝑛} of points of (X, d, 𝑘) converges to a point a of (X, d, 𝑘).”

      Page 2

      Found in: Preliminaries

      Read it in the full textOpen PDF at page 2 ↗
    • The research considers commuting mappings, defined as two functions f and g where the order of application does not change the result (fgx = gfx). View evidence ↗

      What they did

      The research considers commuting mappings, defined as two functions f and g where the order of application does not change the result (fgx = gfx).

      In the paper's own words

      “Two mappings f and g are said to be commuting maps if fgx = gfx for all x ∈X.”

      Page 2

      Found in: Preliminaries

      Read it in the full textOpen PDF at page 2 ↗
    • The main theorem requires that f(X) is a subset of g(X), g is continuous, and the distance between f(x) and f(y) is bounded by a factor q (where 0 < q < 1) times the distance between g(x) and g(y). View evidence ↗

      What they did

      The main theorem requires that f(X) is a subset of g(X), g is continuous, and the distance between f(x) and f(y) is bounded by a factor q (where 0 < q < 1) times the distance between g(x) and g(y).

      In the paper's own words

      “Theorem 3.1. Let (X, d, 𝑘) be a complete digital metric space... and let f and g be self-mappings on X satisfying the following conditions: (3.1) f(X) ⊆ g(X); (3.2) g is continuous; (3.3) d(fx, fy) ≤ q d(gx, gy), for every x y ∈X and 0 < q < 1.”

      Page 2

      Found in: Main Results

      Read it in the full textOpen PDF at page 2 ↗
  4. What they found

    • The authors prove that if the specified conditions are met and the mappings f and g commute, they possess a single, unique common fixed point in X. View evidence ↗

      What they found

      The authors prove that if the specified conditions are met and the mappings f and g commute, they possess a single, unique common fixed point in X.

      In the paper's own words

      “Then f and g have a unique common fixed point in X provided f and g commute.”

      Page 2

      Found in: Main Results

      Read it in the full textOpen PDF at page 2 ↗
    • The uniqueness of the common fixed point is established by showing that the assumption of two distinct fixed points leads to a mathematical contradiction. View evidence ↗

      What they found

      The uniqueness of the common fixed point is established by showing that the assumption of two distinct fixed points leads to a mathematical contradiction.

      In the paper's own words

      “d(z, 𝑧1) = d(fz, f𝑧1) ≤ q d(gz, g𝑧1) = q d(z, 𝑧1) < d(z, 𝑧1), a contradiction, therefore z = 𝑧1.”

      Page 2

      Found in: Uniqueness.

      Read it in the full textOpen PDF at page 2 ↗
    • The theorem is validated with an example using mappings f(x) = 2 - x² and g(x) = x², which results in a unique common fixed point at x = 1. View evidence ↗

      What they found

      The theorem is validated with an example using mappings f(x) = 2 - x² and g(x) = x², which results in a unique common fixed point at x = 1.

      In the paper's own words

      “Example 3.1: Let us consider the digital metric space (X, d, 𝑘), with the standard digital metric d. Consider the self mapping f, g:→𝑋 given by, f𝑥 =2−𝑥2 and g𝑥 =𝑥2. Clearly f and g satisfy all the hypotheses of the Theorem 3.1 and hence have a unique common fixed point x =1.”

      Page 3

      Found in: Main Results

      Read it in the full textOpen PDF at page 3 ↗
  5. What it means

    • The authors conclude that they have successfully proven a common fixed point theorem for digital metric spaces using contraction mappings and demonstrated its validity through an example. View evidence ↗

      What it means

      The authors conclude that they have successfully proven a common fixed point theorem for digital metric spaces using contraction mappings and demonstrated its validity through an example.

      In the paper's own words

      “In this paper, we prove common fixed point theorem in digital metric spaces using contraction mappings. We also give example to prove validity of proved results.”

      Page 1

      Found in: Introduction

      Read it in the full textOpen PDF at page 1 ↗

Visual summary

1 visuals

Illustrations explain the paper; they do not show study data.

AI-generated illustration
AI-generated conceptual illustration (A digital space represented as a 3D grid of discrete points). It explains the idea and does not show study data.↗ Enlarge
Common Fixed Point Concept
AI-generated conceptual illustration (A digital space represented as a 3D grid of discrete points). It explains the idea and does not show study data.

AI-generated conceptual illustration (A digital space represented as a 3D grid of discrete points). It explains the idea and does not show study data.

Open full-size image ↗

Common Fixed Point Concept

AI-generated conceptual illustration (A digital space represented as a 3D grid of discrete points). It explains the idea and does not show study data.

View source evidence ↗
FULL TEXT Original article · reflowed for reading

Introduction

Digital topology is a developing area based on general topology and functional analysis which studies features of 2D and 3D digital images. Rosenfield [9] was the first to consider digital topology as the tool to study digital images. The digital versions of the topological concepts were given by Boxer [1] , who later studied digital continuous functions [2] . Later, he gave results of digital homology groups of 2D digital images in [3] and [4] . Ege and Karaca [5,8] give various fixed point theorems in digital metric spaces. In this paper, we prove common fixed point theorem in digital metric spaces using contraction mappings. We also give example to prove validity of proved results.

Preliminaries

Firstly, we give some definitions used in our paper: Definition 2.1: [5] Let 𝑙, n be positive integers, 1≤ 𝑙 ≤n and two distinct points p = (𝑝 1 , 𝑝 2 ,…𝑝 𝑛 ), q = (𝑞 1 , 𝑞 2 ,…𝑞 𝑛 ) ∈ ℤ 𝑛 , p and q are 𝑘 𝑙 -adjacent if there are at most 𝑙 indices i such that |𝑝 𝑖 -𝑞 𝑖 | = 1 and for all other indices j such that |𝑝 𝑗 -𝑞 𝑗 | ≠ 1, 𝑝 𝑗 = 𝑞 𝑗 . Definition 2.2: [5] Two points p and q in ℤ are 2-adjacent if |𝑝 -𝑞| = 1. Definition 2.3: [5] Two points p and q in ℤ 2 are 8-adjacent if they are distinct and differ by at most 1 in each coordinate. Definition 2.4: [5] For some digital image X⊂ℤ 𝑛 and p ∈ X, we define the digital 𝑘neighborhoods of p with some radius ϵ: 𝑁 𝑘 (p) = {x ∈ X: 𝑙 𝑘 (p, x) ≤ ϵ}∪{p}, Where 𝑙 𝑘 (p, x) is the length of a shortest simple curve from p to x, ϵ ∈ ℕ. Definition 2.5: [5] A digital image X ⊆ ℤ 𝑛 is 𝑘-connected if and only if for every pair of different point x, y ∈ X, there is a set {𝑥 0 , 𝑥 1 , … 𝑥 𝑟 } of points of digital image X such that x = 𝑥 0 , y = 𝑥 𝑟 and 𝑥 𝑖 and 𝑥 𝑖+1 are 𝑘neighbourhood where i = 0,1,2…r-1. Definition 2.6: [5] Let (X, 𝑘 0 ) ⊆ ℤ 𝑛 0 , (Y, 𝑘 1 ) ⊆ ℤ 𝑛 1 be digital images and f: X → Y be a function. i. If for every 𝑘 0 -connected subset U of X, f (U) is a 𝑘 1 -connected subset of Y, then f is said to be (𝑘 0 , 𝑘 1 )-continuous. ii. f is (𝑘 0 , 𝑘 1 )-continuous if and only if for every 𝑘 0 -adjacent points {𝑥 0 , 𝑥 1 } of X, either f(𝑥 0 ) = f(𝑥 1 ) or f(𝑥 0 ) and f(𝑥 1 ) are 𝑘 1 -adjacent in Y.

Definition 2.7. [5] A (2, 𝑘)-continuous function f: [0, m] ℤ → X such that f(0) = x and f(m) = y is called a digital 𝑘 -path from x to y in a digital image X.

Definition 2.8 [9] : Let (X, 𝑘) be a digital image and f: (X, 𝑘)→ (X, 𝑘) be any (𝑘, 𝑘)-continuous function. We say the digital image (X, 𝑘) has the fixed point property [10] if for every (𝑘, 𝑘)-continuous map f: X→ X there exists x ∈ X such that f (x) = x.

Definition 2.8 [9] : Let (X, d, 𝑘) denote the digital metric space with 𝑘 -adjacency where d is usual Euclidean metric for ℤ 𝑛 . A sequence {𝑥 𝑛 } of points of a digital metric space (X, d, 𝑘) is a Cauchy sequence if for all ϵ > 0, there exists α∈ℕ such that for all n, m > α, then d(𝑥 𝑛 , 𝑥 𝑚 ) < ϵ.

Definition 2.9 [5] : Let (X, d, 𝑘) denote the digital metric space with 𝑘 -adjacency where d is usual Euclidean metric for ℤ 𝑛 . A sequence {𝑥 𝑛 } of points of a digital metric space (X, d, 𝑘) converges to a limit a ∈ X if for all ϵ > 0, there exists α ∈ ℕ such that for all n > α, then d(𝑥 𝑛 , 𝑎) < ϵ.

Definition 2.10 [5] : Let (X, d, 𝑘) denote the digital metric space with 𝑘 -adjacency where d is usual Euclidean metric for ℤ 𝑛 . A digital metric space (X, d, 𝑘) is a complete digital metric space if any Cauchy sequence {𝑥 𝑛 } of points of (X, d, 𝑘) converges to a point a of (X, d, 𝑘).

Definition 2.11 [5] : Let (X, d, 𝑘) denote the digital metric space with 𝑘 -adjacency where d is usual Euclidean metric for ℤ 𝑛 . Let (X, 𝑘) be any digital image. A function f: (X, 𝑘)→(X, 𝑘) is called right-continuous if f (a) = lim 𝑥→𝑎 + 𝑓(𝑥)where a ∈ X.

Definition 2.12 [5] : Let (X, d, 𝑘) denote the digital metric space with 𝑘 -adjacency where d is usual Euclidean metric for ℤ 𝑛 . Let (X, d, 𝑘) be any digital metric space and f: (X, d, 𝑘)→ (X, d, 𝑘) be a self -digital map. If there exists β ∈ (0, 1) such that for all x, y ∈ X, d(f (x), f (y)) ≤ βd(x, y), then f is called a digital contraction map.

Theorem 2.1. [7] (Banach contraction principle) Let (X, d, 𝑘) be a complete digital metric space which has a usual Euclidean metric in ℤ 𝑛 . Let f: X→ X be a digital contraction map. Then f has a unique fixed point, i.e. there exists a unique c ∈ X such that f (c) = c. Definition 2.13: Two mappings f and g are said to be commuting maps if fgx = gfx for all x ∈X.

Main Results

Theorem 3.1. Let (X, d, 𝑘) be a complete digital metric space with 𝑘 -adjacency where d is usual Euclidean metric for ℤ 𝑛 and let f and g be self-mappings on X satisfying the following conditions: (3.1) f(X) ⊆ g(X); (3.2) g is continuous;

(3.3) d(fx, fy) ≤ q d(gx, gy), for every x y ∈X and 0 < q < 1.

Then f and g have a unique common fixed point in X provided f and g commute.

Proof. Let 𝑥 0 be an arbitrary point in X. By (3.1), one can choose a point 𝑥 1 in X such that f𝑥 0 = g𝑥 We now prove that z = fz. Again from (3.3), setting x = 𝑥 𝑛 , y = z, we have d(f𝑥 𝑛 , fz) ≤ q d(𝑔𝑥 𝑛 , gz). Taking limit as n → ∞, we have z = fz. Therefore, we have gz = fz = z. Thus z is a common fixed point of f and g.

Uniqueness.

We assume that 𝑧 1 (≠z) be another common fixed point of f and g. Then d(z, 𝑧 1 ) > 0 and d(z, 𝑧 1 ) = d(fz, f𝑧 1 ) ≤ q d(gz, g𝑧 1 ) = q d(z, 𝑧 1 ) < d(z, 𝑧 1 ), a contradiction, therefore z = 𝑧 1 . Hence uniqueness follows.

References

9 in the original paper
  1. Boxer L. Digitally Continuous Functions, Pattern Recognition Letters. 1994; 15:833-839.
  2. Boxer L. Properties of Digital Homotopy. J Math. Imaging Vis. 2005; 22:19-26.
  3. Boxer L. A Classical Constructions for The Digital Fundamental Group J Math. Imaging Vis. 1999; 10:51-62.
  4. Boxer L. Digital Products, Wedges and Covering Spaces. J Math. Imaging Vis. 2006; 25:159-171.
  5. Ege O, Karaca I. Fundamental Properties of Simplicial Homology Groups for Digital Images, American Journal of Computer Technology and Application. 2013; 1:25-42.
  6. Ege O, Karaca I. Lefschetz Fixed Point Theorem for Digital Images, Fixed Point Theory Appl, 2013, 13.
  7. Ege O, Karaca I. Applications of The Lefschetz Number to Digital Images, Bull. Belg. Math. Soc. Simon Stevin. 2014; 21:823-839.
  8. Ege O, Karaca I. Banach Fixed Point Theorem for Digital Images. J Nonlinear Sci. Appl. 2015; 8:237-245.
  9. Rosenfeld. Digital topology, Amer. Math. Monthly. 1979; 86:76-87.

Cited by 3

From OpenAlex, OpenCitations and reference lists read by Scinovex

  • COMMON FIXED POINT THEOREM FOR WEAKLY COMPATIBLE MAPPINGS IN DIGITAL METRIC SPACE ↗

    A. S. Saluja, Jyoti Jhade · INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH · 2023

    In this paper, a common fixed point theorem for a pair of weakly compatible mappings in the setting of digital metric space is proved with a supportive example. Our result extends and improves the result of Ozgur Ege et al. [2].

    ❝ 2PDF
  • DASS AND GUPTA’S FIXED-POINT THEOREM IN DIGITAL METRIC SPACE ↗

    A. S. Saluja, Jyoti Jhade · INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH · 2023

    This paper aims to define Dass and Gupta's contraction in the context of digital metric space and to establish a fixed point theorem for it. An example is also given in support of our proven result. Our findings widen and deepen a number of previously established findings in the literature.

    ❝ 2PDF
  • Weakly Commutative Mappings and Common Fixed-Point Theorem in Digital Metric Space ↗

    A. S. Saluja · International Journal of Science and Research (IJSR) · 2023

    In this paper, a common fixed point theorem for a pair of weakly commutative mappings in the setting of digital metric space is proved that satisfy a contractive condition in this space.Our result broaden and extend many prevailing known results in the literature.

    ❝ 1PDF