Searcharxiv⌕ Search

arXiv subjects

Michael Christ

Publications and source records attributed to Michael Christ.

At least 37 records · Page 2Linked to original sources

Subsets of Euclidean space with nearly maximal Gowers norms

A set subset of Euclidean space whose indicator function has maximal Gowers norm, among all sets of equal measure, is an ellipsoid up to Lebesgue null sets. If the indicator function has nearly maximal Gowers norm then the set nearly coincides with an ellipsoid.

math.CA↗

On Holder-Brascamp-Lieb inequalities for torsion-free discrete Abelian groups

Hölder-Brascamp-Lieb inequalities provide upper bounds for a class of multilinear expressions, in terms of $L^p$ norms of the functions involved. They have been extensively studied for functions defined on Euclidean spaces. Bennett-Carbery-Christ-Tao have initiated the study of these inequalities for discrete Abelian groups and, in terms of suitable data, have characterized the set of all tuples of exponents for which such an inequality holds for specified data, as the convex polyhedron defined by a particular finite set of affine inequalities. In this paper we advance the theory of such inequalities for torsion-free discrete Abelian groups in three respects. The optimal constant in any such inequality is shown to equal $1$ whenever it is finite. An algorithm that computes the admissible polyhedron of exponents is developed. It is shown that nonetheless, existence of an algorithm that computes the full list of inequalities in the Bennett-Carbery-Christ-Tao description of the admissible polyhedron for all data, is equivalent to an affirmative solution of Hilbert's Tenth Problem over the rationals. That problem remains open. Applications to computer science will be explored in a forthcoming companion paper.

math.CA↗

Nilpotent group C*-algebras as compact quantum metric spaces

Let $L$ be a length function on a group $G$, and let $M_L$ denote the operator of pointwise multiplication by $L$ on $\ell^2(G)$. Following Connes, $M_L$ can be used as a "Dirac" operator for the reduced group C*-algebra $C_r^*(G)$. It defines a Lipschitz seminorm on $C_r^*(G)$, which defines a metric on the state space of $C_r^*(G)$. We show that for any length function of a strong form of polynomial growth on a discrete group, the topology from this metric coincides with the weak-$*$ topology (a key property for the definition of a "compact quantum metric space"). In particular, this holds for all word-length functions on finitely generated nilpotent-by-finite groups.

math.OA↗

On nearly radial product functions

If $f\in L^2(R^d)$ and if the function $f(x)f(y)$ is close in $L^2(R^{2d})$ norm to a radially symmetric function of $(x,y)$ then $f$ is close in $L^2$ norm to a centered Gaussian function. This is proved in a quantitative form with the optimal exponent measuring closeness.

math.CA↗

Near equality in the Riesz-Sobolev inequality in higher dimensions

The Riesz-Sobolev inequality provides an upper bound for a trilinear expression involving convolution of indicator functions of sets. It is known that equality holds only for homothetic ordered triples of appropriately situated ellipsoids. We characterize ordered triples of subsets of Euclidean space $R^d$ that nearly realize equality, for arbitrary dimensions $d$, extending a result already known for $d=1$.

math.CA↗

Sharp Hardy-Littlewood-Sobolev Inequalities on Quaternionic Heisenberg Groups

In this paper, we got several sharp Hardy-Littlewood-Sobolev-type inequalities on quaternionic Heisenberg groups (a general form due to Folland and Stein [FS74]), using the symmetrization-free method in a paper of Frank and Lieb [FL12], where they considered the analogues on classical Heisenberg group. First, we give the sharp Hardy-Littlewood-Sobolev inequalities, both on quaternionic Heisenberg group and its equivalent on quaternionic sphere for exponent bigger than 4. The extremizer, as we guess, is almost uniquely constant function on sphere. Then their dual form, sharp conformally-invariant Sobolev inequalities and the right endpoint limit case, Log-Sobolev inequality, are also obtained. For small exponent less 4, constant function is only proved to be a local extremizer. The conformal symmetry of the inequalities and zero center-mass technique play a critical role in the argument.

math.CA↗

Sharp Hardy-Littlewood-Sobolev Inequalities on Octonionic Heisenberg Group

This paper is a second one following our work [CLZ13] in series, considering sharp Hardy- Littlewood-Sobolev inequalities on groups of Heisenberg type. The first important breakthrough was made by Frank and Lieb in [FL12]. In this paper, analogous results are obtained for octonionic Heisenberg group.

math.FA↗

A sharpened Hausdorff-Young inequality

The Hausdorff-Young inequality for Euclidean space, in its sharp form due to Beckner, gives an upper bound for the Fourier transform in terms of Lebesgue space norms, with an optimal constant. The extremizers have been identified by Lieb to be the Gaussians. We establish an improved upper bound, for functions that nearly extremize the inequality, with a negative second term roughly proportional to the square of the distance to the set of extremizers. One formulation of this term comes with its own sharp constant. The main step is to show that any extremizing sequence is precompact, modulo the action of the group of natural symmetries of the inequality. This step relies on inverse theorems of additive combinatorial nature.

math.CA↗

Near equality in the Riesz-Sobolev inequality

The Riesz-Sobolev inequality provides a sharp upper bound for a trilinear expression involving convolution of indicator functions of sets. Equality is known to hold only for indicator functions of appropriately situated intervals. We characterize ordered triples of subsets of the real line that nearly realize equality, with quantitative bounds of power law form with the optimal exponent. This improves on an earlier manuscript by the author in at least two respects. An excessively strong hypothesis has been replaced by the natural assumption, and the conclusion has been strengthened from a "little o(1)" statement to an explicit bound of the optimal form, up to a constant factor.

