Faith's problem on R-projectivity is undecidable
Jan Trlifaj

TL;DR
This paper demonstrates that the question of whether right testing rings are necessarily right perfect is undecidable within ZFC, using consistency results and examples related to Faith's problem on R-projectivity.
Contribution
It proves the consistency of the existence of right testing rings that are not right perfect within ZFC, showing the problem's undecidability and providing examples for small modules.
Findings
The existence of right testing, non-right perfect rings is consistent with ZFC.
Faith's problem on R-projectivity is undecidable in ZFC.
Examples of non-right perfect rings where the Dual Baer Criterion holds for small modules.
Abstract
In \cite{F}, Faith asked for what rings does the Dual Baer Criterion hold in Mod-, that is, when does -projectivity imply projectivity for all right -modules? Such rings were called right testing. Sandomierski proved that if is right perfect, then is right testing. Puninski et al.\ \cite{AIPY} have recently shown for a number of non-right perfect rings that they are not right testing, and noticed that \cite{T2} proved consistency with ZFC of the statement {\lq}each right testing ring is right perfect{\rq} (the proof used Shelah's uniformization). Here, we prove the complementing consistency result: the existence of a right testing, but not right perfect ring is also consistent with ZFC (our proof uses Jensen-functions). Thus the answer to the Faith's question above is undecidable in ZFC. We also provide examples of non-right perfect rings such that the Dual…
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.
