The Proofs of Triangle Inequality Using Binomial Inequalities

In this paper, we introduce the different ways of proving the triangle inequality ‖u − v‖ ≤ ‖u‖+ ‖v‖, in the Hilbert space. Thus, we prove this triangle inequality through the binomial inequality and also, prove it through the Euclidean norm. The first generalized procedure for proving the triangle inequality is feasible for any even positive integer n. The second alternative proof of the triangle inequality establishes the Euclidean norm of any two vectors in the Hilbert space. 2010 Mathematics Subject Classifications: 44B43, 44B44


Introduction
The importance of estimating norms cannot be overemphasized on the grounds that, in most practices, the quantification of exact norm of the two vector points in a complete normed space is tedious and sometimes the procedure is cumbersome.In this regard, we fall on the estimation of norms of vector points.Inequalities are used to describe the geometric structures such as boundedness, continuity, uniform non-l n 1 −ness of mappings or operators of the linear spaces and also, the embeddings of one vector space into another vector space.Recently, some applications of the triangle inequality in the operations research have been found, see research papers by [1,2].
The proof of the triangle inequality of the form is well-known and many researchers across the globe have shown different ways for obtaining this result.A lot of studies delineate the origin of inequalities.For example, see a research paper by author in [3].In [4], the author applied generalized Minkowski's inequality in a generalized vector space to obtain the triangle inequality.The authors in [5], used both the notion of q−norm and-ψ norm to construct the triangle inequality.Another version for obtaining this kind of triangle inequality in Banach space was obtained by authors in [6].The author in [7], obtained an alternative way of proving triangle inequality in Banach space.In [8], the authors applied the ψ− sum of the vector points in the Banach space to construct the triangle inequality.The authors in [9], observed that for any vectors (µ 1 , µ 2 , . . ., µ n ), in the Euclidean space the following inequality holds: The triangle inequality has different versions.One of the particular version which is recent and has attracted much attention of scientists in the 21 st century is the triangle inequality of the form: for any two vectors in a normed linear space V [see 10].This inequality has alternative ways of proving it.For example, see a research paper by authors [11].
In this paper, we present alternative ways of proving triangle inequality in (1); by the use of concept of binomial of two vector points in the Hilbert space.This result generalizes the proof of the triangle inequality.Also, the proof of the triangle inequality is proved through the Euclidean norm.The paper is organized as follows.Section 1 contains the introduction, the new methods for proving the triangle inequality in (1) is seen in section 2 and section (3) contains the summary of this paper.

Main Result
In this section, we introduce a general procedures for proving the inequality in (1).Firstly, we make use of binomial of two vector points to establish the triangle inequality in the Hilbert space for any positive integer n.In addition, we obtain the same result by applying the Young's inequality of the two vector points through the Euclidean norm.These approaches are easier and give better understanding of the triangle inequality.
Definition 1 (Inner product Space).Let X be a vector space of over K.A function is called an inner product space on the vector space X over K if: P1: for all x ∈ X, (x, x) ≥ 0, and (x, x) = 0 if and only if x = 0 P2: (x 1 + x 2 , y) = (x 1 , y) + (x 2 , y) and (αx, y) = α(x, y), for all x 1 , x 2 , y ∈ X and α ∈ K P3: (x, y) = (y, x), for all x, y ∈ X.The bar denotes complex conjugate of two vector points in X (See, 12) Thus, an inner product space is a vector space endowed with an inner product.
Theorem 1 (Cauchy-Schwarz Inequality).If u and v are any two vectors in an inner product space V , then

A Proof of Triangle Inequality Through Binomial Inequality
In this section, we introduce an alternative way of proving the triangle inequality through binomial inequality.By induction, we prove the triangle inequality in (1) as follows.Firstly, we consider an integer n = 2, we observe the following: On other hand, we see that: Applying the transitive law to (2) and (3), we obtain For n = 4, we observe that: Also, we see that: We see from ( 4) and ( 5) that: Again, when n = 6, we observe the following: Also, we observe that: We see from inequalities ( 6) and ( 7) that: For any even positive integer n, we observe the following binomial inequality: On the other hand, we see that: By transitivity, inequalities ( 8) and ( 9) yields

The Proof of the Triangle Inequality through Euclidean norm
In this subsection, we will establish the same result as in (10), by making use of both the binomial inequality of two vector points and the Young's inequality.
Definition 2 (Young's Inequality).Let 1 < p < ∞, q the conjugate of p, and any two vectors u and v, then Firstly, we observe the two vectors in the Hilbert space as: Applying the Young's inequality of two vectors where p = q = 2. Substituting the inequality in (12) into left hand side of inequality (11) yields: On the other hand, the norm of sum of two vectors in Hilbert space was observed as: By transitivity, the inequalities ( 13) and ( 14) yields