Fixed Point Theory in Bi-Operational Metric Spaces with Independent Contraction Operations

Anwar Bataihah

Department of Mathematics, Faculty of Science, Jadara University, Irbid, Jordan
Email: a.bataihah@jadara.edu.jo; anwerbataihah@gmail.com

Received 08 July 2026; Accepted 22 August 2026

Abstract

The Banach contraction principle forms an integral part of nonlinear analysis and is of extensive applicability in fixed point theory and differential equations. Recently, operational metric spaces have been proposed, where in the triangle inequality, the additive structure was replaced by a binary operation ⊕. But in previous literature, the choice of the binary operation (⊕) is highly restricted (for example, either addition or max), with the implicit assumption of a zero element identity. In this paper, we introduce a completely novel concept of a bi-operational metric space with two unrelated binary operations, namely, ⊕, which controls the triangle inequality-type property, and ⊙, controlling the process of contraction. In case the conditions of monotonicity and continuity are satisfied in the usual sense, we prove a Banach-like fixed point theorem in the present context. The model does not involve any notion of scalar multiplication whatsoever. Further, we establish the general applicability of our method in proving that the classical metric space, multiplicative metric space, and ultrametric space are special cases. An example is illustrated on [2,3] with the operations a⊕b=(a−1)⁢(b−1)+1 and a⊙b=(a−1)ln⁡(b−1)+1, for which the inequality ℬ⁢(T⁢ξ,T⁢♭) ≤k⊙ℬ⁢(ξ,♭) leads to a unique fixed point.

Keywords: Fixed point, Banach contraction, operational metric, bi-operational metric..

1 Introduction

The contraction mapping theorem proposed by Stefan Banach in 1922 [3] indicates that a contraction self-map on a complete metric space possesses only one fixed point. Over time since it was established, this theorem has taken center stage in the study of nonlinear analysis and has been widely used in diverse fields like differential and integral equations. Starting from the classic result of Banach on the contraction principle [3], there have been many generalizations of the notion of metric spaces that aim to enlarge the applicability of fixed point theory. Among some of the examples are b-metric spaces [2, 11] that generalize the triangular inequality via multiplication by a positive constant and multiplicative metric spaces [10] where the sum is replaced by multiplication in the metric relation, and also ultrametric spaces [16] where the triangle inequality is strengthened to d⁢(ξ,♭)≤max⁡{d⁢(ξ,z),d⁢(z,♭)}.

It is worth describing the b-metric setting a little more precisely, since it is the closest classical antecedent of the idea of altering the triangle inequality itself. Bakhtin [2] and Czerwik [11] retain the additive form of the triangle inequality but weaken it by a fixed multiplicative constant s≥1,

d⁢(ξ,♭)≤s⁢[d⁢(ξ,z)+d⁢(z,♭)],ξ,♭,z∈𝒪.

The constant s measures how far the space is from being metric, s=1 returns the classical case, while larger values of s permit distance functions, such as d⁢(ξ,♭)=|ξ−♭|p with p>1, that violate the ordinary triangle inequality. What is significant for the present work is that the relaxation is still expressed in terms of ordinary addition and ordinary real multiplication; the algebraic operation governing the triangle inequality is never itself replaced. The same observation applies to cone metric spaces [14], where the scalar codomain [0,∞) is replaced by a cone in an ordered Banach space: the order becomes partial rather than total, but the operation governing the triangle inequality is still vector addition, with its identity 0. For a detailed account of how fixed point theory developed in the b-metric setting, and of the role played by the constant s, we refer to the survey of Berinde and Păcurar [15]. The framework of the present paper departs from this tradition by replacing the operation itself, and, more importantly, by decoupling the operation that governs the triangle inequality from the one that governs the contraction.

The study of generalized distance spaces has been gaining much importance recently. For example, the work of Jleli and Samet [4] presented an approach unifying different distance spaces such as metric and (b)-metric spaces and also providing some fixed point theorems related to these spaces. Further, the idea of generalized Ω-distance mappings was developed by Abodayeh et al. [5] with several fixed point theorems, which have been improved by Abu-Irwaq et al. [6]. Further advancements on generalized distance spaces have been made in [7, 8], and the idea of gamma-distance mappings and its applications has been studied in [9].

The interest in contraction-type principles is not confined to pure analysis. Iterative and recursive schemes are standard tools in reliability and stochastic modelling, and their solvability is often a fixed point statement in disguise. Etesam and Mohtashami Borzadaran [12] apply progressive-batching L-BFGS iterations, with and without momentum, to reliability optimization problems under uncertainty. Parmender et al. [13] analyse a repairable standby system by the regenerative point technique, which expresses reliability measures such as the mean time to system failure and the steady-state availability as solutions of Markov renewal equations of convolution type; that such equations admit exactly one solution is a classical application of the contraction principle on a complete space of functions. In both examples the argument is carried out in an ordinary metric setting. The present paper asks what survives of such arguments when the distance itself takes values in a set whose natural algebraic structure is not additive.

More recently, Adewale et al. [1] have introduced the notion of operational metric spaces by replacing the additive operator in the triangular inequality with a binary operation. Even though this construction provides an interesting algebraic point of view, the contraction conditions are very close to classical notions. We recall the definition of an operational metric space as introduced by Adewale et al. [1].

[1]Let 𝒪 be a nonempty set and let ⊕ be a binary operation on [e,∞) having identity element e. A mapping b:𝒪×𝒪→[e,∞) is called an operational metric if

(O⁢M⁢1)

b⁢(ξ,♭)≥e;

(O⁢M⁢2)

b⁢(ξ,♭)=e⇔ξ=♭;

(O⁢M⁢3)

b⁢(ξ,♭)=b⁢(♭,ξ);

(O⁢M⁢4)

b⁢(ξ,♭)≤b⁢(ξ,z)⊕b⁢(z,♭) for all ξ,♭,z∈𝒪.

The triple (𝒪,b,⊕) is called an operational metric space.

[1]If a⊕b=a+b, then one recovers the usual metric space with e=0. If a⊕b=max⁡{a,b}, one obtains an ultrametric-type structure.

