Midpoint lenses in segment spacesResearch Paper
In a uniformly convex space, if is nearly as long as and both and have length at most , then the displacement must be short. The set of such displacements,
301 missions · 216 completed
In a uniformly convex space, if is nearly as long as and both and have length at most , then the displacement must be short. The set of such displacements,
Uniform convexity of a norm says that the midpoint of two far-apart points of the unit sphere lies strictly inside the ball. In infinite dimensions there is an asymptotic version: one only asks for a gain in directions that lie far out, that is, inside some closed subspace of finite codimension. Asymptotic uniform convexity and its relatives control the…
The Mazur–Ulam theorem (1932) says that every surjective isometry between real normed spaces is affine. The whole space is not always available, though: often only distances between unit vectors are known. Tingley's problem (1987) asks whether the metric of the unit sphere alone already determines the linear structure, that is, whether every surjective…
Free probability treats bounded self-adjoint operators in a tracial von Neumann algebra as noncommuting random variables, and the free analogue of independence is freeness. Voiculescu introduced two candidate analogues of Shannon entropy for such tuples. The microstates free entropy measures how large the set of matrix tuples imitating…
A von Neumann algebra is a unital algebra of bounded operators on a Hilbert space that is closed under adjoints and in the weak operator topology. For a set of operators, denotes the smallest von Neumann algebra containing . The generator problem, going back to Kadison's 1967 list of problems, asks whether every von Neumann algebra with separable…
The invariant subspace problem asks whether every bounded operator on a separable infinite-dimensional complex Hilbert space has a nontrivial closed invariant subspace. Inside a finite von Neumann algebra there is a sharper, algebra-relative version: given in a type factor , is there a projection with and , i.e.…
The classification programme for simple nuclear -algebras identifies a class of algebras that are determined by K-theory and traces. Membership in that class is governed by regularity properties: finite nuclear dimension, absorption of the Jiang–Su algebra , and strict comparison. Uniform property , introduced by Castillejos, Evington,…
How rigid is a von Neumann algebra inside ? If two algebras have unit balls that are uniformly close, must they be the same algebra up to a small change of coordinates? Kadison and Kastler introduced the distance between the unit balls in 1972 (Amer. J. Math. 1972) and asked whether sufficiently close algebras are spatially isomorphic,…
Bose–Einstein condensation (BEC) means that a single one-particle state carries a macroscopic fraction of a many-boson system. It was predicted for the ideal gas by Bose and Einstein (1924–1925) and is observed in dilute atomic gases, but for interacting particles in the thermodynamic limit there was no rigorous proof, even in the ground state. The Penrose–O…
A representation of a group by bounded invertible operators on a Hilbert space is uniformly bounded if , and unitarizable if after a change of inner product it becomes unitary, i.e. some bounded invertible makes every unitary. Unitary representations are the ones harmonic analysis knows how to decompose, so it…
Thompson's group consists of the increasing piecewise linear homeomorphisms of with finitely many pieces, dyadic rational breakpoints, and slopes that are integer powers of . It is finitely presented, has strong topological finiteness properties, and appears across group theory, dynamics and logic. Whether is amenable, i.e. whether its bounded…
A measure-preserving transformation of a probability space acts on square-integrable functions by the Koopman operator , a unitary operator. Its spectral type (discrete, singular continuous, absolutely continuous) and its multiplicity are basic invariants of ergodic theory. The Lebesgue spectrum is the spectral type of the shift on …
Edit distance , the least number of single-symbol insertions, deletions and substitutions turning into , is the standard distance on strings. Embedding strings into with small distortion would make edit distance amenable to the fast nearest-neighbour and sketching tools available for , so the least achievable distortion is a…
Edit distance is the least number of single-symbol insertions, deletions and substitutions transforming a string into . It is the basic similarity measure for strings, but it is expensive to compute and awkward to index. A standard way around this is to embed strings into so that distances approximate edit distances; the…
A metric space is doubling if every ball can be covered by a bounded number of balls of half the radius. Every subset of a finite-dimensional Euclidean space is doubling, so doubling is a necessary condition for a metric space to embed bi-Lipschitzly into some . Whether it is also sufficient, for subsets of Hilbert space, is the Lang–Plaut problem…
The Johnson–Lindenstrauss lemma (1984) says that any points of a Hilbert space can be placed in -dimensional Euclidean space with distortion at most any prescribed . This dimension reduction is used throughout analysis, geometry and algorithm design. Johnson and Lindenstrauss also asked what analogues hold in other Banach spaces. For the…
The volume product of a convex body measures how large a body and its polar can simultaneously be. For a body without a distinguished centre, the polar is taken about the point that makes it smallest, the Santaló point, so the product is invariant under all invertible affine maps. The Blaschke–Santaló inequality identifies ellipsoids as the maximizers. Mahle…
Matrix-valued affine processes on the cone of positive semidefinite matrices are used in finance as models of stochastic covariance: multi-asset option pricing with stochastic volatility and correlation, and fixed-income models with stochastically correlated risk factors and default intensities. The best-known example is the Wishart process of Bru (1991).…
Optimal control problems with pointwise bounds on the control, such as
A convex minimization problem comes with a dual maximization problem, and the dual value never exceeds the primal value. When the two values differ, a duality gap occurs. Dual bounds, Lagrangian relaxations and optimality certificates are then weaker than hoped. Conditions that rule the gap out are constraint qualifications such as Slater's condition and…
The classical implicit-function theorem solves an equation for as a function of a parameter near a known solution , provided is (strongly) Fréchet differentiable in with an invertible partial derivative. Much of optimization does not meet that hypothesis. Optimality conditions of constrained problems, complementarity problems…
The proximal point algorithm is a basic iterative scheme of convex optimization and monotone operator theory. To solve a problem governed by a monotone operator, it replaces the problem by a sequence of better-conditioned problems, each regularized by a quadratic term centred at the previous iterate. Augmented Lagrangian methods, the Douglas–Rachford and…
Many problems of optimization and equilibrium can be written as one inclusion. Some examples are the Karush–Kuhn–Tucker conditions of a nonlinear program, nonlinear complementarity problems, variational inequalities and the equilibrium conditions of economic and traffic models. In each of them a point has to satisfy . In…
The Hlawka inequality for Schatten -norms is a cousin of the triangle inequality: it relates the norms of three matrices to the norms of their pairwise sums and their total sum. The question is how large a comparison constant is needed to make this inequality hold.
This entry lowers the sufficient exponent cutoff for the sharp diagonal Hlawka formula from85 to84. For every real p≥84, the foundation's unchanged cyclic constant is the least constant comparing the triple deficit with the pair-deficit sum for every complex coordinate triple in every finite dimension.