An ``almost'' full embedding of the category of graphs into the category of groups (Q1959448)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An ``almost'' full embedding of the category of graphs into the category of groups |
scientific article |
Statements
An ``almost'' full embedding of the category of graphs into the category of groups (English)
0 references
7 October 2010
0 references
The author constructs a functor \(F:{\mathcal G}raph\to {\mathcal G}rp\) from the category of graphs to the category of groups. An \(m\)-graph is a category \(\Gamma\), whose objects form a disjoint union of a set of vertices (\(vert(\Gamma \))) and a set of edges (\(edg(\Gamma\))). One considers the edges as oriented by specifying its source and target. One of the main properties of this functor is the following Theorem: For all \(m\)-graphs \(\Gamma\) and \(\Delta\), the composition \[ \Hom_{m\text{-}{\mathcal G}raph}(\Gamma,\Delta)\cup\{ *\}\to \Hom_{{\mathcal G}rp}(F\Gamma,F\Delta)\to \text{Rep}(F\Gamma,F\Delta), \] where \(*\) is sent to the trivial homomorphism, is bijective. The above is functorial in \(\Gamma\) and \(\Delta\). The author also proves that \(F\) preserves directed colimits and countably codirected limits. Then, this is applied in following setup. Let \({\mathcal C}\) be a category. A morphism \(f:A\to B\) is orthogonal to an object \(C\) (\(f\perp C\)) if \(f\) induces a bijection \[ \Hom_{{\mathcal C}}(B,C)\to \Hom_{{\mathcal C}}(A,C). \] An orthogonal pair \(({\mathcal S},{\mathcal D})\) consists of a class of morphims \({\mathcal S}\) and a class of objects such that \({\mathcal S}^\perp={\mathcal D}\) and \({\mathcal D}^\perp={\mathcal S}\). A localization is a functor \(L:{\mathcal C}\to{\mathcal C}\) and a natural transformation \(\eta_{L}: \text{Id}\to L\) such that \(\eta_{LX}:LX\to LLX\) is an isomorphism for every \(X\) and \(\eta{LX}=L\eta_{X}\) for all \(X\). The author proves: Theorem: The following are equivalent Every othogonality class of graphs is a small-ortogonality class. Every ortogonality class in the homotopy category is a small-ortogonality class. The author also proves the following theorem: For any infinite cardinal \(\kappa\) there exists a localization \(L\) in the category of groups such that \(LM\) has cardinality \(\kappa\), where \(M\) detones the \(M_{23}\) simple Mathieu group.
0 references
category of groups
0 references
localization
0 references
large cardinals
0 references
orthogonality class of graphs
0 references
homotopy category
0 references