Face of face of a cone is a face. Proof?

  • Context: Graduate 
  • Thread starter Thread starter Silversonic
  • Start date Start date
  • Tags Tags
    Cone Proof
Click For Summary
SUMMARY

The discussion centers on proving that the face of a face of a convex polyhedral cone remains a face of that cone. Participants express confusion regarding the validity of a proof that claims \langle u, v \rangle \geq 0 implies \langle u, v \rangle = 0. The proof relies on the non-negativity of vectors v and w, where v is contained in \check{\sigma} and w in \sigma. The conclusion drawn is that both vectors must be zero if their sum is zero, reinforcing the properties of convex polyhedral cones.

PREREQUISITES
  • Understanding of convex polyhedral cones
  • Familiarity with inner product notation, specifically \langle u, v \rangle
  • Knowledge of the properties of non-negative vectors in \mathbb{R}_+
  • Ability to interpret mathematical proofs and notation
NEXT STEPS
  • Study the properties of convex sets and cones in linear algebra
  • Learn about the implications of inner product spaces in geometry
  • Research the significance of faces in convex polyhedra
  • Explore advanced topics in convex analysis and their applications
USEFUL FOR

Mathematicians, geometry enthusiasts, and students studying convex analysis or linear algebra who seek to deepen their understanding of convex polyhedral cones and their properties.

Silversonic
Messages
121
Reaction score
1
I could really do with some help. I'm trying to show that the face of a face of a convex polyhedral cone is again a face of that polyhedral cone. I have spent a couple hours thinking about this and CAN'T show it. The following apparently gives a proof of this, but it's surely invalid

http://img30.imageshack.us/img30/4752/vsqc.png

The bit I have underlined. I can see literally no reason why \langle u, v \rangle \geq 0 would mean that \langle u, v \rangle = 0. Can anyone help?
 
Last edited by a moderator:
Physics news on Phys.org
This text is really hard to read because some stuff doesn't render or is mis type-setted, and they flip the meaning of v and w in the proof of 3. I believe the claim is using that v is contained in \check{\sigma}.

We know that \left<v,w \right> is non-negative because v is in \check{sigma} and w is in \sigma. Furthermore, p is non-negativve and \left<u,w \right> is non-negative as well (for the same reason as \left<v,w\right>. So we are adding two non-negative things together and getting zero. The only way this can occur is if both non-negative things were zero to begin with.
 
I would also try to answer that, but why is p non negative? except for if R_{+} notation means positive reals... I interpreted it at first as the real numbers supplied by the action of summation.

in the 2nd (3) and 2nd - it confused me more about it
 
Chris, \mathbb{R}_+ does mean positive reals.
 
Thanks for the replies, yeah I noticed the text was quite hard to read but it was the only proof I could find after a long search on google.

I have actually figured it out (after harder searching) and did it before I saw this thread. I've attached in case anyone wants a look.

http://img202.imageshack.us/img202/4387/2x7r.png
 
Last edited by a moderator:

Similar threads

  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 17 ·
Replies
17
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K