CatDat

simple-group probing functor

This functor maps a group GG to the collection F(G):=κHom(Lκ,G),F(G) := \textstyle\prod_{\kappa} \Hom(L_\kappa,G), where κ\kappa ranges over all infinite cardinals and LκL_\kappa is an infinite simple group of cardinality κ\kappa; we choose Lκ:=Altfin(κ)L_\kappa := \Alt_{\fin}(\kappa) to make things concrete. For each GG, the collection F(G)F(G) is isomorphic to a set, since for κ>card(G)\kappa > \card(G) every homomorphism LκGL_\kappa \to G is trivial. Thus, a more precise definition would be F(G):=κcard(G)Hom(Lκ,G),F(G) := \textstyle\prod_{\kappa \leq \card(G)} \Hom(L_\kappa,G), but the first definition makes it more apparent that FF is a functor. This is the canonical example of a continuous functor GrpSet\Grp \to \Set that is not representable, and not a right adjoint.

Satisfied Properties

Assigned properties

Deduced properties

Unsatisfied Properties

Assigned properties

Deduced properties*

*This also uses the deduced satisfied properties.

Unknown properties