Bounded section of pointed cone

Dependencies:

  1. Polyhedral set and polyhedral cone
  2. Rank of a matrix
  3. Condition for polyhedral cone to be pointed
  4. Rank of a homogenous system of linear equations
  5. Direction of a convex set and Recession cone
  6. Polyhedron is unbounded iff it has direction
  7. Recession cone of a polyhedron

Let $C \defeq \{x \in \mathbb{R}^n: (a_i^Tx \ge 0, \forall i \in I) \textrm{ and } (a_i^Tx = 0, \forall i \in E)\}$ be a pointed cone. Let $A$ be the matrix whose rows are $\{a_i: i \in I \cup E\}$. Then $\rank(A) = n$.

Let $K \subseteq I \cup E$ and let $B$ be the matrix having rows $\{a_i: i \in K\}$ such that $\rank(B) = n$. Let $b \defeq \sum_{i \in I \cup E} \lambda_ia_i$, where $\lambda_i > 0$ for $i \in K$. Let $\gamma > 0$ and let $P = \{x \in C: b^Tx = \gamma\}$. Then $P$ is bounded and $b^Tx > 0$ for any $x \in C - \{0\}$. Hence, $\forall x \in C - \{0\}$, $(\gamma/b^Tx)x \in P$.

Proof

Let $\xhat \in C - \{0\}$.

Lemma 1: $\exists i \in K$ such that $a_i^T\xhat > 0$.

Proof: Suppose $a_i^T\xhat = 0$ for all $i \in K$. Then $B\xhat = 0$. Hence, $\xhat = 0$ since $\rank(B) = n$, which is a contradiction. Hence, $\exists i \in K$ such that $a_i^T\xhat > 0$. □

Lemma 2: $b^T\xhat > 0$ and $(\gamma/b^T\xhat)\xhat \in P$.

Proof: Suppose $a_k^T\xhat > 0$, where $k \in K$ (by Lemma 1). Then $b^T\xhat = \sum_{i \in I \cup E} \lambda_i a_i^T\xhat \ge \lambda_k a_k^T\xhat > 0$. Let $\gamma/b^T\xhat)$. Then $\mu > 0$, so $\mu\xhat \in C$. $b^T(\mu\xhat) = \gamma$, so $\mu\xhat \in P$. □

Lemma 3: $P$ is bounded.

Proof: Suppose $P$ is not bounded. Then $P$ has a non-zero direction $d$. Hence, $d \in C-\{0\}$ and $b^Td = 0$. Since $d \in C$, we get $Bd \ge 0$. So, $a_i^Td \ge 0$ for $i \in K$. Since $0 = b^Td = \sum_{i \in I \cup E} \lambda_i(a_i^Td) \ge \sum_{i \in K} \lambda_i(a_i^Td) \ge 0$ and $\lambda_i > 0$ for $i \in K$, we get that $a_i^Td = 0$ for all $i \in K$. Hence, $Bd = 0$. But since $\rank(B) = n$, this means $d = 0$, which is a contradiction. □

Dependency for:

  1. Representing point in pointed polyhedral cone

Info:

Transitive dependencies:

  1. /linear-algebra/vector-spaces/condition-for-subspace
  2. /linear-algebra/matrices/gauss-jordan-algo
  3. /sets-and-relations/equivalence-relation
  4. Group
  5. Ring
  6. Polynomial
  7. Integral Domain
  8. Comparing coefficients of a polynomial with disjoint variables
  9. Field
  10. Vector Space
  11. Linear independence
  12. Span
  13. Semiring
  14. Matrix
  15. Stacking
  16. System of linear equations
  17. Product of stacked matrices
  18. Matrix multiplication is associative
  19. Reduced Row Echelon Form (RREF)
  20. Matrices over a field form a vector space
  21. Row space
  22. Elementary row operation
  23. Every elementary row operation has a unique inverse
  24. Row equivalence of matrices
  25. Row equivalent matrices have the same row space
  26. RREF is unique
  27. Identity matrix
  28. Inverse of a matrix
  29. Inverse of product
  30. Elementary row operation is matrix pre-multiplication
  31. Row equivalence matrix
  32. Equations with row equivalent matrices have the same solution set
  33. Rank of a matrix
  34. Basis of a vector space
  35. Linearly independent set is not bigger than a span
  36. Homogeneous linear equations with more variables than equations
  37. Rank of a homogenous system of linear equations
  38. Cone
  39. Convex combination and convex hull
  40. Transitivity of convexity
  41. Convex set
  42. Polyhedral set and polyhedral cone
  43. Basic feasible solutions
  44. Condition for existence of BFS in a polyhedron
  45. Point in polytope is convex combination of BFS
  46. Convex hull of a finite number of points in Euclidean space is bounded
  47. Extreme point of a convex set
  48. Condition for a point to be extreme
  49. Condition for polyhedral cone to be pointed
  50. Direction of a convex set and Recession cone
  51. Recession cone of a polyhedron
  52. Polyhedron is unbounded iff it has direction