Preprint
Article

An Exploration on a Normed Space called r-Normed Space: Some Properties and an Application

Altmetrics

Downloads

71

Views

52

Comments

0

This version is not peer-reviewed

Submitted:

26 October 2023

Posted:

27 October 2023

You are already at the latest version

Alerts
Abstract
In this paper, we explore a new norm on Lp-space called r-norm, and hence producing a new normed space called r-normed space. Measure theoretic and functional analytic properties are covered such as the relation between r-norm and the classical p-norm. An application of r-normed space in probability theory and statsitics is also presented, notably, its role as a rigorous framework in describing the coefficient of determination.
Keywords: 
Subject: Computer Science and Mathematics  -   Analysis

1. Introduction

In functional analysis [1,2], a normed-space is a vector space [3] together with a map [4] from the vector space to the set of all nonnegative real numbers which satisfies a set of axioms [4] called normed space axioms [2]. A comprehensive and formal description about normed spaces will be presented later. Mathematicians have studied normed spaces from the late 19th and early 20th centuries as the history is concerned.
In this paper, we explore a new kind of normed space related to L p functions [1,2] which we refer to as the r-normed space. The formal definition of this normed space will be presented as well its rigorous construction. We also present an application of r-normed space in probability theory and statistics [5].
For the rest of the paper, symbolic first or second order notations [6] will frequently occur in every formal expression. The readers are referred to [4,6] for comprehensive explanations regarding the formal expressions. Foundations in abstract measure theory [7] are also required since we will not present basic concepts in measure theory unless we think necessary.

2. Basics of Lp Space and Normed Space

