An almost full embedding of the category of graphs into the category of abelian groups
An almost full embedding of the category of graphs into the category of abelian groups
复制标题
图类别几乎完全嵌入到阿贝尔群类别中
DOI:
10.1016/j.aim.2014.02.027
复制
发表时间:
2011
期刊:
影响因子:
--
通讯作者:
A. Przeździecki
中科院分区:
文献类型:
--
作者:
A. Przeździecki
We construct an embedding G: G raphs→ A b of the category of graphs into the category of abelian groups such that for X and Y in G raphs we have Hom (G X, G Y)≅ Z [Hom G raphs (X, Y)], the free abelian group whose basis is the set Hom G raphs (X, Y). The isomorphism is functorial in X and Y. The existence of such an embedding implies that, contrary to a common belief, the category of abelian groups is as complex and comprehensive as any other concrete category. We use this embedding to settle an old problem of Isbell as of whether every full subcategory of the category of abelian groups, which is closed under limits, is reflective. A positive answer turns out to be equivalent to weak Vopěnka's principle, a large cardinal axiom which is not provable but believed to be consistent with standard set theory. We obtain some consequences to the Hovey–Palmieri–Strickland problem about existence of arbitrary localizations in a stable homotopy category. Several known constructions in the category of abelian groups are obtained as quick applications of the embedding.