The generalised Jacobson-Morosov theorem / Peter O'Sullivan.
| Author/creator | O'Sullivan, Peter, 1951- |
| Format | Electronic |
| Publication Info | Providence, R.I. : American Mathematical Society, |
| Description | vii, 120 p. ; 25 cm. |
| Supplemental Content | Full text available from Memoirs of the American Mathematical Society - Backfile |
| Supplemental Content | Full text available from Ebook Central - Academic Complete |
| Subjects |
| Series | Memoirs of the American Mathematical Society, 0065-9266 ; no. 973 |
| Contents | Affine group schemes over a field of characteristic zero -- Universal and minimal reductive homomorphisms -- Groups with action of a proreductive group -- Families of minimal reductive homomorphisms. |
| Abstract | "The author considers homomorphisms H to K from an affine group scheme H over a field k of characteristic zero to a proreductive group K. Using a general categorical splitting theorem, Andr©Øe and Kahn proved that for every H there exists such a homomorphism which is universal up to conjugacy. The author gives a purely group-theoretic proof of this result. The classical Jacobson-Morosov theorem is the particular case where H is the additive group over k. As well as universal homomorphisms, the author considers more generally homomorphisms H to K which are minimal, in the sense that H to K factors through no proper proreductive subgroup of K. For fixed H, it is shown that the minimal H to K with K reductive are parametrised by a scheme locally of finite type over k."--Publisher's description. |
| General note | "Volume 207, number 973 (third of 5 numbers)." |
| Bibliography note | Includes bibliographical references and index. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| LCCN | 2010022758 |
| ISBN | 9780821848951 (pbk. : alk. paper) |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | ✔ Available |