Fix $n \in \mathbb{N}$. A convex polyhedron $C$ in $\mathbb{R}^n$ is the convex hull of finitely many points with nonempty interior. For $H$ a supporting hyperplane, ie $C$ is contained in one of the two closed half-spaces bounded by $H$, we call $H \cap C$ a $j$-face of $C$, where $j$ is the affine dimension of $H \cap C$. By convention, $\varnothing$ is called a $-1$-face of $C$ and $C$ an $n$-face of itself.

Define a function $F$ from the set of convex polyhedra to $\mathbb{R}^{n+2}$ by coordinates, so that $F(C) = (a^C_{-1}, ..., a^C_n)$, where $a^C_j$ is the number of $j$-faces of $C$ for $j=-1,...,n$. Let $W$ be the affine subspace of $\mathbb{R}^{n+2}$ generated by $\operatorname{im} F$.

It's clear that $a^C_{-1}=1$ and $a^C_n=1$. Euler's formula $\displaystyle \sum_{j=-1}^n (-1)^j a^C_j = 0$ (which may be more familiar as the Euler characteristic $V+E-F=2$ in the case of $n=3$) is a third affine relation between the $a^C_j$'s. Hence, $\operatorname{dim}W \le n-1$.

Is it always true for any n that $\operatorname{dim}W = n-1$? Put differently, for any $n$, are the three equations above the only affine relationships that must be satisfied by $a^C_j$'s for all convex polyhedra $C \subset \mathbb{R}^n$, or is there some $n$ in which there is another relation?

I seem to recall an affirmative answer to this, but I can't remember how it was solved or where I found it.