We study the Riemannian quantiative isoperimetric inequality. We show that direct analogue of the Euclidean quantitative isoperimetric inequality is--in general--false on a closed Riemannian manifold. In spite of this, we show that the inequality is true generically. Moreover, we show that a modified (but sharp) version of the quantitative isoperimetric inequality holds for a real analytic metric, using the Lojasiewicz-Simon inequality. A main novelty of our work is that in all our results we do not require any a priori knowledge on the structure shape of the minimizers.
As mentioned above, there has been a lot of recent work on quantitative stability not just for the isoperimetric inequality but also for many other geometric (e.g. Brunn-Minkowski @cite_3 ), spectral (e.g. Faber-Krahn @cite_30 ), and functional (e.g. Sobolev @cite_33 ) inequalities. We defer to the recent survey of Fusco @cite_13 for a more comprehensive list. When the underlying space and the extremizers are highly symmetric these results are often proven by symmetrization or rearrangement (see, e.g. @cite_23 ). In this vein we'd also like to point out the works @cite_35 @cite_0 , which do not use symmetrization techniques but do exploit the richness of the symmetry group of the underlying space.
@cite_30 @cite_35 @cite_33 @cite_3 @cite_0 @cite_23 @cite_13
2083945855 2609098951 1935847907 1988342708
Abstract We investigate the recovery of almost s -sparse vectors x ∈ C N from undersampled and inaccurate data y = A x + e ∈ C m by means of minimizing ‖ z ‖ 1 subject to the equality constraints A z = y . If m ≍ s ln ( N s ) and if Gaussian random matrices A ∈ R m × N are used, this equality-constrained l 1 -minimization is known to be stable with respect to sparsity defects and robust with respect to measurement errors. If m ≍ s ln ( N s ) and if Weibull random matrices are used, we prove here that the equality-constrained l 1 -minimization remains stable and robust. The arguments are based on two key ingredients, namely the robust null space property and the quotient property. The robust null space property relies on a variant of the classical restricted isometry property where the inner norm is replaced by the l 1 -norm and the outer norm is replaced by a norm comparable to the l 2 -norm. For the l 1 -minimization subject to inequality constraints, this yields stability and robustness results that are also valid when considering sparsity relative to a redundant dictionary. As for the quotient property, it relies on lower estimates for the tail probability of sums of independent Weibull random variables. The full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary @math of a set @math , as a function of @math . A weaker (but more widely-used) lower bound is @math , where equality holds iff @math is a subcube. In 2011, the first author obtained a sharp stability' version of the latter result, proving that if @math , then there exists a subcube @math such that @math . The weak' version of the edge isoperimetric inequality has the following well-known generalization for the @math -biased' measure @math on the discrete cube: if @math , or if @math and @math is monotone increasing, then @math . In this paper, we prove a sharp stability version of the latter result, which generalizes the aforementioned result of the first author. Namely, we prove that if @math , then there exists a subcube @math such that @math , where @math . This result is a central component in recent work of the authors proving sharp stability versions of a number of Erd o s-Ko-Rado type theorems in extremal combinatorics, including the seminal complete intersection theorem' of Ahlswede and Khachatrian. In addition, we prove a biased-measure analogue of the full' edge isoperimetric inequality, for monotone increasing sets, and we observe that such an analogue does not hold for arbitrary sets, hence answering a question of Kalai. We use this result to give a new proof of the full' edge isoperimetric inequality, one relying on the Kruskal-Katona theorem. We present some recent stability results concerning the isoperimetric inequality and other related geometric and functional inequalities. The main techniques and approaches to this field are discussed. By introducing a quantitative degree of commutativity'' in terms of the angle between spin observables we present two tight quantitative trade-off relations in the case of two qubits. First, for entangled states, between the degree of commutativity of local observables and the maximal amount of violation of the Bell inequality: if both local angles increase from zero to @math (i.e., the degree of local commutativity decreases), the maximum violation of the Bell inequality increases. Secondly, a converse trade-off relation holds for separable states: if both local angles approach @math the maximal value obtainable for the correlations in the Bell inequality decreases and thus the non-violation increases. As expected, the extremes of these relations are found in the case of anticommuting local observables where, respectively, the bounds of @math and @math hold for the expectation value of the Bell operator. The trade-off relations show that noncommmutativity gives a more than classical result'' for entangled states, whereas a less than classical result'' is obtained for separable states. The experimental relevance of the trade-off relation for separable states is that it provides an experimental test for two qubit entanglement. Its advantages are twofold: in comparison to violations of Bell inequalities it is a stronger criterion and in comparison to entanglement witnesses it needs to make less strong assumptions about the observables implemented in the experiment.