Inequality on $\ell_p$: Proving or Disproving?

  • Context: Graduate 
  • Thread starter Thread starter forumfann
  • Start date Start date
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
3 replies · 1K views
forumfann
Messages
24
Reaction score
0
Could anyone prove or disprove the following inequality:
[itex]||x||_{p}\leq||x||_{p'}[/itex] for all [itex]x\in\mathbb{R}^{n}[/itex] if [itex]p'>p\geq1[/itex]?

By the way, this is not a homework problem.

Any help on this will be highly appreciated.
 
on Phys.org
forumfann said:
Could anyone prove or disprove the following inequality:
[itex]||x||_{p}\leq||x||_{p'}[/itex] for all [itex]x\in\mathbb{R}^{n}[/itex] if [itex]p'>p\geq1[/itex]?

By the way, this is not a homework problem.

Any help on this will be highly appreciated.

Where is the problem from?
 
This a problem that I was curious about, because we know that [itex]||x||_{m}\leq||x||_{1}[/itex] for any positive integer [itex]m[/itex], and then I wondered if it is true for any [itex]p\geq1[/itex].

But it would be great if one can show the following:
[itex]||x||_{p}\leq||x||_{1}[/itex] for [itex]p\geq1[/itex],
so could anyone help me on this?
 
Last edited:
[tex]\|x\|^p_p = \sum_i{|x_i|^p} \leq \left( \sum_i{(|x_i|)} \right)^p = \|x\|_1^p[/tex]

Though I am very dizzy right now, it should be OK where I used [itex]a^2+b^2 \leq (a+b)^2, a,b > 0[/itex]