The fundamental idea of Adewale et al. [1] is to replace the addition in the triangle inequality with a binary operation ⊕

b⁢(ξ,♭)≤b⁢(ξ,z)⊕b⁢(z,♭).

The contraction used in [1] is

b⁢(T⁢ξ,T⁢♭)≤k⋅b⁢(ξ,♭),0≤k<1.

Several fixed point theorems were established for specific choices of ⊕, particularly ⊕⁣=⁣+ and ⊕=max.

Limitations of the Adewale et al. Approach

We identify three fundamental limitations:

1. The Codomain Issue: The contraction b⁢(T⁢ξ,T⁢♭)≤k⋅b⁢(ξ,♭) with k<1 is only valid when e=0. If e>0 and ξ=♭, then b⁢(ξ,♭)=e, and we require k⋅e≥e, which implies k≥1, contradicting k<1.

2. The Scalar Multiplication Issue: The expression k⋅b⁢(ξ,♭) uses ordinary real multiplication, which is not part of the operational metric structure. The contraction mixes two different operations.

3. No Genuine Generalization: When ⊕⁣=⁣+, the theory reduces to Banach’s theorem. When ⊕=max, it reduces to ultrametric-type results. No genuine generalization for arbitrary ⊕ with e>0 is provided.

The following results clarify structural restrictions inherent in the framework proposed by Adewale et al.

The contraction b⁢(T⁢ξ,T⁢♭)≤k⋅b⁢(ξ,♭) with 0≤k<1 is valid only when e=0.

Proof. If e>0, take ξ=♭. Then b⁢(ξ,♭)=e, and the inequality gives:

b⁢(T⁢ξ,T⁢ξ)≤k⋅b⁢(ξ,ξ)=k⋅e.

But b⁢(T⁢ξ,T⁢ξ)=e by (OM2). Hence e≤k⋅e, which implies k≥1, contradicting k<1. Therefore e=0. ∎

For any operation ⊕ with identity e, the only element k∈[e,∞) satisfying k⊕a≤a for all a≥e is k=e.

Proof. Taking a=e, we have k⊕e≤e. Since e is the identity, k⊕e=k. Hence k≤e. But k∈[e,∞), so k≥e. Therefore k=e. ∎

Theorem 1.4 shows that the natural contraction k⊕b⁢(ξ,♭) cannot produce a Banach-type contraction. Based on the above ideas, we define a bi-operational metric space where the triangular inequality is controlled by one binary operation while another binary operation controls the contraction process. Moreover, we introduce a genuinely new framework using two binary operations:

1. ⊕ for the triangle inequality (with identity e),

2. ⊙ for the contraction (not necessarily requiring an identity).

We introduce the concept of a ⊙-contractive element and prove a Banach-type fixed point theorem that does not reduce to the classical case. We provide an explicit example demonstrating the power of our approach.

2 Bi-Operational Metric Spaces

We now introduce our new framework.

Let 𝒪 be a nonempty set. Let ⊕ be a binary operation on [e,∞) with two-sided identity e. Let ⊙ be another binary operation on [e,∞). A mapping ℬ:𝒪×𝒪→[e,∞) is a bi-operational metric if, for all ξ,♭,z∈𝒪,

(B⁢1) ℬ⁢(ξ,♭)≥e;

(B⁢2) ℬ⁢(ξ,♭)=e⇔ξ=♭;

(B⁢3) ℬ⁢(ξ,♭)=ℬ⁢(♭,ξ);

(B⁢4) ℬ⁢(ξ,♭)≤ℬ⁢(ξ,z)⊕ℬ⁢(z,♭).

In this case the quadruple (𝒪,ℬ,⊕,⊙) is called a bi-operational metric space.

A sequence {ξn} in 𝒪 is bi-operational convergent to ξ∈𝒪 if ℬ⁢(ξn,ξ)→e as n→∞.

A sequence {ξn} is called bi-operational Cauchy if ℬ⁢(ξn,ξm)→e as m,n→∞.

A bi-operational metric space is complete if every bi-operational Cauchy sequence converges.

Let ⋆ be a binary operation on [e,∞). We say that ⋆ is monotone if, for all a,g,h,d∈[e,∞),

a≤g⁢and⁢h≤d⟹a⋆h≤g⋆d.

Let ⋆ be a binary operation on [e,∞). We say that ⋆ is continuous if, whenever hn→h and gn→g in [e,∞),

hn⋆gn⟶h⋆g.

A binary operation ⋆ on [e,∞) is associative if (a⋆b)⋆c=a⋆(b⋆c) for all a,b,c∈[e,∞).

Definitions 2.5–2.7 are stated for a generic binary operation ⋆ on [e,∞) and therefore apply verbatim to ⊕ and to ⊙, without any further comment. In particular, Hypothesis 1 of Theorem 4.1, “⊕,⊙ are continuous, associative and monotone”, means that both operations satisfy Definitions 2.5, 2.6 and 2.7 with ⋆⁣=⁣⊕ and with ⋆⁣=⁣⊙, respectively.

The key innovation is that the contraction operation ⊙ does not require an identity. This allows us to define operations that genuinely shrink distances without the constraints imposed by the identity property.

Let (𝒪,ℬ) be a bi-operational metric space whose operation ⊕ is continuous. Then every bi-operational convergent sequence {ξn} in 𝒪 converges to only one point.

Proof. Suppose that ξn→ξ and ξn→♭. Then by (B⁢4), we get

ℬ⁢(ξ,♭)≤ℬ⁢(ξ,ξn)⊕ℬ⁢(ξn,♭).

Since ⊕ is continuous, we get

ℬ⁢(ξ,ξn)⊕ℬ⁢(ξn,♭)→e⊕e=e.

Hence ℬ⁢(ξ,♭)≤e, and since ℬ⁢(ξ,♭)≥e by (B1), we obtain ℬ⁢(ξ,♭)=e, and so, ξ=♭. ∎

2.1 Contractive Elements

Assume that ⊙ is an associative binary operation on [e,∞). An element k∈[e,∞) is called ⊙-contractive if

(C⁢1) k⊙a<a for all a>e;

