On the number of generators of an algebra over a commutative ring
Uriya A. First, Zinovy Reichstein, Ben Willams

TL;DR
This paper investigates the minimal number of generators needed for algebraic structures over rings, extending classical bounds and revealing that these bounds are often not tight, especially for Azumaya algebras, using geometric classifying space methods.
Contribution
It establishes new bounds on generators for algebra forms over rings with finite transcendence degree, showing classical bounds are often not optimal for many algebra types.
Findings
Classical Forster bounds are not tight for most algebra forms.
New bounds are derived for algebras over rings with finite transcendence degree.
Results are especially detailed for Azumaya algebras.
Abstract
A theorem of O. Forster says that if is a noetherian ring of Krull dimension , then any projective -module of rank can be generated by elements. S. Chase and R. Swan subsequently showed that this bound is sharp: there exist examples that cannot be generated by fewer than elements. We view projective -modules as -forms of the non-unital -algebra where the product of any two elements is . 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 \'etale algebras. In this paper, we prove new upper and lower bound on the number of generators of an -form of a -algebra, where is an infinite field and has finite transcendence degree over . In particular, we show that,…
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
TopicsRings, Modules, and Algebras · Commutative Algebra and Its Applications · Algebraic structures and combinatorial models
