|
Cocompact Embedding
In mathematics, cocompact embeddings are embeddings of normed vector spaces possessing a certain property similar to but weaker than compactness. Cocompactness has been in use in mathematical analysis since the 1980s, without being referred to by any name E. Lieb, On the lowest eigenvalue of the Laplacian for the intersection of two domains. Invent. Math. 74 (1983), 441–448.(Lemma 6),V. Benci, G. Cerami, Existence of positive solutions of the equation −Δu+a(x)u=u(N+2)/(N−2) in RN, J. Funct. Anal. 88 (1990), no. 1, 90–117.(Lemma 2.5),S. Solimini, A note on compactness-type properties with respect to Lorentz norms of bounded subsets of a Sobolev space. Ann. Inst. H. Poincaré Anal. Non Linéaire 12 (1995), 319–337.(Theorem 1), or by ad-hoc monikers such as ''vanishing lemma'' or ''inverse embedding''.Terence Tao, A pseudoconformal compactification of the nonlinear Schrödinger equation and applications, New York J. Math. 15 (2009), 265–282. Cocompactness property allows ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Embedding
In mathematics, an embedding (or imbedding) is one instance of some mathematical structure contained within another instance, such as a group that is a subgroup. When some object X is said to be embedded in another object Y, the embedding is given by some injective and structure-preserving map f:X\rightarrow Y. The precise meaning of "structure-preserving" depends on the kind of mathematical structure of which X and Y are instances. In the terminology of category theory, a structure-preserving map is called a morphism. The fact that a map f:X\rightarrow Y is an embedding is often indicated by the use of a "hooked arrow" (); thus: f : X \hookrightarrow Y. (On the other hand, this notation is sometimes reserved for inclusion maps.) Given X and Y, several different embeddings of X in Y may be possible. In many cases of interest there is a standard (or "canonical") embedding, like those of the natural numbers in the integers, the integers in the rational numbers, the rational n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Normed Vector Space
In mathematics, a normed vector space or normed space is a vector space over the real or complex numbers, on which a norm is defined. A norm is the formalization and the generalization to real vector spaces of the intuitive notion of "length" in the real (physical) world. A norm is a real-valued function defined on the vector space that is commonly denoted x\mapsto \, x\, , and has the following properties: #It is nonnegative, meaning that \, x\, \geq 0 for every vector x. #It is positive on nonzero vectors, that is, \, x\, = 0 \text x = 0. # For every vector x, and every scalar \alpha, \, \alpha x\, = , \alpha, \, \, x\, . # The triangle inequality holds; that is, for every vectors x and y, \, x+y\, \leq \, x\, + \, y\, . A norm induces a distance, called its , by the formula d(x,y) = \, y-x\, . which makes any normed vector space into a metric space and a topological vector space. If this metric space is complete then the normed space is a Banach space. Every normed vec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Compact Embedding
In mathematics, the notion of being compactly embedded expresses the idea that one set or space is "well contained" inside another. There are versions of this concept appropriate to general topology and functional analysis. Definition (topological spaces) Let (''X'', ''T'') be a topological space, and let ''V'' and ''W'' be subsets of ''X''. We say that ''V'' is compactly embedded in ''W'', and write ''V'' ⊂⊂ ''W'', if * ''V'' ⊆ Cl(''V'') ⊆ Int(''W''), where Cl(''V'') denotes the closure of ''V'', and Int(''W'') denotes the interior of ''W''; and * Cl(''V'') is compact. Definition (normed spaces) Let ''X'' and ''Y'' be two normed vector spaces with norms , , •, , ''X'' and , , •, , ''Y'' respectively, and suppose that ''X'' ⊆ ''Y''. We say that ''X'' is compactly embedded in ''Y'', and write ''X'' ⊂⊂ ''Y'', if * ''X'' is continuously embedded in ''Y''; i.e., there is a constant ''C'' such that , , ''x' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Analysis
Analysis is the branch of mathematics dealing with continuous functions, limit (mathematics), limits, and related theories, such as Derivative, differentiation, Integral, integration, measure (mathematics), measure, infinite sequences, series (mathematics), series, and analytic functions. These theories are usually studied in the context of Real number, real and Complex number, complex numbers and Function (mathematics), functions. Analysis evolved from calculus, which involves the elementary concepts and techniques of analysis. Analysis may be distinguished from geometry; however, it can be applied to any Space (mathematics), space of mathematical objects that has a definition of nearness (a topological space) or specific distances between objects (a metric space). History Ancient Mathematical analysis formally developed in the 17th century during the Scientific Revolution, but many of its ideas can be traced back to earlier mathematicians. Early results in analysis were i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sobolev Space
In mathematics, a Sobolev space is a vector space of functions equipped with a norm that is a combination of ''Lp''-norms of the function together with its derivatives up to a given order. The derivatives are understood in a suitable weak sense to make the space complete, i.e. a Banach space. Intuitively, a Sobolev space is a space of functions possessing sufficiently many derivatives for some application domain, such as partial differential equations, and equipped with a norm that measures both the size and regularity of a function. Sobolev spaces are named after the Russian mathematician Sergei Sobolev. Their importance comes from the fact that weak solutions of some important partial differential equations exist in appropriate Sobolev spaces, even when there are no strong solutions in spaces of continuous functions with the derivatives understood in the classical sense. Motivation In this section and throughout the article \Omega is an open subset of \R^n. There are many c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cocompact Group Action
In mathematics, an action of a group ''G'' on a topological space ''X'' is cocompact if the quotient space ''X''/''G'' is a compact space. If ''X'' is locally compact In topology and related branches of mathematics, a topological space is called locally compact if, roughly speaking, each small portion of the space looks like a small portion of a compact space. More precisely, it is a topological space in which ev ..., then an equivalent condition is that there is a compact subset ''K'' of ''X'' such that the image of ''K'' under the action of ''G'' covers ''X''. It is sometimes referred to as ''mpact'', a tongue-in-cheek reference to dual notions where prefixing with "co-" twice would "cancel out". References * Group actions (mathematics) {{topology-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continuous Embedding
In mathematics, one normed vector space is said to be continuously embedded in another normed vector space if the inclusion function between them is continuous function, continuous. In some sense, the two norms are "almost equivalent", even though they are not both defined on the same space. Several of the Sobolev inequality, Sobolev embedding theorems are continuous embedding theorems. Definition Let ''X'' and ''Y'' be two normed vector spaces, with norms , , ·, , ''X'' and , , ·, , ''Y'' respectively, such that ''X'' ⊆ ''Y''. If the identity function, inclusion map (identity function) :i : X \hookrightarrow Y : x \mapsto x is continuous, i.e. if there exists a constant ''C'' > 0 such that :\, x \, _Y \leq C \, x \, _X for every ''x'' in ''X'', then ''X'' is said to be continuously embedded in ''Y''. Some authors use the hooked arrow "↪" to denote a continuous embedding, i.e. "''X'' ↪ ''Y''" means "''X'' and ''Y'' are normed spaces with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trudinger's Theorem
In mathematical analysis, Trudinger's theorem or the Trudinger inequality (also sometimes called the Moser–Trudinger inequality) is a result of functional analysis on Sobolev spaces. It is named after Neil Trudinger (and Jürgen Moser). It provides an inequality between a certain Sobolev space norm and an Orlicz space norm of a function. The inequality is a limiting case of Sobolev imbedding and can be stated as the following theorem: Let \Omega be a bounded domain in \mathbb^n satisfying the cone condition. Let mp=n and p>1. Set : A(t)=\exp\left( t^ \right)-1. Then there exists the embedding : W^(\Omega)\hookrightarrow L_A(\Omega) where : L_A(\Omega)=\left\. The space :L_A(\Omega) is an example of an Orlicz space In mathematical analysis, and especially in real, harmonic analysis and functional analysis, an Orlicz space is a type of function space which generalizes the ''L'p'' spaces. Like the ''L'p'' spaces, they are Banach spaces. The spaces are na .... Referenc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orlicz Space
In mathematical analysis, and especially in real, harmonic analysis and functional analysis, an Orlicz space is a type of function space which generalizes the ''L''''p'' spaces. Like the ''L''''p'' spaces, they are Banach spaces. The spaces are named for Władysław Orlicz, who was the first to define them in 1932. Besides the ''L''''p'' spaces, a variety of function spaces arising naturally in analysis are Orlicz spaces. One such space ''L'' log+ ''L'', which arises in the study of Hardy–Littlewood maximal functions, consists of measurable functions ''f'' such that the integral :\int_ , f(x), \log^+ , f(x), \,dx < \infty. Here log+ is the of the logarithm. Also included in the class of Orlicz spaces are many of the most important |
Strichartz Estimate
In mathematical analysis, Strichartz estimates are a family of inequalities for linear dispersive partial differential equations. These inequalities establish size and decay of solutions in mixed norm Lebesgue spaces. They were first noted by Robert Strichartz and arose out of connections to the Fourier restriction problem. Examples Consider the linear Schrödinger equation The Schrödinger equation is a linear partial differential equation that governs the wave function of a quantum-mechanical system. It is a key result in quantum mechanics, and its discovery was a significant landmark in the development of the ... in \mathbb^d with ''h'' = ''m'' = 1. Then the solution for initial data u_0 is given by e^u_0. Let ''q'' and ''r'' be real numbers satisfying 2\leq q, r \leq \infty; \frac+\frac=\frac; and (q,r,d)\neq(2,\infty,2). In this case the homogeneous Strichartz estimates take the form: :\, e^ u_0\, _\leq C_ \, u_0\, _. Further suppose that \t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Compactness (mathematics)
In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space by making precise the idea of a space having no "punctures" or "missing endpoints", i.e. that the space not exclude any ''limiting values'' of points. For example, the open interval (0,1) would not be compact because it excludes the limiting values of 0 and 1, whereas the closed interval ,1would be compact. Similarly, the space of rational numbers \mathbb is not compact, because it has infinitely many "punctures" corresponding to the irrational numbers, and the space of real numbers \mathbb is not compact either, because it excludes the two limiting values +\infty and -\infty. However, the ''extended'' real number line ''would'' be compact, since it contains both infinities. There are many ways to make this heuristic notion precise. These ways usually agree in a metric space, but may not be equivalent in other topological ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convergence (mathematics)
In mathematics, a series is the sum of the terms of an infinite sequence of numbers. More precisely, an infinite sequence (a_0, a_1, a_2, \ldots) defines a series that is denoted :S=a_0 +a_1+ a_2 + \cdots=\sum_^\infty a_k. The th partial sum is the sum of the first terms of the sequence; that is, :S_n = \sum_^n a_k. A series is convergent (or converges) if the sequence (S_1, S_2, S_3, \dots) of its partial sums tends to a limit; that means that, when adding one a_k after the other ''in the order given by the indices'', one gets partial sums that become closer and closer to a given number. More precisely, a series converges, if there exists a number \ell such that for every arbitrarily small positive number \varepsilon, there is a (sufficiently large) integer N such that for all n \ge N, :\left , S_n - \ell \right , 1 produce a convergent series: *: ++++++\cdots = . * Alternating the signs of reciprocals of powers of 2 also produces a convergent series: *: -+-+-+\cdots = ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
