See all sketches...

Sketch 3

Strategies for Hom Computations


Huh...

Right now it feels like I kind of suck at computing Hom between two sets. We've had a few problems like this on our problem sets for algebra, and my go to methods have always been what I think is naive and not super fun: just looking at what elements could map where and figuring out what restrictions there might be on the maps. In this sketch I want to explore the usage of exact sequences, tensor products, and category theory for discovering Hom sets (or modules or etc. etc. in enriched structures).

Date Started: February 29, 2024
Date Finished: Unfinished

My Ideas

Grp

I'll start with the category of groups. I'll start with some simple examples, which I have even previously computed in previous sketches. Suppose we would like to compute Hom(Z,Z). Many people would find this one to be quite simple: any homomorphism out of Z is completely determined by its value at one, since Z is generated by 1. In other words, if φHom(Z,Z), then φ(k)=kφ(1) (here I'm implicitely utilizing the Z-module structure on Z since it is an abelian group). Notice that in general, if we have fixed the value of φ mapping out of a group G on a subset SG in a consistent way, the values of φ are determined on the smallest subgroup of G containing S. This comes down to the classic idea on how I approach finding hom sets:

Claim. If G is generated by {gααS} for some indexing set S, then any morphism out of G is determined by its values on the generating set.

After we know this, we can look at the image. In the case of Hom(Z,Z), we know that we simply have to determine the value of any homomorphism on 1, and we can see that 1 can take any value in Z. Thus, Hom(Z,Z)Z. Similarly, we can see that Hom(Z,Q)Q and Hom(Z,R)R. So far so good. In fact, we can see that for any group G, Hom(Z,G)G since for every element gG, we have a homomorphism mapping 1 to G, so that k maps to gk. This is quite nice.

But things aren't as nice when we consider mapping into Z. Consider φHom(Q,Z). Again, notice that the values of φ are determined on ZQ simply by choosing φ(1), namely φ(a)=aφ(1). However, this becomes a problem because we need to map φ(1n) to a value such that nφ(1n)=φ(1)Z. On the other hand, if we choose NZ such that N>φ(1), there clearly does not exist an integer such that Nφ(1N)=φ(1), that is, unless φ(1)=0, in which case we have that φ(1n)=0 for all n, so φ is the zero map. As such, there is only one possible map, so Hom(Q,Z)=0. Notice that in this case there existed a larger subgroup of Q (the one generated by 1N) which was more restrictive than the one we initially picked (Z). From this there's one thing in particular that I would like to notice: Hom(Z,Z) is a superset of Hom(Q,Z) since Z is a subset of Q; any homomorhism from Q to Z must also be a homomorphism when restricted to Z.

Here we can see a latice consisting of various subgroups of Q. There are of course many kinds, and some which are quite weird. For example, while many of these subgroups have a natural ring structure, 23 doesn't even have this structure on it. Also notice that every subgroup which is finitely generated is also principally generated (because of Bezout's Lemma), but there are subgroups like Z[12] which are not even finitely generated. There also isn't a unique maximal element in this poset of inclusions.

Claim. There is no unique maximal element in the lattice of subgroups of Q.

Proof Sketch.
Suppose for contradiction that there was a unique maximal element, HQ. If 1pkH for all p prime and kZ, then H=Q. Thus there must be some prime p and jZ such that 1pj is not in Q, so simply take the smallest subgroup contianing H and 1pj. This subgroup still doesn't contain 1pj+1 so it is not all of Q, but it is larger than H, a contradiction.

To go back to another idea, maybe the maybe this idea that Hom reverses inclusions in one component will end up motivating categorical limits or functoriality, I guess we'll have to see.

Notice that the same issue happens with Z[1p] for any p, we have that Hom(Z[1p],Z)=0. We might instead consider Hom(Z[1n],Z[1m]) for n and m integers. This becomes a much more tedious problem. We can see that ϕ(a)=aϕ(1) again on the integers, and nkϕ(1nk)=ϕ(1), so we must have that ϕ(1) is always "divisible" by nk for all k, or that n is invertible in Z[1m]. n being invertible in Z[1m] would imply that nk divides some power of m, so the primes dividing n also divide m. It is interesting to note that this condition is precisely that V(n)V(m) in Spec(Z). In this case, regardless of where we map ϕ(1), things work, so that Hom(Z[1n],Z[1m])=Z[1m].

CRing

Mod(A)