1
$\begingroup$

Let $A \mapsto S$ and $B \mapsto S$ be two schemes over the scheme $S$. Is there a connection between the automorphism group of the scheme $A \otimes_{S} B$ and the automorphism groups of $A$ and $B$ ? What about special cases such as:

  1. the case where $A$ and $B$ are affine schemes over $\mathrm{Spec}(k)$ with $k$ a field, or

  2. specific examples which behave good/bad ?

$\endgroup$
3
$\begingroup$

Let me work over $\operatorname{Spec}(k)$ just to show that even that case is hard. There is a map $\operatorname{Aut}(A) \times \operatorname{Aut}(B) \to \operatorname{Aut}(A \times B)$. I doubt one can say much more than this without knowing something about the specific geometry of $A$ and $B$. For example, if $A = B = E$ is an elliptic curve, then $\operatorname{Aut}(A \times B)$ is much larger than either $\operatorname{Aut}(A)$ or $\operatorname{Aut}(B)$, since there's an action of $\operatorname{GL}_2(\mathbb Z)$.

I'd expect that something similar can happen with other $S$, for example, if you have two surfaces elliptically fibered over $\mathbb P^1$, and take the fiber product, in general $\operatorname{Aut}(A \times_S B)$ (either over $S$ or just over $k$) can probably increase in size, but saying exactly what it is probably pretty delicate in general.

Things are better if you know something about the geometry. For example, if there is no nonconstant map $A \to B$, then any automorphism of $A \times B$ has to permute the fibers of $A \times B \to B$. If $\operatorname{Aut}(A)$ is a discrete group, this means that the map from the first paragraph should be an isomorphism.

$\endgroup$
  • 1
    $\begingroup$ Oops, I see you are interested in the affine case. There things are probably even worse: $\operatorname{Aut}(\mathbb A^2)$ is a complicated beast, much bigger than $\operatorname{Aut}(\mathbb A^1) \times \operatorname{Aut}(\mathbb A^1)$. $\endgroup$ – user47305 Dec 6 '17 at 15:25
  • $\begingroup$ @ Mark: Great answer ! About your map $\mathrm{Aut}(A) \times \mathrm{Aut}(B) \mapsto \mathrm{Aut}(A \times B)$: I guess it is injective (= the latter contains an isomorphic copy of the first) ? $\endgroup$ – THC Dec 6 '17 at 17:58

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.