Example 7.10 . [02XA]
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
Example 7.10.
In case is a simplex, its aggregates in a given direction are some of its faces and the corresponding coefficients can be made explicit. Indeed, they satisfy the linear system
This system has as many unknowns as equations and might be solved using Cramer’s rule. These coefficients admit the closed formula below, which the reader might check using the recurrence relation (7.9):
| (7.11) |
where the products are over the vertices of not lying in and the sum is over the tuples of non negative integers of length , indexed by those same vertices of that are not in , that is, and . In case is a vertex of , the above formula reduces to
| (7.12) |
Suppose that the simplex is presented as the intersection of halfspaces as for some and . Up to a reordering, we can assume that is normal to the unique face of not containing and that . Then the above coefficient can be alternatively written as
| (7.13) |