(C⁢2) k⊙n⊙a→e as n→∞ for all a≥e,

where

k⊙n=k⊙k⊙⋯⊙k⏟n⁢ times.

The condition k⊙a<a ensures that each application of k shrinks distances. The condition k⊙n⊙a→e ensures that repeated application converges to the identity of the triangle operation.

The associativity of ⊙ is not an incidental assumption made later in the development, it is a standing hypothesis of Definition 2.11, stated in its first line, and it is exactly what makes the symbol k⊙n meaningful. Indeed, for a non-associative operation the n-fold combination k⊙k⊙⋯⊙k depends on the bracketing, so no single element k⊙n would be determined. Under Definition 2.7 all bracketings coincide, and k⊙n is unambiguously defined by the recursion

k⊙1=k,k⊙(n+1)=k⊙k⊙n(n≥1),

which is the form used throughout the proofs below. Consequently condition (C2) and the Operational Convergence Property (Definition 2.18) are well posed. For the specific operation of Example 4.3, associativity is verified directly in Appendix A, part (A.11), and the closed form of k⊙n is computed in part (A.8); no circularity is involved, since the appendix merely confirms for that example a property which is assumed abstractly here.

Let ⊕ be a binary operation on [e,∞) with two-sided identity e (i.e. a⊕e=e⊕a=a for all a≥e) which is monotone in the sense of Definition 2.5. Then for all a,b∈[e,∞),

a⊕b≥aanda⊕b≥b.

Proof. Since b≥e and a≤a, monotonicity gives a⊕b≥a⊕e=a. Since a≥e and b≤b, monotonicity gives a⊕b≥e⊕b=b. ∎

Assume throughout this definition that ⊕ is associative and monotone. Let (xi)i≥m be a sequence in [e,∞). For N≥m define the finite partial combination

SN:=xm⊕xm+1⊕⋯⊕xN,

which is well defined because ⊕ is associative. By Lemma 2.14,

SN+1=SN⊕xN+1≥SN,

so the sequence (SN)N≥m is non-decreasing in the usual order of [e,∞). We therefore define

⨁i=m∞xi:=limN→∞SN∈[e,+∞],

allowing the value +∞ when (SN)N is unbounded, and we say that the infinite combination converges when this limit is finite.

If ⨁i=m∞xi converges, then for every n>m,

⨁i=mn−1xi≤⨁i=m∞xi.

Proof. Immediate from Definition 2.15: the sequence (SN)N≥m of partial combinations is non-decreasing, so every partial value Sn−1 satisfies Sn−1≤limN→∞SN. ∎

Corollary 2.16 is precisely the statement that was invoked informally in the proof of Theorem 4.1 under the phrase “since the triangle-inequality operation is increasing”. The proof below now refers to it explicitly.

We say that (⊕,⊙) satisfies the Operational Convergence Property (OCP) if for every a≥e and every ⊙-contractive element k, the infinite combination ⨁i=m∞(k⊙i⊙a) (Definition 2.15) converges for every m≥1, and

⨁i=m∞(k⊙i⊙a)⟶eas⁢m→∞.

3 Examples

In this section we show that the bi-operational metric framework recovers several well-known distance structures as special cases.

3.1 Classical Metric Spaces

Let 𝒪 be a nonempty set. The usual metric setting is obtained by considering a mapping

d:𝒪×𝒪→[0,+∞)

satisfying the following conditions:

(d1) d⁢(ξ,♭)=0 if and only if ξ=♭;

(d2) d⁢(ξ,♭)=d⁢(♭,ξ);

(d3) d⁢(ξ,♭)≤d⁢(ξ,z)+d⁢(z,♭) for all ξ,♭,z∈𝒪.

Every standard metric space (𝒪,d) is a bi-operational metric space (𝒪,d,⊕) under the choice a⊕b=a+b with identity e=0.

Proof. Conditions (B1)–(B3) follow immediately from (d1)–(d2) and nonnegativity of d. Condition (B4) is exactly (d3), since d⁢(ξ,♭)≤d⁢(ξ,z)+d⁢(z,♭)=d⁢(ξ,z)⊕d⁢(z,♭). The operation ⊕⁣=⁣+ is continuous, associative, and monotone on [0,∞) with identity e=0. ∎

3.2 Multiplicative Metric Spaces

A multiplicative metric on a nonempty set 𝒪 is a mapping d:𝒪×𝒪→[1,+∞) satisfying:

(m1) d⁢(ξ,♭)=1⇔ξ=♭;

(m2) d⁢(ξ,♭)=d⁢(♭,ξ);

(m3) d⁢(ξ,♭)≤d⁢(ξ,z)⋅d⁢(z,♭) for all ξ,♭,z∈𝒪.

Every multiplicative metric space (𝒪,d) is a bi-operational metric space (𝒪,d,⊕) under the choice a⊕b=a⋅b with identity e=1.

Proof. Conditions (B1)–(B3) follow immediately from (m1)–(m2). Condition (B4) is exactly (m3), since d⁢(ξ,♭)≤d⁢(ξ,z)⋅d⁢(z,♭)=d⁢(ξ,z)⊕d⁢(z,♭). The operation ⊕⁣=⁣⋅ is continuous, associative, and monotone on [1,∞) with identity e=1. ∎

3.3 Ultrametric Spaces

An ultrametric on 𝒪 is a mapping d:𝒪×𝒪→[0,+∞) satisfying (d1)–(d2) above and

(d3) d⁢(ξ,♭)≤max⁡{d⁢(ξ,z),d⁢(z,♭)} for all ξ,♭,z∈𝒪.

Every ultrametric space (𝒪,d) is a bi-operational metric space (𝒪,d,⊕) under the choice a⊕b=max⁡{a,b} with identity e=0.

Proof. Conditions (B1)–(B3) follow immediately from (d1)–(d2). Condition (B4) is exactly (u3), since d⁢(ξ,♭)≤max⁡{d⁢(ξ,z),d⁢(z,♭)}=d⁢(ξ,z)⊕d⁢(z,♭). The operation ⊕=max is continuous, associative, and monotone on [0,∞) with identity e=0. ∎

