A measure-theoretic Grothendieck inequality
نویسندگان
چکیده
منابع مشابه
On an Inequality of A. Grothendieck
In 1955, A. Grothendieck proved a basic inequality which shows that any bounded linear operator between L(μ)-spaces maps (Lebesgue-) dominated sequences to dominated sequences. An elementary proof of this inequality is obtained via a new decomposition principle for the lattice of measurable functions. An exposition is also given of the M. Lévy extension theorem for operators defined on subspace...
متن کاملSpherical functions and the Grothendieck inequality
We discuss the addition theorem for spherical functions and its application to a proof of the classical Grothendieck inequality where the best constant is still unknown. 1. The addition theorem for spherical functions For k ∈ N0, n ∈ N let Pn,k denote the real vector space of polynomials of degree ≤ k in n real variables, restricted to the unit sphere Sn−1 ⊆ R. Let Homn,k and Hn,k denote the su...
متن کاملA generalized Grothendieck inequality and entanglement in XOR games
Suppose Alice and Bob make local two-outcome measurements on a shared entangled state. For any d, we show that there are correlations that can only be reproduced if the local dimension is at least d. This resolves a conjecture of Brunner et al. [Phys. Rev. Lett. 100, 210503 (2008)] and establishes that the amount of entanglement required to maximally violate a Bell inequality must depend on the...
متن کاملPrequential probability: game-theoretic = measure theoretic
This article continues study of the prequential framework for evaluating a probability forecaster. Testing the hypothesis that the sequence of forecasts issued by the forecaster is in agreement with the observed outcomes can be done using prequential notions of probability. It turns out that there are two natural notions of probability in the prequential framework: game-theoretic, whose idea go...
متن کاملStable Grothendieck Polynomials and K-theoretic Factor Sequences
We give a nonrecursive combinatorial formula for the expansion of a stable Grothendieck polynomial in the basis of stable Grothendieck polynomials for partitions. The proof is based on a generalization of the EdelmanGreene insertion algorithm. This result is applied to prove a number of formulas and properties for K-theoretic quiver polynomials and Grothendieck polynomials. In particular we for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2010
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2010.04.020