can someone explain this proof please, I added a star to the inequalities I don't see/understand.(adsbygoogle = window.adsbygoogle || []).push({});

if | | is a norm on a field K and if there is a C > 0 so that for all integers n |n.1| is smaller than or equal to C, the norm is non archimedean (ie the strong triangle inequality is true)

proof: if x and y in K

[tex]\[

\begin{array}{l}

|x + y|^n \le \sum\limits_{k = 0}^n {|\frac{{n!}}{{k!(n - k)!}}} x^k y^{n - k} | \le *(n + 1).C.\max \left( {|x|,|y|} \right)^n \\

|x + y| \le *\mathop {\lim }\limits_{n \to \infty } \left[ {(n + 1)C.\max \left( {|x|,|y|} \right)^n } \right]^{1/n} * = \max \left( {|x|,|y|} \right) \\

\end{array}

\][/tex]

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Non archimedean norm

Loading...

Similar Threads - archimedean norm | Date |
---|---|

A For finite dimension vector spaces, all norms are equivalent | Sep 29, 2016 |

B Does the L2 norm of a vector destroy all directional info? | May 24, 2016 |

Is this proof of an ##\infty## norm valid? | Jan 26, 2016 |

**Physics Forums - The Fusion of Science and Community**