Linear Algebra - Inner Product problem

Click For Summary
SUMMARY

The discussion centers on proving or disproving the statement: "Let u ∈ V. If (u, v) = 0 for every v ∈ V such that v ≠ u, then u = 0," within the context of inner product spaces. Participants highlight the importance of the inner product axioms, particularly that (u, u) = 0 implies u = 0. They suggest that the original statement may contain a typo and should instead state (u, v) = 0 for every v ≠ 0. The Gram-Schmidt orthogonalization process is also referenced as a relevant concept for understanding vector orthogonality.

PREREQUISITES
  • Understanding of inner product spaces and their axioms
  • Familiarity with the Gram-Schmidt orthogonalization algorithm
  • Knowledge of linearity properties of inner products
  • Basic concepts of vector spaces and orthogonality
NEXT STEPS
  • Study the properties of inner products in finite-dimensional vector spaces
  • Learn about the Gram-Schmidt orthogonalization process in detail
  • Explore proofs involving inner product axioms and their implications
  • Investigate counterexamples in vector spaces to understand orthogonality
USEFUL FOR

Students and educators in linear algebra, mathematicians focusing on vector spaces, and anyone interested in the properties and applications of inner products in mathematics.

RikaWolf
Messages
2
Reaction score
0
TL;DR
Prove/Disprove - Inner Product topic
I need help to know if I'm on the right track:
Prove/Disprove the following:
Let u ∈ V . If (u, v) = 0 for every v ∈ V such that v ≠ u, then u = 0.
(V is a vector-space)
I think I need to disprove by using v = 0, however I'm not sure.
 
Physics news on Phys.org
RikaWolf said:
Summary: Prove/Disprove - Inner Product topic

I need help to know if I'm on the right track:
Prove/Disprove the following:
Let u ∈ V . If (u, v) = 0 for every v ∈ V such that v ≠ u, then u = 0.
(V is a vector-space)
I think I need to disprove by using v = 0, however I'm not sure.
I assume you have a real, finite dimensional vector space here.

You are right, ##(u,0)=0## is always true for any ##u##, which makes me think there is a typo. The condition is probably ##(u,v)=0## for every ##v\neq 0##, then ##u=0##.

What does it mean, that ##(u,v)=0## for all ##v\neq 0## and what does it mean if you chose a basis and express ##u## according to this basis?
 
fresh_42 said:
I assume you have a real, finite dimensional vector space here.

You are right, ##(u,0)=0## is always true for any ##u##, which makes me think there is a typo. The condition is probably ##(u,v)=0## for every ##v\neq 0##, then ##u=0##.

What does it mean, that ##(u,v)=0## for all ##v\neq 0## and what does it mean if you chose a basis and express ##u## according to this basis?
Well then, assuming v= {b1...bn}, u={a1...an} there could still be a (u,v)=0 when v= {-an...-a} and u isn't 0
 
##(u,v)=0## means that ##u## and ##v## are perpendicular to each other. Now how can a vector ##u## be perpendicular to all the rest? Have you had the Gram Schmidt orthogonalization algorithm in your course, yet?
 
RikaWolf said:
Summary: Prove/Disprove - Inner Product topic

I need help to know if I'm on the right track:
Prove/Disprove the following:
Let u ∈ V . If (u, v) = 0 for every v ∈ V such that v ≠ u, then u = 0.
(V is a vector-space)
I think I need to disprove by using v = 0, however I'm not sure.

Let me add to the above by explaining how I thought about this:

First, why are we not given that ##(u, u) = 0##? Well, one of the inner product axioms is that ##(u, u) = 0## iff ##u =0##.

Now, that gives me an idea of how to prove that ##u = 0##. If I could show that ##(u, u) = 0## then that would be enough.

So, how to show that ##(u, u) = 0##?

First, I can see an easy way that is a bit of a cheat. So, if I don't use that, what else can I do?

Well, there's the linearity of the inner product: ##(u, v+w) = (u, v) + (u, w)##. Perhaps I could use that ...
 
  • Like
Likes   Reactions: Cryo

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K