TransWikia.com

Elementary Inequality regarding Sum of Squares

Mathematics Asked by Consider Non-Trivial Cases on November 21, 2020

begin{align}
&mbox{If}quad
A = sum_{i = 1}^{m}a_{i},x_{i}^{2}
quadmbox{and}quad
B = sum_{j = 1}^{n}b_{j},y_{j}^{2}
\[2mm] &
mbox{where}quad
x_{i}, y_{j}, a_{i}, b_{j} geq 1, quad x_{i} neq y_{j}
end{align}

Then, find necessary and sufficient conditions such that $A – B > 1$ when $m = n$ is odd, $ A > B$.

My Attempt:

Because there are total $m = n $ subtractions $a_{i},x_{i}^{2} – b_{j},y_{j}^{2}$ and each
$a_{i},x_{i}^{2} – b_{j}y_{j}^{2} > 2$ ( minimum possible case is
$1 cdot 2^{2} – 1cdot 1^{1} = 3$ ), we need to show $displaystylesum_{i = 1}^{n – 1}a_{i},x_{i}^{2} – b_{i},y_{i}^{2}$ has to be $geq 0$.

so the sum of $a_{i},x_{i}^{2} – b_{j},y_{j}^{2}$ is greater than $0$, thus $A – B > 1$.

Is there anything in the literature imply the proposition? In that case plz comment.

The post consider the non-trivial case, if any specification is required, plz let me know.

ADDED NOTE:

All $x_{i}, y_{j}, a_{i}, b_{j}$ are integers.

Is linear form of logarithm relevant to this problem $?$.

One Answer

begin{align} &mbox{If}quad A = sum_{i = 1}^{n}a_{i},x_{i}^{2} quadmbox{and}quad B = sum_{j = 1}^{n}b_{j},y_{j}^{2} \[2mm] end{align}

with integer $x_{i}, y_{j}, a_{i}, b_{j} geq 1 , quad x_{i} neq y_{j} $, and $A > B$, we are to find conditions for which $A-B > 1$.

As OP already posted, the given condition $A > B$, together with the integer condition of the variables, implies that the difference $A - B$ cannot become arbitrarily small. So we start to investigate the smallest such difference under the given conditions.

This can be used to construct first of all an example where the assertion does not hold true. Let $A = 1cdot 3^2 = 9$ and $B = 2cdot 2^2 = 8$, then $A>B$ and $A-B=1$ so the required $A-B>1$ fails. There are many more such examples possible for other integer numbers $x_{i}, y_{j}, a_{i}, b_{j} geq 1$. So, the only statement we can make in general is that, due to the integer condition and $A>B$, the minimum possible difference is $A-B=1$.

From this it follows that it's difficult resp. unlikely to give general explicit conditions for making $A-B> 1$. Such conditions can be implicitely stated: Choose integer numbers $x_{i}, y_{j}, a_{i}, b_{j} geq 1$ such that $A-Bge 2$. (Then $A-B > 1$ is obviously obtained.)

Answered by Andreas on November 21, 2020

Add your own answers!

Ask a Question

Get help from others!

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP