Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
65 views

Minimal condition $\sum \rho_{ij} \Psi_{ij} s_i s_j < \sum s_i s_j $, $\mid \rho_{ij} \mid \leq 1$, $s_i \in \mathbb R$ and $\Psi_{ij} \in \{0,1\}$

Consider a sequence of real number $\{s_i\}_{i\leq n}$. Now consider the real numbers $F$, $G$ and $\alpha$ defined below $$F= \sqrt{ \left( \sum ~\rho_{ij} ~\Psi_{ij}~ s_i ~s_j \right)^+}, $$ $$G = ...
user50278's user avatar
  • 123
2 votes
1 answer
140 views

interpret of Picone inequality for non-regular functions

Assume $\Omega \subset \mathbb{R}^N$, $ N>4 $ is open set. There is a well-known picone identity that says Let $u,v \in C^2(\Omega)$ satisfy $v>0$ and $-\Delta v \geq 0$ in $\Omega$. The ...
Hheepp's user avatar
  • 371
4 votes
0 answers
197 views

Dynamics of an inequality

The dynamics $D\ni(r_i,r_{i+1})\mapsto(r_{i+1},r_{i+2})\in D$ on the set $D:=\{(x,y)\in\mathbb{R}^2\colon x>0,y>x^2/2\}$ is given by the recurrence $$r_{i+2}=\frac{r_{i+1}^2}2+\frac1{r_{i+1}^3} ...
Iosif Pinelis's user avatar
1 vote
2 answers
416 views

Lower bound for $ \sum_{i=1}^n x_i f(x_i)$ when $\sum_{i=1}^{n}x_i = K$

Considering, the set of all n dim. vectors $\{x_i\}_{i=1,...,n} $ such that $x_i \geq 0 $ and $\sum_{i=1}^{n}x_i = K$ Any continuous and strictly increasing function $f^+(x)$ : $ \mathbb R^+ \to \...
Anna maredric's user avatar
2 votes
1 answer
260 views

An elementary functional inequality

