The Upper and Lower bound Theorems in convex geometry deal, respectively, with the maximum and minimum number of facets that a convex d-dimensional polytope with n vertices can have. In this talk we will offer bounds for such numbers for what we refer to as the projective case of this problem.