Propositions 3.1–3.3 concern only the triangle-inequality operation ⊕, because Definition 2.1 requires only ⊕ to define a bi-operational metric space. The contraction operation ⊙ is independent of the metric structure and enters only when a specific contraction mapping T is studied. This is precisely the separation that distinguishes the bi-operational framework from the operational metric spaces of Adewale et al., where a single operation governs both the triangle inequality and the contraction. The choice of ⊙ is made freely and independently in each fixed point problem, as illustrated in the consequence results.

3.4 A Comparative Summary

Table 1 collects the special cases discussed above together with the two frameworks they are being compared against. Reading the table by columns makes the contribution of the present paper visible at a glance: in every row except the last one the contraction mechanism is either dictated by the triangle-inequality operation or imported from outside the structure as ordinary real multiplication, whereas in the bi-operational setting the two operations are chosen independently of one another.

Table 1 Comparison of the bi-operational framework with the classical distance structures and with the operational metric spaces of Adewale et al. The decisive difference is recorded in the fourth column: only in the last row is the contraction operation a free parameter of the theory.

Framework Triangle Operation ⊕ Identity e Contraction Operation ⊙ Contraction Condition
Metric a⊕b=a+b 0 a⊙b=a⋅b d⁢(T⁢ξ,T⁢♭)≤k⁢d⁢(ξ,♭), k∈[0,1)
Multiplicative [10] a⊕b=a⋅b 1 a⊙b=bln⁡a d⁢(T⁢ξ,T⁢♭)≤d⁢(ξ,♭)ln⁡k
Ultrametric [16] a⊕b=max⁡{a,b} 0 a⊙b=a⋅b d⁢(T⁢ξ,T⁢♭)≤k⁢d⁢(ξ,♭), k∈[0,1)
b-metric [2, 11] a⊕b=s⁢(a+b), s>1 none — not covered; see Remark 3.5
Operational [1] arbitrary, with identity e none: real scalar multiplication is used b⁢(T⁢ξ,T⁢♭)≤k⋅b⁢(ξ,♭), forces e=0
Bi-operational (this paper) arbitrary, with identity e arbitrary, independent of ⊕, identity not required ℬ⁢(T⁢ξ,T⁢♭)≤k⊙ℬ⁢(ξ,♭), k ⊙-contractive

The fourth row of Table 1 deserves a comment, since b-metric spaces are the most frequently cited generalization of the triangle inequality. Writing the b-triangle inequality as d⁢(ξ,♭)≤s⁢[d⁢(ξ,z)+d⁢(z,♭)] with s>1 suggests the choice a⊕sb:=s⁢(a+b). This operation is continuous and monotone on [0,∞), but it is neither associative nor unital: one has (a⊕sb)⊕sc=s2⁢a+s2⁢b+s⁢c while a⊕s(b⊕sc)=s⁢a+s2⁢b+s2⁢c, and a⊕s0=s⁢a≠a for every a>0. Hence ⊕s does not meet the requirement of Definition 2.1, and b-metric spaces are not subsumed by the framework of the present paper. Extending the bi-operational setting to triangle-inequality operations that are only approximately associative and possess only an approximate identity, so as to cover the b-metric case, is an interesting problem that we leave for future work.

4 Banach Fixed Point Theorem in Bi-operational Metric Spaces

Let (𝒪,ℬ,⊕,⊙) be a complete bi-operational metric space. Assume

1. ⊕,⊙ are continuous, associative and monotone,

2. there exists a ⊙-contractive element k∈[e,∞), where e is the identity element of ⊕ and a two-sided absorbing element of ⊙, i.e., e⊙g=g⊙e=e for all g≥e,

3. (⊕,⊙) satisfies OCP.

If T:𝒪→𝒪 satisfies

ℬ⁢(T⁢ξ,T⁢♭)≤k⊙ℬ⁢(ξ,♭),

then T has a unique fixed point.

Proof. Let ξn+1=T⁢ξn. If there is ξq=ξq+1, then ξq is a fixed point for T. Thus, we may suppose that for all n, ξn+1≠ξn.

Step 1: the basic estimate. We claim that, with b0:=ℬ⁢(ξ1,ξ0),

ℬ⁢(ξn+1,ξn)≤k⊙n⊙b0for every⁢n≥1. (1)

We argue by induction on n. For n=1, the contraction hypothesis gives

ℬ⁢(ξ2,ξ1)=ℬ⁢(T⁢ξ1,T⁢ξ0)≤k⊙ℬ⁢(ξ1,ξ0)=k⊙1⊙b0,

which is (1) for n=1. Assume now that (1) holds for some n≥1. Applying the contraction hypothesis to the pair (ξn+1,ξn) and then the induction hypothesis, we obtain

ℬ⁢(ξn+2,ξn+1)=ℬ⁢(T⁢ξn+1,T⁢ξn)≤k⊙ℬ⁢(ξn+1,ξn)≤k⊙(k⊙n⊙b0),

where the second inequality uses the monotonicity of ⊙ in its second argument (Definition 2.5). Since ⊙ is associative (Definition 2.7),

k⊙(k⊙n⊙b0)=(k⊙k⊙n)⊙b0=k⊙(n+1)⊙b0,

by the recursion recorded in Remark 2.13. This is (1) for n+1, and the induction is complete.

Step 2: the Cauchy property. For n>m≥1, we first use the symmetry (B3) and then apply the triangle inequality (B4) repeatedly, splitting off the leftmost term at each stage, so that the resulting combination is taken in increasing order of the index; with the estimate (1) and the monotonicity of ⊕ this gives

ℬ⁢(ξn,ξm) =ℬ⁢(ξm,ξn)
≤ℬ⁢(ξm,ξm+1)⊕ℬ⁢(ξm+1,ξm+2)⊕⋯⊕ℬ⁢(ξn−1,ξn)
≤⨁i=mn−1(k⊙i⊙b0)where⁢b0=ℬ⁢(ξ1,ξ0)
≤⨁i=m∞(k⊙i⊙b0)(by Corollary 2.16)

