See all sketches...
Sketch 3
Strategies for Computations
Huh...
Right now it feels like I kind of suck at computing 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 sets (or modules or etc. etc. in enriched structures).
Date Started: February 29, 2024
Date Finished: Unfinished
My Ideas
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 . Many people would find this one to be quite simple: any homomorphism out of is completely determined by its value at one, since is generated by 1. In other words, if , then (here I'm implicitely utilizing the -module structure on since it is an abelian group). Notice that in general, if we have fixed the value of mapping out of a group on a subset in a consistent way, the values of are determined on the smallest subgroup of containing . This comes down to the classic idea on how I approach finding hom sets:
Claim. If is generated by for some indexing set , then any morphism out of is determined by its values on the generating set.
After we know this, we can look at the image. In the case of , we know that we simply have to determine the value of any homomorphism on , and we can see that can take any value in . Thus, . Similarly, we can see that and . So far so good. In fact, we can see that for any group , since for every element , we have a homomorphism mapping to , so that maps to . This is quite nice.
But things aren't as nice when we consider mapping into . Consider . Again, notice that the values of are determined on simply by choosing , namely . However, this becomes a problem because we need to map to a value such that . On the other hand, if we choose such that , there clearly does not exist an integer such that , that is, unless , in which case we have that for all , so is the zero map. As such, there is only one possible map, so . Notice that in this case there existed a larger subgroup of (the one generated by ) which was more restrictive than the one we initially picked (). From this there's one thing in particular that I would like to notice: is a superset of since is a subset of ; any homomorhism from to must also be a homomorphism when restricted to .
Here we can see a latice consisting of various subgroups of . There are of course many kinds, and some which are quite weird. For example, while many of these subgroups have a natural ring structure, 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 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 .
Proof Sketch.
Suppose for contradiction that there was a unique maximal element, . If for all prime and , then . Thus there must be some prime and such that is not in , so simply take the smallest subgroup contianing and . This subgroup still doesn't contain so it is not all of , but it is larger than , a contradiction.
To go back to another idea, maybe the maybe this idea that 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 for any , we have that . We might instead consider for and integers. This becomes a much more tedious problem. We can see that again on the integers, and , so we must have that is always "divisible" by for all , or that is invertible in . being invertible in would imply that divides some power of , so the primes dividing also divide . It is interesting to note that this condition is precisely that in . In this case, regardless of where we map , things work, so that .