I think the phrase "fppf scheme" in item 3 in the definition is misleading, since the fppf site used here is the big one, not the small one. (It suggests that w
| This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
| |||||||||||
I think the phrase "fppf scheme" in item 3 in the definition is misleading, since the fppf site used here is the big one, not the small one. (It suggests that we should restrict attention to schemes (over the base) satisfying the "fppf" property, but this is not the case.) — Preceding unsigned comment added by 5.13.18.163 (talk) 09:52, 6 August 2024 (UTC)
The final sentence in the motivation section is broken. —Preceding unsigned comment added by 129.240.21.51 (talk) 08:35, 2 February 2010 (UTC)
What even are these??? —Keenan Pepper 02:18, 16 November 2005 (UTC)
The article's title suggests that it covers stacks (i.e., fibred categories over a site (or a topos, or a topological space) for which "descent works"). However, the present article is essentially a stub for algebraic stacks, i.e., very particular types of stacks in groupoids that are suitably "covered" by algebraic spaces. Whereas stacks in general are a formalisation of a key concept in general descent theory, algberaic stacks (of the D-M and Artin types) are a generalisation of schemes. The two topics are in fact quite dissimilar in terms of questions considered and techniques used.
Thus, the article should be split into a new article on general stacks, and another one to cover algebraic stacks. For the general article a title like Stack (descent theory) would be better than Stack (category theory) as the framework for stacks includes also a Grothendieck topology and not only categories. Stca74 17:30, 3 September 2007 (UTC)
This section is a sketch of ways the article can be improved
Defining morphisms of algebraic stacks and giving some examples. This could include
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.