### Motivational example

Consider a polyhedral graph $G$. A realization of $G$ is given by a convex polyhedron which is - essentially - characterized by the angles between the edges emanating from each vertex. There are $\sum_v d(v) = 2E$ such angles, so the degree of freedom $\mathsf{d}$ of a polyhedron is $\mathsf{d}\leq 2E$ (with $E$ the number of edges). But the angles cannot be choosen freely: for every (flat) face of the polyhedron the interior angle sum must obey a (strict) equality. Thus, $\mathsf{d}\leq 2E - F$ (with $F$ the number of faces). Because the polyhedron is supposed to be convex there is another restriction: for every vertex $v$ of the polyhedron the sum of angles between the edges emanating from $v$ has to be less than $2\pi$. Thus, we have $V$ additional restricting inequalities (with $V$ the number of vertices). But because inequalities are somehow "weaker" than equalities we cannot simply deduce that

$$\mathsf{d}\leq 2E - F - V = E - \chi = E - 2$$

(with $\chi$ the Euler characteristic of the graph/polyhedron). But by which amount $\mathsf{d}$ might be greater than $E-2$?

### Question

The original question is (more abstractly) concerned with the question how **inequalities** enter into the calculation of a "degree of freedom":

How can an (eventually non-integer) degree of freedom be defined when inequalities are involved?