SearcharxivSearch

arXiv · 2512.21341

Novel Perturbed b-Metric and Perturbed Extended b-Metric Spaces with Banach-Type Fixed Point Theorem

Abstract

In this paper, we introduce a new general framework, called \emph{perturbed extended $b$-metric spaces}, denoted by $(X,\mathcal{D}_{\zeta},\hbar)$, which extends the classical and extended $b$-metric structures through the inclusion of an explicit perturbation mapping $\hbar$. This formulation is motivated by the observation that distance measurements in many analytical and applied contexts are often affected by intrinsic or external deviations that cannot be captured by the usual metric-type geometries. We also identify a meaningful specialization arising when the control function $\zeta$ is constant, leading to the notion of a \emph{perturbed $b$-metric space}, introduced here as a natural restriction of the general framework. We establish several fundamental properties of spaces of the form $(X,\mathcal{D}_{\zeta},\hbar)$ and develop a Banach-type fixed point theorem in the perturbed extended $b$-metric setting. Conditions ensuring the existence and uniqueness of fixed points of a self-map $T:X\to X$ are derived, together with convergence of Picard iterations $T^{n}v \to \vartheta$. Illustrative examples are provided to show that the presence of the perturbation term $\hbar$, together with the influence of the control function $\zeta$, may cause $\mathcal{D}_{\zeta}$ to lose the usual extended $b$-metric behaviour and prevent $\mathcal{D}_{\zeta}$ from satisfying the standard extended $b$-metric axioms. We further discuss natural extensions of this perturbation philosophy to multi-point settings, encompassing $S$-metric spaces and their extended and $S_b$-metric variants. The results presented here open new directions for the study of contractive operators and fixed point theory in generalized metric environments.

Explore related subjects

Keep this discovery

BibTeXRIS

Abdelhamid Moussaoui. 2025-12-07. Novel Perturbed b-Metric and Perturbed Extended b-Metric Spaces with Banach-Type Fixed Point Theorem. https://arxiv.org/abs/2512.21341

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC