Real numbers (R) in fixed point theory and matrix spaces with applications

Introduction Mathematical Foundation and Context

Real numbers form a fundamental structure in mathematics, underpinning a wide range of theories and applications. In the context of Fixed-point theory and matrix spaces, real numbers serve as the essential numerical framework that facilitates the rigorous study of mathematical phenomena. To fully appreciate their role, it is important to understand the mathematical properties of real numbers, how they influence fixed point theory, and their application in matrix spaces [20] .

Fixed Point Theory: Mathematical Perspective

Fixed point theory is concerned with identifying points x ∈ X in a space X such that for a given function f: X → X, the equation f(x) = x holds. In metric spaces, particularly those defined over real numbers, fixed point theorems like Banach's Contraction Principle provide necessary conditions for the existence and uniqueness of fixed points. The mathematical significance of fixed points lies in their stability properties, which are leveraged in solving differential equations, optimization problems, and even in iterative algorithms used in numerical analysis [6] .

Matrix Spaces: Handling Multidimensional Data

Let 𝑀 n × m (𝑅) denote the vector space of n × m matrices with real entries. Each element of 𝑀 n × m (𝑅) is a matrix 𝐴 = [𝑎 ij ] where 𝑎 ij ∈ 𝑅 for 𝑖 = 1,…, 𝑛 and 𝑗 = 1,…𝑚. Matrix spaces 𝑀 n × m (𝑅) provide a framework for the representation and manipulation of multidimensional data. These spaces are fundamental in linear algebra, functional analysis, and applied mathematics. The operations within matrix spaces, including matrix multiplication AB (where 𝐴 ∈ 𝑀 n × k (𝑅) and 𝐵 ∈ 𝑀 k × m (𝑅)), eigenvalue computation of square matrices 𝐴 ∈ 𝑀 n × n (𝑅), and transformation analysis, are deeply connected to the properties of real numbers 𝑅 [12] . We will discuss Banach fixed point theorem in metric spaces with complete normed spaces and related topics.

Banach Fixed Point Theorem in Metric Spaces

The Banach Fixed Point Theorem, also known as the Contraction Mapping Theorem, is a fundamental result in metric space theory and analysis, particularly in the context of complete normed spaces. It provides conditions under which a function, or mapping, has a unique fixed point. This theorem has wide-ranging applications in various fields, including numerical analysis, differential equations, and optimization [13] .

Metric Space

Let X be a non-empty set. A metric on X is a function d:X×X→R, which assigns a non-negative real number to each pair of points in X. This number represents the "distance" between the points, and the function d must satisfy the following properties for all x, y, z ∈ X: Non-negativity: d (x, y) ≥ 0. This property ensures that the distance between any two points is always non-negative. Identity of Indiscernible: d (x, y) = 0 if and only if x = y. This property states that the distance between two distinct points is positive, and the distance between a point and itself is zero [14] . Symmetry: d (x, y) = d (y, x). This ensures that the distance from x to y is the same as the distance from y to x. Triangle Inequality: d (x, y) ≤ d (x, z) + d (z, y) [8] . This property is essential in ensuring that the direct distance between two points is always less than or equal to the distance measured by taking a detour through a third point z. When a set X is equipped with a metric d, the pair (X, d) is called a metric space. This structure allows for the rigorous discussion of concepts like convergence, continuity, and compactness. In fixed point theory, real numbers play a crucial role, particularly in the context of metric spaces.

Convergence and Limit of a Sequence

In a metric space (X, d), a sequence {𝑥 𝑛 } is said to be convergent if there exists an element x ∈ X such that: lim 𝑛→∞ d (𝑥 𝑛 , x) = 0 Here, x is called the limit of the sequence {𝑥 𝑛 }, and we write this as lim 𝑛→∞ 𝑥 𝑛 = x. Intuitively, this means that as n increases, the elements of the sequence {𝑥 𝑛 } get arbitrarily close to x [20] .

Complete Metric Space

A metric space (X, d) is said to be complete if every Cauchy sequence in X converges to a point within X. A Cauchy sequence is a sequence {𝑥 𝑛 } in a metric space (X, d) such that for every ϵ > 0, there exists a positive integer N such that for all p, q > N, the distance d(𝑥 𝑝 , 𝑥 𝑞 ) < ϵ. This means that the elements of the sequence become arbitrarily close to each other as the sequence progresses [17] . The importance of completeness lies in the fact that it ensures the existence of limits within the space, which is a crucial property for various mathematical constructions and proofs.

Fixed Point

A fixed point of a mapping f: X → X is a point x ∈ X such that f(x) = x. In other words, applying the function 𝑓 to 𝑥 returns 𝑥 itself. The Banach Fixed Point Theorem states that if (X, d) is a complete metric space and f: X → X is a contraction mapping (i.e., there exists a constant c ∈ [0,1) such that d (f(x), f(y)) ≤ c⋅ d (x, y) for all x, y ∈ X), then 𝑓 has a unique fixed point in 𝑋. Moreover, the fixed point can be found as the limit of the sequence defined by 𝑥 𝑛 + 1 = 𝑥 𝑛 , starting from an arbitrary point 𝑥 0 ∈ X [1] .

Integrating Fixed Point Theory with Matrix Spaces

This research aims to bridge the mathematical theory of fixed points with the practical framework provided by matrix spaces, focusing on the role that real numbers play in this integration. Specifically, we investigate how real numbers contribute to defining and understanding fixed points within matrix spaces, examining key concepts such as: Contraction Mappings in Matrix Spaces: The role of real numbers in defining contraction mappings, which are critical in establishing fixed points [2,5] . Let (X, d) be a metric space, where 𝑋 is a set of matrices and d: X × X → R is a metric. A mapping T:X→X is a contraction mapping if there exists a constant c ∈ [0,1) such that:

where c is a constant such that 0 ≤ c < 1.

Here, the role of real numbers 𝑐 in defining the contraction is crucial in ensuring the existence and uniqueness of fixed points A * in 𝑋 such that T(A * ) = A * [18] . By focusing on these mathematical aspects, the research seeks to provide a comprehensive analysis of how real numbers facilitate the study and application of fixed-point theory within the context of matrix spaces. This integration not only enhances our understanding of these concepts but also offers practical tools for solving complex mathematical problems in various disciplines.

Statement of Problem

The intersection of fixed-point theory and matrix spaces, particularly through the framework of real numbers, introduces significant complexities. Investigating the existence and uniqueness of fixed points within matrix spaces demands an in-depth exploration of real numbers and their role in the behavior of iterative methods. This study tackles the issue of delineating the impact of real numbers on fixed-point theory within matrix spaces, examining how these characteristics can be applied in realworld scenarios. The core challenge lies in comprehending the influence of real numbers on fixed-point existence and uniqueness, with a focus on their application in iterative processes and mathematical modeling, thus addressing the intricate nature of fixed points in matrix spaces.

Objectives

The primary objectives of this research are:  To analyze the role of real numbers in fixed point theory and matrix spaces.  To establish conditions for the existence and uniqueness of fixed points in various matrix spaces.  To explore the Applications of real numbers in fixed point theory.  To apply the findings in mathematical modeling and numerical analysis.

Methodology

The methodology for this research combined theoretical analysis with practical applications to investigate fixed point theory within metric spaces. Theoretical foundations were established by defining the basic properties of metric spaces and exploring contraction mappings to determine conditions for the existence of unique fixed points. Key theoretical results were incorporated, such as the Archimedean property, which ensures that for any positive number and any real number, there is a natural number such that the product of these numbers exceeds the real number; the Bolzano-Weierstrass theorem, which guarantees that every bounded sequence in the real numbers has a convergent subsequence; the Intermediate Value Theorem, which asserts that for a continuous function on a closed interval, there is a point where the function attains any value between its values at the endpoints of the interval; the Mean Value Theorem, which provides insights into the behavior and rate of change of functions; and the Cauchy-Schwarz Inequality, used to evaluate the stability and convergence of iterative processes. Practical examples were then utilized to illustrate these theoretical concepts. For example, the fixed point for a specific function was computed, resulting in a particular value, and the fixed point of an operator in the matrix space was found to be zero. The research also applied iterative methods, such as successive approximations and the Newton-Raphson method, to solve equations. Successive approximations demonstrated convergence to a specific value, while the Newton-Raphson method achieved faster convergence to the same fixed point. The convergence and stability of these iterative methods were analyzed through both theoretical results and practical evidence, providing a comprehensive understanding of fixed point theory and its real-world applications.

Results

In this section, we present the main findings of our research, structured around the objectives.

Role of Real Numbers in Fixed Point Theory

Real numbers play a critical role in defining the metric spaces where fixed points are analyzed. We provide a detailed examination of the conditions under which real numbers ensure the existence and uniqueness of fixed points, particularly focusing on contraction mappings in matrix spaces [20,9] .

Completeness Axiom (Completeness Property)

Every non-empty subset S ⊆ R that is bounded above has a supremum sup s ∈ R [17] . Banach Fixed Point Theorem: In a complete metric space (X, d), if 𝑓: X → X is a contraction, then 𝑓 has a unique fixed point 𝑥 * ∈ 𝑋, where 𝑥 * = (𝑥 * ).

Mathematical Formulation: There exists a unique 𝑥 * ∈ 𝑋 such that f(𝑥 * ) =𝑥 * and d(f(x), f(y)) ≤ α d (x, y) with 0 ≤ 𝛼 < 1.

Archimedean Property

For x, y ∈ R with x > 0, there exists 𝑛 ∈ 𝑁 such that 𝑛𝑥 > 𝑦 [20] . Example 1: Fixed Point and Real Numbers in a Bounded Setting Problem: Verify that a function 𝑓 (𝑥) = 𝑥 2 has fixed points within finite bounds when considering 𝑥 greater than a certain positive value.

Given: Function: 𝑓 (𝑥) = 𝑥 2 , 𝑥 > 0 We need to ensure that for a natural number 𝑛, if 𝑛 ⋅ 𝑥 > 1, then the values are finite and computable Solution: Fixed Point Definition: A fixed point of a function (𝑥) is a value 𝑥 * such that 𝑓 (𝑥 * ) = 𝑥 * .

For 𝑓 (𝑥) = 𝑥 2 , we find fixed points by solving: 𝑥 2 = x Solving the Fixed-Point Equation: Rearrange the equation: 𝑥 2x = 0 Factorize: 𝑥 (𝑥 -1) = 0, So the solutions are: 𝑥 = 0 or 𝑥 = 1 The fixed points are 𝑥 = 0 and 𝑥 = 1. However, we are given 𝑥 > 0, so the relevant fixed point is 𝑥 = 1. Bounded Values Condition: We need to ensure that 𝑛 ⋅ 𝑥 > 1 for natural numbers 𝑛. For 𝑥 = 1: 𝑛 ⋅ 1 > 1 ⟹ 𝑛 > 1 So, if 𝑛 is any natural number greater than 1, the condition 𝑛 ⋅ 𝑥 > 1 is satisfied for 𝑥 = 1. Verification of Finite Bounds: To ensure that no "infinitely large" values distort the calculations, we verify that 𝑥 is bounded. In this case: 𝑥 = 1 is finite and within the bounds set by 𝑛 ⋅ 𝑥 > 1 for 𝑛 >1.

Therefore, the fixed point 𝑥 = 1 is finite and computable. The function 𝑓 (𝑥) = 𝑥 2 has a fixed point 𝑥 = 1 when 𝑥 > 0. The condition 𝑛 ⋅ 𝑥 > 1 for natural numbers 𝑛 >1 ensures that 𝑥 does not become infinitely large. Thus, the fixed point is within finite bounds and is valid within the given constraints.

Bolzano-Weierstrass Theorem

Every bounded sequence {𝑥 𝑛 } ⊆ 𝑅 has a convergent subsequence {𝑥 𝑛 𝑘 }with 𝑥 𝑛 𝑘 →𝐿 ∈ 𝑅 [9] . This theorem implies that if {𝑥 𝑛 } is a sequence generated by an iterative method in a complete metric space, there is a convergent subsequence {𝑥 𝑛 𝑘 } that converges to a fixed point 𝑥 * . Mathematically, this means For a sequence {𝑥 𝑛 } in a complete metric space, there exists 𝑥 * such that lim 𝑛→∞ 𝑑 (𝑥 𝑛 𝑘 , 𝑥 * ) = 0. where d is the metric on the space. with 𝑥 0 = 0. The sequence {𝑥 𝑛 } generated by this method is bounded and converges to the fixed point 𝑥 * = 1, demonstrating the Bolzano-Weierstrass Theorem's relevance in confirming the convergence to 𝑥 * .

Intermediate Value Theorem

If 𝑓: [𝑎, 𝑏] → 𝑅 is continuous and 𝐿∈ [(𝑎), (𝑏)], then there exists 𝑐 ∈ [𝑎, 𝑏] such that 𝑓(𝑐) = 𝐿 [4] . For a continuous function 𝑓, if (𝑎)and 𝑓(𝑏) are on opposite sides of 𝐿, then there exists 𝑐 ∈ [𝑎, 𝑏] such that 𝑓(𝑐) = 𝐿. Specifically, Specifically, if 𝑓 (𝑎) < 0 and 𝑓 (𝑏) > 0, then there exists 𝑐 ∈ [𝑎, 𝑏] such that 𝑓 (𝑐) = 0.

Example 3: Let 𝑓 (𝑥) = 𝑥 2 -2 on the interval [1, 2]. Since 𝑓 (1) = -1 and 𝑓 (2) = 2, and 0 ∈ [-1, 2], by the Intermediate Value Theorem, there exists 𝑐 ∈ [1, 2] such that 𝑓 (𝑐) = 0. Here, 𝑐 = √2 is a fixed point where 𝑓 (𝑐) = 0.

Mean Value Theorem

If 𝑓: [𝑎, 𝑏] → 𝑅 is continuous on [𝑎, 𝑏]and differentiable on (𝑎, 𝑏), then there exists

b -a [15] . The rate of change 𝑓′ (𝑐) = 0.5 at the fixed point 𝑥 * ≈ 0.88 indicates how rapidly the function 𝑓 (𝑥) = sin (𝑥) is changing around this fixed point. This information can be useful in optimization problems, particularly in understanding the behavior of 𝑓near the fixed point and refining 𝑥 * for optimal solutions. For example, if the rate of change is small, the function is changing slowly around the fixed point, which might suggest that 𝑥 * is a stable or nearly optimal point.

Rate of Change

Cauchy-Schwarz Inequality

For vectors 𝑢, in an inner product space, |⟨𝑢, 𝑣⟩| ≤ ∥𝑢∥ ∥𝑣∥ [4] . In an inner product space, |⟨𝑢, 𝑣 ⟩| ≤ ∥𝑢∥⋅∥𝑣∥ ensures stability in iterative algorithms [21] .

Example 5

Consider the iterative method for finding the fixed point of 𝑓 (𝑥) = ), where 𝑥 is the variable and the fixed point 𝑥 * is √2. Using the Cauchy-Schwarz inequality, we can analyze the stability and convergence of this method by bounding the inner product ⟨ 𝑥 𝑛 , 𝑥 n + 1 ⟩with the norms of 𝑥 𝑛 and 𝑥 n + 1 , ensuring that the iterates remain close to the fixed point √2.

Fixed Point Definition

Fixed point theory is concerned with identifying points x ∈ X in a space X such that for a given function f: X → X, the equation f(x) = x holds [3] .

Example 6

Consider the function f: R → R defined by: f(x) = We want to find a fixed point 𝑥 * such that f (𝑥 * ) = x.

Step 1: Set Up the Fixed-Point Equation The Fixed-point equation for this function is: f(x) = x. Substituting the definition of f(x):

Step 2: Solve for the Fixed Point To solve for x, first eliminate the fraction by multiplying both sides by 2: x + 3 = 2x. Now, rearrange the equation to isolate x: 3 = 2x -x, 3 = x. Thus, the fixed point is 𝑥 * =3.

Step 3: Verify the Fixed Point 𝑥 * = 3. To verify that is indeed a fixed point, substitute x=3 back into the function: f (3) =

Interpretation

In this example, the function

Metric Spaces and Fixed Points

A metric space (X, d) consists of a set X and a distance function d: X × X → R satisfying:

Non-negativity: d (x, y) ≥ 0 for all x, y ∈ X, and d (x, y) = 0 if and only if x = y. Symmetry: d (x, y) = d (y, x) for all x, y ∈ X.

Triangle Inequality: d (x, z) ≤ d (x, y) + d (y, z) for all x, y, z ∈ X.

A fixed point 𝑥 * of a function T: X → X satisfies: T (𝑥 * ) =𝑥 * [3], [1] . This means that applying the function 𝑇 to 𝑥 * leaves it unchanged.

Example 7

Consider 𝑋 = 𝑅, the set of real numbers, with the standard metric (distance function) 𝑑 (𝑥, 𝑦) = |𝑥 -𝑦|. Let 𝑇: 𝑅 → 𝑅 be the function defined as: 𝑇 (𝑥) =

Contraction Mappings

A mapping T: X → X is called a contraction mapping if there exists a constant α ∈ [0,1) such that: d (T(x), T(y)) ≤ α d (x, y) for all x, y ∈ X. The constant α and the metric d are defined using real numbers, which determine the extent to which T contracts distances [5,12] . Let's consider a mathematical example of a Contraction Mapping in a real number context using fixed point theory:

Example 8

Let 𝑋 = 𝑅 (the set of real numbers) and let the metric 𝑑 (𝑥, 𝑦) be the usual absolute difference:

Now, define a function 𝑇: 𝑅 → 𝑅 as:

We want to show that 𝑇 is a contraction mapping, and then use the Banach Fixed Point Theorem to find the fixed point of 𝑇.

Step 1: Show that 𝑇 is a contraction mapping. We need to find a constant 𝛼 ∈ [0, 1) such that for all 𝑥, 𝑦 ∈ 𝑅, the following inequality holds: , which is clearly in the interval [0, 1). Therefore, 𝑇 is a contraction mapping with contraction constant 𝛼 = Step 2: Apply the Banach Fixed Point Theorem. The Banach Fixed Point Theorem assurances that if 𝑇 is a contraction mapping on a complete metric space 𝑋, then 𝑇 has a unique fixed point. A fixed point 𝑥 * satisfies the equation:

Substitute the definition of 𝑇 (𝑥): , and it has a unique fixed point at 𝑥 * = 2.

Banach Fixed Point Theorem

The Banach Fixed Point Theorem states that if (X, d) is a complete metric space and T: X → X is a contraction mapping, then T has a unique fixed point in X [1,13] .

Proof of Existence and Uniqueness Using Real Numbers Existence

Cauchy Sequence: Let (𝑋, 𝑑) be a complete metric space and T be a contraction mapping with constant α. Consider an arbitrary initial point 𝑥 0 ∈ X and define the sequence {𝑥 𝑛 }by:

Convergence: For 𝑚 > 𝑛, we have:

Since 𝛼 < 1, 𝛼 𝑚 → 0 as 𝑚 → ∞. Therefore, {𝑥 𝑛 }is a Cauchy sequence because: 𝑑(𝑥 𝑚 + 1 , 𝑥 𝑛 ) ≤ 𝛼 𝑚 𝑑 (𝑥 0 , 𝑥 𝑛 ). Define the mapping 𝑇: 𝑀 2 × 2 (𝑅) → 𝑀 2 × 2 (𝑅) by:

Fixed Point Verification

Verify Contraction Mapping

Contraction Property: For matrices 𝐴, 𝐵 ∈ 𝑀 2 × 2 (𝑅),

Thus, T is a contraction mapping with constant 𝛼 = 1 2 .

Apply Banach Fixed Point Theorem

Complete Metric Space: 𝑀 2 × 2 (𝑅) with the Frobenius norm is a complete metric space. Existence: By the Banach Fixed Point Theorem, T has a unique fixed point.

Find the Fixed Point

Solve for Fixed Point: Set 𝑇 (𝐴) = 𝐴: 1 2 A = 𝐴 ⟹ 𝐴 = 0. Hence, A=0 is the unique fixed point of T in 𝑀 2 × 2 (𝑅) [25] .

Hence, Real numbers are essential in defining the metric space and contraction mappings used in fixed point theory. The Banach Fixed Point Theorem demonstrates that, with real-valued metrics and contraction constants, matrix spaces guarantee the existence and uniqueness of fixed points.

Mathematical Significance of Fixed Points

The mathematical significance of fixed points lies in their stability properties, which are leveraged in solving differential equations, optimization problems, and even in iterative algorithms used in numerical analysis [7,14] .

Proof (Stability in Dynamical Systems)

Stability Concept: Consider a differential equation 𝑑𝑥 / 𝑑𝑡 = (𝑥)with equilibrium points 𝑥 * such that 𝑔(𝑥 * ) = 0. These points correspond to fixed points of the function f (𝑥) = 𝑥 + (𝑥). Linear Stability Analysis: Linearize the system around the fixed point 𝑥 * :

The stability of 𝑥 * is determined by the sign of 𝑔′(𝑥 * ). If 𝑔′(𝑥 * ) < 0, the fixed point is stable; if 𝑔′(𝑥 * ) > 0, it is unstable.

Proof (Optimization Problems)

Optimization and Fixed Points: Consider the gradient descent method, where the fixed point 𝑥 * of the gradient function ∇𝑓(𝑥) = 0 represents a local minimum. Iterative Algorithm: Define the update rule𝑥 𝑛 + 1 = 𝑥 𝑛 -𝛾 ∇ (𝑥 𝑛 )The fixed point 𝑥 * satisfies: 𝑥 * = 𝑥 * -𝛾 ∇(𝑥 * ), implying ∇𝑓(𝑥 * ) = 0, i.e., 𝑥 * is a critical point, often corresponding to a minimum. Proof (Numerical Analysis and Iterative Methods): Convergence to Fixed Points: Numerical methods like the Newton-Raphson method aim to find solutions to f(x)=0. The sequence

converges to the fixed point of the function

, under appropriate conditions on 𝑓.

Fixed point theory, via Banach's Contraction Principle, proves the existence and uniqueness of solutions in metric spaces. It is essential in ensuring stability, finding optimal solutions, and achieving convergence in various mathematical fields.

Example 10

Let's solve the example application using numerical analysis with the Newton-Raphson method and the successive approximations method for finding the fixed point of the equation 𝑥 = cos (𝑥).

Step 1: Analyze Convergence First, we analyze the convergence behavior by checking the derivative of cos(x). The function f (x) = cos (x) has the derivative: f ′ (x) = -sin(x) For convergence in fixed point iterations, we require: |𝑓′(𝑥)| = |sin (𝑥)| < 1 Since |sin(x)| ≤ 1 for all x, the condition is met. However, we must ensure |sin(x)| is significantly less than 1 for rapid convergence.

Step 2: Successive Approximations Method We use the iteration:𝑥 𝑛 + 1 = cos (𝑥 𝑛 ) Let's choose an initial guess 𝑥 0 =1.0 and iterate: 𝑥 1 = cos (1.0) ≈ 0.5403 𝑥 2 = cos (0.5403) ≈ 0.8576 𝑥 3 = cos (0.8576) ≈ 0.6543 𝑥 4 =cos (0.6543) ≈ 0.7937 𝑥 5 = cos (0.7937) ≈ 0.7074 𝑥 6 = cos (0.7074) ≈ 0.7645 𝑥 7 = cos (0.7645) ≈ 0.7221 𝑥 8 = cos (0.7221) ≈ 0.7504 𝑥 9 = cos (0.7504) ≈ 0.7314 𝑥10 = cos (0.7314) ≈ 0.7442 Notice that the values are converging. The fixed point is approximately 𝑥 * ≈ 0.7391 [7] .

Step 3: Newton-Raphson Method Now, let's use the Newton-Raphson method. For the equation x = cos (x), rewrite it as: g(x) = xcos (x) = 0

The derivative g ′(x) is: g ′(x) = 1 + sin (x)

The Newton-Raphson iteration is

Starting with 𝑥 0 = 1. 0: The iteration results 𝑥 1 ≈ 0.7503 𝑥 2 ≈ 0.7392 𝑥 3 ≈ 0.7391 [19,23] .

The solution converges to approximately 𝑥 ≈ 0.7391, which is a fixed point where 𝑥 = cos(𝑥) Here, the method converges rapidly to the fixed point 𝑥 * ≈ 0.7391 Successive Approximations: This method shows gradual convergence, taking about 10 iterations to get close to the fixed point. Newton-Raphson Method: This method converges faster, requiring only about 3 iterations. The Newton-Raphson method is more efficient for this problem, given the faster convergence, but it requires the computation of the derivative. The successive approximations method, though slower, is simpler and does not require the derivative. Both methods ultimately lead to the same fixed point, 𝑥 * ≈ 0.7391.

Applications of Fixed-Point Theorem

The Banach Fixed Point Theorem, which relies on real-valued metrics and contraction constants, guarantees the existence and uniqueness of fixed points in complete metric spaces. This theorem has broad applications across various fields: Economics: General equilibrium models leverage fixed point theory to ensure that economic equilibria converge to a stable state, facilitating accurate predictions and analyses of market behaviors [22] .

Engineering: In control systems, the stability analysis often involves matrix equations where real numbers define metric spaces and contraction mappings. This ensures that the control systems are robust and stable [16,24] .

Computer Science: Iterative algorithms frequently use real numbers to ensure the efficiency and accuracy of fixed point computations. This includes algorithms for optimization and numerical solutions where fixed points ensure convergence [10] .

Physics:

In dynamic systems analysis, fixed points represent stable states of systems. Real numbers provide the necessary framework for analyzing and predicting the behavior of these systems [11] .

Discussion

Completeness Axiom

Our result showed that every non-empty subset 𝑆 ⊆ 𝑅 that is bounded above has a supremum sup𝑆∈𝑅. This is consistent with the Banach Fixed Point Theorem, which states that in a complete metric space (𝑋, 𝑑), if 𝑇:𝑋 → 𝑋 is a contraction mapping, then 𝑇 has a unique fixed point 𝑥 * ∈ 𝑋such that 𝑇(𝑥 * ) = 𝑥 * and 𝑑(𝑇(𝑥), 𝑇(𝑦)) ≤ 𝛼 𝑑(𝑥, 𝑦) where 0 ≤ 𝛼 <1 This finding corroborates the results by Mannan et al., [13] and Agarwal et al., [2] , confirming that completeness ensures the existence and uniqueness of fixed points in such metric spaces.

Archimedean Property

Our result showed that for any 𝑥, 𝑦 ∈ 𝑅 with 𝑥 > 0, there exists 𝑛 ∈ 𝑁 such that 𝑛𝑥 > 𝑦. This prevents distortion from infinitely large values and is consistent with Majid et al., [12] , who demonstrated that the Archimedean property ensures the finiteness and computability of fixed points.

Bolzano-Weierstrass Theorem

Our result confirmed that every bounded sequence {𝑥 𝑛 }⊆ R has a convergent subsequence {𝑥𝑛𝑘}converging to some limit 𝐿 ∈ 𝑅. This supports the convergence of iterative methods, ensuring that if {𝑥 𝑛 }is generated in a complete metric space, there exists a fixed point 𝑥 * such that lim 𝑛→∞ 𝑑 (𝑥 𝑛 𝑘 , 𝑥 * ) = 0. This aligns with findings by Howie [9] , who demonstrated that this theorem guarantees fixed points through convergent subsequences.

Intermediate Value Theorem

Our result indicated that if 𝑓 is continuous on [𝑎, 𝑏] and 𝐿 is a number between (𝑎) and 𝑓 (𝑏), then there exists 𝑐 ∈ [𝑎, 𝑏] such that 𝑓 (𝑐) = 𝐿. This theorem supports the existence of fixed points for continuous functions within specified intervals. Buchanan [7] , similarly confirmed this, highlighting its role in ensuring the existence of fixed points in continuous functions.

Mean Value Theorem

Our findings showed that if 𝑓 is continuous on [𝑎, 𝑏] and differentiable on (𝑎, 𝑏), then there exists 𝑐 ∈ (𝑎, 𝑏) such that 𝑓′(𝑐) = . This theorem provides insight into the rate of change of 𝑓 and is used to optimize and analyze fixed point functions. This is consistent with results by Agarwal et al., [1] and Yadav [25] , who applied this theorem for stability analysis and optimization in fixed point problems.

Cauchy-Schwarz Inequality

Our result confirmed that for any vectors 𝑢 and 𝑣 in an inner product space, |⟨𝑢, 𝑣⟩| ≤ ∥𝑢∥ ∥𝑣∥. ensures bounds and stability in fixed point iterations. This aligns with Shakhno [21] , who used this inequality to ensure boundedness and stability in iterative algorithms

Numerical Analysis

In solving 𝑥 = cos𝑥, iterative methods such as Successive Approximations and Newton-Raphson are employed. Both methods converge to the fixed point 𝑥 * ≈ 0.7391. However, the Newton-Raphson Method demonstrates superior efficiency, converging in approximately 3 iterations compared to the 10 iterations required by Successive Approximations. This highlights Newton-Raphson's practical effectiveness for faster convergence. The consistency in results between these methods underscores their reliability and the crucial role of real numbers in achieving precise solutions. Our findings align with Mannan et al., [13] , who demonstrated the effectiveness of fixed point methods in various practical applications, and Agarwal et al., [1] , who confirmed the utility of iterative methods like Newton-Raphson in optimizing computational efficiency. This supports the theoretical underpinnings of fixed point theory and its practical applications.

Conclusion

This research highlights the critical role of real numbers in fixed point theory and matrix spaces. It explores the foundational concepts of these mathematical areas, demonstrating how real numbers affect the existence, uniqueness, and convergence of fixed points in diverse contexts. The study examines the implications of real numbers for stability and solutions, offering practical methods for addressing complex problems across different domains. Through theoretical analysis and practical applications, the research underscores how real numbers enhance the understanding and effectiveness of fixed point theory in mathematical modeling and numerical techniques. The findings are particularly relevant for solving challenges in fields such as engineering and economics, illustrating the profound impact of real numbers on both theoretical and applied mathematics.

Acknowledgement

AcknowledgmentWe sincerely thank previous researchers for their pioneering work on the application of real numbers in fixed-point theory and matrix spaces. Their contributions have significantly advanced our understanding and provided valuable insights that have paved the way for further research in this field.

References

1. Agarwal P, Jleli M, editors. Fixed point theory in metric spaces: Recent advances and applications [Internet]. Springer; 2018 [cited YYYY MMM DD]. Available from: https://doi.org/10.1007/978-981-13-2913-5
2. Agarwal P, Jleli M, Samet B. Banach Contraction Principle and Applications. 2018.
3. Ansari QH, Sahu DR. Fixed point theory in metric spaces. Cambridge University Press; 2023. Published online 15 July.
4. Bailey DF. Some theorems on contractive mappings. Journal of the London Mathematical Society. 1966;1(1):101-106.
5. Belluce LP, Kirk WA. Some fixed point theorems in metric and Banach spaces. Cambridge University Press; 2018. Published online 20 November.
6. Buchanan JR. Fixed-Point Iteration. MATH 375 Numerical Analysis. Department of Mathematics, Spring 2022.
7. Deepak, Meenakshi. Metric space and its applications. Journal of University of Shanghai for Science and Technology. 2021;23(7):957-961.
8. Majid NA, AL Jumaili A, Lee SK. Some applications of fixed point results for monotone multivalued and integral type contractive mappings. Research. Published 17 July 2023.
9. Mannan MA, Rahman MR, Akter H, Nahar N, Mondal S. A study of Banach fixed point theorem and its applications. American Journal of Computational Mathematics. 2021;11(2):157-174. Available from: https://doi.org/10.4236/ajcm.2021.112011
10. Martynyuk AA. Stability of dynamical systems in metric space. Nonlinear Dynamics and Systems Theory. 2005;5(2):157167.
11. Matkowski J. A mean-value theorem and its applications. Journal of Mathematical Analysis and Applications. 2011;373(1):227-234. Available from: https://doi.org/10.1016/j.jmaa.2010.07.031
12. Okelo NB. Properties of complete metric spaces and their applications to computer security, information and communication technology. 2014;1:23-28.
13. Palais RS. A simple proof of the Banach contraction principle. Journal of Fixed Point Theory and Applications. 2007;2(2):221-223. Available from: https://doi.org/10.1007/s11784-007-0041-6
14. Pho KH. Improvements of the Newton-Raphson method. Journal of Computational and Applied Mathematics. 2022;408:114106. Available from: https://doi.org/10.1016/j.cam.2022.114106
15. Shakhno SM. An iterative algorithm with superquadratic convergence for solving nonlinear operator equations. Journal of Computational and Applied Mathematics. 2009;231(1):222-235. Available from: https://doi.org/10.1016/j.cam.2008.08.014
16. Skare M, Stjepanovic S. How important are general equilibrium models for small open economies -the case of Croatia. Technological and Economic Development of Economy. 2013;19(2):331-349.
17. Triana JG. On the Newton-Raphson method and its modifications. CIENCIA ENDESARROLLO. 2023;14(2):75-80. Available from: https://doi.org/10.19053/01217488.v14.n2.2023.15157
18. Xue Y, Han J, Tu Z, Chen X. Stability analysis and design of cooperative control for linear delta operator system. AIMS Mathematics. 2023;8(6):12671-12693. Available from: https://doi.org/10.3934/math.2023637
19. Yadav D, Tiwari SK. Expansive type rational contraction in metric space and common fixed point theorems. Mikailalsys Journal of Mathematics and Statistics. 2023, 1(1)