By OCP, we have ⨁i=m∞(k⊙i⊙b0)→e as m→∞. Hence {ξn} is Cauchy and, by completeness, converges to some u∈𝒪.

Step 3: u is a fixed point. Observe that, for every n,

ℬ⁢(T⁢u,ξn+1)=ℬ⁢(T⁢u,T⁢ξn)≤k⊙ℬ⁢(u,ξn).

Since ξn→u we have ℬ⁢(u,ξn)→e, and the continuity of ⊙ (Definition 2.6) gives

k⊙ℬ⁢(u,ξn)⟶k⊙e=e,

the last equality being exactly the two-sided absorption assumed in Hypothesis 2. On the other hand ℬ⁢(T⁢u,ξn+1)≥e for every n by (B1). Combining the two facts,

e≤ℬ⁢(T⁢u,ξn+1)≤k⊙ℬ⁢(u,ξn)⟶e,

so the squeeze principle yields ℬ⁢(T⁢u,ξn+1)→e; that is, ξn+1→T⁢u. Since ξn+1→u as well, Lemma 2.10 (uniqueness of bi-operational limits) forces T⁢u=u.

Step 4: uniqueness. If u,v are fixed points, then

ℬ⁢(u,v)=ℬ⁢(T⁢u,T⁢v)≤k⊙ℬ⁢(u,v).

If ℬ⁢(u,v)>e, then by the contractivity of k (condition (C1)), we get

k⊙ℬ⁢(u,v)<ℬ⁢(u,v),

a contradiction. So, ℬ⁢(u,v)=e, hence u=v. ∎

Hypothesis 2 requires two-sided absorption, e⊙g=g⊙e=e for all g≥e. The left-hand identity e⊙g=e is what makes e an absorbing element in the algebraic sense; the right-hand identity g⊙e=e is the one actually used in Step 3, where the limit k⊙ℬ⁢(u,ξn)→k⊙e must be identified with e. Both identities are verified in each of the Corollaries 5.1, 5.2 and 5.3, and for the operation of Example 4.3 in Appendix A, part (A.7); stating the hypothesis in two-sided form therefore brings the theorem into exact agreement with what is used and verified in the rest of the paper.

The following example verifies the assumptions imposed in our main theorem and illustrates the obtained results.

Let 𝒪=[2,3] and let ⊕ and ⊙ be the binary operations defined on [2,∞) by

a⊕b=(a−1)⁢(b−1)+1,a⊙b=(a−1)ln⁡(b−1)+1.

Consider the function ℬ:𝒪×𝒪→[2,∞) defined by

ℬ⁢(ξ,♭)=|ξ−♭|+2.

Define T:𝒪→𝒪 by

T⁢(ξ)=2+ξ−210.

Choose k=2.5.

The identity element of ⊕ is e=2, and (𝒪,ℬ,⊕,⊙) is a complete bi-operational metric space on which Hypotheses 1–3 of Theorem 4.1 are satisfied; all of these verifications, including the fact that T maps 𝒪 into itself, that k=2.5 is ⊙-contractive, and that (⊕,⊙) satisfies OCP, are carried out in detail in Appendix A. Note that 𝒪=[2,3] is a closed subinterval of [2,∞), which is the set on which the two operations and the bi-operational metric take their values; the choice of the compact interval [2,3] for the underlying space is what makes the elementary estimate below possible.

It remains to verify that the mapping T satisfies the contractive hypothesis of Theorem 4.1. For arbitrary ξ,♭∈𝒪, let

t=|ξ−♭|∈[0,1].

Then

ℬ⁢(T⁢ξ,T⁢♭)=|2+ξ−210−(2+♭−210)|+2=t10+2.

On the other hand,

k⊙ℬ⁢(ξ,♭)=(2.5−1)ln⁡(|ξ−♭|+1)+1=(1.5)ln⁡(t+1)+1.

Since xln⁡y=yln⁡x for all x,y>0,

(1.5)ln⁡(t+1)=(t+1)ln⁡(1.5).

We now show that

(t+1)α≥ 1+t10for all⁢t∈[0,1],where⁢α=ln⁡(1.5)≈0.4055. (2)

Since α∈(0,1), the function s↦sα is concave, so Bernoulli’s inequality applies in the form (1+t)α≤1+α⁢t, that is, in the direction opposite to the one that would be needed here. We therefore establish (2) directly, by a monotonicity argument. Put

f⁢(t)=(t+1)α−1−t10,t∈[0,1].

Then f⁢(0)=1−1−0=0, and f is differentiable on [0,1] with

f′⁢(t)=α⁢(t+1)α−1−110.

Because α−1<0, the map t↦(t+1)α−1 is decreasing on [0,1], and hence attains its minimum at t=1;

(t+1)α−1≥ 2α−1= 2−0.5945≈ 0.6623(0≤t≤1).

Consequently

f′⁢(t)≥α⋅2α−1−110≈0.4055×0.6623−0.1≈0.1685>0(0≤t≤1),

so f is strictly increasing on [0,1]. Together with f⁢(0)=0 this yields f⁢(t)≥0 for every t∈[0,1], which is exactly (2).

Therefore,

k⊙ℬ⁢(ξ,♭)=(1.5)ln⁡(t+1)+1=(t+1)ln⁡(1.5)+1≥2+t10=ℬ⁢(T⁢ξ,T⁢♭).

Hence

ℬ⁢(T⁢ξ,T⁢♭)≤k⊙ℬ⁢(ξ,♭),

for all ξ,♭∈𝒪. Finally, if ξ=T⁢(ξ), then

ξ=2+ξ−210,

which implies

10⁢ξ=20+ξ−2,

and consequently

9⁢ξ=18.

Thus ξ=2. Consequently, the mapping T admits a unique fixed point, which is given by ξ=2. Hence, all the hypotheses required by Theorem 4.1 are fulfilled.

The estimate (2) is sharp at the left endpoint, since f⁢(0)=0; this reflects the fact that ℬ⁢(T⁢ξ,T⁢♭)=k⊙ℬ⁢(ξ,♭)=2=e when ξ=♭. It is also worth noticing that the inequality (t+1)α≥1+t/10 fails for large t: the function f above has f′⁢(t)=0 at t=(10⁢α)1/(1−α)−1≈9.53, and f becomes negative for t beyond roughly t≈30.5. The restriction of the underlying space to the bounded interval 𝒪=[2,3], which confines t=|ξ−♭| to [0,1], is therefore essential and not merely a convenience.