The underlying vector space [3] in the whole discussion is the L p space, a function space satisfying some Lebesgue integration property [7] which will be described further. The designation of L p space can be broad since many different vector spaces may be examples of L p space such as finite dimensional vector space, infinite dimensional vector space in forms of sequences and function space of certain type of Lebesgue integrable functions [2,7]. We will present the general measure theoretic definition of L p space as follows.
Definition 1
(Equivalence Classes Family L p ). Let ( X , A , μ ) be a measure space [7]. Let p R such that 1 p < . Let L p ( μ ) be a family of measurable functions [7] X R such that
f L p ( μ ) : X | f | p d μ < .
Suppose an equivalence relation [4] ∼ on L p ( μ ) defined by
f , g L p ( μ ) : f g μ ( { x X f ( x ) g ( x ) } ) = 0 .
Then we have a family of equivalence classes [4] in L p ( μ )
L p ( μ ) : = { [ f ] f L p ( μ ) }
in which
f , g L p ( μ ) : g [ f ] f g .
We will need to show that the family L p of equivalence classes in definition 1 is a vector space. First, let us observe the axiomatic definition of vector space in the following definition.
Definition 2
(Vector Space). A set V is a vector space [3] over a field F together with operations + : V × V V and · : F × V V if the following axioms are satisfied:
V1 
u , v , w V : ( u + v ) + w = u + ( v + w )
V2 
u , v V : u + v = v + u
V3 
There exists a unique 0 V V such that
u V : 0 V + u = u + 0 V = u .
V4 
u , v V : u + v = v + u = 0 V
V5 
a , b F u V : a ( b u ) = ( a b ) u
V6 
There exists a unique 1 F F such that
u V : 1 F u = u .
V7 
a F u , v V : a ( u + v ) = a u + a v
V8 
a . b F u V : ( a + b ) u = a u + b u
The following theorem will show that the family L p of equivalence classes in definition 1 is in fact a vector space over R which is referred to as an L p space.
Theorem 1.
Let ( X , A , μ ) be a measure space. The family L p ( μ ) of equivalent classes as described in definition 1 is a vector space over R .
Proof. 
To show that L p ( μ ) is a vector space over R we need to show that all axioms in definition 2 hold.
Let f , g , h L p ( μ ) . Since f , g , h are real-valued functions, then
x X : ( f ( x ) + g ( x ) ) + h ( x ) = f ( x ) + ( g ( x ) + h ( x ) )
and
x X : f ( x ) + g ( x ) = g ( x ) + f ( x )
holds and show that axioms V1 and V2 are satisfied. Note that in the sense of L p ( μ ) , the symbol ‘=’ designates the equivalence relation ∼ as described in definition 1. The zero function e L p ( μ ) also exists as it satisfies
N : = { x X e ( x ) 0 } μ ( N ) = 0 .
Then we have
x X N : e ( x ) + f ( x ) = f ( x ) + e ( x ) = f ( x ) + 0 = f ( x )
which shows that axiom V3 is satisfied. Then f L p ( μ ) is certain since
X | f | p d μ = X | 1 | p | f | p d μ = X | f | p d μ < .
With
x X : f ( x ) + ( f ( x ) ) = f ( x ) + f ( x ) = 0 = e ( x ) ,
axiom V4 is satisfied. Note that
c R f ˜ L p ( μ ) : c f ˜ L p ( μ )
since
c R f ˜ L p ( μ ) : X | c f ˜ | p d μ = X | c | p f ˜ | p d μ = | c | p X | f ˜ | p d μ < .
Now, let a , b R . Then we obtain
x X : a ( b f ( x ) ) = ( a b ) f ( x ) ,
which shows that axiom V5 is satisfied. Then, certainly 1 R and we have
x X : 1 f ( x ) = f ( x )
which shows that axiom V6 is satisfied. Also
x X : a ( f ( x ) + g ( x ) ) = a f ( x ) + a g ( x )
and
x X : ( a + b ) f ( x ) = a f ( x ) + b f ( x )
show that axioms V7 and V8 are satisfied. Thus, we conclude that L p ( μ ) is a vector space. □
Another functional analytic [2] notion to necessarily be presented is normed space [2], which is given in the following definition.
Definition 3
(Normed Space). Let V be a vector space over a field F . A norm on V is a map · : V [ 0 , ) satisfying the following axioms:
N1 
u V : u 0
N2 
u V : u = 0 u = 0 V
N3 
a F u V : a u = | a | u
N4 
u , v V : u + v u + v
If · is a norm on V, then we call ( V , · ) a normed space [2].
For a given vector space and a possible norm, the common challenge is proving axiom N4, which is sometimes also referred to as the triangle inequality. An indispensable tools in mathematical analysis to help prove axiom N4 are the so-called “Hölder’s inequality" and “Minkowski inequality" which will be presented. In fact, Minkowski inequality is a consequence of Hölder’s inequality. However, we first need Young’s inequality in order to prove Hölder’s which is presented in the following lemma.
Proposition 1.
Let p , q R such that p , q > 1 and 1 p + 1 q = 1 . Note that the following expressions are equivalent:
  i 
p q p q + 1 = 1
 ii 
( p 1 ) ( q 1 ) = 1
iii 
p 1 = 1 q 1 , q 1 = 1 p 1
iv 
1 p = 1 1 q = q 1 q p = q q 1
 v 
1 q = 1 1 p = p 1 p q = p 1 p
Lemma 1.
Let a , b R such that a , b 0 . Let p , q > 1 such that 1 p + 1 q = 1 . Then the inequality
a b a p p + b q q ,
known as Young’s inequality [2], holds.
Proof. 
Suppose a function f : [ 0 , a ] [ 0 , α ] such that b α , f ( a ) = α and f is continuous [8] as well as bijective [4]. Note that we will have
a b 0 a f ( x ) d x + 0 b f 1 ( y ) d y .
In particular, f can be defined by
x [ 0 , a ] : f ( x ) : = x p 1
as it is continuous [2] and bijective. And we can show the bijectivity of f if we can show that f is strictly monotone, since strict monotonicity of such a function implies bijectivity. Now let s , t [ 0 , a ] such that s < t . Certainly we have
f ( s ) = s p 1 < t p 1 = f ( t )
which shows that f is strictly increasing. Hence f is bijective. It implies that f 1 exists, which is now our task in finding it. Follows from proposition 1, we obtain the inverse f 1 as given by
y [ 0 , b ] : f 1 ( y ) = y q 1 .
And we have
a b 0 a f ( x ) d x + 0 b f 1 ( y ) d y = 0 a x p 1 d x + 0 b y q 1 d y = x p p | 0 a + y q q | 0 b = a p p + b q q
which proves the lemma. □
Now we present Hölder’s inequality in the following theorem.
Theorem 2.
Let ( X , A , μ ) be a measure space [7]. Let p , q > 1 such that 1 p + 1 q = 1 . Let f L p ( μ ) and g L q ( μ ) [7]. Then
X | f g | d μ X | f | p d μ 1 p X | g | q d μ 1 q ,
holds, which is known as Hölder’s inequality.
Proof. 
Suppose some functions f ˜ , g ˜ : X R defined by
x X : f ˜ ( x ) : = f ( x ) X | f | p d μ 1 p
and
x X : g ˜ ( x ) : = g ( x ) X | g | q d μ 1 q
respectively. Follows from lemma 1, i. e., Young’s inequality, we obtain
x X : | f ˜ ( x ) g ˜ ( x ) | | f ˜ ( x ) | p p + | g ˜ ( x ) | q q .
By taking Lebesgue integral [7] to the expression above, we obtain
X | f ˜ g ˜ | d μ X | f ˜ | p p + | g ˜ | q q d μ X | f g | X | f | p d μ 1 p X | g | q d μ 1 q d μ X | f | p p X | f | p d μ + | g | q q X | g | q d μ d μ X | f g | d μ X | f | p d μ 1 p X | g | q d μ 1 q X | f | p d μ p X | f | p d μ + X | g | q d μ q X | g | q d μ = 1 p + 1 q = 1
which implies
X | f g | d μ X | f | p d μ 1 p X | g | q d μ 1 q ,
which proves Hölder’s inequality. □
Theorem 3.
Let ( X , A , μ ) be a measure space [7]. Let p R such that 1 p < . Follows from theorem 1, we have a vector space L p ( μ ) . Let f , g L p ( μ ) . Then
X | f + g | p d μ 1 p X | f | p d μ 1 p + X | g | p d μ 1 p
holds, which is known as Minkowski inequality [2].
Proof. 
Proving for p = 1 is trivial, since obviously
x X : | f ( x ) + g ( x ) | | f ( x ) | + | g ( x ) | ,
then by the property of Lebesgue integral [7] we have
X | f + g | d μ X | f | d μ + X | g | d μ ,
which proves the inequality for p = 1 .
Now we prove the inequality for p > 1 . Let q R such that q > 1 and 1 p + 1 q = 1 . Let h : X R such that
x X : h ( x ) : = | f ( x ) + g ( x ) | p 1 .
Note that | f + g | L p ( μ ) since L p ( μ ) is a vector space, which means that it is closed under addition and scalar multiplication. That is,
x X : | f ( x ) + g ( x ) | = sgn ( f ( x ) + g ( x ) ) · ( f ( x ) + g ( x ) ) ,
where the map sgn : R { 1 , 0 , 1 } is defined by
a R : sgn ( a ) : = 1 : a > 0 0 : a = 0 1 : a < 0 .
From the expression above, additive closure shows that f + g L p ( μ ) , and scalar multiplicative closure shows that sgn ( f + g ) · ( f + g ) L p ( μ ) , and hence | f + g | L p ( μ ) . Follows from proposition 1, we obtain
X | h | q d μ = X | f + g | ( p 1 ) q d μ = X | f + g | ( p 1 ) p p q d μ = X | f + g | p d μ < ,
from the fact that | f + g | L p ( μ ) . Hence h L q ( μ ) . Then follows from the triangle inequality and Hölder’s inequality we obtain
X | f + g | p d μ = X | f + g | | f + g | p 1 d μ X ( | f | + | g | ) | f + g | p 1 d μ ( Triangle inequality ) = X | f | | f + g | p 1 d μ + X | g | | f + g | p 1 d μ = X | f h | d μ + X | g h | d μ X | f | p d μ 1 p X | h | q d μ 1 q + X | g | p d μ 1 p X | h | q d μ 1 q ( H ö lder s inequality ) = X | f | p d μ 1 p + X | g | p d μ 1 p X | h | q d μ 1 q = X | f | p d μ 1 p + X | g | p d μ 1 p X | f + g | ( p 1 ) p p 1 d μ 1 1 p = X | f | p d μ 1 p + X | g | p d μ 1 p X | f + g | p d μ 1 1 p = X | f | p d μ 1 p + X | g | p d μ 1 p X | f + g | p d μ X | f + g | p d μ 1 p
which implies
X | f + g | p d μ 1 p X | f | p d μ 1 p + X | g | p d μ 1 p
which proves Minkowski inequality for p > 1 . Thus, we conclude the proof. □
Now let us observe the very fundamental norm defined on L p space, which is the p-norm [2]. This norm is a fundamental concept in functional analysis and is the interest of study in Banach spaces [1,2]. This norm will also be essentially related to our formulation of r-norm. We will present this norm on a theorem after we present the following lemma.
Lemma 2.
Let ( X , A , μ ) be a measure space [7]. Let p R such that 1 p < . Follows from theorem 1, we have a vector space L p ( μ ) . The expression
a R f L p ( μ ) : a f 0 X | a f | p d μ = 0
holds.
Proof. 
We prove the forward part first. Let a R and f L p ( μ ) . Suppose a f 0 . Then we have
N : = { x X a f ( x ) 0 } μ ( N ) = 0 ,
which implies
N | a f | p d μ = 0 .
And by the property of Lebesgue integral [7], we obtain
X | a f | p d μ = N | a f | p d μ + X N | a f | p d μ = 0 + 0 · μ ( X N ) = 0 ,
which proves the forward part.
Now for the backward part, suppose
X | a f | p d μ = 0 .
Let g : X R such that g : = | a f | p . Note that g is measurable and nonnegative. By simple function [7] approximation theorem, for every n N there exists a simple function s n : X [ 0 , ) such that
x X : 0 s 1 ( x ) s 2 ( x ) g ( x )
and
x X : lim n s n ( x ) = g ( x )
holds. Note that there are only finitely many points in the image of s n since it is a simple function, for any n N . Now let
m : N N n m n
such that
n N : | im ( s n ) | = m n .
The notation im above refers to the image of a function [4]. Now suppose
n N : im ( s n ) = { α n , k } k = 1 m n .
And suppose
n N k { 1 , , m n } : A n , k : = { x X s n ( x ) = α n , k } .
We can now express the simple function as
n N x X : s n ( x ) = k = 1 m n α n , k χ A n , k ( x )
where
n N k { 1 , , m n } x X : χ A n , k ( x ) : = 1 : x A n , k 0 : x A n , k ,
which is known as an indicator function. And the Lebesgue integral of g over X can be given in accordance with its definition [7] by
X g d μ = sup n N X s n d μ = sup n N k = 1 m n α n , k μ ( A n , k ) .
Recalling the assumption, we now have
0 = X | a f | p d μ = X g d μ = sup n N k = 1 m n α n , k μ ( A n , k ) .
Note that each term in the summation above is nonnegative. Then we must have
j N : 0 k = 1 m j α j , k μ ( A j , k ) sup n N k = 1 m n α n , k μ ( A n , k ) = 0 ,
which implies
j N : k = 1 m j α j , k μ ( A j , k ) = 0 .
The only solution to this circumstance is
j N k { 1 , , m j } : μ ( A j , k ) 0 α j , k = 0 .
The statement above implies that
μ ( { x X g ( x ) 0 } ) = 0 ,
which means that g 0 , or g = 0 μ-almost everywhere [7]. It also implies that a f 0 , which proves the backward part. We conclude that
a f 0 X | a f | p d μ = 0 ,
which proves the theorem as a whole. □
Theorem 4.
Let ( X , A , μ ) be a measure space [7]. Let p R such that 1 p < . Follows from theorem 1, we have a vector space L p ( μ ) . A map · p : L p ( μ ) [ 0 , ) defined by
f L p ( μ ) : f p : = X | f | p d μ 1 p
is a norm on L p ( μ ) known as the p-norm, and hence ( L p ( μ ) , · p ) is a normed space.
Proof. 
To show that · p is a norm on L p ( μ ) , we need to show that axioms N1, N2, N3 and N4 in definition 3 are satisfied. For the whole discussion in this proof, let a R and f , g L p ( μ ) .
By definition, · p involves the designation of | · | p within the Lebesgue integral, hence we will always have a nonnegative integrand. By the property of Lebesgue integral [7], since | f | p 0 then
f p = X | f | p d μ 1 p 0 ,
which shows that axiom N1 is satisfied.
Now we need to show that f p = 0 f = 0 , which is equivalent to showing f p p = 0 f = 0 , as shown by
f p = 0 f = 0 , f p p = 0 f p = 0 f p p f = 0 .
Follows from lemma 2, we obtain
f 0 X | f | p d μ = 0 .
Note that the equality symbol ‘=’ in terms of L p ( μ ) refers to ’∼’ in terms of L p ( μ ) . Thus, the statement above shows that f p p = 0 f = 0 which implies f p = 0 f = 0 and hence axiom N2 is satisfied.
By the property of Lebesgue integral [7], we obtain
a f p = X | a f | p d μ 1 p = | a | p X | f | p d μ 1 p = | a | X | f | p d μ 1 p = | a | f p ,
which shows that axiom N3 is satisfied.
Then by the property of Lebesgue integral as well as theorem 3 (Minkowski inequality), we obtain
f + g p = X | f + g | p d μ 1 p X | f | p d μ 1 p + X | g | p d μ 1 p = f p + g p ,
which shows that axiom N4 is satisfied.
Thus, we conclude that · p : L p ( μ ) R is a norm on L p ( μ ) . Hence ( L p ( μ ) , · p ) is a normed space. □