math.CA↗

Off-diagonal decay of Bergman kernels: On a conjecture of Zelditch

Consider a complex line bundle over a compact complex manifold equipped with an infinitely differentiable metric with strictly positive curvature form. Assign to positive tensor powers of this bundle the associated product metrics and Bergman projection operators. Zelditch has conjectured that if the Bergman kernels, away from the diagonal, decay exponentially fast to zero as the power tends to infinity, then the metric must be real analytic. Moreover, this is conjectured even if exponential decay is assumed to hold merely for some arbitrarily sparse subsequence of powers tending to infinity. Previously the author has constructed examples in which the metric is infinitely differentiable, but exponential decay does not hold. These examples are within a framework in which a certain degree of symmetry is present. In the present paper we prove the conjecture for all structures within this framework, thus providing evidence in favor of the conjecture. The analysis is carried out for base manifolds of arbitrary dimensions, rather than only for dimension one as in the author's previous work.

math.CV↗

Communication lower bounds and optimal algorithms for programs that reference arrays -- Part 1

The movement of data (communication) between levels of a memory hierarchy, or between parallel processors on a network, can greatly dominate the cost of computation, so algorithms that minimize communication are of interest. Motivated by this, attainable lower bounds for the amount of communication required by algorithms were established by several groups for a variety of algorithms, including matrix computations. Prior work of Ballard-Demmel-Holtz-Schwartz relied on a geometric inequality of Loomis and Whitney for this purpose. In this paper the general theory of discrete multilinear Holder-Brascamp-Lieb (HBL) inequalities is used to establish communication lower bounds for a much wider class of algorithms. In some cases, algorithms are presented which attain these lower bounds. Several contributions are made to the theory of HBL inequalities proper. The optimal constant in such an inequality for torsion-free Abelian groups is shown to equal one whenever it is finite. Bennett-Carbery-Christ-Tao had characterized the tuples of exponents for which such an inequality is valid as the convex polyhedron defined by a certain finite list of inequalities. The problem of constructing an algorithm to decide whether a given inequality is on this list, is shown to be equivalent to Hilbert's Tenth Problem over the rationals, which remains open. Nonetheless, an algorithm which computes the polyhedron itself is constructed.

math.CA↗

The optimal constants in Holder-Brascamp-Lieb inequalities for discrete Abelian groups

The optimal constants are found for Lebesgue norm multilinear inequalities of Holder-Brascamp-Lieb type for arbitrary discrete Abelian groups. Previously a criterion for finiteness of the constants had been established for finitely generated Abelian groups, and the optimal constant had been found in the torsion-free case. The main step here is the analysis of finite groups.

math.CA↗

Upper bounds for Bergman kernels associated to positive line bundles with smooth Hermitian metrics

Off-diagonal upper bounds are established away from the diagonal for the Bergman kernels associated to high powers of holomorphic line bundles over compact complex manifolds, asymptotically as the power tends to infinity. The line bundle is assumed to be equipped with a Hermitian metric with positive curvature form, which is infinitely differentiable but not necessarily real analytic. The bounds obtained are the best possible for this class of metrics.

math.CV↗

Low regularity bounds for mKdV

We study the local well-posedness in the Sobolev space H^s for the modified Korteweg-de Vries (mKdV) equation on the real line. Kenig-Ponce-Vega \cite{KPV2} and Christ-Colliander-Tao established that the data-to-solution map fails to be uniformly continuous on a fixed ball in H^s when s<1/4. In spite of this, we establish that for -1/8 < s < 1/4, the solution satisfies global in time H^s(R) bounds which depend only on the time and on the H^s(R) norm of the initial data. This result is weaker than global well-posedness, as we have no control on differences of solutions. Our proof is modeled on recent work by Christ-Colliander-Tao and Koch-Tataru employing a version of Bourgain's Fourier restriction spaces adapted to time intervals whose length depends on the spatial frequency.

math.AP↗

Near equality in the two-dimensional Brunn-Minkowski inequality

If a pair of subsets of two-dimensional Euclidean space nearly achieves equality in the Brunn-Minkowski inequality, in the sense that the measure of the associated sumset is nearly equal to the lower bound provided by the inequality, then these sets must nearly coincide with a pair of homothetic convex sets. The proof relies on a continuum analogue of a theorem of Freiman which characterizes finite sets of integers whose sumsets are of nearly minimal size. Small corrections and clarifications have been made in this draft.

math.CA↗

Near Equality in the Brunn-Minkowski Inequality

A pair of subsets of Euclidean space which nearly achieves equality in the Brunn-Minkowski inequality must nearly coincide with a pair of homothetic convex sets. The two-dimensional case was treated in a previous paper in this series by an argument which does not seem to generalize to higher dimensions. Here the result is extended to arbitrary dimensions. An induction on the dimension, a symmetrization argument, and a description of near solutions of an additive functional equation are used to establish sufficient regularity to set up a compactness argument.

math.CA↗

Near-extremizers of Young's Inequality for R^d

If a pair of functions nearly extremizes Young's convolution inequality for R^d, with all three exponents finite and strictly greater than 1, then each function is close in norm to a Gaussian. The proof relies on the Riesz-Sobolev rearrangement inequality and in particular, on an approximate inverse Riesz-Sobolev inequality established in a companion paper.

math.CA↗