Symmetric Decreasing Rearrangement
   HOME
*



picture info

Symmetric Decreasing Rearrangement
In mathematics, the symmetric decreasing rearrangement of a function is a function which is symmetric and decreasing, and whose level sets are of the same size as those of the original function. Definition for sets Given a measurable set, A, in \R^n, one defines the ''symmetric rearrangement'' of A, called A^*, as the ball centered at the origin, whose volume (Lebesgue measure) is the same as that of the set A. An equivalent definition is A^* = \left\, where \omega_n is the volume of the unit ball and where , A, is the volume of A. Definition for functions The rearrangement of a non-negative, measurable real-valued function f whose level sets f^(y) (for y \in \R_) have finite measure is f^*(x) = \int_0^\infty \mathbb_(x) \, dt, where \mathbb_A denotes the indicator function of the set A. In words, the value of f^*(x) gives the height t for which the radius of the symmetric rearrangement of \ is equal to x. We have the following motivation for this definition. Because the iden ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Pólya–Szegő Inequality
In mathematical analysis, the Pólya–Szegő inequality (or Szegő inequality) states that the Sobolev energy of a function in a Sobolev space does not increase under symmetric decreasing rearrangement. The inequality is named after the mathematicians George Pólya and Gábor Szegő. Mathematical setting and statement Given a Lebesgue measurable function u:\R^n\to \R^+,the symmetric decreasing rearrangement u^*:\R^n\to \R^+, is the unique function such that for every t \in \R, the sublevel set u^*^((t, +\infty)) is an open ball centred at the origin 0 \in \R^n that has the same Lebesgue measure as u^((t, +\infty)). Equivalently, u^* is the unique radial and radially nonincreasing function, whose strict sublevel sets are open and have the same measure as those of the function u. The Pólya–Szegő inequality states that if moreover u \in W^(\R^n), then u^* \in W^(\R^n) and : \int_ , \nabla u^*, ^p \leq \int_ , \nabla u, ^p. Applications of the inequality The Pólya–S ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Measure Theory
In mathematics, the concept of a measure is a generalization and formalization of geometrical measures ( length, area, volume) and other common notions, such as mass and probability of events. These seemingly distinct concepts have many similarities and can often be treated together in a single mathematical context. Measures are foundational in probability theory, integration theory, and can be generalized to assume negative values, as with electrical charge. Far-reaching generalizations (such as spectral measures and projection-valued measures) of measure are widely used in quantum physics and physics in general. The intuition behind this concept dates back to ancient Greece, when Archimedes tried to calculate the area of a circle. But it was not until the late 19th and early 20th centuries that measure theory became a branch of mathematics. The foundations of modern measure theory were laid in the works of Émile Borel, Henri Lebesgue, Nikolai Luzin, Johann Radon, Const ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Almost Everywhere
In measure theory (a branch of mathematical analysis), a property holds almost everywhere if, in a technical sense, the set for which the property holds takes up nearly all possibilities. The notion of "almost everywhere" is a companion notion to the concept of measure zero, and is analogous to the notion of ''almost surely'' in probability theory. More specifically, a property holds almost everywhere if it holds for all elements in a set except a subset of measure zero, or equivalently, if the set of elements for which the property holds is conull. In cases where the measure is not complete, it is sufficient that the set be contained within a set of measure zero. When discussing sets of real numbers, the Lebesgue measure is usually assumed unless otherwise stated. The term ''almost everywhere'' is abbreviated ''a.e.''; in older literature ''p.p.'' is used, to stand for the equivalent French language phrase ''presque partout''. A set with full measure is one whose complement i ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Measurable Function
In mathematics and in particular measure theory, a measurable function is a function between the underlying sets of two measurable spaces that preserves the structure of the spaces: the preimage of any measurable set is measurable. This is in direct analogy to the definition that a continuous function between topological spaces preserves the topological structure: the preimage of any open set is open. In real analysis, measurable functions are used in the definition of the Lebesgue integral. In probability theory, a measurable function on a probability space is known as a random variable. Formal definition Let (X,\Sigma) and (Y,\Tau) be measurable spaces, meaning that X and Y are sets equipped with respective \sigma-algebras \Sigma and \Tau. A function f:X\to Y is said to be measurable if for every E\in \Tau the pre-image of E under f is in \Sigma; that is, for all E \in \Tau f^(E) := \ \in \Sigma. That is, \sigma (f)\subseteq\Sigma, where \sigma (f) is the σ-algebra gen ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


