  This paper examines the feasible region of a standard conic program
represented as the intersection of a closed convex cone and a set of linear
equalities. It is recently shown that when Slater constraint qualification
(strict feasibility) fails for the classes of linear and semidefinite programs,
two key properties emerge within the feasible region; (a) every point in the
feasible region is degenerate; (b) the constraint system inherits implicit
redundancies. In this paper we show that degeneracy and implicit redundancies
are inherent and universal traits of all conic programs in the absence of
strict feasibility.