5 Consequences of the Main Theorem

In this section we show that Theorem 4.1 recovers the classical fixed point results corresponding to each special case above, by specifying the contraction operation ⊙ in each setting.

5.1 Banach Contraction Principle

Let (𝒪,d) be a complete standard metric space and T:𝒪→𝒪 a mapping. Suppose there exists k∈[0,1) such that

d⁢(T⁢ξ,T⁢♭)≤k⁢d⁢(ξ,♭)for all⁢ξ,♭∈𝒪.

Then T has a unique fixed point.

Proof. Set a⊕b=a+b and a⊙b=a⋅b with e=0. By Proposition 3.1, (𝒪,d,⊕) is a complete bi-operational metric space. The operation ⊙ is continuous, associative and monotone. Two-sided absorption holds since 0⊙a=a⊙0=0=e. For k∈[0,1):

(C1) k⊙a=k⁢a<a for all a>0.

(C2) k⊙n⊙a=kn⁢a→0=e.

OCP holds since ⨁i=m∞(ki⁢a)=∑i=m∞ki⁢a=km⁢a/(1−k)→0=e. The contraction condition d⁢(T⁢ξ,T⁢♭)≤k⊙d⁢(ξ,♭)=k⁢d⁢(ξ,♭) coincides with the hypothesis. The result follows from Theorem 4.1. ∎

5.2 Multiplicative Contraction Principle

Let (𝒪,d) be a complete multiplicative metric space and T:𝒪→𝒪 a mapping. Suppose there exists k∈[1,exp⁡(1)), where exp⁡(1)≈2.71828 denotes Euler’s number, such that

d⁢(T⁢ξ,T⁢♭)≤d⁢(ξ,♭)ln⁡kfor all⁢ξ,♭∈𝒪.

Then T has a unique fixed point.

Proof. Set a⊕b=a⋅b and a⊙b=bln⁡a with e=1. By Proposition 3.2, (𝒪,d,⊕) is a complete bi-operational metric space. The operation ⊙ is continuous, associative and monotone. Two-sided absorption holds since 1⊙a=aln⁡1=a0=1=e and a⊙1=1ln⁡a=1=e. For k∈[1,exp⁡(1)), so that ln⁡k∈[0,1):

(C1) k⊙a=aln⁡k<a for all a>1, since ln⁡k<1.

(C2) k⊙n⊙a=a(ln⁡k)n→a0=1=e since (ln⁡k)n→0.

OCP holds since ⨁i=m∞(k⊙i⊙a)=∏i=m∞a(ln⁡k)i=a(ln⁡k)m/(1−ln⁡k)→1=e. The contraction condition d⁢(T⁢ξ,T⁢♭)≤k⊙d⁢(ξ,♭)=d⁢(ξ,♭)ln⁡k coincides with the hypothesis. The result follows from Theorem 4.1. ∎

5.3 Ultrametric Contraction Principle

Let (𝒪,d) be a complete ultrametric space and T:𝒪→𝒪 a mapping. Suppose there exists k∈[0,1) such that

d⁢(T⁢ξ,T⁢♭)≤k⁢d⁢(ξ,♭)for all⁢ξ,♭∈𝒪.

Then T has a unique fixed point.

Proof. Set a⊕b=max⁡{a,b} and a⊙b=a⋅b with e=0. By Proposition 3.3, (𝒪,d,⊕) is a complete bi-operational metric space. The operation ⊙ is continuous, associative and monotone. Two-sided absorption holds since 0⊙a=a⊙0=0=e. For k∈[0,1):

(C1) k⊙a=k⁢a<a for all a>0.

(C2) k⊙n⊙a=kn⁢a→0=e.

OCP holds since ⨁i=m∞(ki⁢a)=supi≥m(ki⁢a)=km⁢a→0=e. The contraction condition d⁢(T⁢ξ,T⁢♭)≤k⊙d⁢(ξ,♭)=k⁢d⁢(ξ,♭) coincides with the hypothesis. The result follows from Theorem 4.1. ∎

6 Conclusion

In this paper, we have identified the fundamental limitations of the approach of Adewale et al., in which the contraction of the form k⋅b⁢(ξ,♭) is only meaningful when e=0, and in which real scalar multiplication is mixed with the underlying operational metric structure. To overcome these issues, we introduced a genuinely new framework based on two binary operations: ⊕, which governs the triangle-type inequality and is equipped with an identity element, and ⊙, which governs the contraction mechanism and does not require an identity. Within this setting, we introduced the notion of a ⊙-contractive element k, characterized by the property that k⊙a<a for all a>e, together with the asymptotic condition k⊙n⊙a→e. Under these assumptions, we established a Banach-type fixed point theorem in the bi-operational framework. Furthermore, we provided illustrative examples, including the classical case and a non-trivial construction on [2,3] defined by a⊕b=(a−1)⁢(b−1)+1 and a⊙b=(a−1)ln⁡(b−1)+1. These results demonstrate that the proposed framework constitutes a genuine and non-trivial generalization of Banach’s contraction principle, in which the contraction mechanism is a free parameter of the theory rather than a consequence of the triangle-inequality operation.

The framework developed here sits at the meeting point of metric fixed point theory and algebra, and we believe that this is where its principal interest lies. A bi-operational metric space is, in effect, a set equipped with a distance taking values in an ordered algebraic structure carrying two operations, one of which need not have an identity; structures of this kind are familiar from the theory of ordered semigroups, semirings and residuated lattices, and it would be natural to ask which fixed point statements survive when [e,∞) is replaced by an abstract ordered monoid or a complete lattice. In a different direction, the axioms (C1)–(C2) and the Operational Convergence Property are conditions on the asymptotics of the iterates k⊙n, which invites a dynamical reading of the theory. We therefore expect that future work may profitably explore the applications and the connections of bi-operational metric spaces with other branches of mathematics, among them ordered algebraic structures and lattice theory, topological algebra, and the theory of integral and fractional differential equations, where contraction principles are the standard route to existence and uniqueness results [7, 9]. Finally, as observed in Remark 3.5, the b-metric case is not covered by the present axioms, and finding the right relaxation of the identity requirement so as to include it remains an open problem.

