Timeline for Has the notion of a unipotent group scheme been studied?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30 at 12:35 | comment | added | Gabriel | Dear @anon, this is very close to what I wanted. If you are willing to write this as an answer, I would happily accept it | |
| Jun 28 at 18:08 | comment | added | anon | Searching for "unipotent group scheme" came up with dept.math.lsa.umich.edu/~idolga/izve74.pdf, which, together with the works it cites, contains lots of interesting material. | |
| Jun 14 at 21:32 | comment | added | anon19 | One approach is described in Definition 5.9 of arxiv.org/abs/2110.15041. | |
| Jun 13 at 21:06 | comment | added | YCor | In char $p$, a cyclic group of order $p$ defines a (reduced, smooth, non-connected) unipotent group scheme. | |
| Jun 13 at 19:30 | history | edited | Max Lonysa Muller | CC BY-SA 4.0 |
Fixed a typo
|
| Jun 13 at 17:28 | comment | added | LSpice | I think that the definition involving composition factors is not what you want (although of course you can study it—but note that, even over a field, it is only the right definition for smooth, connected group schemes). I suspect that the proper definition should be that these are linear groups (i.e., admitting a faithful representation) for which every representation admits a non-$0$ fixed vector. | |
| Jun 13 at 8:34 | history | asked | Gabriel | CC BY-SA 4.0 |