System Requirements Document

1. Introduction

This document specifies the requirements for a Fixed Point Theory Comparative Literature Review deliverable. The deliverable synthesizes and compares five peer-reviewed mathematics research articles concerned with fixed point theory in generalized metric spaces and its applications to integral equations. The requirement is driven by an explicit request to convene a panel of fixed point theory experts to review the supplied articles and produce a consolidated synthesis that identifies the common threads and the divergences across them.

The scope covers: the theoretical spaces treated by each article; the classes of contractive mappings and control functions employed; the families of fixed point, coincidence point, coupled coincidence point, coupled common fixed point, and common fixed point results proved; the topological and structural lemmas and properties relied upon; the prior results each article extends; the real-world applications to nonlinear quadratic and Volterra integral equations; and the stated generalizations, improvements, and methodological differences among the articles.

This is an analysis-and-synthesis document product. It does not constitute a software application with runtime authentication, administration, or transactional scope.

2. System Overview

The system is a comparative research synthesis over a curated corpus of five fixed point theory articles:

• Aghajani and Arab — Fixed points of (ψ,φ,θ)-contractive mappings in partially ordered b-metric spaces and application to quadratic integral equations (Fixed Point Theory and Applications, 2013:245; MSC Primary 47H10, Secondary 54H25).
• Huang, Radenović and Vujaković — On some recent coincidence and immediate consequences in partially ordered b-metric spaces (Fixed Point Theory and Applications, 2015:63; MSC 47H10; 54H25).
• Allahyari, Arab and Haghighi — A generalization on weak contractions in partially ordered b-metric spaces and its application to quadratic integral equations (Journal of Inequalities and Applications, 2014:355).
• Radenović and Kadelburg — Generalized weak contractions in partially ordered metric spaces (Computers and Mathematics with Applications 60, 2010, 1776–1783).
• Shah, Talat and Noor — Fixed Point Theorems in Extended Quasi Partial B-Metric Spaces with Applications to Volterra Integral Equations (Boletim da Sociedade Paranaense de Matemática, 2025; MSC 37C25, 47H10, 54H25).

The system's purpose is to extract, normalize, and contrast the definitions, axioms, mapping classes, control-function families, theorem statements, structural lemmas, and integral-equation applications of each article into a single canonical comparison, while preserving exact mathematical terminology.

The synthesis must support two kinds of consumption: (a) a theoretical researcher tracking how the contractive framework evolves across b-metric, partial, quasi-partial, extended, and ordered settings, and which prior results each work extends; and (b) an applied reader interested in the existence and uniqueness of solutions to integral equations derived from these fixed point theorems.

3. Functional Requirements

3.1 Expert-Panel Review Capability

FR-1. As a fixed point theory researcher, I want the review to be conducted from the perspective of a panel of mathematics experts whose research specialization is fixed point theory, so that the synthesis reflects authoritative domain judgment rather than a generic summary.

FR-2. As a fixed point theory researcher, I want every one of the five supplied articles to be reviewed in full, so that no article is omitted from the comparative analysis.

FR-3. As a fixed point theory researcher, I want the review to summarize the common points shared among the articles, so that I can see the unified theoretical thread running through the corpus.

FR-4. As a fixed point theory researcher, I want the review to summarize the differences among the articles, so that I can distinguish the genuine contributions and divergent assumptions of each work.

3.2 Metric and Topological Space Foundations

FR-5. As a fixed point theory researcher, I want the synthesis to capture the definition of a b-metric space (with parameter s ≥ 1 and the axioms d(x,y)=0 iff x=y, d(x,y)=d(y,x), and d(x,y) ≤ s[d(x,z)+d(z,y)]), so that the foundational space of the corpus is stated precisely.

FR-6. As a fixed point theory researcher, I want the synthesis to record that a b-metric reduces to an ordinary metric when s = 1, so that the relationship between b-metric and classical metric spaces is made explicit.

FR-7. As a fixed point theory researcher, I want the synthesis to capture the partially ordered b-metric space structure (a b-metric space equipped with a partial order\x20\xe2\xaa\xaf), so that ordering-based results are grounded.

FR-8. As a fixed point theory researcher, I want the synthesis to capture the definition and axioms of partial b-metric spaces (including the non-zero self-distance condition and the modified triangle inequality), so that partial-metric generalizations are represented.

FR-9. As a fixed point theory researcher, I want the synthesis to capture the definition of extended partial b-metric spaces and the role of the strictly increasing continuous comparison function Ω with Ω⁻¹(t) ≤ t ≤ Ω(t), so that the extension mechanism is documented.

FR-10. As a fixed point theory researcher, I want the synthesis to capture the definition of quasi partial b-metric spaces, so that the antecedent of the extended quasi partial construction is preserved.

FR-11. As a fixed point theory researcher, I want the synthesis to capture the definition of the extended quasi partial b-metric space and its axiom set, so that the newest space type in the corpus is stated exactly.

FR-12. As a fixed point theory researcher, I want the synthesis to record, for more concepts such as b-convergence, the topological notions of b-convergence, b-Cauchy sequence, b-completeness, and b-closed set, so that the analytic scaffolding of the results is preserved.

FR-13. As a fixed point theory researcher, I want the synthesis to record the simple lemma about b-convergent sequences given by 1/s²·d(x,y) ≤ liminf d(x\xe2\x82\x99,y\xe2\x82\x99) ≤ limsup d(x\xe2\x82\x99,y\xe2\x82\x99) ≤ s²·d(x,y), so that the key technical device used in the proofs is captured.

FR-14. As an applied mathematician, I want the synthesis to record which space types are equipped with concrete example constructions (e.g., R² with L1 and Euclidean norms, C([a,b],R) function spaces, Lebesgue-measurable function spaces), so that I can see how each abstraction is instantiated.

FR-15. As a fixed point theory researcher, I want the synthesis to document that, given a metric space (X,d) and p > 1, the function ρ(x,y) = (d(x,y))\xe1\xb5\x96 is a b-metric with s = 2\xe1\xb5\x96⁻¹, so that the standard example of a b-metric that is not a metric is preserved.

FR-16. As a fixed point theory researcher, I want the synthesis to record that the leading example of a b-metric (real line with ρ(x,y) = |x−y|², s = 2) is not a metric, and that a b-metric need not be continuous, so that the structural nuance of the space class is preserved.

3.3 Contraction Classes and Control Functions

FR-17. As a fixed point theory researcher, I want the synthesis to capture the almost generalized (ψ,φ,θ)-contractive mapping definition, including the M_{s,T,g}(x,y,u,v) and N_{T,g}(x,y,u,v) max/min expressions and the constant L ≥ 0, so that the Aghajani–Arab contractive condition is preserved.

FR-18. As a fixed point theory researcher, I want the synthesis to capture the almost generalized (ψ,ϕ,L)-contractive mapping definition used for coincidence and common fixed point results, so that the Allahyari–Arab–Haghighi condition is preserved.

FR-19. As a fixed point theory researcher, I want the synthesis to capture the almost generalized (ψ,L)-contractive mapping and almost generalized (ψ,θ)-contractive mapping definitions, so that the Huang–Radenović–Vujaković refinements are preserved.

FR-20. As a fixed point theory researcher, I want the synthesis to capture the weak contraction definition d(fx,fy) ≤ d(x,y) − φ(d(x,y)), so that the classical weak-contraction baseline is established.

FR-21. As a fixed point theory researcher, I want the synthesis to capture the Banach contraction principle as the historical origin generalized by all five articles, so that the through-line of the corpus is visible.

FR-22. As a fixed point theory researcher, I want the synthesis to capture the family of functions ψ (continuous, non-decreasing, ψ(t)=0 iff t=0, i.e., the altering distance function), so that the control-function baseline is stated.

FR-23. As a fixed point theory researcher, I want the synthesis to capture the family of functions φ (lower semi-continuous, φ(t)=0 iff t=0), so that the comparative control-function class is stated.

FR-24. As a fixed point theory researcher, I want the synthesis to capture the family of functions θ (continuous, θ(t)=0 iff t=0), so that the θ-term appearing in the (ψ,φ,θ) condition is documented.

FR-25. As a fixed point theory researcher, I want the synthesis to capture the family of functions ϕ (right-continuous, non-decreasing, ϕ(t) < t for t > 0), so that the alternative control-function class used in the weak-contraction articles is documented.

FR-26. As a fixed point theory researcher, I want the synthesis to capture the class of functions γ (non-decreasing, (γ(t))\xe1\xb5\x96 ≤ γ(t\xe1\xb5\x96) for p ≥ 1, and expressible as γ(t) = t − φ(t)), together with examples γ₁(t) = kt (0 ≤ k < 1) and γ₂(t) = t/(t+1), so that the application-side control class is documented.

FR-27. As a fixed point theory researcher, I want the synthesis to capture the pair of control functions (ψ, ϕ) and the notion that ψ, ϕ are called control functions, so that the terminology is preserved.

FR-28. As a fixed point theory researcher, I want the synthesis to record the historical origin of the weak contraction (introduced by Alber and Guerre-Delabrere in Hilbert spaces in 1997, and shown by Rhoades to hold in complete metric spaces), so that the provenance of the weak-contraction framework is documented.

3.4 Structural Properties and Mapping Relationships

FR-29. As a fixed point theory researcher, I want the synthesis to capture the mixed g-monotone property (F non-decreasing g-monotone in its first argument and non-increasing g-monotone in its second argument), so that the structural condition enabling coupled results is preserved.

FR-30. As a fixed point theory researcher, I want the synthesis to capture the mixed monotone property as the special case of the mixed g-monotone property when g is the identity mapping, so that the relationship between the two is clear.

FR-31. As a fixed point theory researcher, I want the synthesis to capture the definition of g-nondecreasing mappings, so that the monotonicity condition for single-mapping results is documented.

FR-32. As a fixed point theory researcher, I want the synthesis to capture the commutativity condition F(gx,gy) = g(F(x,y)) relating a mapping F and a mapping g, so that the commutativity assumption is preserved.

FR-33. As a fixed point theory researcher, I want the synthesis to capture the compatibility condition (limit of d(g(F(x\xe2\x82\x99,y\xe2\x82\x99)), F(gx\xe2\x82\x99,gy\xe2\x82\x99)) = 0), so that the compatibility assumption is preserved.

FR-34. As a fixed point theory researcher, I want the synthesis to capture the weak compatibility condition (f and g commute at their coincidence points), so that the weakened hypothesis used in later articles is documented.

FR-35. As a fixed point theory researcher, I want the synthesis to capture the notions of a weakly increasing pair, a partially weakly increasing pair, and a pair that is weakly increasing with respect to h or partially weakly increasing with respect to h, so that the ordering-based structural hypotheses are preserved.

FR-36. As a fixed point theory researcher, I want the synthesis to capture the notion of g-weakly isotone increasing mappings (fx\x20\xe2\xaa\xaf gfx\x20\xe2\xaa\xaf fgfx), so that the isotone-increase condition is preserved.

FR-37. As a fixed point theory researcher, I want the synthesis to capture the regularity condition of a partially ordered b-metric space (monotone sequences converge to comparable limits), so that the alternative-to-continuity hypothesis is documented.

FR-38. As a fixed point theory researcher, I want the synthesis to capture the orbit O(u\xe2\x82\x80) = {u\xe2\x82\x80, T²u\xe2\x82\x80, T³u\xe2\x82\x80, …} and the notion of the iterative sequence u\xe2\x82\x99 = Tⁿu\xe2\x82\x80, so that the iterative framework of the newest space is documented.

3.5 Fixed Point Result Families

FR-39. As a fixed point theory researcher, I want the synthesis to capture the definition of a fixed point, so that the central object of the corpus is stated.

FR-40. As a fixed point theory researcher, I want the synthesis to capture the definition of a common fixed point of a mapping F : X×X → X and a mapping g : X → X (F(x,x) = gx = x), so that the multi-mapping terminology is preserved.

FR-41. As a fixed point theory researcher, I want the synthesis to capture the definition of a coincidence point, so that single-mapping coincidence results are represented.

FR-42. As a fixed point theory researcher, I want the synthesis to capture the definition of a coupled coincidence point (F(x,y)=gx and F(y,x)=gy), so that the coupled framework is represented.

FR-43. As a fixed point theory researcher, I want the synthesis to capture the definition of a coupled fixed point as the identity-mapping special case of a coupled coincidence point, so that the relationship is clear.

FR-44. As a fixed point theory researcher, I want the synthesis to capture the definition of a coupled common fixed point, so that the strongest coupled-result object is represented.

FR-45. As a fixed point theory researcher, I want the synthesis to capture the existence theorems for coupled coincidence points in partially ordered complete b-metric spaces, so that the main existence results are preserved.

FR-46. As a fixed point theory researcher, I want the synthesis to capture the existence theorems for coincidence points and common fixed points for single-mapping (ψ,ϕ,L) and (ψ,L) conditions, so that the single-mapping results are preserved.

FR-47. As a fixed point theory researcher, I want the synthesis to capture the generalization on the Banach fixed point theorem (Theorem 3.1 of Shah et al.) establishing that p_Ω(Tu,Tv) ≤ λ p_Ω(u,v) with 0 ≤ λ < 1 yields a unique fixed point, so that the newest space's contraction result is preserved.

FR-48. As a fixed point theory researcher, I want the synthesis to capture the corollary for the iterate Tⁿ satisfying p_Ω(Tⁿu, Tⁿv) ≤ λ p_Ω(u,v), so that the iterate version is documented.

FR-49. As a fixed point theory researcher, I want the synthesis to capture the series-convergence equivalence results relating the existence of φ : Y → R\xe2\x81\xba with p_Ω(u,Tu) ≤ φ(u) − φ(Tu) to convergence of Σ p_Ω(Tⁿu, T^{n+1}u), both for all u ∈ Y and for all u ∈ O(u), so that the summability characterization is preserved.

FR-50. As a fixed point theory researcher, I want the synthesis to capture the orbital convergence and orbitally-lower-semi-continuous results (existence of lim Tⁿu = w, and Tw = w iff G(u)=p_Ω(u,Tu) is T-orbitally lower semi-continuous at u), so that the iterative and semi-continuity results are documented.

FR-51. As a fixed point theory researcher, I want the synthesis to capture the corollary with Y = Y₁, R = I and c = 1, as well as the corollary with 0 < k < 1 under p_Ω(Tv, T²v) ≤ k p_Ω(v, Tv), so that the reduced forms of the orbital results are preserved.

FR-52. As a fixed point theory researcher, I want the synthesis to capture the corollaries derived by taking g = I_X (the identity mapping), and let f, g : X → X be two mappings in the single-mapping coincidence-corollary setting, so that the specialization chain is documented.

FR-53. As a fixed point theory researcher, I want the synthesis to capture the uniqueness theorems and the comparability hypotheses (e.g., for every two points there exists a comparable third point) under which the coupled common fixed point or common fixed point is unique, so that uniqueness conditions are preserved.

FR-54. As a fixed point theory researcher, I want the synthesis to capture the theorem stating that if gx\xe2\x82\x80 and gy\xe2\x82\x80 are comparable, then the coupled common fixed point collapses to a single common fixed point (x = y), so that the reduction to the diagonal is documented.

FR-55. As a fixed point theory researcher, I want the synthesis to capture the results omitting the continuity assumption and replacing compatibility with weak compatibility, so that the hypothesis-weakening contributions are preserved.

FR-56. As a fixed point theory researcher, I want the synthesis to capture the fixed point theorem for nondecreasing single mappings under control functions ψ and ϕ, together with the corollaries specializing to s³d(Tx,Ty) ≤ φ(max{…}) and the control-function replacements ϕ(t) = λt (0 < λ < 1), so that the single-map corollaries are represented.

FR-57. As a fixed point theory researcher, I want the synthesis to capture the theorem establishing the equivalence between the (ψ,φ) formulation and the ϕ formulation d(F(x,y),F(u,v)) ≤ ϕ(max{d(gx,gu), d(gy,gv)}) when s = 1, so that the equivalence asserted among the frameworks is preserved.

3.6 Prior Results, Generalizations and the Rational Metric Space Lineage

FR-58. As a fixed point theory researcher, I want the synthesis to record that the generalizations of the Banach contraction principle are obtained via rational metric spaces, listing ordered Banach spaces, partially ordered metric spaces, 2-metric spaces, fuzzy metric spaces, probabilistic metric spaces, G-metric spaces, cone metric spaces, cone Banach spaces, b-metric spaces, and metric type spaces, so that the landscape of generalizations is documented.

FR-59. As a fixed point theory researcher, I want the synthesis to record that fixed point results in partially ordered metric spaces were first obtained by Ran and Reurings (2004) and then by Nieto and López, and together with applications to differential equations and matrix equations, so that the origin of ordered fixed point theory is documented.

FR-60. As a fixed point theory researcher, I want the synthesis to record that weakly contractive mappings in ordered spaces, together with applications to differential equations, were obtained by Harjani and Sadarangani, so that the immediate predecessors of the synthesis corpus are preserved.

FR-61. As a fixed point theory researcher, I want the synthesis to capture Zhang and Song's generalized ϕ-weak contraction for two mappings, and\x20\xc3\x90orić's extension using a pair of functions ψ and ϕ, so that the direct antecedents of the Radenović–Kadelburg results are preserved.

FR-62. As a fixed point theory researcher, I want the synthesis to capture the notions of (condition (B)) of Babu et al. and the almost generalized contractive condition for two maps (Ćirić et al.) and for four maps (Aghajani et al.), so that the provenance of the "almost generalized" family is preserved.

FR-63. As a fixed point theory researcher, I want the synthesis to capture the contribution of Berinde's almost contractions and Pacurar's sequences of almost contractions and fixed points in b-metric spaces, so that the almost-contraction lineage is documented.

FR-64. As a fixed point theory researcher, I want the synthesis to capture the introduction of b-metric spaces by Bakhtin (1989) and Czerwik, and the introduction of partial b-metric spaces by Shukla (2014), of extended b-metric spaces by Kamran (2017), of extended partial b-metric spaces by Parvaneh and Kadelburg, and of quasi partial b-metric spaces (2015), so that the evolution of the space types is documented.

FR-65. As a fixed point theory researcher, I want the synthesis to capture the result that each cone metric space over a normal cone has a b-metric structure (Khamsi), so that the cross-relationship with cone metrics is preserved.

FR-66. As a fixed point theory researcher, I want the synthesis to capture the generalization and improvement claims each article makes relative to prior results — e.g., Huang et al. generalizing Roshan et al. and Aghajani–Arab; Allahyari et al. generalizing Agarwal et al. and Ran–Reurings results — so that the contribution of each work is explicit.

FR-67. As a fixed point theory researcher, I want the synthesis to capture the specific methodological simplifications claimed (e.g., deletion of the redundant control function ϕ, removal of the −φ(M) term, replacement of the restricted constant ε = 3 by an arbitrary ε > 1, weakening of commutativity to compatibility, and proofs that no longer rely on the b-convergent-sequence lemma), so that the technical advances are recorded.

FR-68. As a fixed point theory researcher, I want the synthesis to capture the counterexamples and limitations (e.g., the four-point set X = {p,q,r,s} example showing that a theorem fails when M₁ is replaced by M₂), so that boundary conditions of the results are preserved.

FR-69. As a fixed point theory researcher, I want the synthesis to capture the cross-citation relationships showing which article generalizes which prior result, so that the lineage of results is traceable.

3.7 Applications to Integral Equations

FR-70. As an applied mathematician, I want the synthesis to capture the application to the nonlinear quadratic integral equation x(t) = h(t) + λ ∫\xe2\x82\x80¹ k₁(t,s) f₁(s,x(s)) ds · ∫\xe2\x82\x80¹ k₂(t,s) f₂(s,x(s)) ds, so that the quadratic-equation application is documented.

FR-71. As an applied mathematician, I want the synthesis to capture the full set of assumptions (a₁)–(a\xe2\x82\x87) placed on the quadratic integral equation (continuity, non-negativity, monotonicity of f₁ and f₂, boundedness of the kernels, Lipschitz-type conditions, the existence of α, β ∈ C(I), and the constant inequality max{L₁\xe1\xb5\x96, L₂\xe1\xb5\x96} λ\xe1\xb5\x96 K^{2p} ≤ 1/2^{3p−3}), so that the applicability conditions are preserved.

FR-72. As an applied mathematician, I want the synthesis to capture the single-integral version x(t) = h(t) + λ ∫\xe2\x82\x80¹ k(t,s) f(s,x(s)) ds with its assumptions (a₁)–(a\xe2\x82\x85) and the constant inequality L\xe1\xb5\x96 λ\xe1\xb5\x96 K\xe1\xb5\x96 ≤ 1/2^{3p−3}, so that the reduced quadratic application is preserved.

FR-73. As an applied mathematician, I want the synthesis to capture the transfer of the assumptions into an operator T : X → X or T : X × X → X (e.g., T(x,y)(t) = h(t) + λ ∫\xe2\x82\x80¹ k₁(t,s) f₁(s,x(s)) ds · ∫\xe2\x82\x80¹ k₂(t,s) f₂(s,y(s)) ds) shown to satisfy the mixed monotone property and the contractive condition, so that the proof-of-application mechanism is documented.

FR-74. As an applied mathematician, I want the synthesis to capture the application to the Volterra integral equation u(t) = ∫_a^t F(t,s,u(s)) ds + f(t), so that the Volterra-equation application is documented.

FR-75. As an applied mathematician, I want the synthesis to capture the Volterra application's Lipschitz-type condition F(t,s,u(s)) − F(t,s,v(s)) ≤ (3/4)(u(s) − v(s) + 1), so that the applicability conditions are preserved.

FR-76. As an applied mathematician, I want the synthesis to capture the treatment of the space X = C(I) of continuous functions with the supremum-based metric and the induced bp-metric d(x,y) = sup |x(t) − y(t)|\xe1\xb5\x96 (with s = 2^{p−1}), so that the functional-analytic setting of the applications is documented.

FR-77. As an applied mathematician, I want the synthesis to capture the partial order on C(I) (pointwise order) and on X×X ((x,y) ≤ (u,v)\x20\xe2\x9f\xba x ≤ u and y ≥ v), and the existence of comparable upper/lower bounds (max{x,u}, min{y,v}), so that the ordered structure of the applications is preserved.

FR-78. As an applied mathematician, I want the synthesis to capture each article's Theorem of application asserting the existence of a unique solution to the respective integral equation under its assumptions, so that the end-to-end application results are preserved.

FR-79. As an applied mathematician, I want the synthesis to capture the concrete worked example integral equations (e.g., the functional integral equation x(t) = t²/(1+t\xe2\x81\xb4) + (1/27)∫\xe2\x82\x80¹ e^{−s} sin(t) / (2(1+t)) · |x(s)|/(1+|x(s)|) ds, with h(t) = t²/(1+t\xe2\x81\xb4), k(t,s) = e^{−s}/(1+t), f(t,x) = sin(t)/2 · |x|/(1+|x|), α(t) = 3t²/(4(1+t\xe2\x81\xb4)), and verification that every p ≥ 1 satisfies the governing inequality), so that the applicability is demonstrably instantiated.

3.8 Examples, Validation and Provenance Documentation

FR-80. As a fixed point theory researcher, I want the synthesis to capture the illustrative examples provided in each article to validate its definitions and theorems, including the specific examples constructed to show that the following example shows the superiority or necessity of the obtained conditions, so that the supporting evidence is documented.

FR-81. As a fixed point theory researcher, I want the synthesis to capture the Introduction and preliminaries sections of each article as the source of definitions, notations, and recalled results, so that the document structure of the source material is traceable to the synthesized requirements.

FR-82. As a fixed point theory researcher, I want the synthesis to capture the Mathematics Subject Classification (MSC) codes reported by each article (e.g., 47H10, 54H25, 37C25), so that the subject classification of each work is preserved.

FR-83. As a fixed point theory researcher, I want the synthesis to record the institutional affiliations of the authors (e.g., Department of Mathematics, Karaj Branch, Islamic Azad University; Department of Mathematics, Sari Branch, Islamic Azad University; University of Belgrade; Hubei Normal University; Dong Thap University; University of Pristina; Kohsar University Murree; Mashhad Branch, Islamic Azad University; Alborz), so that the provenance of each article is documented.

FR-84. As a fixed point theory researcher, I want the synthesis to record the publication venue, article type (Research), and table of contents of each article (e.g., Contents lists available at ScienceDirect; Fixed Point Theory and Applications; Journal of Inequalities and Applications; Computers and Mathematics with Applications), so that the bibliographic provenance is traceable.

FR-85. As a fixed point theory researcher, I want the synthesis to record the source articles' provenance and standard academic front-matter and back-matter declarations — the Research article designation, the Competing interests declarations, the Authors' contributions statements, the Received/Accepted/Published dates, the Acknowledgements, and the copyright and licensing statements (including the restrictions on reproduction, distribution, sale, licensing, and posting to third-party websites) — solely as bibliographic provenance metadata, so that the source material is traceable without reproducing such boilerplate as substantive requirements.

4. User Personas

Persona 1 — Fixed Point Theory Researcher (Expert Panel Member). A mathematician with an active research program in fixed point theory and generalized metric spaces. This persona reviews the five articles, verifies the correctness and novelty of each result, and produces the comparative synthesis. Their visible material is the full corpus of definitions, theorems, proof techniques, prior-result lineage, and generalization claims. Their accepted workflow is: read each article → classify its space and contraction type → extract theorem families → compare → synthesize common points and differences.

Persona 2 — Applied Mathematician (Reader). A mathematician interested primarily in the existence and uniqueness of solutions to nonlinear quadratic and Volterra integral equations. This persona consumes the synthesis to identify which fixed point theorem supports which integral-equation result, and under which assumptions. Their visible material is the application sections, the assumption sets (a₁)–(a\xe2\x82\x87) and (a₁)–(a\xe2\x82\x85) and the Volterra condition, and the resulting existence theorems. Their accepted workflow is: locate the integral equation of interest → identify the supporting theorem → check the assumptions.

5. Core User Flows

Flow A — Expert-Panel Comparative Review (Persona 1)

1. The reviewer collects all five articles into the corpus.
2. The reviewer extracts each article's foundational space definition and axioms (b-metric, partial b-metric, extended partial b-metric, quasi partial b-metric, extended quasi partial b-metric, partially ordered variants).
3. The reviewer extracts each article's contraction class and control-function families (ψ, φ, θ, ϕ, γ).
4. The reviewer extracts each article's structural properties (mixed g-monotone, g-nondecreasing, commutativity, compatibility, weak compatibility, weakly increasing, weakly isotone increasing) and result families (fixed point, coincidence, coupled coincidence, coupled fixed point, coupled common fixed point, common fixed point, uniqueness).
5. The reviewer extracts each article's proof devices and lemmas (e.g., the b-convergent-sequence lemma, use or avoidance of control functions, the rational-metric-space lineage).
6. The reviewer extracts each article's applications and worked examples.
7. The reviewer assembles the common-points summary.
8. The reviewer assembles the differences summary.
9. The reviewer verifies that every named capability and result family from every article appears in the synthesis.

Flow B — Application Lookup (Persona 2)

1. The applied reader identifies the target integral equation type (quadratic or Volterra).
2. The reader locates the corresponding application section in the article(s) that treat it.
3. The reader checks the assumption set the theorem requires (continuity, non-negativity, monotonicity, kernel boundedness, Lipschitz conditions, and the governing constant inequality).
4. The reader confirms which fixed point theorem (and which space type) certifies the existence/uniqueness of the solution.
5. The reader records the conclusion and the constraints on the parameters (λ, K, L, p, and the interval length).

Flow C — Prior-Result Lineage Trace (Persona 1)

1. The reviewer selects a result family (e.g., coincidence points or almost generalized contractions).
2. The reviewer traces its antecedents (Banach; Alber–Guerre-Delabrere; Rhoades; Ran–Reurings; Nieto–López; Harjani–Sadarangani; Zhang–Song;\x20\xc3\x90orić; Berinde;\x20\xc4\x86irić et al.; Babu et al.; Aghajani et al.).
3. The reviewer records how the corpus articles generalize, improve, or simplify each antecedent.
4. The reviewer records any counterexamples that bound the applicability of the prior or new results.

6. Visuals Colors and Theme

The visual presentation follows the project-wide creative direction: Swiss grid rigour for a comparative synthesis of fixed point theory, after the muse of Josef Müller-Brockmann. The register is rigorous, almost architectural clarity: a visible modular grid, strict typographic hierarchy, and geometric forms that turn abstract structure into something readable, with no decorative motion so that attention stays on the mathematics. The generic indigo/blue-on-white SaaS template is forbidden for this project.

• Palette (light mode). Background #F4F4F1 (warm paper-white ground), surface #FFFFFF (pure white for definition boxes and theorem panels), text #111111, primary #111111, accent #E63329 (pure red), muted #8A8A85. Black carries all primary type and rules. The single red signal colour marks article identity, the active comparison axis, and key theorem labels. A second coded accent appears only in the comparison matrix: pure blue #1D4ED8 and pure yellow #F2C200 for the two remaining article codes, used as flat fills or thin rules — never as gradients. Muted grey is reserved for metadata, citations, and secondary labels. Proportion: 70% ground/surface, 22% black type and rules, 6% red, 2% blue/yellow coded accents.
• Typography. Headings in Archivo (medium and semibold), flush-left ragged-right, tight tracking (−0.02em), sized large enough to act as structural signage. Article titles and section numbers are set in uppercase with wide tracking (+0.08em) as small-caps-like labels. No italics for headings; hierarchy comes from size and weight alone. Body in Source Serif 4. Scale: 1.25 modular with a 1.5 display step — 64/48/32/24/18/16/14. Display sizes 64 and 48 are reserved for the page title and the five article headings; body sits at 18/16 with 1.6 line-height; metadata and figure captions at 14 uppercase. Inter, Roboto, Arial, Helvetica, Open Sans, Lato, Poppins, and system-ui are forbidden for headings and body.
• Shape language. Hard-edged and geometric. No border radius anywhere — corners are square. Definition and theorem panels are bounded by a single 1px black rule on the left and a hairline top rule, or by a full 1px black box for the most important axioms. Colour-coded article markers are perfect circles 12px in diameter, used as flat dots beside article names. Comparison matrix cells are separated by 1px black grid lines. Diagrams use circles, squares, and straight connectors only; curves appear only when they represent a mathematical curve (e.g. the Ω function), never as decoration. No drop shadows, glassmorphism, gradient blobs, or floating card grids; icons use geometric line symbols only.
• Layout. A strict 12-column modular grid with a 24px gutter and generous 96px outer margins on desktop. The page opens with a full-width title block, then a five-column article index where each article occupies one column with its colour dot, title, and one-line scope. The synthesis is organised as a vertical sequence of full-width sections: Foundational Spaces, Topological Notions, Contraction Classes, Structural Properties, Fixed Point Results. Within each section, a two-column split places the shared points on the left (black type, no colour) and the differences on the right (colour-coded by article). A comparison matrix at the end uses the full grid width with articles as columns and concepts as rows, with black 1px rules throughout. No centred text except the page title; everything else is flush-left on the grid.
• Comparison presentation. Common points and differences are presented as structured tables and paired columns, with cross-article rows keyed by paper so that divergence is visually immediate.
• Formula treatment. All mathematical expressions are typeset as proper mathematical notation (not plain text), displayed for theorems and inline for references, in a consistent rendering engine.
• Imagery. No photography. The visual language is diagrammatic: a large geometric diagram of the space hierarchy (b-metric → partially ordered b-metric → partial b-metric → extended partial b-metric → quasi partial b-metric → extended quasi partial b-metric) drawn with circles and straight connectors; a small function plot for Ω(t) showing Ω⁻¹(t) ≤ t ≤ Ω(t); schematic diagrams for the contraction classes showing the mapping relationships. All diagrams are drawn in black with red for the active path and the coded article colours for attribution. Typography itself is treated as image in the title block, where the project name is set at 64px across the full grid width.

6.1 Landing Hero Motion Brief

Motion tempo: restrained; hero dimensionality: flat; hero drama: bold. The hero is a full-viewport title block on the warm paper-white ground, not centred, and it could not be mistaken for a SaaS hero: the project name 'FIXED POINT THEORY' is set in Archivo semibold at 64px flush-left on the grid, occupying columns 1–8, with the subtitle 'A comparative synthesis of five articles on b-metric and partial b-metric spaces' set in Source Serif 4 at 24px directly beneath it in columns 1–6. To the right, in columns 9–12, a vertical stack of five perfect 12px colour dots (red, blue, yellow, black, muted grey) each paired with its article title in 14px uppercase tracked Archivo. A single 1px black horizontal rule spans the full grid width beneath the entire block. There is no button, no image, no gradient — the composition is type, rule, and colour dots.

• Input → transformation → outcome thesis. The reader's arrival at the top of the document (input) is answered by a single contained, restrained loop that draws the five article dots and the full-width rule into place and settles the title block (transformation), so the first frame reads as a composed poster of the corpus rather than a landing page (outcome).
• Focal subject. The 64px flush-left title 'FIXED POINT THEORY' spanning columns 1–8, with the five-dot colour-coded article index stacked in columns 9–12 on the same baseline.
• Visible layers. (1) Paper-white ground #F4F4F1; (2) the title and subtitle type block; (3) the five 12px colour dots with their 14px uppercase tracked article labels; (4) the single 1px black full-grid rule; (5) the thin red progress rule pinned to the top of the viewport that tracks reading position through the synthesis.
• Loop. One contained loop at restrained tempo: the five dots fade in sequentially in article order (red, blue, yellow, black, muted grey) at roughly 120ms apart, the 1px black rule draws left-to-right across the full grid width, and the title block settles with a 200ms opacity fade and a 4px upward shift. The loop then holds; it does not repeat on its own.
• Composed first frame. Title, subtitle, five dots with labels, and the full-width rule all present and legible before any motion runs, so the hero is complete without animation.
• Optional interaction. Hovering an article dot and its label applies a flat red left rule at 120ms and reveals the article's one-line scope; anchor navigation scrolls smoothly but without easing theatrics.
• Responsive behavior. On narrow viewports the title block reflows to full grid width, the five-dot article index moves beneath the subtitle as a single flush-left column, and the 1px rule remains full-width; no centred text is introduced.
• Reduced-motion fallback. Under prefers-reduced-motion the hero renders its composed first frame immediately with no fade, no shift, and no sequential dot reveal; the red progress rule remains as a static reading-position indicator.
• Implementation. A product-specific 2D DOM/SVG/CSS composition in the direction's motion vocabulary, implemented with Motion for React (motion/react) or GSAP. No Canvas, WebGL, R3F, or Drei is required, and no 3D scene brief applies because the hero dimensionality is flat.

6.2 Signature Moves

