Skip to main content
Replaced '\[ \]' pair with $$ $$ so that the TeX would render.
Source Link

This is just Sergei Ivanov's comment finished with Pietro Majer's answer. If all the terms are real and positive then rearrange both $a:=(a_n)$ and $b:=(b_n)$ so they are non-increasing. If $a \neq b$, then by removing the longest initial segment on which they agree we may assume that $a_1 \neq b_1$.

But now

\[ a_1 = \|a\|_\infty=\lim_{p \to \infty} \|a\|_p = \lim_{p \to \infty} \|b\|_p=\|b\|_\infty=b_1, \]$$ a_1 = \|a\|_\infty=\lim_{p \to \infty} \|a\|_p = \lim_{p \to \infty} \|b\|_p=\|b\|_\infty=b_1, $$

a contradiction.

This is just Sergei Ivanov's comment finished with Pietro Majer's answer. If all the terms are real and positive then rearrange both $a:=(a_n)$ and $b:=(b_n)$ so they are non-increasing. If $a \neq b$, then by removing the longest initial segment on which they agree we may assume that $a_1 \neq b_1$.

But now

\[ a_1 = \|a\|_\infty=\lim_{p \to \infty} \|a\|_p = \lim_{p \to \infty} \|b\|_p=\|b\|_\infty=b_1, \]

a contradiction.

This is just Sergei Ivanov's comment finished with Pietro Majer's answer. If all the terms are real and positive then rearrange both $a:=(a_n)$ and $b:=(b_n)$ so they are non-increasing. If $a \neq b$, then by removing the longest initial segment on which they agree we may assume that $a_1 \neq b_1$.

But now

$$ a_1 = \|a\|_\infty=\lim_{p \to \infty} \|a\|_p = \lim_{p \to \infty} \|b\|_p=\|b\|_\infty=b_1, $$

a contradiction.

added 35 characters in body
Source Link
Tony Huynh
  • 32.1k
  • 11
  • 112
  • 187

This is just Sergei Ivanov's comment finished with Pietro Majer's answer. If all the terms are real and positive then rearrange both $a:=(a_n)$ and $b:=(b_n)$ so they are non-increasing. By consideringIf $a \neq b$, then by removing the first index atlongest initial segment on which they disagreeagree we may assume that $a_1 > b_1 \geq b_n$ for all $n$$a_1 \neq b_1$.

But now

\[ a_1 = \lim_\|a\|_\infty=\lim_{p \to \infty} \|a\|_p = \lim_{p \to \infty} \|b\|_p=b_1\|b\|_p=\|b\|_\infty=b_1, \]

a contradiction.

This is just Sergei Ivanov's comment finished with Pietro Majer's answer. If all the terms are real and positive then rearrange both $a:=(a_n)$ and $b:=(b_n)$ so they are non-increasing. By considering the first index at which they disagree we may assume that $a_1 > b_1 \geq b_n$ for all $n$.

But now

\[ a_1 = \lim_{p \to \infty} \|a\|_p = \lim_{p \to \infty} \|b\|_p=b_1, \]

a contradiction.

This is just Sergei Ivanov's comment finished with Pietro Majer's answer. If all the terms are real and positive then rearrange both $a:=(a_n)$ and $b:=(b_n)$ so they are non-increasing. If $a \neq b$, then by removing the longest initial segment on which they agree we may assume that $a_1 \neq b_1$.

But now

\[ a_1 = \|a\|_\infty=\lim_{p \to \infty} \|a\|_p = \lim_{p \to \infty} \|b\|_p=\|b\|_\infty=b_1, \]

a contradiction.

Source Link
Tony Huynh
  • 32.1k
  • 11
  • 112
  • 187

This is just Sergei Ivanov's comment finished with Pietro Majer's answer. If all the terms are real and positive then rearrange both $a:=(a_n)$ and $b:=(b_n)$ so they are non-increasing. By considering the first index at which they disagree we may assume that $a_1 > b_1 \geq b_n$ for all $n$.

But now

\[ a_1 = \lim_{p \to \infty} \|a\|_p = \lim_{p \to \infty} \|b\|_p=b_1, \]

a contradiction.