2000 character limit reached
Walker's cancellation theorem
Published 7 Oct 2015 in math.LO and math.GR | (1510.02137v1)
Abstract: Walker's cancellation theorem says that if B+Z is isomorphic to C+Z in the category of abelian groups, then B is isomorphic to C. We construct an example in a diagram category of abelian groups where the theorem fails. As a consequence, the original theorem does not have a constructive proof even if B and C are subgroups of the free abelian group on two generators. Both of these results contrast with a group whose endomorphism ring has stable range one, which allows a constructive proof of cancellation and also a proof in any diagram category.
Paper Prompts
Sign up for free to create and run prompts on this paper.