Prove that l^p is a subset of l^q for all p,q from 1 to infinity

  • Thread starter Thread starter cbarker1
  • Start date Start date
  • Tags Tags
    Infinity
cbarker1
Gold Member
MHB
Messages
345
Reaction score
23
Homework Statement
Prove that l^p is a subset of l^q for all p,q from 1 to infinity. Then prove it is strict subset. First, prove that a^t<=a for all t,a in (0,1]. Then prove that finite sum of |x_i|^t<= the sum of |xi|.
Relevant Equations
a^t<=a for all a,t
p-norm's definition.
Dear everyone,

I am having trouble with this problem. I have convinced myself that the ##a^t-a\leq 0## is true. Now, I am trying to applying this inequality for the finite series and I don't know where to start. After that, proving that the p-norm is less or equal to the q-norm.

Thanks,
Cbarker1
 
Physics news on Phys.org
Is there a condition on p and q, such as q &lt; p? Otherwise you are being asked to prove l^p \subsetneq l^q \subsetneq l^p which is impossible.

If you have two sequences of non-negative numbers, with the property that each element of the first sequence is less than or equal to the corresponding element of the second sequence, what can you say about the sums of those sequences?
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top