σ-finite Measure
In mathematics, a positive (or signed) measure ''μ'' defined on a ''σ''-algebra Σ of subsets of a set ''X'' is called a finite measure if ''μ''(''X'') is a finite real number (rather than ∞), and a set ''A'' in Σ is of finite measure if ''μ''(''A'') < ∞''.'' The measure ''μ'' is called σ-finite if ''X'' is a of measurable sets with finite measure. A set in a measure space is said to have ''σ''-finite measure if it is a countable union of measurable sets with finite measure. A measure being σ-finite is a weaker condition than being finite, i.e. all finite measures are σ-finite but there are (many) σ-finite measures that are not finite. A different but related notion that should not be confus ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Rayleigh–Faber–Krahn Inequality
In spectral geometry, the Rayleigh–Faber–Krahn inequality, named after its conjecturer, Lord Rayleigh, and two individuals who independently proved the conjecture, G. Faber and Edgar Krahn, is an inequality concerning the lowest Dirichlet eigenvalue of the Laplace operator on a bounded domain in \mathbb^n, n \ge 2. It states that the first Dirichlet eigenvalue is no less than the corresponding Dirichlet eigenvalue of a Euclidean ball having the same volume. Furthermore, the inequality is rigid in the sense that if the first Dirichlet eigenvalue is equal to that of the corresponding ball, then the domain must actually be a ball. In the case of n=2, the inequality essentially states that among all drums of equal area, the circular drum (uniquely) has the lowest voice. More generally, the Faber–Krahn inequality holds in any Riemannian manifold in which the isoperimetric inequality holds. In particular, according to Cartan–Hadamard conjecture, it should hold in all simply con ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Isoperimetric Inequality
In mathematics, the isoperimetric inequality is a geometric inequality involving the perimeter of a set and its volume. In n-dimensional space \R^n the inequality lower bounds the surface area or perimeter \operatorname(S) of a set S\subset\R^n by its volume \operatorname(S), :\operatorname(S)\geq n \operatorname(S)^ \, \operatorname(B_1)^, where B_1\subset\R^n is a unit sphere. The equality holds only when S is a sphere in \R^n. On a plane, i.e. when n=2, the isoperimetric inequality relates the square of the circumference of a closed curve and the area of a plane region it encloses. '' Isoperimetric'' literally means "having the same perimeter". Specifically in \R ^2, the isoperimetric inequality states, for the length ''L'' of a closed curve and the area ''A'' of the planar region that it encloses, that : L^2 \ge 4\pi A, and that equality holds if and only if the curve is a circle. The isoperimetric problem is to determine a plane figure of the largest possible area whose ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Hardy–Littlewood Inequality
In mathematical analysis, the Hardy–Littlewood inequality, named after G. H. Hardy and John Edensor Littlewood, states that if f and g are nonnegative measurable real functions vanishing at infinity that are defined on n-dimensional Euclidean space \mathbb R^n, then :\int_ f(x)g(x) \, dx \leq \int_ f^*(x)g^*(x) \, dx where f^* and g^* are the symmetric decreasing rearrangements of f and g, respectively. The decreasing rearrangement f^* of f is defined via the property that for all r >0 the two super-level sets :E_f(r)=\left\ \quad and \quad E_(r)=\left\ have the same volume (n-dimensional Lebesgue measure) and E_(r) is a ball in \mathbb R^n centered at x=0, i.e. it has maximal symmetry. Proof The layer cake representation allows us to write the general functions f and g in the form f(x)= \int_0^\infty \chi_ \, dr \quad and \quad g(x)= \int_0^\infty \chi_ \, ds where r \mapsto \chi_ equals 1 for rs the indicator functions x \mapsto \chi_(x) and x \map ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Level Sets
In mathematics, a level set of a real-valued function of real variables is a set where the function takes on a given constant value , that is: : L_c(f) = \left\~, When the number of independent variables is two, a level set is called a level curve, also known as ''contour line'' or ''isoline''; so a level curve is the set of all real-valued solutions of an equation in two variables and . When , a level set is called a level surface (or ''isosurface''); so a level surface is the set of all real-valued roots of an equation in three variables , and . For higher values of , the level set is a level hypersurface, the set of all real-valued roots of an equation in variables. A level set is a special case of a fiber. Alternative names Level sets show up in many applications, often under different names. For example, an implicit curve is a level curve, which is considered independently of its neighbor curves, emphasizing that such a curve is defined by an implicit e ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Function And Its Symmetric Decreasing Rearrangement
Function or functionality may refer to: Computing * Function key, a type of key on computer keyboards * Function model, a structured representation of processes in a system * Function object or functor or functionoid, a concept of object-oriented programming * Function (computer programming), or subroutine, a sequence of instructions within a larger computer program Music * Function (music), a relationship of a chord to a tonal centre * Function (musician) (born 1973), David Charles Sumner, American techno DJ and producer * "Function" (song), a 2012 song by American rapper E-40 featuring YG, Iamsu! & Problem * "Function", song by Dana Kletter from '' Boneyard Beach'' 1995 Other uses * Function (biology), the effect of an activity or process * Function (engineering), a specific action that a system can perform * Function (language), a way of achieving an aim using language * Function (mathematics), a relation that associates an input to a single output * Function (sociology) ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Indicator Function
In mathematics, an indicator function or a characteristic function of a subset of a set is a function that maps elements of the subset to one, and all other elements to zero. That is, if is a subset of some set , one has \mathbf_(x)=1 if x\in A, and \mathbf_(x)=0 otherwise, where \mathbf_A is a common notation for the indicator function. Other common notations are I_A, and \chi_A. The indicator function of is the Iverson bracket of the property of belonging to ; that is, :\mathbf_(x)= \in A For example, the Dirichlet function is the indicator function of the rational numbers as a subset of the real numbers. Definition The indicator function of a subset of a set is a function \mathbf_A \colon X \to \ defined as \mathbf_A(x) := \begin 1 ~&\text~ x \in A~, \\ 0 ~&\text~ x \notin A~. \end The Iverson bracket provides the equivalent notation, \in A/math> or to be used instead of \mathbf_(x)\,. The function \mathbf_A is sometimes denoted , , , or even just . Nota ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]