ScalingStacks

Proof. [04R8]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Proof.

We may assume that our lattice polyhedron is a simplex, since otherwise we can triangulate it to smaller polyhedra. Fix one of its vertex and consider the (n+1)(n+1) integer vectors connecting it to other vertices. The volume of the simplex is equal to the determinant of the sublattice generated by these vectors divided by (n+1)!(n+1)!. ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.