Rings whose cyclics are C3-modules
Bibliographic record
Abstract
It is well known that if every cyclic right module over a ring is injective, then the ring is semisimple artinian. This classical theorem of Osofsky promoted a considerable interest in the rings whose cyclics satisfy a certain generalized injectivity condition, such as being quasi-injective, continuous, quasi-continuous, or [Formula: see text]. Here we carry out a study of the rings whose cyclic modules are [Formula: see text]-modules. The motivation is the observation that a ring [Formula: see text] is semisimple artinian if and only if every [Formula: see text] -generated right [Formula: see text]-module is a [Formula: see text]-module. Many basic properties are obtained for the rings whose cyclics are [Formula: see text]-modules, and some structure theorems are proved. For instance, it is proved that a semiperfect ring has all cyclics [Formula: see text]-modules if and only if it is a direct product of a semisimple artinian ring and finitely many local rings, and that a right self-injective regular ring has all cyclics [Formula: see text]-modules if and only if it is a direct product of a semisimple artinian ring, a strongly regular ring and a [Formula: see text] matrix ring over a strongly regular ring. Applications to the rings whose [Formula: see text]-generated modules are [Formula: see text] -modules, and the rings whose cyclics are ADS or quasi-continuous are addressed.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.012 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".