We will use the following notations from now on:
For the data f and a, we assume the following:
There exists a positive constant such that
(2.3)
for all and , where (a space to be defined later) with .
with , for all .
(2.5)
We now introduce the spaces:
and
On , we introduce the Luxemburg norm
Then
is a norm on the space .
Remark 2.1 If , then . Indeed, if , then . Let
where
and
is necessarily a finite set and for any since .
We also have that , then . As is a finite set, then , which implies that
Thus,
Proposition 2.1 Under condition (2.5), satisfies:
-
(a)
; .
-
(b)
For , if , we have
and if , we have
-
(c)
For every fixed , is a continuous convex even function in λ, and it increases strictly when .
Proof (a) Let , we have
-
(b)
For , if , we have
We also have .
If , we have
We also have .
-
(c)
For every fixed and , we have
This proves that is convex.
Let such that . We have
Thus, for every fixed , increases strictly when .
For the continuity of , let be a real sequence such that as . We denote . We have
where
Then,
Therefore, we have the continuity of . □
Proposition 2.2 Let , then if and only if .
Proof Let us denote .
Case 1: . Then, there exists a sequence such that .
Therefore, as for all and is continuous with respect to λ, then we get .
Suppose now that . As , then there exists such that . Then
Solving the inequality , we get
Since
then there exists such that , which is a contradiction.
Thus,
Case 2: . Then, and . Let be a sequence such that .
We suppose that , then
So
which implies that
Therefore,
which is a contradiction. Thus,
□
Proposition 2.3 If and , then the following properties hold:
-
(1)
;
-
(2)
;
-
(3)
;
-
(4)
as .
Proof (1) .
Case 1. is proven using Proposition 2.2.
Case 2. . Suppose that , then
Conversely, taking and supposing that , then
which is a contradiction. Therefore, .
Case 3. . Suppose that , then
Conversely, we take and we suppose that . We have
which is a contradiction. Therefore .
-
(2)
.
Let , then
which is equivalent to
Thus,
-
(3)
. The proof is similar to that for the Case 2.
-
(4)
as .
Case 1. , then
where
So as .
Case 2. as , then
where
So as . □
Proposition 2.4 Let , then .
Proof Case 1. . Then
where .
Thus
Therefore, by mimicking the proof of Proposition 2.2, we deduce that .
Case 2. . As in the first case, we get . □
Proposition 2.5 If and , then the following properties hold:
-
(1)
;
-
(2)
;
-
(3)
;
-
(4)
as .
Proof The proof is similar to the proof of Proposition 2.3. □
Theorem 2.1 (Discrete Hölder type inequality)
Let and be such that , then
Proof Let and be such that .
Case 1. or , then the result is true.
Case 2. and . Let us denote and . Then, by Young inequality, we deduce that
Therefore, . □