Proving Normed Vectorspace: K > 0 Solution

  • Thread starter Thread starter Hummingbird25
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on proving the existence of a constant K > 0 such that the norm ||x|| is bounded by K times the L1-norm ||x||_1 for any vector x in \mathbb{R}^n. The user presents the definitions of the Euclidean norm and the L1-norm, leading to the inequality ||x|| ≤ K||x||_1. The conclusion drawn is that since K is a positive scalar, the right side of the inequality will always exceed the left side, thereby supporting the claim. Further clarification on the argument's validity is requested.

PREREQUISITES
  • Understanding of vector norms, specifically Euclidean norm and L1-norm.
  • Familiarity with mathematical proofs and inequalities.
  • Knowledge of continuous functions and their properties in \mathbb{R}^n.
  • Basic concepts of open intervals in real analysis.
NEXT STEPS
  • Study the properties of norms in vector spaces, focusing on norm equivalence.
  • Explore the concept of bounded linear operators in functional analysis.
  • Learn about the triangle inequality and its implications in normed spaces.
  • Investigate the implications of continuity in functions mapping from open intervals to \mathbb{R}^n.
USEFUL FOR

Mathematicians, students of real analysis, and anyone interested in understanding vector norms and their applications in functional analysis.

Hummingbird25
Messages
84
Reaction score
0
Hi

I'm tasked with proving the following:

Let S be an open interval S and [tex]f: S -> \mathbb{R}^n[/tex] be a continuous function.

Let [tex]|| \cdot ||[/tex] be norm on [tex]\mathbb{R}^n[/tex]. show

1) There exist a K > 0 such that [tex]||x|| \leq K||x||_1 ; \ x \in \mathbb{R}^n, ||x||_1 = \sum_{i=1} ^n |x_i|[/tex].

My Solution:

According to the definition the norm of a vector x in R^n is the non-negative scalar [tex]||x|| = \sqrt{x_1^{2} + x_2^{2} + \cdots x_n^2}[/tex]

The L1-norm can be written as [tex]||x||_1 = |x_1| + |x_2| + \cdots + |x_n|[/tex]

Expanding the inequality:

[tex]\sqrt{x_1^{2} + x_2^{2} + \cdots x_n^2} \leq K|x_1| + K|x_2| + \cdots + K|x_n|[/tex]

Is it then concludable from this that since K>0, then the right side of the inequality sign will always be larger than the left side?

Sincerley Yours
Humminbird25
 
Last edited:
Physics news on Phys.org
Hummingbird25 said:
Is it then concludable from this that since K>0, then the right side of the inequality sign will always be larger than the left side?

Can you expand on how you think this argument would work?
 

Similar threads

Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
9
Views
1K
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
Replies
2
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K