Stanley's Reciprocity Theorem¶
A reciprocity identity turning a rational cone's lattice-point generating function under variable inversion into the signed generating function of its relative interior.
Core Idea¶
Stanley's reciprocity theorem packages inclusion–exclusion across a cone's faces into one generating-function identity. The enumerator of all lattice points and that of interior lattice points become transforms of one another after variables are inverted.
The relative dimension supplies the sign, and relative interior is essential for cones not spanning the ambient space. Rationality, lattice, lineality/pointedness, and formal-versus-analytic interpretation determine the precise statement.
Scope of Application¶
- Enumerative combinatorics. Counts lattice points by monomials.
- Polyhedral geometry. Uses cones and faces.
- Ehrhart theory. Derives strict-versus-weak counts.
- Commutative algebra. Interprets Hilbert-series reciprocity.
Clarity¶
State cone generators/inequalities, lattice, span and dimension, pointedness/lineality convention, multivariate monomials, relative interior, rational-function identity, inversion convention, and sign. Inclusion test: Require a rational cone, lattice, relative dimension, pointed/formal-series conditions, and the exact interior-versus-closure generating functions. Exclusion test: Exclude Ehrhart reciprocity stated without cone homogenization, arbitrary power-series substitution outside a valid formal/rational interpretation, and ordinary interior used for lower-dimensional cones. Nearest boundary: Ehrhart reciprocity for polytopes follows through cone constructions; Stanley reciprocity is the cone generating-function identity itself. Exit condition: The formula is unsupported when lineality makes the series ill-defined under the chosen convention or the wrong dimension/interior is used. Common misclassifications: It is not merely Ehrhart reciprocity. It does not use ambient interior indiscriminately. Variable inversion is a monomial operation. The dimension in the sign must be declared. Nearest named distinctions: Ehrhart reciprocity: Counts dilates of a polytope. Combinatorial reciprocity: Is the broader family. Fourier inversion: Is unrelated despite inversion language. Cone duality: Maps cones rather than generating-function variables.
Manages Complexity¶
The theorem converts geometric boundary removal into algebraic inversion, linking face structure, parity, and rational enumeration.
Abstract Reasoning¶
- Specify cone and lattice.
- Form the closed-cone enumerator.
- Identify relative interior and dimension.
- Interpret the rational function under inversion.
- Apply the sign and verify conventions on examples.
Knowledge Transfer¶
The identity transfers only under compatible lattice, dimension, monomial, interior, and lineality conventions; a coordinate change must preserve integrality.
Relationships to Other Abstractions¶
Current abstraction Stanley's Reciprocity Theorem Domain-specific
Parents (1) — more general patterns this builds on
-
Stanley's Reciprocity Theorem presupposes Duality Prime
Stanley's Reciprocity Theorem presupposes Duality because the theorem's reciprocity identity pairs a cone's generating function with the signed generating function of its relative interior.
Hierarchy path (1) — routes to 1 parentless root
- Stanley's Reciprocity Theorem → Duality
Neighborhood in Abstraction Space¶
Stanley's Reciprocity Theorem sits in a moderately populated region (47th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Algebraic Varieties & Topological Invariants (27 abstractions)
Nearest neighbors
- Algebraic Surface — 0.88
- Newton polytope — 0.87
- Digon — 0.87
- Secant Variety — 0.86
- Prism graph — 0.86
Computed from structural-signature embeddings · 2026-10-08