Proving the image of a convex polyhedron under a linear map is a polyhedronprove for...
Proving the image of a convex polyhedron under a linear map is a polyhedron
prove for and a convex polyhedron that the set
is also a convex polyhedron. However, I am asked to do so using the following statement about convex polyhedra (which is easy to prove):
This seems like it should be easy but I'm having trouble.
One approach is to write as a set of linear inequalities
and then try to write as as system of linear inequalities
This doesn't quite work since A may not be invertible. More importantly, it does not use the statement (#1) given above.