Intereting Posts

Sum of nth roots of unity
Integral inequality with two increasing functions
How can a subfield of an abelian extension fail to be cyclic when subjected to a norm-like condition. (How can I understand the supplied explanation)
Generalization of Cayley-Hamilton for non-diagonal coefficients related to other properties than eigenvalues?
What's the best way to measure mathematical ability?
Is there a way to see this geometrically?
Bounded inverse operator
Are there any simple ways to see that $e^z-z=0$ has infinitely many solutions?
Compact spaces and closed sets (finite intersection property)
If X,Y and Z are independent, are X and YZ independent?
What is a real world application of polynomial factoring?
Will this procedure generate random points uniformly distributed within a given circle? Proof?
Group Actions: Orbit Space
Continued fraction of $e^{-2\pi n}$
Should you ever stop rolling, THE SEQUEL

$\sum_{i=1}^n(a_i)\sum_{i=1}^n(\frac{1}{a_i})\ge n^2$ is what I want to prove, where $a_i>0$ and I need to showwhen equality holds. I have tried using Cauchy-Schwarz, where inside the sums I multiply each value by 1 to do it but it doesn’t work out. I have also done

$\sum_{i=1}^n(a_i)\sum_{i=1}^n(\frac{1}{a_i})=\sum_{i=1}^n \sum_{i=1}^n(\frac{a_i}{a_i})=\sum_{i=1}^n\sum_{i=1}^n(1)=\sum_{i=1}^n(n)=n^2$, but this proves an equality.

Am I not allowed to do the first step I did in my work?

- Homogenous equation in linear algebra?
- How to express complex multiplication with a linear operator on $\mathbb R^n$?
- linear least squares minimizing distance from points to rays - is it possible?
- Tensors in the context of engineering mechanics: can they be explained in an intuitive way?
- Proving that every vector space has a norm.
- geometric multiplicity= algebraic multiplicity for a symmetric matrix

- If $\lambda$ is an eigenvalue of $A^2$, then either $\sqrt{\lambda}$ or $-\sqrt{\lambda}$ is an eigenvalue of $A$
- Real analysis textbok that develops the subject in a self-motivated, coherent fashion?
- Convergence of $\sum \frac{\sqrt{a_n}}{n^p}$
- Does that fact that the dual map is zero imply that the map is zero?
- Assume that $ f ∈ L()$ and $\int x^nf(x)dx=0$ for $n=0,1,2…$.
- Assuming $AB=I$ prove $BA=I$
- Continuous function from $(0,1)$ onto $$
- Gaussian Elimination
- Prove that a function is contractive
- Show that $\int_{\pi}^{\infty} \frac{1}{x^2 (\sin^2 x)^{1/3}} dx$ is finite.

By the Cauchy-Schwarz inequality,

$$\sum_{i = 1}^n a_i \sum_{i = 1}^n \frac{1}{a_i} \ge \left(\sum_{i = 1}^n \sqrt{a_i}\cdot \sqrt{\frac{1}{a_i}}\right)^2 =\left(\sum_{i = 1}^n 1\right)^2 = n^2.$$

Expanding GEdgar’s answer,

$\begin{array}\\

\sum_{i=1}^na_i\sum_{i=1}^n\frac{1}{a_i}

&=\sum_{i=1}^n \sum_{j=1}^n\frac{a_i}{a_j}\\

&=\sum_{i=1}^n \left(\sum_{j=1}^{i-1}\frac{a_i}{a_j}

+\frac{a_i}{a_i}

+\sum_{j=i+1}^{n}\frac{a_i}{a_j}\right)\\

&=\sum_{i=1}^n \sum_{j=1}^{i-1}\frac{a_i}{a_j}

+n

+\sum_{i=1}^n\sum_{j=i+1}^{n}\frac{a_i}{a_j}\\

&=\sum_{i=1}^n \sum_{j=1}^{i-1}\frac{a_i}{a_j}

+n

