Polytope

A polytope is a geometric object with flat sides, existing in any finite number of dimensions: a polygon in two dimensions, a polyhedron in three, and a generalization to higher dimensions whose combinatorial structure is described by its face lattice. In matching theory, the Gale-Ryser theorem and related results reveal that the set of feasible matchings can be represented as the vertices of a polytope — the matching polytope — whose edges encode the structural constraints that make stability computable. This connection between discrete optimization and continuous geometry is one of the deepest insights in combinatorial mathematics: a problem that appears to be about combinatorial search is actually about navigating a geometric space. The polytope is the skeleton beneath the surface.

The matching polytope is not a representation of a problem; it is the problem. The field that treats discrete and continuous mathematics as separate disciplines has not yet recognized that polytopes are the universal language of structural constraint.