3. Definition and Properties of r-Normed Space

We formulate r-norm as a norm on L p space. The formal definition of r-norm and r-normed space follows from the following theorem.
Theorem 5.
Let ( X , A , μ ) be a measure space [7]. Let p R such that 1 p < . Follows from theorem 1, we have a vector space L p ( μ ) . Let r L p ( μ ) such that
N : = { x X r ( x ) = 0 } μ ( N ) = 0 ,
i. e., r 0 μ-almost everywhere [7]. Let
R : = X | r | p d μ .
A map · p : r : L p ( μ ) [ 0 , ) defined by
f L p ( μ ) : f p : r : = X | f | p R d μ 1 p
is a norm on L p ( μ ) .
Proof. 
We need to show that axioms N1, N2, N3 and N4 are satisfied. For the whole disucssion in this proof, let a R and f , g L p ( μ ) .
Note that r L p ( μ ) , r 0 μ-almost everywhere [7] and | r | p 0 , which imply 0 < | r | p < μ-almost everywhere. Then
0 < R = X | r | p d μ < .
And note that f L p ( μ ) , which means
0 X | f | p d μ < .
Then by the property of Lebesgue integral [7], we obtain
f p : r = X | f | p R d μ 1 p = 1 R p X | f | p d μ 1 p 0
which shows that axiom N1 is satisfied.
Note that
f 0 f R p 0
and
X | f | p R d μ = 0 X | f | p R d μ 1 p = 0
hold. Follows from lemma 2, we obtain
f R p 0 X f R p p d μ = X | f | p R d μ = 0 .
Note that the equality symbol ’=’ in terms of L p ( μ ) refers to the equivalence relation [4] symbol ’∼’ in terms of L p ( μ ) . Then by the transitive property of biconditional statements, we obtain
f = 0 ( μ - almost everywhere ) f p : r = X | f | p R d μ 1 p = 0
which shows that axiom N2 is satisfied.
By the property of Lebesgue integral [7], we obtain
a f p : r = X | a f | p R d μ 1 p = | a | p X | f | p R d μ 1 p = | a | X | f | p R d μ 1 p = | a | f p : r
which shows that axiom N3 is satisfied.
Follows from the property of Lebesgue integral [7] and theoerm 3 (Minkowski inequality), we obtain
f + g p : r = X | f + g | p R d μ 1 p = 1 R p X | f + g | p d μ 1 p 1 R p X | f | p d μ 1 p + X | g | p d μ 1 p ( Minkowski inequality ) = 1 R p X | f | p d μ 1 p + 1 R p X | g | p d μ 1 p = X | f | p R d μ 1 p + X | g | p R d μ 1 p = f p : r + g p : r ,
which shows that axiom N4 is satisfied. We conclude that the map · p : r : L p ( μ ) [ 0 , ) is a norm on L p ( μ ) . □
By theorem 5, we can present the formal definition of r-normed and r-normed space in the following definition.
Definition 4
(r-Normed Space). Let ( X , A , μ ) be a measure space [7]. Let p R such that 1 p < . Follows from theorem 1, we have a vector space L p ( μ ) . Let r L p ( μ ) such that r 0 μ-almost everywhere [7]. And let
R : = X | r | p d μ .
Follows from theorem 5, a map · p : r defined by
f L p ( μ ) : f p : r : = X | f | p R d μ 1 p
is a norm on L p ( μ ) , which we call r-norm. And the normed space ( L p ( μ ) , · p : r ) is called r-normed space.
As we have mentioned in the earlier section that p-norm and r-norm are closely related. The relationship is described in the following proposition.
Proposition 2.
Suppose an r-normed space ( L p ( μ ) , · p : r ) with respect to a measure space ( X , A , μ ) [7]. Let f L p ( μ ) . Note that from theorem 4, we have another norm · p : L p ( μ ) [ 0 , ) defined by
f p : = X | f | p d μ 1 p .
And follows from definition 4, we obtain
f p : r = X | f | p R d μ 1 p = 1 R p X | f | p d μ 1 p = X | f | p d μ 1 p X | R | p d μ 1 p = f p r p .

