A combinatorial category [Pultr (1973, Def. 1.7)] $C$ is a locally finite category satisfying the unnatural isomorphism property:
Or equivalently
Let $C$ be a combinatorial category and let $A, B, X \in \C$. If $A \times X \cong B \times X$ and $X$ is weakly terminal, then $A \cong B$.
For all $Y \in C$, we have
Hence we may divide both sides by $\left|C(Y, X)\right|$ (which is nonzero since $X$ is weakly terminal) and so $\left|C(Y, A)\right| = \left|C(Y, B)\right|$ for all $Y \in \C$, from which we have $A \cong B$.
not related is the notion of combinatorial model category
Věra Trnková, Unnatural isomorphisms of products in a category, Category Theory: Applications to Algebra, Logic and Topology Proceedings of the International Conference Held at Gummersbach, July 6–10, 1981. Berlin, Heidelberg: Springer Berlin Heidelberg.
A. Pultr, Isomorphism types of objects in categories determined by numbers of morphisms, Acta Scientiarum Mathematicarum 35 (1973) 155-160 [pdf]
Ehsan Momtahan, Afshin Amini, and Babak Amini, From $Hom (A, X) \cong Hom(B, X)$ to $A \cong B$, Filomat 32.11 (2018): 4079-4087.
Luca Reggio?, Polyadic sets and homomorphism counting, Advances in Mathematics 410 (2022): 108712.
Shoma Fujino and Makoto Matsumoto, Lovász’s hom-counting theorem by inclusion-exclusion principle, arXiv:2206.01994 (2022).
Last revised on May 7, 2024 at 21:28:24. See the history of this page for a list of all contributions to it.