Conflict of Interest

The author declares no conflict of interest.

Acknowledgement

The author is grateful to the Deanship of Scientific Research at Jadara University for providing financial support for this publication.

Appendix A Detailed Verification of Example 4.3

Let 𝒪=[2,3], and let the operations

a⊕b=(a−1)⁢(b−1)+1,a⊙b=(a−1)ln⁡(b−1)+1

be defined on [2,∞), which is the codomain of the bi-operational metric ℬ⁢(ξ,♭)=|ξ−♭|+2 of Example 4.3.

Throughout this appendix, 𝒪=[2,3] denotes the underlying space of Example 4.3, while [2,∞) denotes the set on which ⊕, ⊙ and ℬ take their values. The two intervals play different roles and are no longer used interchangeably: parts (A.1)–(A.5), (A.7), (A.8), (A.9) and (A.11) below are statements about the operations, and are therefore proved on all of [2,∞); parts (A.6) and (A.10) are statements about the space and the mapping T, and are proved on 𝒪=[2,3].

(A.1) Identity of ⊕.For all a≥2,

a⊕2=(a−1)⁢(1)+1=a,2⊕a=(1)⁢(a−1)+1=a.

Hence e=2 is the identity element of ⊕.

(A.2) Well-definedness.Since a−1≥1 and b−1≥1 for all a,b≥2, both operations are well-defined and map [2,∞) into itself.

(A.3) Monotonicity of ⊕.If a≤c and b≤d, then

(a−1)⁢(b−1)≤(c−1)⁢(d−1),

so a⊕b≤c⊕d.

(A.4) Monotonicity of ⊙.Fix b≥2. Since ln⁡(b−1)≥0, the map a↦(a−1)ln⁡(b−1)+1 is non-decreasing in a for a≥2. Fix a≥2. Since a−1≥1 and ln⁡(⋅) is increasing, the map b↦(a−1)ln⁡(b−1)+1 is non-decreasing in b. Hence ⊙ is monotone in each argument.

(A.5) Continuity.Both operations are compositions of continuous functions on [2,∞), hence continuous.

(A.6) ℬ is a complete bi-operational metric on 𝒪=[2,3].Conditions (B1)–(B3) of Definition 2.1 are immediate:ℬ⁢(ξ,♭)=|ξ−♭|+2≥2=e; equality holds if and only if|ξ−♭|=0, that is ξ=♭; and ℬ is symmetric because|⋅| is. For (B4), let ξ,♭,z∈𝒪 and putu=|ξ−z|, v=|z−♭|. Then

ℬ⁢(ξ,z)⊕ℬ⁢(z,♭) =(u+2−1)⁢(v+2−1)+1
=(u+1)⁢(v+1)+1=u⁢v+u+v+2,

whereas, by the ordinary triangle inequality on ℝ,

ℬ⁢(ξ,♭)=|ξ−♭|+2≤u+v+2.

Since u⁢v≥0, we conclude ℬ⁢(ξ,♭)≤u⁢v+u+v+2=ℬ⁢(ξ,z)⊕ℬ⁢(z,♭), which is (B4). As for completeness, ℬ⁢(ξn,ξm)→e=2 is equivalent to|ξn−ξm|→0, so a bi-operational Cauchy sequence in 𝒪 is exactly a Cauchy sequence of real numbers lying in the closed bounded interval[2,3]. Such a sequence converges in [2,3] to some ξ, and thenℬ⁢(ξn,ξ)=|ξn−ξ|+2→2=e, i.e. ξn→ξ in the bi-operational sense. Hence (𝒪,ℬ,⊕,⊙) is complete. Finally, T maps 𝒪 into itself: if ξ∈[2,3] thenT⁢(ξ)=2+(ξ−2)/10∈[2,2.1]⊂[2,3].

(A.7) Two-sided absorption.For every g≥2,

e⊙g=2⊙g=(2−1)ln⁡(g−1)+1=1ln⁡(g−1)+1=2=e,
g⊙e=g⊙2=(g−1)ln⁡(2−1)+1=(g−1)ln⁡1+1=(g−1)0+1=2=e.

Thus e=2 is a two-sided absorbing element for ⊙, as required by Hypothesis 2 of Theorem 4.1.

(A.8) k=2.5 is a ⊙-contractive element.Write α:=ln⁡(k−1)=ln⁡(1.5)≈0.4055∈(0,1).

(C1). Let a>2 and put A:=a−1>1. Then

k⊙a=(k−1)ln⁡(a−1)+1=(1.5)ln⁡A+1=Aα+1.

Since A>1 and α<1 we have Aα<A, hence k⊙a<A+1=a, which is (C1).

(C2). We first record the closed form of the ⊙-powers of k: for every n≥1,

k⊙n=exp⁡(αn)+1. (3)

Indeed, for n=1, exp⁡(α)+1=exp⁡(ln⁡1.5)+1=1.5+1=2.5=k. Assuming (3) for n, the recursion of Remark 2.13 gives

k⊙(n+1) =k⊙k⊙n=(k−1)ln⁡(k⊙n−1)+1=(1.5)ln⁡(exp⁡(αn))+1
=(1.5)αn+1=exp⁡(αn+1)+1,

which is (3) for n+1. Now let a≥2 and A=a−1≥1. Using (3),

k⊙n⊙a=(k⊙n−1)ln⁡(a−1)+1=exp(αn)ln⁡A+1=exp(αnlnA)+1. (4)

Since 0<α<1 we have αn→0, henceexp⁡(αn⁢ln⁡A)→exp⁡(0)=1 and thereforek⊙n⊙a→2=e, which is (C2). Thus k=2.5 is⊙-contractive.

(A.9) The pair (⊕,⊙) satisfies OCP.Let a≥2, A=a−1≥1, and let m≥1. Becausex⊕y=(x−1)⁢(y−1)+1, an immediate induction shows that for anyxm,…,xN∈[2,∞),