• A full-width 64px flush-left title in Archivo semibold that spans columns 1–8, with a five-dot colour-coded article index stacked in columns 9–12 on the same baseline — the title block reads as a poster, not a landing page.
• A comparison matrix at the end of the synthesis where rows are concepts (b-metric axioms, b-convergence, (ψ,ϕ)-contractions, coupled coincidence points) and columns are the five articles, separated by 1px black rules, with each cell containing a short phrase and a colour-coded dot for attribution.
• Definition and theorem panels bounded by a single 1px black left rule and a hairline top rule, with the theorem number set in red Archivo uppercase at 14px tracked +0.08em, and the statement in Source Serif 4 at 18px — no background fill, no shadow, no radius.
• A geometric space-hierarchy diagram drawn with black circles and straight connectors, with the active space highlighted by a red path that animates in on scroll, and each space labelled in 14px uppercase Archivo.
• A thin red progress rule pinned to the top of the viewport that tracks reading position through the synthesis, with section anchors in the left margin set in 14px uppercase Archivo with wide tracking.

7. Signature Design Concept

"The Contractive Framework Map." The synthesis is anchored by a single master comparison artifact: a matrix whose rows are the five articles and whose columns are the dimensions of comparison — Space Type, Contraction Class, Control Functions, Mapping Count, Result Family, Additional Hypotheses, Proof Devices, Prior Results Extended, and Integral-Equation Application. This matrix is the signature element: every narrative common-points or differences statement is directly traceable to a cell in the matrix, and the matrix visually reveals the progression from ordered metric spaces, through b-metric and partially ordered b-metric spaces, to extended quasi partial b-metric spaces. The concept enforces the anti-collapsing requirement by making each article's distinct capabilities an explicit, non-mergeable cell.

8. Interaction Model & Motion Direction

The interaction model for this static research-report deliverable is document-oriented, with no runtime application behavior:

• Non-linear navigation. Table-of-contents anchors, cross-references between a theorem and its corollary, and bidirectional links between each common point/difference and the supporting article.
• Comparison drill-down. From any row of the Contractive Framework Map, the reader can expand the corresponding theorem statements and assumptions of the specific article.
• Lineage drill-down. From any result family, the reader can expand the chain of prior results that the article generalizes.
• Honest, minimal motion. Because the deliverable is a static document, motion is limited to lightweight affordances only if rendered interactively: subtle highlighting of the active comparison row and smooth in-document scrolling. There is no animated transition logic, no stateful UI, and no motion that obscures mathematical content.
• Typography-first feedback. Emphasis is conveyed through weight, rule lines, and label styling rather than motion.

9. Non-Functional Requirements

• NFR-1 — Mathematical fidelity. Every definition, axiom, inequality, and theorem statement must match the source articles exactly; symbolic expressions must render without ambiguity.
• NFR-2 — Completeness. Every named capability, theorem family, corollary, definition, control-function family, structural property, prior result, example, and application from all five articles must appear in the synthesis as a distinct item.
• NFR-3 — Non-collapsing comparison. No sub-capability from the source material may be merged into a vague umbrella statement; each remains individually traceable.
• NFR-4 — Readability. The synthesis must be readable by both theoretical and applied mathematicians, with consistent notation and clearly separated theorem/definition/remark blocks.
• NFR-5 — Citation integrity. Each synthesized claim must be attributable to its source article.
• NFR-6 — Accessibility of mathematics. Rendered formulas must remain legible in the output format (display and inline), including in print.
• NFR-7 — Reproducibility. The comparison structure (the Contractive Framework Map) must be deterministic, so that re-running the synthesis over the same corpus yields the same classification.
• NFR-8 — Delivery shape. The deliverable is a static, provider-owned research report; it must not acquire runtime services (no live API, database, or user session) that the document does not require.
• NFR-9 — Provenance metadata compliance. Bibliographic provenance metadata (journal, MSC codes, affiliations, article type, dates, and licensing/declaration statements) is captured as metadata only and must not be elevated into substantive functional requirements or reproduced as product features.

10. Tech Stack

The accepted delivery shape is a static academic research report. Only the layers that this shape actually requires are specified; no application, service, or data layers are introduced.

• Authoring format. Markdown (or LaTeX) source for the report body and structured tables.
• Mathematical typesetting. Mathematical notation rendered via KaTeX (for HTML output) and standard LaTeX math environments (for PDF output).
• Typesetting engine. LaTeX for the print/PDF rendition, using theorem-, definition-, lemma-, corollary-, and remark-style environments.
• Bibliography management. BibTeX-based reference handling to attribute every claim to its source article.
• Output formats. PDF (primary, print-grade) and a linked HTML rendition (secondary) for cross-referenced navigation.
• No server, database, identity, or administration layer. The deliverable is a document; none of these layers are required and none are specified.

11. Assumptions and Constraints