4. An Application of r-Normed Space

A notable application of r-normed space is in a formal description of the coefficient of determination (CoD) in probability theory and statistics [5]. The CoD is used in statistical models for predictions or hypotheses testing. It provides a numeric representation on the performance of the model [9]. This section will discuss the formal construction of CoD based on the r-norm, begun from defining the underlying measure space [7] and random variables [5].
Suppose we have a real world observation. Note that we will only have finitely many data points in the observation. Let Ω be the possible outcome of the observation, and hence | Ω | < . Let F be a σ -algebra [7] representing the set of probable events from the observation. Then we have a measurable space ( Ω , F ) . Then let P : F [ 0 , 1 ] be a probability measure, and hence we have a probability space ( Ω , F , P ) [5]. Let us consider another measure γ : F N defined as the counting measure [7] on ( Ω , F ) , i. e.,
A F : γ ( A ) : = | A | .
Since we only have finitely many data points in the observation, then
γ ( Ω ) = | Ω | < ,
which means that γ is a finite measure.
Also suppose that the observation produces random variables [5] of which some of them are independent and one of them is dependent. We will focus on the dependent random variable Y : Ω R . Suppose Y is almost surely [5] nonconstant, that is,
a R : P ( { ω Ω Y ( ω ) = a } ) < 1 ,
and almost surely [5] bounded, that is,
P ( { ω Ω | Y ( ω ) | < } ) = 1 .
On the other hand, suppose Y L 2 ( γ ) . Theorem 5 and definition 4 allow us to define an r-norm on L 2 ( γ ) . Let r L 2 ( γ ) such that
ω Ω : r ( ω ) : = Y ( ω ) E [ Y ]
where E [ Y ] denotes the expectation [5] of Y, that is,
E [ Y ] = Ω Y d P < .
The boundedness of the expectation is implied from the designation that Y is almost surely bounded. Also note that E [ Y ] is just a constant, which means that it is also an L 2 ( γ ) function, since
Ω E [ Y ] 2 d γ = E [ Y ] 2 Ω d γ = E [ Y ] 2 γ ( Ω ) < .
Now let
R : = Ω r 2 d γ = Ω ( Y E [ Y ] ) 2 d γ .
Then the r-norm · 2 : r : L 2 ( γ ) [ 0 , ) is defined by
X L 2 ( γ ) : X 2 : r : = Ω X 2 R d γ 1 2 .
Suppose we develop a predictive model to estimate Y, either using a statistical or machine learning (ML) model. Let Y ^ : Ω R be the predictive model. The CoD regarding the predictive model Y ^ with respect to Y can be be given by
1 Y Y ^ 2 : r 2 .
With that in mind, we can also present a new method of numeric performance evaluation of the model by making use of only the r-norm in exchange for the CoD. We propose the method in the following proposition.
Proposition 3.
Suppose an observation which produces a finite number of data points. Let a measurable space [5] ( Ω , F ) be the underlying event space [5]. Note that
| Ω | < .
Then let ( Ω , F , P ) be the corresponding probability space. And let γ : F N be a counting measure [7] on ( Ω , F ) , and hence we have another measure space ( Ω , F , γ ) . Let Y : Ω R be a dependent random variable such that Y has a bounded expectation [5], is almost surely nonconstant [5] and Y L 2 ( γ ) . Let r : Ω R such that
ω Ω : r ( ω ) : = Y ( ω ) E [ Y ] .
And let
R : = Ω r 2 d γ .
Follows from theorem 5 and definition 4, there exists a normed space ( L 2 ( γ ) , · 2 : r ) such that
X L 2 ( γ ) : X 2 : r : = Ω X 2 R d γ 1 2 .
Let Y ^ : Ω R be a predictive model on Y such that Y ^ L 2 ( γ ) . The model Y ^ is ρ-reliable if there exists some ρ R with 0 < ρ < 1 such that
Y Y ^ 2 : r 2 < ρ .
Here is the main difference of the CoD with the performance evaluation presented in proposition 3. In CoD the model can be deemed showing a good performance if the corresponding CoD has a value close to 1. While in our proposed method, the model has a good performance if the corresponding squared r-norm has a value close to 0. On the other hand, an awful model will give a negative CoD, or equivalently a squared r-norm greater than 1.