Let $g$ be a $C^1$ function with $g(0)=0$ and $g(t)>0$ for all $t>0$. I am surprised that for all such $g$ the following seems to hold $\frac{\int_0^t(g'(s))^2ds}{g^2(t)}\geq \frac{1}{t}$ for ...
A random mathematician's user avatar
3 votes
0 answers
275 views

Maximizing the discrepancy in Jensen's inequality for a certain function

Let $\underline{b}=\{b_1,\dots,b_n\}$ be a fixed sequence of positive numbers, and let $a>0$ be a parameter. Define $$ D(a;\underline{b}):=\frac{1}{\frac{1}{na}+\frac{1}{\sum_{i=1}^n b_i}} -\sum_{...
dima's user avatar
  • 959
1 vote
0 answers
85 views

What are good bounds on ratios of subdeterminants?

Let $A$ be a symmetric matrix and $A_i$ be the matrix obtained from $A$ by dropping the $i^{th}$ row and column. Then what are some good bounds on the value of $\frac{det(A_i)}{det(A)}$ ? Using the ...
user6818's user avatar
  • 1,893
7 votes
1 answer
497 views

Inequality of the norm of the convolution in $L^p(\mathbb{R}^n)$ with symmetric decreasing rearrangement?

Is it true that $$ ||f*g||_p \le ||\,|f|^* * |g|^*||_p\quad ? $$ where $|f|^*$ and $|g|^*$ are the symmetric decreasing rearrangements of the functions $|f|$ and $|g|$. Under what conditions on $f$ ...
rrr's user avatar
  • 193
0 votes
1 answer
247 views

Proving a complicated inequality with powers of logarithms

I am currently formalising some results from complexity theory with a theorem prover. For that, I have to prove the following statement: Let $p, b, \varepsilon \in \mathbb R$ with $\varepsilon>0$ ...
Manuel Eberl's user avatar
  • 1,241
3 votes
1 answer
320 views

Is this parametric inequality true?

Puzzled by this still open question, I tried comparing the arithmetic mean $A(x,y)=(x+y)/2$ with a mean intermediate between a geometric-type mean $G(X)=(x^a y^{1-a}+x^{1-a} y^a)/2\;$ for $0\le a \le ...
Yaakov Baruch's user avatar
1 vote
1 answer
260 views

Nepero game (by Yacov Perelman)

I have already posted this question time before on stackexchange, but didn't receive a definitive solution. So this is the game: consider a positive integer number $n$ and divide it in a finite ...
asdfghj's user avatar
  • 11
1 vote
0 answers
225 views

Is there an improvement for the Schur-Horn inequalities for positive semi-definite matrices?

By the Schur-Horn inequality I am thinking of the statement that for any Hermitian matrix $H$ its diagonal n-tuple $(H_{11},H_{22},..,H_{nn})$ for any choice of basis lies in the convex hull of the $n!...
user6818's user avatar
  • 1,893
3 votes
4 answers
1k views

Simple bound for generalized geometric series

Let $b \in (0,1)$, $m\in \mathbb{N}$ and $a>0$. I want to bound $$\sum_{k=m+1}^\infty b^{k^a} \leq c \; b^{m^a}, $$ where $c>0$ is independent from $m$. Is there a simple way of proving this ...
L. Omat's user avatar
  • 85
6 votes
3 answers
2k views

Generalized Hardy-Littlewood-Sobolev Inequality

The Hardy-Littlewood-Sobolev Inequality says that $$\text{for $p,q,r\in (1,+\infty)$ such that }\quad 1-\frac1p+1-\frac1q=1-\frac1r,\tag {$\sharp$} $$ $$ \exists C, \forall u\in L^p(\mathbb R^n),\...
Bazin's user avatar
  • 16.2k
4 votes
3 answers
711 views

Inequality of arithmetic, geometric and harmonic means

Let $a_1,\dots,a_n$ be positive numbers, does the following inequality holds? $$\frac{a_1+a_2+\cdots+a_n}{n}-\sqrt[n]{a_1a_2\cdots a_n}\geq\sqrt[n]{a_1a_2\cdots a_n}-\frac{n}{\frac{1}{a_1}+\frac{1}{...
HGF's user avatar
  • 287
2 votes
1 answer
3k views

Inequality for the tail of normal distribution function

Let $ Ф(x) = \frac{1}{\sqrt{2\pi}} \int_{-\infty}^{x} e^{-t^2/2} \, dt $ be the cumulative distribution function of the standard normal distribution. Numerical calculations suggest the following ...
user47855's user avatar
1 vote
0 answers
248 views

Uniform bound for an alternating series of functions

I have mainly two questions, the first one being motivated by the second one. 1) Is there a way to prove that $F(x) = \sum_{k=1}^\infty \frac{(-1)^{k+1} x^{2k}}{(2k)!}$ is bounded on $\mathbb{R}_+$ ...
Alphonse's user avatar
  • 266
5 votes
1 answer
921 views

About generalized Minkowski inequality

For which functions $f:\mathbb{R}^+ \to \mathbb{R}^+$ does the inequality $f^{-1}\left(\sum\limits_{k=1}^n f(x_k+y_k)\right) \leq f^{-1}\left(\sum\limits_{k=1}^n f(x_k)\right) + f^{-1}\left(\sum\...
Bogdan's user avatar
  • 51
3 votes
1 answer
390 views

An elementary inequality: reference request

Consider the problem of minimizing $\sum_{i=1}^{n}{x_{i}}$ under the constraints $\sum_{i=1}^{n}{x_{i}^{2}}=1$ and $x_{i} \geq 0$. Obviously the solution is given by the vector $(1,0,\ldots,0)$. Now ...
Felix Goldberg's user avatar
4 votes
1 answer
388 views

Dependence of the constant in Korn's inequality on the domain

Let $\Omega \subset \mathbb{R}^N$ be an open, connected set with Lipschitz boundary, $N \geqslant 2$ and $$ \mathcal{E} ( v) := \int_{\Omega} \sum_{i, j} \varepsilon_{i j} ( v) \varepsilon_{i j} (...
Beni Bogosel's user avatar
  • 2,222
37 votes
3 answers
3k 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 ...
Eric Naslund's user avatar
  • 11.4k
-1 votes
2 answers
418 views

An inequality involving multi-index [closed]

I came across these inequalities while learning about Schwartz functions (Classical Fourier Analysis, Grafakos) and I have no idea how to prove this: For $x \in \mathbb{R}^{n}$ and $\alpha = (\alpha_{...
Vishal Gupta's user avatar
16 votes
6 answers
3k 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 ...
Hans's user avatar
  • 2,239
9 votes
2 answers
519 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 $k$-...
jat's user avatar
  • 91
16 votes
7 answers
6k 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, ...
Tom Leinster's user avatar
  • 27.7k
11 votes
8 answers
3k views

Almost-converses to the AM-GM inequality

Let us consider the Arithmetic Mean -- Geometric Mean inequality for nonnegative real numbers: $$ GM := (a_1 a_2 \ldots a_n)^{1/n} \le \frac{1}{n} \left( a_1 + a_2 + \ldots + a_n \right) =: AM. $$ ...
Vincenzo's user avatar
  • 531
0 votes
1 answer
302 views

An interpolation inequality.

For all $s>0$ define for $\epsilon\in(0,1)$ the function: \begin{equation} g(\epsilon)=\sum_{k=0}^{\infty}(1+k)^s(\sqrt{1-\epsilon})^k. \end{equation} Prove that $\exists C>0$ and $\phi(s)$ such ...
Felice's user avatar
  • 45
4 votes
0 answers
462 views

System of Equations Upper Bound

I asked a related question on math.stackexchange here but would now like to obtain a better bound. This question comes from a graph theory problem. I'll restate the new question here: For $i=1,2,\...
Alex R.'s user avatar
  • 4,952
1 vote
1 answer
273 views

Does this variable have an upper bound?

Let $x$ be a positive scalar variable whose time derivative satisfies $$|\dot{x}(t)|\leq \exp \left\{\left(-\int_{0}^{t}\frac{1}{x(\tau)} \mathrm{d} \tau \right)\right\},$$ where $|\cdot|$ denotes the ...
Shiyu's user avatar
  • 61
7 votes
3 answers
709 views

On the inequality $\sum_{i=1}^nx_i^4\sum_{i=1}^nx_i^2 -\sum_{i=1}^nx_i^6 \leq c\left(\sum_{i=1}^nx_i^3\right)^2$

I'm have some difficulties in bounding the following inequality: I want to find a c as small as possible s.t. $$\sum_{i=1}^nx_i^4\sum_{i=1}^nx_i^2 -\sum_{i=1}^nx_i^6 \leq c\left(\sum_{i=1}^nx_i^3\...
xwangae's user avatar
  • 191
4 votes
1 answer
977 views

Ratio sum comparison on operators

It is known by the Lidskii inequality, that $\sum_{i=1}^n \left|s_i(S)-s_i(T)\right|\le\sum_{i=1}^n s_i(S+T)$, where $s_i(S)$ is the $i$-th singular value of $S$. How would one prove that $$\sum_{i=1}^...
Ktb's user avatar
  • 41
2 votes
1 answer
1k views

On an eigenvalue inequality

Let $\lambda_1 (\cdot)$ be the larger absolute value eigenvalue of a $2\times2$ matrix and $\lambda_2 (\cdot)$ the smaller absolute value eigenvalue of a $2\times2$ matrix, i.e. $|\lambda_1 (\cdot)| \...
user20216's user avatar
4 votes
2 answers
5k views

Ratio of Sequences Sum Inequality

I have two real sequences $a_1,a_2,\dots,a_n$ and $b_1, b_2, \dots, b_n$, with $a_i > 0$ and $1 \leq b_i < n$, and I'm looking for a lower bound of $\sum_i \frac{a_i}{b_i}$ in terms of $\sum_i ...
Michael Biro's user avatar
  • 1,182
2 votes
1 answer
255 views

Quotients of perfect powers separated by an integer

Let $a_n=\frac{(n+1)^{n+2}}{n^n}$ and $b_n=\frac{(n+2)^{(n+1)}}{(n+1)^{n-1}}$. Then it is easy to see that $a_n \leq b_n$ for all integers $n\geq 1$ (because the sequence $(1+\frac{1}{n})^n$ is ...
Ewan Delanoy's user avatar
  • 3,595
2 votes
2 answers
711 views

Power function inequality

Let $x$ and $p$ be real numbers with $x \ge 1$ and $p \ge 2$ . Show that $(x - 1)(x + 1)^{p - 1} \ge x^p - 1$ . I recently discovered this result. I am sure it is known, but it is new to me. It is ...
Richard Hevener's user avatar
2 votes
1 answer
942 views

A singular value inequality

Let $s_1,s_2: \mathbb{R}^{2\times 2} \mapsto \mathbb{R}_+$, $s_{1}\left(\cdot\right)\ge s_{2}\left(\cdot\right)\ge 0$, be the singular values of a $2\times2$ matrix. Is it true that $$\left|s_{1}\...
user7738's user avatar
  • 173
11 votes
1 answer
1k views

Proof of the "Neo-classical Inequality", a fractional extension of the binomial theorem

I came across the following inequality, dubbed the "Neoclassical Inequality" which holds uniformly in $p\geq 1$ and $n\in\mathbb N$: $$\frac{1}{p^2}\sum_{j=0}^n\frac{a^{\frac{j}p}b^{\frac{n-j}p}}{\...
Alex R.'s user avatar
  • 4,952
7 votes
2 answers
724 views

Sturm chain analogue for exponential polynomials?

I'm going to define an exponential polynomial of degree $k$ as a function $f$ of the form $f(x) = \sum_{i=1}^k c_ie^{\alpha_ix}$ ($\alpha_i$s real). My first question is: is there an algorithm for ...
zeb's user avatar
  • 8,688
6 votes
1 answer
369 views

Denominators in the solution to Hilbert's XVII

Hilbert's seventeenth problem asks to prove that every positive semidefinite form can be written as the sum of squares of rational functions. Currently we don't seem to have a good understanding of ...
Gjergji Zaimi's user avatar

1
3 4 5 6
7