Constant group scheme
Definition
Suppose is a group and is a scheme which is the final object in a category of schemes that admits fiber products. The constant group scheme of over , denoted , can intuitively be thought of as a scheme that stores a copy of for each element of , and operates on these copies as if they were the corresponding elements of .
Explicitly, the scheme is a disjoint union of copies of indexed by elements of , and the operations are as follows:
| Operation | How it's defined |
|---|---|
| multiplication or product | First, note that is a disjoint union of copies of indexed by . We consider the usual multiplication and define the morphism as exhibiting the same behavior on the corresponding copies of . That this is a morphism follows from the constraints on . |
| identity element | This is the map from to that sends it to the copy of indexed by the identity element of . |
| inverse map | This sends the copy of indexed by to the copy indexed by , and does so for each . |