• A-1. The corpus consists of exactly the five supplied articles; the synthesis is scoped to them and does not extend to external literature except where the articles themselves cite prior results (such as Alber–Guerre-Delabrere, Rhoades, Ran–Reurings, Nieto–López, Harjani–Sadarangani, Zhang–Song,\x20\xc3\x90orić, Berinde,\x20\xc4\x86irić et al., Babu et al.).
• A-2. The request is interpreted as producing a comparative synthesis (common points and differences), not as re-proving any theorem.
• A-3. Mathematical terminology and notation from the sources are preserved verbatim in meaning, even where different articles use related but distinct symbols (e.g., φ in one framework versus ϕ in another).
• C-1. Each article uses a distinct-but-overlapping generalization of metric spaces; the synthesis must keep these distinct rather than assuming a single unified framework.
• C-2. The control-function families differ across articles (ψ, φ, θ in Aghajani–Arab and Huang et al.; ψ, ϕ in Allahyari et al. and Radenović–Kadelburg; ψ alone in the Huang (ψ,L) result; Ω in Shah et al.); these must not be collapsed.
• C-3. Applications are of two distinct kinds (nonlinear quadratic integral equations versus Volterra integral equations) and must not be merged.
• C-4. Some articles claim improvements by removing hypotheses or control functions and by altering proof technique; these claims are part of the required content.
• C-5. The deliverable contains no legal boilerplate, author contribution statements, funding acknowledgements, or publisher copyright text reproduced as substantive requirements; such front-matter and back-matter (including Research designation, Competing interests, Authors' contributions, dates, Acknowledgements, and copyright/licensing statements) is recorded only as provenance metadata.
• C-6. The constant inequalities governing the integral-equation applications (e.g., max{L₁\xe1\xb5\x96, L₂\xe1\xb5\x96} λ\xe1\xb5\x96 K^{2p} ≤ 1/2^{3p−3}, and L\xe1\xb5\x96 λ\xe1\xb5\x96 K\xe1\xb5\x96 ≤ 1/2^{3p−3}) are constraints on applicability and must be preserved exactly.

12. Glossary

• b-metric space. A set X with a function d : X×X → R\xe2\x81\xba satisfying d(x,y)=0 iff x=y, symmetry, and the relaxed triangle inequality d(x,y) ≤ s[d(x,z)+d(z,y)] for some s ≥ 1.
• Partially ordered b-metric space. A b-metric space (X,d) equipped with a partial order\x20\xe2\xaa\xaf.
• Extended b-metric space. A b-metric generalization in which the triangle inequality is scaled by a function θ(u,w) ≥ 0.
• Partial b-metric space. A space admitting non-zero self-distance d(u,u), with the modified triangle inequality d(u,v) ≤ α[d(u,w)+d(w,v)−d(w,w)].
• Quasi partial b-metric space. A partial b-metric variant with quasi-metric asymmetry conditions and the inequality qpb(u,v) ≤ s[qpb(u,w)+qpb(v,w)] − qpb(w,w).
• Extended partial b-metric (partial p-metric). A space defined through p and Ω satisfying the four extended-partial axioms with Ω⁻¹(t) ≤ t ≤ Ω(t).
• Extended quasi partial b-metric space. The generalization defined by p_Ω on Y satisfying (1) u=v iff p_Ω(u,u)=p_Ω(u,v)=p_Ω(v,v), (2) p_Ω(u,u) ≤ p_Ω(u,v), and (3) p_Ω(u,v) ≤ Ω(p_Ω(u,w)+p_Ω(w,v)−p_Ω(w,w)−p_Ω(u,u)), where Ω is strictly increasing, continuous, with Ω⁻¹(t) ≤ t ≤ Ω(t).
• Altering distance function. A non-decreasing, continuous ψ : [0,∞)→[0,∞) with ψ(t)=0 iff t=0.
• Control functions. The function families ψ, φ, θ, ϕ, γ used to modulate the contractive inequalities.
• (ψ,φ,θ)-contractive mapping. A mapping T : X×X → X satisfying ψ(s³d(T(x,y),T(u,v))) ≤ ψ(M) − φ(M) + Lθ(N) for comparable arguments.
• Almost generalized (ψ,ϕ,L)-contractive mapping. A single-mapping condition ψ(s³d(Tx,Ty)) ≤ ϕ(ψ(M(x,y))) + Lψ(N(x,y)) for gx ≤ gy.
• Almost generalized (ψ,L)-contractive mapping. A single-mapping condition ψ(s^ε d(Tx,Ty)) ≤ ψ(M(x,y)) + Lψ(N(x,y)) for gx\x20\xe2\xaa\xaf gy, with ε > 1.
• Mixed g-monotone property. F is non-decreasing g-monotone in its first argument and non-increasing g-monotone in its second.
• Mixed monotone property. The mixed g-monotone property with g the identity mapping.
• g-nondecreasing mapping. T with gx ≤ gy\x20\xe2\x9f\xb9 Tx ≤ Ty.
• Commutative mappings. F(gx,gy) = g(F(x,y)) for all x, y.
• Compatible pair. (F,g) such that lim d(g(F(x\xe2\x82\x99,y\xe2\x82\x99)), F(gx\xe2\x82\x99,gy\xe2\x82\x99)) = 0 for the relevant sequences.
• Weakly compatible pair. f and g commute at their coincidence points.
• Weakly increasing pair. (f,g) with fx\x20\xe2\xaa\xaf gfx and gx\x20\xe2\xaa\xaf fgx for all x.
• g-weakly isotone increasing. f with fx\x20\xe2\xaa\xaf gfx\x20\xe2\xaa\xaf fgfx for all x.
• Regular ordered space. A partially ordered b-metric space in which nondecreasing sequences converging to x satisfy x\xe2\x82\x99\x20\xe2\xaa\xaf x, and nonincreasing sequences converging to y satisfy y\xe2\x82\x99\x20\xe2\xaa\xb0 y.
• Fixed point. An x with Tx = x.
• Coincidence point. An x with Tx = gx.
• Common fixed point. For F : X×X→X and g : X→X, an x with F(x,x) = gx = x.
• Coupled coincidence point. A pair (x,y) with F(x,y) = gx and F(y,x) = gy.
• Coupled fixed point. A coupled coincidence point with g the identity mapping.
• Coupled common fixed point. A pair (x,y) with x = gx = T(x,y) and y = gy = T(y,x).
• b-convergence / b-Cauchy / b-complete / b-closed. Convergence, Cauchy, completeness, and closedness notions defined with respect to a b-metric.
• Nonlinear quadratic integral equation. The equation x(t) = h(t) + λ ∫\xe2\x82\x80¹ k₁(t,s)f₁(s,x(s))ds · ∫\xe2\x82\x80¹ k₂(t,s)f₂(s,x(s))ds.
• Volterra integral equation. The equation u(t) = ∫_a^t F(t,s,u(s))ds + f(t).
• Orbit O(u\xe2\x82\x80). The set {u\xe2\x82\x80, T²u\xe2\x82\x80, T³u\xe2\x82\x80, …} generated by iterating T.
• T-orbitally lower semi-continuous. A function G such that G(w) ≤ lim inf G(u\xe2\x82\x99) for every sequence u\xe2\x82\x99 in O(u) converging to w.
• Contractive Framework Map. The master comparison matrix of the synthesis (see Section 7).