On the number of generators of an algebra over a commutative ring
Bibliographic record
Abstract
A theorem of O. Forster says that if R R is a noetherian ring of Krull dimension d d , then every projective R R -module of rank n n can be generated by d + n d+n elements. S. Chase and R. Swan subsequently showed that this bound is sharp: there exist examples that cannot be generated by fewer than d + n d+n elements. We view rank- n n projective R R -modules as R R -forms of the non-unital R R -algebra R n R^n where the product of any two elements is 0 0 . The first two authors generalized Forster’s theorem to forms of other algebras (not necessarily commutative, associative or unital); A. Shukla and the third author then showed that this generalized Forster bound is optimal for finite étale algebras. In this paper, we prove new upper and lower bounds on the number of generators of an R R -form of a k k -algebra, where k k is an infinite field and R R is a finitely generated k k -ring of Krull dimension d d . In particular, we show that, contrary to expectations, for most types of algeb
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.003 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.006 |
| Scholarly communication | 0.005 | 0.013 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.012 | 0.003 |
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".