Bessel's Inequality: Proving \|v\|^2 \ge c_1^2 + \cdots + c_k^2

  • Thread starter Thread starter e(ho0n3
  • Start date Start date
  • Tags Tags
    Inequality
Click For Summary
SUMMARY

The discussion centers on proving Bessel's Inequality, which states that for a vector \( v \in \mathbb{R}^n \) and an orthonormal set \( \{u_1, \ldots, u_k\} \), the inequality \( \|v\|^2 \ge c_1^2 + \cdots + c_k^2 \) holds, where \( c_i = v \cdot u_i \). Participants explored the relationship between the vector \( v \) and the orthonormal set, concluding that completing the set to an orthonormal basis using the Gram-Schmidt process is essential. The discussion also touches on proving Parseval’s Identity and the conditions under which Bessel's Inequality becomes an equality.

PREREQUISITES
  • Understanding of vector spaces and inner products in \( \mathbb{R}^n \)
  • Knowledge of orthonormal sets and bases
  • Familiarity with the Gram-Schmidt orthogonalization process
  • Basic concepts of linear combinations and projections in linear algebra
NEXT STEPS
  • Study the Gram-Schmidt process for orthonormalization in vector spaces
  • Learn about Parseval’s Identity and its implications in functional analysis
  • Explore the geometric interpretation of inner products and projections
  • Investigate applications of Bessel's Inequality in signal processing and Fourier analysis
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, functional analysis, or related fields, will benefit from this discussion. It is also valuable for anyone interested in the applications of orthonormal bases in various mathematical contexts.

e(ho0n3
Messages
1,349
Reaction score
0
Homework Statement
Let v \in \mathbb{R}^n, let \{u_1, \ldots, u_k\} be an orthonormal subset of \mathbb{R}^n and let c_i be the coefficient of the projection of v to the span of u_i. Show that \|v\|^2 \ge c_1^2 + \cdots + c_k^2.

The attempt at a solution
c_i = v \cdot u_i and \| v \|^2 = v \cdot v so I can write the inequality as

v \cdot (v - (u_1 + \cdots + u_k)) \ge 0

This means the angle between v and v - (u_1 + \cdots + u_k) is less than 90 degrees. This is all I've been able to conjure. I'm trying to reverse-engineer the inequality back to something I know is true. Is this a good approach? Is there a better approach?
 
Physics news on Phys.org
Couldn't you just complete {u1,...,uk} to an orthonormal basis {u1,...,uk,uk+1,...,un}? So ||v||^2=c1^2+...cn^2.
 
Ah! Good point. I think that'll work. All that remains to be proved is that v = c_1u_1 + \cdots c_nu_n.
 
Quick question: the basis doesn't have to be orthonormal does it?
 
e(ho0n3 said:
Ah! Good point. I think that'll work. All that remains to be proved is that v = c_1u_1 + \cdots c_nu_n.

Do you really have to prove that? v is some linear combination of the basis vectors u_i. So c_i must be v.u_i since they are orthonormal. Isn't that what an orthonormal basis is all about?
 
Never mind. I understand why it has to be orthonormal: If it isn't, I couldn't write v as a linear combination of the u's using the c's as the coefficients.
 
The only thing that might have to be proved is that you can complete an orthonormal subset to an orthonormal basis. But that's Gram-Schmidt.
 
I know I can expand the set of u's to a basis, then orthogonalize it using Gram-Schmidt, and then normalize the result. This will yield an orthonormal basis with the original u's.
 
Right. So not much to prove really. That one was easy.
 
  • #10
Thank you for your help.
 
  • #11
Hi
Can you do it these two proof?
I tried but i don't know these proofs...

(b) Prove Parseval’s Indentity: For any w ∈ span(S), we have

||w||^2 = |w · u1 |^2 + |w · u2 |^2+ · · · + |w · uk |^2 .

(c) Prove Bessel’s Inequality: For any x ∈ R^n we have

||x||^2 ≥ |x · u1 |^2 + |x · u2 |^2 + · · · + |x · uk |^2 ,

and this is an equality if and only if x ∈ span(S).
 

Similar threads

Replies
34
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 25 ·
Replies
25
Views
3K
  • · Replies 23 ·
Replies
23
Views
2K