+\sum_{j=1}^n\sum_{i=1}^{j-1}\frac{a_i}{a_j}\\

&=\sum_{i=1}^n \sum_{j=1}^{i-1}\frac{a_i}{a_j}

+n

+\sum_{i=1}^n\sum_{j=1}^{i-1}\frac{a_j}{a_i}

\quad\text{ (swapping i and j in the last sum)}\\

&=\sum_{i=1}^n \sum_{j=1}^{i-1}\left(\frac{a_i}{a_j}+\frac{a_j}{a_i}\right)

+n\\

&=\sum_{i=1}^n \sum_{j=1}^{i-1}\left(\frac{a_i^2+a_j^2}{a_i a_j}\right)

+n\\

&=\sum_{i=1}^n \sum_{j=1}^{i-1}\left(\frac{(a_i-a_j)^2+2a_i a_j}{a_i a_j}\right)

+n\\

&=\sum_{i=1}^n \sum_{j=1}^{i-1}\left(\frac{(a_i-a_j)^2}{a_i a_j}+2\right)

+n\\

&=\sum_{i=1}^n \sum_{j=1}^{i-1}\frac{(a_i-a_j)^2}{a_i a_j}

+\sum_{i=1}^n \sum_{j=1}^{i-1}2

+n\\

&=\sum_{i=1}^n \sum_{j=1}^{i-1}\frac{(a_i-a_j)^2}{a_i a_j}+\sum_{i=1}^n 2(i-1)+n\\

&=\sum_{i=1}^n \sum_{j=1}^{i-1}\frac{(a_i-a_j)^2}{a_i a_j}+2\frac{n(n-1)}{2}+n\\

&=n^2+\sum_{i=1}^n \sum_{j=1}^{i-1}\frac{(a_i-a_j)^2}{a_i a_j}\\

&\ge n^2\\

\end{array}

$

with equality

if and only if

all the $a_i$ are equal.

For the first step

$$

\sum_{i=1}^n(a_i)\sum_{i=1}^n(\frac{1}{a_i})=\sum_{i=1}^n \sum_{j=1}^n(\frac{a_i}{a_j})

$$

The first factor has $n$ terms, the second factor has $n$ terms, and when you multiply them there are $n^2$ terms.

Can you see how to finish now?

(*Late answer, but I just flagged a recent question as a duplicate of this one, and thought I’d leave yet another way to solve it here*.)

The given inequality $\displaystyle\,\left(\sum_{i=1}^n a_i\right)\left(\sum_{i=1}^n\frac{1}{a_i}\right)\ge n^2\,$ is equivalent to $\;\displaystyle\,\frac{\displaystyle\;\sum_{i=1}^n a_i\;}{n} \ge \frac{n}{\displaystyle\;\sum_{i=1}^n \frac{1}{a_i}\;} \,$.

The latter is the $\text{AM} \ge \text{HM}$ inequality between the arithmetic and harmonic means of $\,n\,$ positive numbers, which holds true by the generalized mean inequality, with equality iff all $\,a_i\,$ are equal.

- The solution of $\min_x \max_{1\leq r \leq N} \left|\frac{\sin rMx}{\sin rx}\right|$
- What is the field of fractions of $\mathbb{Q}/(x^2+y^2)$?
- Question about Conditional Expectation
- inverse function of $y=ax\ln(bx)$
- The topology defined by the family of pseudo-distances.
- How to solve $4\sin \theta +3\cos \theta = 5$
- normal bundle of level set
- “Continuity” of stochastic integral wrt Brownian motion
- Creating an ellipsoidal 3D surface
- How to find $x$ when $2^{x}+3^{x}=6$?
- How do you prove triangle inequality for this metric?
- Euler characteristic of a covering space
- Prove $\langle x,x \rangle < 0$ or $\langle x,x \rangle > 0$ for all $x \neq 0$
- Galois Theoretic Proof of Fundamental Theorem of Algebra
- A robot moves on 2-Dimensional grid. It starts out at (0,0) and is allowed to move in any of these four ways: