Borel complexity of modules
Michael C. Laskowski, Danielle S. Ulrich

TL;DR
This paper investigates the complexity of classifying countable modules over countable rings, showing a dichotomy where the classification problem is either very simple or as complex as possible (Borel complete).
Contribution
It establishes a dichotomy for the Borel complexity of countable modules over countable rings and provides new proofs of Borel completeness for related classes.
Findings
Class of countable R-modules is either countably many types or Borel complete.
Proves Borel completeness of torsion-free abelian groups (TFAB).
Shows classes of modules with endomorphisms or submodules are Borel complete.
Abstract
We prove that for a countable, commutative ring , the class of countable -modules either has only countably many isomorphism types, or else it is Borel complete. The machinery gives a succinct proof of the Borel completeness of TFAB, the class of torsion-free abelian groups. We also prove that for any countable ring , both the class of left -modules endowed with an endomorphism and the class of left -modules with four named submodules are Borel complete.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Rings, Modules, and Algebras · Advanced Topology and Set Theory