5. Conclusion and Future Work

We have presented a new norm called r-norm on an L p space which produces a new normed space called r-normed space. Some property of r-normed space has also been presented regarding its relation with the classical p-norm on the same underlying function space. An application of r-normed space has also been presented in the formal description of coefficient of determination in probability theory and statistics [5]. The r-normed space of square integrable random variable with respect to a measure space space ( Ω , F , γ ) and probability space ( Ω , F , P ) of a finite observation Ω , with γ : F N being a counting measure [7], serves as an alternative framework in describing the coefficient of determination. We have also proposed an alternative model performance evaluation using the squared r-norm as presented in proposition 3.
For the future works, we are interested in further exploring the measure theoretic and functional analytic properties of r-normed space. We are also interested in exploring other possible applications of r-normed space in probability theory, statistics, or other fields of science and engineering.

Conflicts of Interest

Conflicts of Interest: The authors declare no conflicts of interest.

References

  1. Bühler, T.; Salamon, D.A. Functional Analysis; American Mathematical Society: Zurich, 2018. [Google Scholar]
  2. Kreyszig, E. Introductory Functional Analysis with Applications; Wiley: New York, 1978. [Google Scholar]
  3. Roman, S. Advanced Linear Algebra (Second Edition); Springer: New York, 2005. [Google Scholar]
  4. Stoll, R.R. Set Theory and Logic; Dover: New York, 1963. [Google Scholar]
  5. Brémaud, P. Probability Theory and Stochastic Processes; Springer: Cham, 2020. [Google Scholar] [CrossRef]
  6. Bergmann, M.; Moor, J.; Nelson, J. The Logic Book (Sixth Edition); McGraw-Hill: New York, 2014. [Google Scholar]
  7. Salamon, D.A. Measure and Integration; European Mathematical Society: Zurich, 2016. [Google Scholar]
  8. Rudin, W. Principles of Mathematical Analysis; McGraw-Hill: New York, 1964. [Google Scholar]
  9. Draper, N.R.; Smith, H. Applied Regression Analysis; Wiley-Interscience, 1998. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated