Proving the Properties of Subspace U⊥ in Rn | Help with Subspace Concepts

  • Context: Graduate 
  • Thread starter Thread starter icystrike
  • Start date Start date
  • Tags Tags
    Subspace
Click For Summary

Discussion Overview

The discussion revolves around proving properties of the orthogonal complement of a subspace \( U \) in \( \mathbb{R}^n \), specifically addressing whether \( U^\perp \) is a subspace and the relationship between the dimensions of \( U \) and \( U^\perp \). The scope includes theoretical aspects and mathematical reasoning related to linear algebra concepts.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • Some participants assert that \( U^\perp \) is a subspace of \( \mathbb{R}^n \) by demonstrating that it contains the zero vector and is closed under addition and scalar multiplication.
  • Others propose that if \( U \) has rank \( r \), then \( U^\perp \) is the nullspace of the transpose of \( U \), leading to the conclusion that \( \text{dim}(U) + \text{dim}(U^\perp) = n \).
  • A participant suggests that the intersection of \( U \) and \( U^\perp \) is trivial, containing only the zero vector, which supports the dimension argument.
  • Some participants express confusion regarding the notation used, particularly the use of "T" for transpose and the characterization of \( U \) as a matrix rather than a subspace.
  • Hints are provided for proving the dimension relationship, including the uniqueness of representation of vectors in \( \mathbb{R}^n \) as sums of vectors from \( U \) and \( U^\perp \).
  • One participant proposes a reasoning based on the dimension formula, suggesting that the intersection dimension must be zero to satisfy the properties of subspaces.

Areas of Agreement / Disagreement

Participants generally agree on the need to prove the properties of \( U^\perp \) but express differing views on the notation and the approach to the proofs. The discussion includes both supportive arguments and clarifications, indicating that multiple perspectives exist without a clear consensus on the best method of proof.

Contextual Notes

Some participants note limitations in the notation and assumptions made about the nature of \( U \) as a subspace versus a matrix, which may affect the clarity of the arguments presented.

icystrike
Messages
444
Reaction score
1
1. Let U be a subspace of Rn and let
U⊥ = {w ∈ Rn : w is orthogonal to U} .
Prove that
(i) U⊥ is a subspace of Rn,
(ii) dimU + dimU⊥ = n.


Attempt.


i)
U. ( U⊥)T=0
If U⊥ does not passes the origin , the above equation cannot be satisfied.
Therefore U⊥ passes the origin.
U.( U⊥+ U⊥)T=U. ( U⊥)T+U.( U⊥)T=0+0=0
U.(k U⊥)T=k[U. (U⊥)T]=k.0=0

Therefore U⊥ is a subspace in Rn

ii) let U have rank r.
U⊥ is the nullspace of the U transpose.
and if U is a matrix of mxn , UT is nxm.
Therefore , the sum of dim of the two matrices is exactly n.
 
Physics news on Phys.org
I don't understand your notation. You use "T" which I guess is "transpose" and talk about U being a matrix. U is given as a subspace, not a matrix.
 
HallsofIvy said:
I don't understand your notation. You use "T" which I guess is "transpose" and talk about U being a matrix. U is given as a subspace, not a matrix.

yup you are right.. it is transpose and subspace..
 
icystrike said:
1. Let U be a subspace of Rn and let
U⊥ = {w ∈ Rn : w is orthogonal to U} .
Prove that
(i) U⊥ is a subspace of Rn,
(ii) dimU + dimU⊥ = n.


Attempt.


i)
U. ( U⊥)T=0
If U⊥ does not passes the origin , the above equation cannot be satisfied.
Therefore U⊥ passes the origin.
U.( U⊥+ U⊥)T=U. ( U⊥)T+U.( U⊥)T=0+0=0
U.(k U⊥)T=k[U. (U⊥)T]=k.0=0

Therefore U⊥ is a subspace in Rn

ii) let U have rank r.
U⊥ is the nullspace of the U transpose.
and if U is a matrix of mxn , UT is nxm.
Therefore , the sum of dim of the two matrices is exactly n.


Let u,v be in U⊥. Let k be a constant in R.
Now <u,w>=0 for all w in U and <v,w>=0 for all w in U.
Thus by linearity of inner product we have <u+kv,w>=0 for all w in U. Thus, u+kv is also in U⊥ for all u,v,k. Thus U⊥ is a subspace.

For the second part, DIY but here are some hints:
- We know that U [tex]\cap[/tex] U⊥ = {0}. Easy to check (if a vector is in U and perpendicular to U then it has to be the zero vector).
- Take x in Rn. Prove that x = u+u' for u in U and u' in U⊥.
- This is unique representation. If x = u+u' = v+v' with u,v in U and u',v' in U⊥ then 0 = (u-v)+(u'-v') implies u-v = v'-u' implies u-v = v'-u' = 0 since U [tex]\cap[/tex] U⊥ = {0}. Thus u=v and u'=v'.
- Thus projection map [tex]\pi[/tex]: Rn -->> U defined by [tex]\pi[/tex](x)=u where x = u+u' with u in U and u' in U⊥.
- Use Isomorphism theorem corollary (that dim(range)+dim(kernel)=dim(Rn)=n)
 
adityab88 said:
Let u,v be in U⊥. Let k be a constant in R.
Now <u,w>=0 for all w in U and <v,w>=0 for all w in U.
Thus by linearity of inner product we have <u+kv,w>=0 for all w in U. Thus, u+kv is also in U⊥ for all u,v,k. Thus U⊥ is a subspace.

For the second part, DIY but here are some hints:
- We know that U [tex]\cap[/tex] U⊥ = {0}. Easy to check (if a vector is in U and perpendicular to U then it has to be the zero vector).
- Take x in Rn. Prove that x = u+u' for u in U and u' in U⊥.
- This is unique representation. If x = u+u' = v+v' with u,v in U and u',v' in U⊥ then 0 = (u-v)+(u'-v') implies u-v = v'-u' implies u-v = v'-u' = 0 since U [tex]\cap[/tex] U⊥ = {0}. Thus u=v and u'=v'.
- Thus projection map [tex]\pi[/tex]: Rn -->> U defined by [tex]\pi[/tex](x)=u where x = u+u' with u in U and u' in U⊥.
- Use Isomorphism theorem corollary (that dim(range)+dim(kernel)=dim(Rn)=n)


Hmm.. i think for part 2 i can explain by stating that dim(U+U⊥)=dim(U)+dim(U⊥)+dim(U[tex]\cap[/tex] U⊥)
Rn=dim(U)+dim(U⊥)
since dim(U[tex]\cap[/tex] U⊥) ought to be atleast {0} to satisfy the condition of subspace , and all the more they are orthogonal to one another , the can't be parallel , thus they have to be {0} itself.
Hence proving part 2.
 
Last edited:

Similar threads

  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
9K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
4K
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
7K
  • · Replies 14 ·
Replies
14
Views
3K