Consider a vector x in RR^n with entries x_i. Given that norm(x)_2^2 <= n, and no other information, what is the best possible upper bound on sum_(i=1)^n x_i that we can have?

alan3885uo

alan3885uo

Open question

2022-08-21

Consider a vector x R n with entries x i . Given that x 2 2 n, and no other information, what is the best possible upper bound on i = 1 n x i that we can have?

Answer & Explanation

Leon Clark

Leon Clark

Beginner2022-08-22Added 9 answers

Apply the Cauchy-Schwarz inequality and check that it is tight.
i = 1 n x i i = 1 n x i 2 i = 1 n 1 2 = n x 2
Equality holds when x 1 = = x n

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?