The tag has no wiki summary.

learn more… | top users | synonyms (1)

67
votes
15answers
6k views

Why do we care about L^p spaces besides p = 1, p = 2, and p = infinity?

I was helping a student study for a functional analysis exam and the question came up as to when, in practice, one needs to consider the Banach space $L^p$ for some value of $p$ other than the obvious ...
34
votes
3answers
3k views

the following inequality is true,but I can't prove it

The inequality is \begin{equation*} \sum_{k=1}^{2d}\left(1-\frac{1}{2d+2-k}\right)\frac{d^k}{k!}>e^d\left(1-\frac{1}{d}\right) \end{equation*} for all integer $d\geq 1$. I use computer to verify ...
30
votes
3answers
2k views

Absolute value inequality for complex numbers

I asked this question on stackexchange, but despite much effort on my part have been unsuccesful in finding a solution. Does the inequality $$2(|a|+|b|+|c|) \leq |a+b+c|+|a+b-c|+|a+c-b|+|b+c-a|$$ ...
30
votes
1answer
2k views

An Entropy Inequality

Let $X,Y$ be probability measures on $\{1,2,\dots,n\}$, and set $K=\sum_i\sqrt{X(i)Y(i)}$ so that $Z:=\frac{1}{K}\sqrt{XY}$ is also a probability measure on $\{1,2,\dots,n\}$. How can we prove the ...
25
votes
1answer
918 views

Does a proof of Selberg's 3.2 inequality exist?

A well-known inequality of Montgomery and Vaughan (generalizing a result of Hilbert) states that $$ \left |\sum_{r \neq s} \frac{w_{r} \overline{w_{s}} }{\lambda_r - \lambda_s} \right| \leq \pi ...
23
votes
9answers
4k views

Is there a good reason why a^{2b} + b^{2a} <= 1 when a+b=1?

The following problem is not from me, yet I find it a big challenge to give a nice (in contrast to 'heavy computation') proof. The motivation for me to post it lies in its concise content. If $a$ and ...
21
votes
0answers
430 views

Are there any nontrivial near-isometries of the $n$-dimensional cube?

Consider the $n$-dimensional Hamming cube, $C = \{-1,1\}^n$. Given an $n \times n$ orthogonal matrix $O$, I'll measure "how close $O$ is to being an isometry of $C$" by the following scoring ...
20
votes
2answers
6k views

Is the Jaccard distance a distance?

Wikipedia defines the Jaccard distance between sets A and B as $$J_\delta(A,B)=1-\frac{|A\cap B|}{|A\cup B|}.$$ There's also a book claiming that this is a metric. However, I couldn't find any ...
20
votes
3answers
559 views

A sumset inequality

A friend asked me the following problem: Is it true that for every $X\subset A\subset \mathbb{Z}$, where $A$ is finite and $X$ is non-empty, that $$\frac{|A+X|}{|X|}\geq \frac{|A+A|}{|A|}?$$ ...
20
votes
1answer
961 views

What goes wrong for the Sobolev embeddings at $k=n/p$?

For $u\in W^{k,p}(U)$, where $U\subseteq\mathbb{R}^n$ is open and bounded with $C^1$-boundary, we have the celebrated Sobolev inequalities: If $k < n/p$ then $u\in L^q(U)$ for $q$ satisfying ...
19
votes
1answer
1k views

How often are irrational numbers well-approximated by rationals?

Suppose $x\in \mathbb{R}$ is irrational, with irrationality measure $\mu=\mu(x)$; this means that the inequality $|x-\frac{p}{q}|< q^{-\lambda}$ has infinitely many solutions in integers $p,q$ if ...
18
votes
6answers
11k views

Determinant of sum of positive definite matrices

Say $A$ and $B$ are symmetric, positive definite matrices. I've proved that $\det(A+B) \ge \det(A) + \det(B)$ in the case that $A$ and $B$ are two dimensional. Is this true in general for ...
17
votes
6answers
3k views

Applications of Hardy's inequality

Every so often I would encounter Hardy's inequality: Theorem 1 (Hardy's inequality). If $p>1$, $a_n \geq 0$, and $A_n=a_1+a_2+\cdots+a_n$, then $$\sum_{n=1}^\infty ...
16
votes
2answers
403 views

What is $A+A^T$ when $A$ is row-stochastic ?

This is motivated by this MO question. If $A\in{\bf M}_n({\mathbb R})$ is row-stochastic (entrywise non-negative, and $\sum_j a_{ij}=1$ for all $i$), then $M:=A+A^T$ is symmetric, entrywise ...
15
votes
4answers
781 views

Proving univariate polynomials (defined by sums, binomial coeffs, etc.) are nonnegative: is it 'routine'?

My colleagues and I are working on a project related to an old paper of C. Borell and we have boiled it down to the following problem: Show, for all integers $1 \leq i \leq k$, that the univariate ...
15
votes
1answer
293 views

A possible extension of a determinant inequality

It is well known that if $A, B$ are positive semidefinite matrices, then $$\det (A+B)\ge \det A+\det B.$$ I am considering a possible extension of this result. Let $\mathbb{M}_m(\mathbb{M}_n)$ ...
14
votes
1answer
978 views

An $L^0$ Khintchine inequality

Suppose that $\epsilon_1,\epsilon_2,\ldots$ are IID random variables with the Bernoulli distribution $\mathbb{P}(\epsilon_n=\pm1)=1/2$, and $a_1,a_2,\ldots$ is a real sequence with $\sum_na_n^2=1$. ...
13
votes
6answers
2k views

subadditive implies concave

Let $f:R_+\to R_+$ be smooth on $(0,\infty)$, increasing, $f(0)=0$ and $\lim_{x\to\infty}=\infty$. Assume also that $f$ is subadditive: $f(x+y)\le f(x)+f(y)$ for all $x,y\ge 0$. Must $f$ be concave? ...
13
votes
4answers
931 views

A Normal Distribution Inequality

Let $n(x) = \frac{1}{\sqrt{2\pi}} e^{-\frac{x^2}{2}}$, and $N(x) = \int_{-\infty}^x n(t)dt$. I have plotted the curves of the both sides of the following inequality. The graph shows that the following ...
12
votes
4answers
1k views

How to prove a known inequality from a book

The following inequality is from page 125 of D.S. Mitrinovic, J. Pecaric, A.M. Fink, Classical and new inequalities in analysis, Kluwer Academic Publishers, Dordrecht/Boston/London, 1993. If ...
12
votes
5answers
930 views

Understanding Gibbs's inequality

Short version Gibbs's inequality is a simple inequality for real numbers, usually understood information-theoretically. In the jargon, it states that for two probability measures on a finite set, ...
12
votes
2answers
266 views

Subset of vectors whose sum has a large norm

In Rudin - Real & Complex Analysis we have the following Lemma 6.3. If $z_1, \ldots, z_n \in \mathbb{C}$ then there is a subset $S \subseteq \{1,\ldots,n\}$ for which $$\left|\sum_{k \in S} ...
12
votes
0answers
363 views

Noncommutative arithmetic mean geometric mean inequality and symmetric polynomials

While analyzing convergence speed of stochastic-gradient methods for convex optimization problems, Recht et al (2011) posed a tantalizing conjecture. It seems quite tricky, so after having struggled a ...
11
votes
5answers
3k views

Upper bounds for the sum of primes <= n

Let $s(n)$ denote the sum of primes less than or equal to n. Clearly, $s(n)$ is bounded from above by the sum of the first $n/2$ odd integers $+1$. $s(n)$ is also bounded by the sum of the first $n$ ...
11
votes
2answers
528 views

Quadratic Farkas' Lemma?

The Farkas Lemma says that if a system of linear inequalities implies yet another linear inequality, then this last inequality can be obtained by taking a positive linear combination of the ...
11
votes
1answer
211 views

Hlawka inequality for determinants of positive definite matrices

It is mentioned here that if $A, B, C\in M_{n}(\mathbb C)$ are positive semidefinite, then $$\det (A+B+C)+\det C\ge \det (A+C)+\det (B+C)$$ (quoted from this article) and the special case ($C=\bf 0$) ...
11
votes
2answers
480 views

A property of unimodal sequences

It is well-known that $(-1)^j \sum_{i=0}^j (-1)^i\binom{n}{i} \geq 0$. This inequality can be used to prove Bonferroni's inequalities for example. Recently I noticed that a similar inequality applies ...
11
votes
2answers
757 views

Positivity of sequences via generating series

There are different ways of showing that a given sequence $a_0,a_1,a_2,\dots$ of integers, say, is nonnegative. For example, one can show that $a_n$ count something, or express $a_n$ as a (multiple) ...
11
votes
1answer
626 views

A delicate elementary inequality

The following "piecewise-quadratic" inequality emerged in a joint work of Rom Pinchasi and myself. The inequality is surprisingly delicate, and all our attempts to simplify it made it false. By the ...
10
votes
5answers
1k views

Bounding the absolute sum of entries of the inverse of a 0-1 matrix

I have a non-singular square 0-1 matrix and I want to bound the sum of absolute values of its inverse as a function of n (or the vector 1-norm). Asymptotic results are also useful. Does anyone know ...
10
votes
2answers
344 views

Inequalities for averaging over partially ordered sets

Let's start from a classical inequality: If $0\le a_1\le\cdots\le a_k$ and $0\le b_1\le\cdots\le b_k$ then $(a_1+\cdots+a_k)(b_1+\cdots+b_k)\le k(a_1b_1+\cdots+a_k b_k)$. It can be written also in ...
10
votes
1answer
439 views

Hölder's inequality for matrices

I was wondering if the Hölder's inequality was true for matrix induced norms, i.e. if $$\|AB\|_1 \leq \|A\|_p\|B\|_q, \quad\forall p,q \in [1,\infty] \text{ s.t. } \tfrac{1}{p}+\tfrac{1}{q} = 1.$$ But ...
10
votes
1answer
1k views

Sum of difference moduli vs. sum of modulus differences

This is a failed attempt of mine at creating a contest problem; the failure is in the fact that I wasn't able to solve it myself. Let $x_1$, $x_2$, ..., $x_n$ be $n$ reals. For any integer $k$, ...
10
votes
2answers
1k views

Proving a messy inequality

EDIT: After much work I was able to reduce the inequality to a single variable function which I need to show is non-positive. That function is (for $0\leq p\leq\frac{1}{2}$) $$\frac{p^2(\log(p))^2 - ...
9
votes
2answers
1k views

Question on eigenvalue square root subadditivity

ORIGINAL QUESTION Let $\lambda_{1}\left(\cdot\right)$ be the larger eigenvalue of a $2\times2$ matrix and $\lambda_{2}\left(\cdot\right)$ the smaller eigenvalue of a $2\times2$ matrix. Is it true ...
9
votes
2answers
355 views
+50

Conjecture on maximum of symmetric combinatoric function

A curious symmetric function crossed my way in some quantum mechanics calculations, and I'm interested its maximum value (for which I do have a conjecture). (The question was first asked at math.SE, ...
9
votes
2answers
621 views

Bounding Euler products (or almost) by products of zeta functions

Let $s_1, s_2 \in (1/2,1\rbrack$. I would like to bound the product $$A=\prod_p \left(1 + \frac{p^{-s_1} p^{-s_2}}{(1-p^{-s_1}+p^{-1}) (1-p^{-s_2}+p^{-1})}\right)$$ Now, I am almost positive that ...
9
votes
1answer
178 views

Generalized Hlawka inequality

Let $E$ be a vector space over the real (the complex case is interesting too). We consider functions $f:E\rightarrow\mathbb R$ which satisfy the homogeneity property $$f(\lambda x)=|\lambda|\,f(x).$$ ...
9
votes
2answers
487 views

The fraction of the sphere a fixed distance from a subspace

The following problem has a beautiful geometric interpretation in terms of the proportion of points on the Euclidean sphere in $\mathbb{R}^d$ that lie at least a certain distance away from a ...
9
votes
0answers
214 views

Determinant inequality involving Hermitian, positive definite matrices

Question: Let $A,B,C\in M_{n}(C)$ be Hermitian and positive definite matrices such that:$$A+B+C=I_{n}$$ Show that: $$\det\left(6(A^3+B^3+C^3)+I_{n}\right)\ge 5^n\det(A^2+B^2+C^2)$$ This question ...
9
votes
0answers
311 views

Inequality regarding sum of gaussian on lattices

When S is a subset of an inner product space, let d(S) denote ${\sum\limits_{s \in S} e^{- \langle s,s \rangle}}$ Suppose L is a discrete additive subgroup of $\mathbb{R^n}$, M is a subgroup of L, ...
8
votes
8answers
2k views

Examples of inequality implied by equality.

It is well known Cauchy's inequality is implied by Lagrange's identity. Bohr's inequality $|a -b|^2 \le p|a|^2 +q|b|^2$, where $\frac{1}{p}+\frac{1}{q}=1$, is implied by $|a -b|^2 ...
8
votes
1answer
237 views

Cauchy-Schwarz proof of Sidorenko for 3-edge path (Blakley-Roy inequality)

Is there a "Cauchy-Schwarz proof" of the following inequality? Theorem. Given $f \colon [0,1]^2 \to [0,1]$, one has $$ \int_{[0,1]^4} f(x,y)f(z,y)f(z,w) \, dxdydzdw \geq \left(\int_{[0,1]^2} f(x,y) ...
8
votes
1answer
280 views

An inequality for positive definite matrices

Let $K$ and $K^\prime$ positive definite $n \times n$ matrices, such that for all vectors $f \ge 0$ with nonnegative coordinates we have $$\sum_{i,j} K_{ij} f_i f_j \le \sum_{ij} K^\prime_{ij} f_i ...
7
votes
5answers
1k views

A plausible inequality.

I come across the following problem in my study. Let $x_i, y_i\in \mathbb{R}, i=1,2\cdots,n$ with $\sum\limits_{i=1}^nx_i^2=\sum\limits_{i=1}^ny_i^2=1$, and $a_1\ge a_2\cdots \ge a_n>0 $. Is it ...
7
votes
2answers
4k views

When is the product of a set of numbers greater than the sum of them?

This could well be too general a question, but I'd be interested in solutions to special cases too. Say you have some finite set of positive real numbers $x_i$, when is it the case that $\sum_i x_i ...
7
votes
5answers
830 views

Rearrangement-style inequality with lots of terms and little evidence

This is another of the problems I designed for contests but wasn't able to solve on my own for years. Maybe AoPS is a better place for it, but let me try it here. [UPDATE: I have streamlined the ...
7
votes
2answers
546 views

Is this ergodic inequality true?

Is anything similar to the following inequality true, $\displaystyle P\{\max_{n \leq k \leq m} |A_k f - A_n f| > \epsilon\} \leq C \frac{||A_m f - A_n f||_1}{\epsilon}$ where $A_n f = ...
7
votes
1answer
172 views

Sumsets and a bound

Let $q$ be a positive integer. Is it true there exists a constant $C_q$ such that the following inequality holds for any finite set $A$ of reals: $$\displaystyle |A+qA|\ge (q+1)|A|-C_q\qquad (1)$$ I ...
7
votes
3answers
289 views

An inequality related to the number of binary strings with no fixed substring

This is basically a repost of this math.se question. At the time I was writing this I thought it has to have a straightforward solution so I posted it there. Now I am not so sure about it being so ...