category of F(I)-sets

Notation F(I)−SetF(I){-}\Set Objects sets with an action of a free large group F(I)F(I) Morphisms maps that are compatible with the action Related M−SetM{-}\Set, Z−Set\IZ{-}\Set, SetI\Set^I

Here, II is a collection that is not essentially small, and its free group is constructed in the universe of collections (cf. Foundations). Objects can be identified with pairs (X,σ)(X,\sigma), where XX is a set and σ=(σi)i∈I\sigma = (\sigma_i)_{i \in I} is a large family of permutations of XX, and morphisms are maps of sets that commute with the permutations. This category behaves similarly to Z−Set\IZ{-}\Set (in particular, it is a cocomplete elementary topos), but the most important difference is that it has neither a generating collection nor a cogenerating collection.

Satisfied Properties

Assigned properties

Deduced properties

Unsatisfied Properties

Assigned properties

Deduced properties*

*This also uses the deduced satisfied properties.

Unknown properties

There is 1 property for which the database doesn't have an answer if it is satisfied or not. Please help to contribute the data!

Special objects

  • terminal object: singleton set with the unique action
  • initial object: empty set with the unique action
  • products: direct product with the obvious action
  • coproducts: disjoint union with the obvious action

Special morphisms

  • isomorphisms: bijective morphisms
  • monomorphisms: injective morphisms
  • epimorphisms: surjective morphisms
  • regular monomorphisms: same as monomorphisms
  • regular epimorphisms: same as epimorphisms

Comments

  • The category has appeared in MO/258269.
  • The category is well-defined in our Foundations. For instance, the collection of objects is ∏X∈Set∏i∈IAut⁡(X)\prod_{X \in \SetColl} \prod_{i \in I} \Aut(X), which is indeed a collection since collections are closed under the usual operations of set theory. Another explanation is that it is the functor category [B(F(I)),Set][B(F(I)),\Set], where B(F(I))B(F(I)) is the one-object category associated with F(I)F(I).
  • Surprisingly, the forgetful functor to Set\Set does not preserve large limits, hence is not representable, and therefore has no left adjoint. For i∈Ii \in I consider the object Xi=({0,1},σ[i])X_i = (\{0,1\},\sigma^{[i]}), where σi[i]=(0 1)\sigma^{[i]}_i = (0 ~ 1) and σj[i]=id⁡\sigma^{[i]}_j = \id for j≠ij \neq i. One can show that the product of the large family (Xi)i∈I(X_i)_{i \in I} exists in F(I)−SetF(I){-}\Set and is given by the empty set with the unique action. But the large family of underlying sets has no product in Set\Set.