{'fraction_non_alphanumeric': 0.06768739329184337, 'fraction_numerical': 0.014539846891006224, 'mean_word_length': 3.5830388692579507, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 25, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 4, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Modular Uniform Convexity of Lebesgue Spaces of Variable Integrability

We analyze the modular geometry of the Lebesgue space with variable exponent, L p ( · ) . Our central result is that L p ( · ) possesses a modular uniform convexity property. Part of the novelty is that the property holds even in the case sup x ∈ Ω p ( x ) = ∞ . We present specific applications to fixed point theory.


Introduction
In this work, we prove a hitherto unknown modular convexity property of the Lebesgue spaces with variable exponent, L p(·) , which has far reaching applications in fixed point theory, remarkably even in the case in which the exponent p(·) is unbounded.
Lebesgue spaces of variable-exponent (L p(·) ) were first mentioned in [1]. In the late 19 th century these spaces were brought into the center stage of mathematical research as they were realized to be the natural solution space for partial differential equations exhibiting non-standard growth. The first systematic treatment of variable exponent spaces was given in [2]. In 1997, while studying differential equations in electromagnetism, V. Zhikov's work [3] led to the minimization of integrals of the form Ω |∇w(x)| p(x) dx, which in turn leads to the corresponding Lagrange-Euler equation: ∆ p(·) w := div |∇w| p(·)−2 ∇w = 0. (1) Because of the variability of p(x), Equation (1) is said to have non-standard growth. The natural space for the solutions of such differential equations must take into consideration the dependence of p(x) on the space variable x. It is at this point obvious that the classical L p theory is not sufficient in this situation and that a condition such as Ω |∇u(x)| p(x) dx < ∞ should be imposed as an a priori requirement.
Similar considerations arise in the study of the hydrodynamic equations governing non-Newtonian fluids [4,5]. These equations have non-standard growth and model, in particular, electrorheological fluids, i.e., fluids whose viscosity can be changed dramatically and in a few mili-seconds when exposed to a magnetic or an electric field. Electrorheological fluids are currently the object of intense research activity in both theoretical and applied fields. Their applications include medicine, civil engineering and military science [6][7][8][9].
Through these applications, then, there inexorably emerged the need for a deeper understanding of these generalized functional spaces with variable integrability.
The article is organized in the following manner: In Section 2 we give the definition of a convex modular and introduce the definition of the UUC2 condition. In Section 3 we lay the ground for our main result by properly defining the Lebesgue spaces with variable integrability. In Section 4, Theorem 3, which constitutes the main contribution of this work, is proved and in Section 5 we present applications.

Modular Spaces
In the present section we introduce the standard definitions and terminology on modular spaces to be used in the sequel. We also state the concept of modular uniform convexity. For a detailed account of the ideas expounded here, the interested reader is referred to the monograph [10]. Let V be a real or complex vector space. We denote the scalar field with K.
that satisfies the following conditions: for all x, y ∈ V and t ∈ (0, 1]. In particular, if s = 1, the modular is said to be convex. A convex modular ρ on a vector space V is leftcontinuous (right-continuous) if for any x ∈ V the map is left-continuous (right-continuous) on [0, ∞) (or, on (0, ∞) in the case of left continuity); if ρ is both left-and right-continuous, it is said to be continuous.
If ρ satisfies conditions (1) and (2) but not necessarily condition (1), it is said to be a semimodular on V. By reason of its relevance to the present work, the following standard example is noted: Consider a domain Ω ⊆ R n and set M to denote the vector space of all Borel-measurable real-valued functions on Ω. Then, the functional is a semimodular on M. The following definition is standard [11,12]: Let V be a real vector space and ρ be a convex modular on V. ρ is said to be uniformly convex if for each ε > 0 there exists δ = δ(ε) > 0 such that, for every u ∈ V and v ∈ V with ρ(u) = 1, ρ(v) = 1 and

Modular Uniform Convexity
A less stringent form of modular uniform convexity was introduced and studied in [10]. Specifically, Definition 3. Let V be a real vector space and ρ be a convex modular on V. Let r > 0, ε > 0. Set and If D(r, ε) = ∅, we define δ(r, ε) = 1. Notice that for ε > 0 that is small enough, D(r, ε) = ∅.

Lebesgue Spaces with Variable Exponent
In what follows, we delve into the question of uniform convexity of the Lebesgue spaces of variable exponent. We start by stating the basic definitions ( [2,[13][14][15]). Given a domain Ω ⊂ R n , M(Ω) will stand for the vector space of all real-valued, Borel-measurable functions defined on Ω. We will denote by P (Ω) the subset of M that consists of all functions As usual, if A is a Borel set A ⊂ R n , its Lebesgue measure will be written as |A|. Fix such a function p, define the sets: Proof of Theorem 1. See [2,14].

Theorem 1. The function
On the subspace V of M(Ω) defined as is a norm; it is called the Luxemburg norm. Furnished with the Luxemburg norm, V becomes a Banach space. In particular, if the function p is constant, this space coincides with the Lebesgue space L p . For this reason, V is called the Lebesgue space of variable exponent or of variable integrability and denoted by L p(·) (Ω).
To the author's best knowledge, the first reference to the modular given in Theorem 1 is to be found in the work by Orlicz [1]. We refer the reader to [2,13,14] for a systematic treatment of the variable exponent Lebesgue spaces. Notice that We point out in passing that L p(·) (Ω) is the Musielak-Orlicz space corresponding to the Musielak-Orlicz function These spaces were introduced by Nakano in 1950 [16]; we refer to the surveys [11,13,15] for more detailed information on this vast topic.
If p is constant in Ω, the modular ρ p is simply the p th power of the Luxemburg norm (5). For this reason, when working whether with the norm or with the modular, one faces essentially the same technicalities. If p is non-constant, however, the situation changes radically. In this case, the handling of the norm presents technical challenges and its often desirable to work with the modular whenever possible. This is especially true when dealing with uniform convexity.

Uniform Convexity
We recall the following standard definition: a normed space (X, · ) is defined to be uniformly convex iff given any ε : 0 < ε ≤ 2 one has The number δ X (ε) is known as the modulus of uniform convexity of X (see, for example, [17,18]). For the variable exponent spaces L p(·) (Ω), uniform convexity is fully characterized. The reader is referred to [14,19] for the proof of the next Theorem. Notice that it follows that the uniform convexity of the Luxemburg normnin expression (5) is equivalent to the ∆ 2 -condition.
Theorem 2. The following statements are equivalent for any function p ∈ P (Ω): The modular ρ p satisfies the ∆ 2 -condition. More precisely, there exists a positive constant K such that for

Modular Uniform Convexity
Though it follows from Theorem 2 that there is no hope for norm-uniform convexity of L p(·) (Ω) if the exponent p is unbounded, we will show in this section that even when p + = ∞, the modular ρ p still exhibits the uniform-convexity property UUC2 introduced in Definition 3. As will be discussed in Section 6, this property has far-reaching implications.
To tackle the modular uniform convexity property aim, the following auxiliaries inequalities are necessary: If p ≥ 2 [17], it holds that A detailed proof of (ii) is given in [15]. We next set out to state and prove Theorem 3, which is the central aim of this article.
Proof of Theorem 3. Fix a domain Ω ⊆ R n and p ∈ P (Ω); let ρ p be as in Theorem 1. Let r > 0, ε > 0 and consider u, v ∈ D(r, ε), that is, assume that On account of the convexity of ρ p we have ε ≤ 1: indeed, Let If inequality (6) holds, one has, by virtue of inequality (i) in Lemma 1: It is thus concluded that, in this case, Thus, On the other hand, if inequality (7) holds, we define With this notation, it follows that The validity of statement (7) implies in particular that Integrating the last inequality over Ω \ (Ω 1 ∪ Ω 2 ) , it is easily concluded that We arrive thus at In all We conclude that, for any r > 0, ε > 0 and arbitrary u, v ∈ D(r, ε) as specified in Definition 3, it holds that and it is concluded by definition that L p(·) (Ω) is UUC2.

Applications
A remarkable fact about the above discussion is that the UUC2 property holds even if p + = sup x∈Ω p(x) = ∞, that is, in the absence of the ∆ 2 condition. This observation makes the UUC2 condition a valuable tool for dealing with certain applications that have been hitherto heavily ∆ 2 -dependent. For an exhaustive treatment of the interplay between modular spaces and fixed point theory, we refer the reader to the monograph [10].
Norm convergence is equivalent to modular convergence in L p(·) (Ω) if and only if ρ p fulfills the ∆ 2 condition [13,15]. Bearing this fact in mind, we introduce some terminology before proceeding any further: a subset W ∈ L p(·) (Ω) will be called ρ p -bounded if, for some constant C ≥ 0 and any u ∈ W, the inequality ρ p (u) ≤ C holds. W is said to be ρ p -closed if whenever u n ρ p → u one has u ∈ W. Notice that, if p + = ∞, then ρ-closedness and ρ-boundedness are strictly weaker than norm-closedness and norm-boundedness, respectively.
The next observation is of particular importance in the sequel. Let u ∈ L p(·) (Ω), v ∈ L p(·) (Ω) and let (v n ) be ρ p -convergent to v. Fatou's Lemma yields the following inequality For obvious reasons, the above is known as the Fatou property of the modular ρ p .
Then, there exists a unique v 0 ∈ W for which Proof of Theorem 4. One can clearly assume that u / ∈ W, otherwise there is nothing to prove. Under this assumption, one must have d(u, W) > 0, due to the ρ p -closedness of W. Let (v n ) ⊆ W be such that Then, the sequence v n 2 must be ρ p -Cauchy, i.e., it must necessarily hold that ρ p (2 −1 (v n − v m )) → 0 as m, n → ∞. The latter follows by contradiction. Indeed, if otherwise, there would exist δ > 0 and strictly increasing subsequences (n k ) k≥1 and (m k ) k≥1 with n k > m k for every k such that for each k ∈ N. Since n k > m k , it would then hold that Together with the bound (9) and in by virtue of Definitions (3) and (4) and of Theorem 1, there exists for any k ∈ N. Though not mentioned explicitly there, the proof of Theorem 1 contains the fact that η is independent r k . Since W is convex by assumption, the last inequality above yields Letting k tend to ∞ one clearly reaches a contradiction: in conclusion, the sequence v n 2 is ρ p -Cauchy, as claimed. Since L p(·) (Ω) is ρ p -complete, we define v as Notice that for fixed k ∈ N, v k +v n 2 n converges to v k 2 + v. The convexity and ρ p -closedness of W imply then that v k 2 + v ∈ W for each k and invoking again the closedness of W we conclude that 2v ∈ W. On account of the Fatou's property for the modular ρ p , one concludes that Since ρ p has the UUC2 property, it is strictly convex. Hence, w = 2v, which yields the uniqueness statement.
It should be emphasized at this point that Theorem 4 can be restated as the following minimization result: Theorem 5. In the notation and under the hypotheses of Theorem 4, there exists a unique solution u 0 ∈ W to the minimization problem (notice here that u ∈ L p(·) (Ω)).

Proof of Theorem 5. It is immediate from Theorem 4 that the unique solution is given by
Aiming at presenting further applications of the UUC2 property for L p(·) (Ω), we state and prove Theorem 6: Theorem 6. Consider a non-increasing sequence (C n ) n of ρ p -closed, convex, nonempty subsets of L p(·) (Ω) and assume that p − > 1.
Suppose that for some v ∈ L p(·) (Ω) it holds that sup Proof of Theorem 6. It is sufficient to assume that, for some n 0 ∈ N, it holds that v / ∈ C n 0 ; otherwise there would be nothing to prove. From the ρ p -closedness of C n 0 , it is easily derived that d(v, C n 0 ) > 0. Since the sequence (C n ) n is non-increasing by assumption, the inequalities are clear for any n > 1. Thus, the sequence d(v, C n ) is non-decreasing and bounded. Let L = lim n→∞ d(v, C n ) < ∞; clearly L > 0. For each n ∈ N, let u n ∈ C n be chosen so that ρ p (v − u n ) = d(v, C n ). As in Theorem 4, one can prove that the sequence u n 2 n is ρ p -Cauchy in L p(·) (Ω) and hence it ρ p -converges to, say, u/2 ∈ L p(·) (Ω). Fix k ∈ N. Then, the sequence u n 2 n≥k is contained in C k and ρ p -converges to u 2 , which implies that u 2 ∈ C k , since C k is ρ p -closed. In conclusion, i.e., ∞ n=1 C n = ∅, as claimed.
To facilitate the proof of the following theorem, we recall the following: Theorem 7. Assume that p − > 1 and suppose that ∅ = C ⊂ L p(·) (Ω) is a ρ p -closed, ρ p -bounded, convex set, then if let (C i ) i∈I ⊂ 2 C is a family of subsets of C having the finite intersection property, it necessarily holds that i∈I C i = ∅.
Proof of Theorem 7. C is ρ p -bounded; it is therefore immediate that, for any u ∈ C and i ∈ I, For any finite subset A ⊂ I, let Notice that if A and B are finite subsets of I and if A ⊆ B, then Let (A n ) be the sequence defined by Write B n = n k=1 A k and J = ∞ n=1 B n . It is clear then that, for each n ∈ N, the set i∈B n C i is ρ p -closed, convex and non-empty and that the sequence i∈B n C i is non-increasing. Hence, Theorem 6 applies and we have S = i∈J C i = ∅.
By definition, for each n ∈ N, it holds that i∈J C i ⊆ i∈A n C i , and it follows that for each n one has Thus, d(u, S) = d I . On account of Theorem 4, there exists a unique z ∈ S which satisfies ρ p (u − z) = d I and, therefore, for any index i 0 ∈ I, one has it is seen immediately that d I ≤ d(u, S) ≤ d(u, S ∩ C i 0 ) ≤ d I . In all, and by Theorem 4 there exists a unique w ∈ S ∩ C i 0 for which In particular, w ∈ S, thus, invoking the uniqueness part of Theorem 4, one must necessarily have w = z. Since i 0 is arbitrary, it is concluded that z ∈ i∈I C i and hence the latter intersection is non-empty, as claimed.
The following theorem is another consequence of the UUC2 property for L p(·) (Ω).
Theorem 8. Let p − > 1, ∅ = C ⊂ L p(·) (Ω) be a convex, ρ p -closed, ρ p bounded and assume that C is not a singleton (i.e., C at least two distinct points). Then, there exists u ∈ C for which where as usual diam(C) = sup a,b∈C ρ p (a − b) stands for the ρ p -diameter of C.
The property established in Theorem 8 is commonly referred to as the ρ p -normal structure property. Theorem 8 can thus be rephrased as asserting that, if p − > 1, then L p(·) (Ω) has ρ p -norma structure.
Proof of Theorem 8. The assumptions imply that δ(C) > 0 and that there exist two distinct points u ∈ C, v ∈ C, u = v. For any w ∈ C, invoking the UUC2 property, it follows at once that, for δ as in the definition of UUC2, (Definition (3)), The arbitrariness of w in concert with the convexity of C yields the claim.
Theorem 9. If p − > 1 and ∅ = C ⊂ L p(·) (Ω) is convex, ρ p -closed and ρ p -bounded, it follows that any map holds for any u ∈ C, v ∈ C, has a fixed point. In other words, under the above conditions, there exists w ∈ C such that T(w) = w.
Proof of Theorem 9. It is obvious that the theorem is true if C is a singleton. Thus, it can be assumed that the cardinality of C is at least 2. Let F = ∅ = K ⊂ C : K is ρ p -closed and T(K) ⊆ K .
Since C ∈ F , F = ∅. Moreover, F is partially ordered by the order relation If G is a totally order subfamily of F , then G possesses the finite intersection property and, on account of Theorem 7, it follows that X∈G X = ∅; this clearly implies that X∈G X ∈ F , hence X∈G X is an upper bound for G.
Zorn's Lemma yields the existence of a maximal element X 0 ∈ F . We set about to prove that X 0 contains exactly one point. Denote the intersection of all ρ p -closed, convex subsets of C that contain T(X 0 ) by conv ρ p (T(X 0 )). In particular, since X 0 ∈ F , conv ρ p (T(X 0 )) ⊆ X 0 .
On the other hand, the set conv ρ p (T(X 0 )) belongs to F because it is convex, ρ p -closed and it holds that As a consequence of the maximality of X 0 with respect to the indicated inclusion, one has conv ρ p (T(X 0 )) = X 0 .
Theorem 8 yields the existence of an element x 0 ∈ X 0 such that Let B ρ p (a, s) denote the ρ p -ball of radius s centered at a; we remark the obvious fact that the convexity and the Fatou property of the modular ρ p imply that B ρ p (a, s) is ρ p -closed and convex. Set then, M is ρ p -closed and convex and M ⊂ X 0 . Moreover, if x ∈ M, then for any v ∈ X 0 In other words, if v ∈ X 0 , ρ p (T(v) − T(x)) ≤ r 0 , i.e., T(X 0 ) ⊆ B ρ p (T(x), r 0 ). By definition of conv ρ p (T(X 0 )) , it is plain that: conv ρ p (T(X 0 )) ⊆ B ρ p (T(x), r 0 ); from equality (11), it follows that X 0 = conv ρ p (T(X 0 )) ⊆ B ρ p (T(x), r 0 ); that is, for any v ∈ X 0 , ρ p (T(x) − v) ≤ r 0 , i.e., T(x) ∈ B ρ p (v, r 0 ). It is clear that, by definition of M, so that M ∈ F and, since M ⊆ X 0 and X 0 is maximal, one has a fortiori: By definition, then, if w ∈ X 0 , ρ p (w − x 0 ) ≤ r 0 ; this forces the inequality diam(X 0 ) ≤ r 0 , which contradicts the strict inequality (12) unless diam(X 0 ) = 0. Hence, diam(X 0 ) = 0 and X 0 = {a} is a singleton. Since also T(X 0 ) ⊆ X 0 , necessarily T(a) = a.
In conclusion, T has a fixed point.

Conclusions
The main results in this work can be summarized as follows: Theorem 3 asserts that, if p − > 1, then the variable exponent space L p(·) (Ω) has the UUC2 property.
It follows from Theorem 7 that, if p − > 1 and C ⊂ L p(·) (Ω) is a nonempty, ρ p -closed, ρ p -bounded, convex set, then any family of subsets of C that has the finite intersection property has nonempty intersection.
In Theorem 9, it is proved that, if p − > 1, then any non-expansive map T on a nonempty, ρ p -closed, ρ p -bounded, convex subset of L p(·) (Ω) has a fixed point.
Author Contributions: All authors contributed equally to this article.