You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
If two groups and have finite presentations, has a finite presentation as well, by taking the disjoint union of the two finite representations and adding relations saying that generators of commute with those of . When can something like this be done in other algebraic theories?
More abstractly, under what conditions is a product of finitely presentable objects finitely presentable (where the abstract definition says that is f.p. if preserves filtered colimits)? In algebraic categories, any f.p. object can be written as a reflexive coequalizer of a diagram of free models, and as this is a shifted colimit, the product of two f.p. objects can be written as a reflexive coequalizer of a diagram of products of free models. So I guess the question reduces to: when is a product of free things finitely presentable?
I'm also interested in seeing counterexamples, i.e. two f.p. objects whose product is not.
It may be relevant that there is an intermediate step in what you described. If you just take the disjoint union of the presentations, then you get the free product , which is the coproduct in the category of groups.
I think that should be true very generally, so that a disjoint union of presentations gives the coproduct. The part that seems more specific to groups is that the product of two finitely generated things can be obtained from their coproduct by adding finitely many relations.
Martti Karvonen said:
I'm also interested in seeing counterexamples, i.e. two f.p. objects whose product is not.
I described a kind of trivial example of this kind at https://mathoverflow.net/a/307344: take an algebraic theory given by infinitely many constant symbols, and two copies of the initial algebra.
Another positive example is simplicial sets: the product of two simplices has a finite presentation by simplices.
Thanks for the counterexample. Is there one when the algebraic theory can be given by finitely many operations and axioms?
Semigroups give another easy counterexample: the free semigroup on one generator is but is not finitely generated: for any finite , consider the least such that is not in .
The example of semigroups seems to generalise like this: take a presentation of a theory and assign natural numbers to all functional symbols and constants of the theory. Extend this to a “valuation” on the set of terms by
Suppose that is compatible with the equations of the theory, i.e. the two sides of each equation have the same valuation, and the theory has at least one symbol of arity > 0 (which implies that is unbounded). Then the product of two free algebras on finite nonempty sets is not finitely generated.
In the case of semigroups, this comes from assigning, say, 1 to the multiplication (which is compatible with the associativity axiom).
This covers e.g. all theories without equations and at least one (non-constant) operation...
And similarly, having any kind of neutral element in the axiomatization results in an obstruction for such a valuation, as the corresponding constants should get assigned 0 in order to respect the equations.