⨁i=mNxi=∏i=mN(xi−1)+1.

Applying this to xi=k⊙i⊙a and using (4),

⨁i=mN(k⊙i⊙a)=∏i=mNexp⁡(αi⁢ln⁡A)+1=exp⁡(ln⁡A⁢∑i=mNαi)+1.

Since 0<α<1, the geometric series converges as N→∞, giving the finite value

⨁i=m∞(k⊙i⊙a)=exp⁡(αm1−α⁢ln⁡A)+1<∞,

so the infinite combination converges in the sense of Definition 2.15. Finally αm/(1−α)→0 asm→∞, whence

⨁i=m∞(k⊙i⊙a)⟶exp⁡(0)+1=2=e,

which is exactly OCP. Together with (A.1)–(A.8) and (A.11), this shows that all three hypotheses of Theorem 4.1 hold in Example 4.3.

(A.10) Convergence of the Picard Sequence.For any x0∈[2,3], the Picard sequence generated by the mapT⁢(ξ)=2+ξ−210 of Example 4.3 is

xn+1=T⁢(xn)=2+xn−210.

The solution is:

xn=2+x0−210n.

Indeed:

xn+1−2=xn−210.

So, by induction:

xn−2=x0−210n.

Thus:

xn=2+x0−210n⟶2as⁢n→∞.

Since x0∈[2,3] implies x0−2∈[0,1], the sequence {xn} remains in [2,3] for all n, and the Picard sequence converges geometrically (with ratio 1/10) to the fixed point 2, consistent with Theorem 4.1.

(A.11) Associativity of the operation ⊙.Let

x=a−1,y=b−1,z=c−1,

where a,b,c>1. Then

a⊙b=xln⁡y+1.

Therefore,

(a⊙b)⊙c =(xln⁡y)ln⁡z+1
=x(ln⁡y)⁢(ln⁡z)+1.

On the other hand,

a⊙(b⊙c) =xln⁡(yln⁡z)+1
=x(ln⁡z)⁢(ln⁡y)+1
=x(ln⁡y)⁢(ln⁡z)+1.

Hence,

(a⊙b)⊙c=a⊙(b⊙c),

showing that ⊙ is associative on (1,∞), and in particular on[2,∞).

References

[1] O.K. Adewale, S.O. Ayodele, A.C. Loyinmi, B.E. Oyelade, C. Iluno, A. Oyem, G.A. Adewale, Metric spaces with binary operation, Advances in Mathematics: Scientific Journal, 14(2) (2025), 211–225. https://doi.org/10.37418/amsj.14.2.6

[2] I.A. Bakhtin, The contraction mapping principle in almost metric spaces, Funct. Anal., 30 (1989), 26–37.

[3] S. Banach, Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales, Fund. Math., 3 (1922), 133–181.

[4] M. Jleli, B. Samet, A generalized metric space and related fixed point theorems, Fixed Point Theory Appl., 2015 (2015), art. no. 61. https://doi.org/10.1186/s13663-015-0312-7https://doi.org/10.1186/s13663-015-0312-7

[5] K. Abodayeh, A. Bataihah, W. Shatanawi, Generalized Ω-distance mappings and some fixed point theorems, UPB Sci. Bull. Ser. A, 79(2) (2017), 223–232.

[6] I. Abu-Irwaq, W. Shatanawi, A. Bataihah, I. Nuseir, Fixed point results for nonlinear contractions with generalized Ω-distance mappings, UPB Sci. Bull. Ser. A, 81(1) (2019), 57–64.

[7] A. Bataihah, Some fixed point results with application to fractional differential equation via new type of distance spaces, Results Nonlinear Anal., 7(1) (2024), 202–208.

[8] A. Bataihah, T. Qawasmeh, A new type of distance spaces and fixed point results, J. Math. Anal., 15(4) (2024), 81–90.

[9] A. Bataihah, T. Qawasmeh, I.M. Batiha, I.H. Jebril, T. Abdeljawad, Gamma distance mappings with application to fractional boundary differential equation, J. Math. Anal., 15(5) (2024), 99–106.

[10] A.E. Bashirov, E.M. Kurpinar, A. Ozyapici, Multiplicative calculus and its applications, J. Math. Anal. Appl., 337(1) (2008), 36–48.

[11] S. Czerwik, Contraction mappings in b-metric spaces, Acta Math. Inform. Univ. Ostraviensis, 1 (1993), 5–11.

[12] M. Etesam, G.R. Mohtashami Borzadaran, Reliability optimization using progressive batching L-BFGS, Journal of Reliability and Statistical Studies, 17(2) (2024), 321–332. https://doi.org/10.13052/jrss0974-8024.1723https://doi.org/10.13052/jrss0974-8024.1723

[13] Parmender, V. Garg, A. Kumar, Stochastic evaluation of a duplicate standby system via semi-Markov processes, Journal of Reliability and Statistical Studies, 18(2) (2025), 473–490. https://doi.org/10.13052/jrss0974-8024.18210https://doi.org/10.13052/jrss0974-8024.18210

[14] L.G. Huang, X. Zhang, Cone metric spaces and fixed point theorems of contractive mappings, J. Math. Anal. Appl., 332(2) (2007), 1468–1476.

[15] V. Berinde, M. Păcurar, The early developments in fixed point theory on b-metric spaces: a brief survey and some important related aspects, Carpathian J. Math., 38(3) (2022), 523–538. https://doi.org/10.37193/CJM.2022.03.01

[16] M. Krasner, Nombres semi-réels et espaces ultramétriques, C. R. Acad. Sci. Paris, 219 (1944), 433–435.

Biography

images

Anwar Bataihah received his Ph.D. in mathematics, with distinction, from The University of Jordan. He is an Assistant Professor in the Department of Mathematics, Faculty of Science, Jadara University, Irbid, Jordan. He has published more than 57 Scopus-indexed papers (h-index 21) on fixed point theory, generalized metric spaces, neutrosophic and fuzzy structures, fractional calculus, and statistical estimation.