2016
DOI: 10.1007/bf03377397
|View full text |Cite
|
Sign up to set email alerts
|

Multiscale Weak Compactness in Metric Spaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(5 citation statements)
references
References 27 publications
0
5
0
Order By: Relevance
“…Remark In Step 3 above, to show E satisfies (PS) c condition for any c<c$c&lt;c^*$, we proceed in a classical way. But to recover compactness, that is, to prove (PS) c condition, one may use profile decomposition theorem [13, 15, 16, 20, 23, 24, 31, 33, 34]. The main steps are the following: (1)Consider a (PS) c sequence {uk}k1$\lbrace u_k\rbrace _{k \ge 1}$ for E , that is, Efalse(ukfalse)c$E(u_k) \rightarrow c$ and E(uk)0$E^{\prime }(u_k) \rightarrow 0$ in (X0false(normalΩfalse))$(X_0(\Omega ))^{\prime }$ as k$k \rightarrow \infty$, thereby showing that sequence {uk}k1$\lbrace u_k\rbrace _{k \ge 1}$ is bounded in X0(Ω)$X_0(\Omega )$. (2)The weak limit of {uk}k1$\lbrace u_k\rbrace _{k \ge 1}$ (up to a subsequence), u (0) solves false(scriptPfalse)$(\mathcal {P})$. (3)If the convergence of {uk}k1…”
Section: Proof Of Theorem 11mentioning
confidence: 99%
See 1 more Smart Citation
“…Remark In Step 3 above, to show E satisfies (PS) c condition for any c<c$c&lt;c^*$, we proceed in a classical way. But to recover compactness, that is, to prove (PS) c condition, one may use profile decomposition theorem [13, 15, 16, 20, 23, 24, 31, 33, 34]. The main steps are the following: (1)Consider a (PS) c sequence {uk}k1$\lbrace u_k\rbrace _{k \ge 1}$ for E , that is, Efalse(ukfalse)c$E(u_k) \rightarrow c$ and E(uk)0$E^{\prime }(u_k) \rightarrow 0$ in (X0false(normalΩfalse))$(X_0(\Omega ))^{\prime }$ as k$k \rightarrow \infty$, thereby showing that sequence {uk}k1$\lbrace u_k\rbrace _{k \ge 1}$ is bounded in X0(Ω)$X_0(\Omega )$. (2)The weak limit of {uk}k1$\lbrace u_k\rbrace _{k \ge 1}$ (up to a subsequence), u (0) solves false(scriptPfalse)$(\mathcal {P})$. (3)If the convergence of {uk}k1…”
Section: Proof Of Theorem 11mentioning
confidence: 99%
“…In Step 3 above, to show 𝐸 satisfies (PS) 𝑐 condition for any 𝑐 < 𝑐 * , we proceed in a classical way. But to recover compactness, that is, to prove (PS) 𝑐 condition, one may use profile decomposition theorem[13,15,16,20,23,24,31,33,34].…”
mentioning
confidence: 99%
“…), ϕ = 0, for every ϕ ∈ H 1,2 SO(N ) (B N ) and λ ∈ (0, λ (ω)). Hence, J λ (u Profile decomposition methods can be useful in order to study similar problems when a lack of compactness occurs (see, among others, the recent papers [15,16]). A further and more general investigation of this topics will be included in the forthcoming book [37].…”
Section: Proof Of the Main Theoremmentioning
confidence: 99%
“…Remark 4.2. Profile decomposition methods can be useful in order to study similar problems when a lack of compactness occurs (see, among others, the recent papers [15,16]). A further and more general investigation of this topics will be included in the forthcoming book [37].…”
Section: Proof Of the Main Theoremmentioning
confidence: 99%