Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Projective module
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Projective modules over a polynomial ring == The [[Quillen–Suslin theorem]], which solves Serre's problem, is another [[deep result]]: if ''K'' is a field, or more generally a [[principal ideal domain]], and {{nowrap|1=''R'' = ''K''[''X''<sub>1</sub>,...,''X''<sub>''n''</sub>]}} is a [[polynomial ring]] over ''K'', then every projective module over ''R'' is free. This problem was first raised by Serre with ''K'' a field (and the modules being finitely generated). [[Hyman Bass|Bass]] settled it for non-finitely generated modules,<ref>{{cite journal|title=Big projective modules are free|last=Bass|first=Hyman|journal=[[Illinois Journal of Mathematics]]|volume=7|number=1|year=1963|publisher=Duke University Press|doi=10.1215/ijm/1255637479|at=Corollary 4.5|doi-access=free}}</ref> and [[Dan Quillen|Quillen]] and [[Andrei Suslin|Suslin]] independently and simultaneously treated the case of finitely generated modules. Since every projective module over a principal ideal domain is free, one might ask this question: if ''R'' is a commutative ring such that every (finitely generated) projective ''R''-module is free, then is every (finitely generated) projective ''R''[''X'']-module free? The answer is ''no''. A [[counterexample]] occurs with ''R'' equal to the local ring of the curve {{nowrap|1=''y''<sup>2</sup> = ''x''<sup>3</sup>}} at the origin. Thus the Quillen–Suslin theorem could never be proved by a simple [[mathematical induction|induction]] on the number of variables.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)