Prove the W is the orthogonal complement of its orthogonal complement

  • Thread starter Thread starter chipotleaway
  • Start date Start date
  • Tags Tags
    Orthogonal
Click For Summary
SUMMARY

The discussion centers on proving that the orthogonal complement of the orthogonal complement of a subspace W in R^n is W itself, expressed mathematically as (W^{\perp})^{\perp} = W. Participants analyze the properties of orthogonal complements, emphasizing that all vectors in W are also in (W^{\perp})^{\perp}. A critical point raised is the necessity of showing that (W^{\perp})^{\perp} cannot contain vectors outside of W, which leads to a contradiction if such vectors exist. The proof requires the assumption that W is closed, as noted in Erwin Kreyszig's "Introduction to Functional Analysis".

PREREQUISITES
  • Understanding of vector spaces and subspaces in R^n
  • Familiarity with the concept of orthogonal complements
  • Knowledge of properties of linear transformations
  • Basic principles of functional analysis
NEXT STEPS
  • Study the properties of orthogonal complements in linear algebra
  • Review Erwin Kreyszig's "Introduction to Functional Analysis" for detailed proofs
  • Explore the implications of closed subspaces in R^n
  • Learn about the relationship between orthogonal complements and linear independence
USEFUL FOR

Students of linear algebra, mathematicians focusing on functional analysis, and educators teaching vector space concepts will benefit from this discussion.

chipotleaway
Messages
174
Reaction score
0

Homework Statement


Let W be a subspace of R^n. Show that the orthogonal complement of the orthogonal complement of W is W.

i.e. Show that [itex](W^{\perp})^{\perp}=W[/itex]

The Attempt at a Solution


This is one of those 'obvious' properties that probably has a really simple proof but which continues to elude me. Here's my latest, rather ugly attempt. I still feel like I've overlooked something, if not, I think it definitely could be refined.

If [itex]W^{\perp}[/itex] is the orthogonal complement of [itex]W[/itex], then [itex]w.u=0, \forall w\in W, \forall u \in W^{\perp}[/itex].
Similarly, [itex]x.u=0, \forall u\in W^{\perp}[/itex] and [itex]\forall x\in (W^{\perp})^{\perp}[/itex].
All vectors [itex]w \in W[/itex] must also be in [itex](W^{\perp})^{\perp}[/itex] since [itex]W[/itex] consists of only vectors to perpendicular to those in [itex]W^{\perp}[/itex]. Now we need to show that [itex](W^{\perp})^{\perp}[/itex] cannot contain anything not in [itex]W[/itex]. Suppose there is a vector [itex]x' \in (W^{\perp})^{\perp}[/itex] but not in [itex]W[/itex]. Then [itex]x'.u=0[/itex], but it must also have some property that prevents it from being in [itex]W[/itex], namely [itex]x'[/itex] would also have to be orthogonal to [itex]W[/itex] (if not, then it must be in [itex]W[/itex]). But this would imply it is in [itex]W^{\perp}[/itex] and contradict the property [itex]W^{\perp} \cap (W^{\perp})^{\perp}=0[/itex]
 
Physics news on Phys.org
chipotleaway said:

Homework Statement


Let W be a subspace of R^n. Show that the orthogonal complement of the orthogonal complement of W is W.

i.e. Show that [itex](W^{\perp})^{\perp}=W[/itex]

The Attempt at a Solution


This is one of those 'obvious' properties that probably has a really simple proof but which continues to elude me. Here's my latest, rather ugly attempt. I still feel like I've overlooked something, if not, I think it definitely could be refined.

If [itex]W^{\perp}[/itex] is the orthogonal complement of [itex]W[/itex], then [itex]w.u=0, \forall w\in W, \forall u \in W^{\perp}[/itex].
Similarly, [itex]x.u=0, \forall u\in W^{\perp}[/itex] and [itex]\forall x\in (W^{\perp})^{\perp}[/itex].
All vectors [itex]w \in W[/itex] must also be in [itex](W^{\perp})^{\perp}[/itex] since [itex]W[/itex] consists of only vectors to perpendicular to those in [itex]W^{\perp}[/itex].
Is it okay to simply assert that or should you explicitly show it? One way to show equality of two sets A and B is to show that A is a subset of B and B is a subset of A, which is essentially what you seem to be doing. But if you can simply make the claim you did, can't you do the same thing with the two sets swapped and be finished?

Now we need to show that [itex](W^{\perp})^{\perp}[/itex] cannot contain anything not in [itex]W[/itex]. Suppose there is a vector [itex]x' \in (W^{\perp})^{\perp}[/itex] but not in [itex]W[/itex]. Then [itex]x'.u=0[/itex], but it must also have some property that prevents it from being in [itex]W[/itex], namely [itex]x'[/itex] would also have to be orthogonal to [itex]W[/itex] (if not, then it must be in [itex]W[/itex]). But this would imply it is in [itex]W^{\perp}[/itex] and contradict the property [itex]W^{\perp} \cap (W^{\perp})^{\perp}=0[/itex]
 
  • Like
Likes   Reactions: 1 person
You have neglected the fact that your claim is true only when W is closed. You can check Erwin Kreyszig - Introduction to Functional analysis.. pg 149, lemma 3.3-6 for a standard proof.
<Mod note: deleted personal information -- email address>
 
Last edited by a moderator:

Similar threads

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