Quadratic and cubic invariants of unipotent affine automorphisms

Abstract

Let K be an arbitrary field of characteristic zero, Pn:= K[ x1, ..., xn] be a polynomial algebra, and Pn, x1:= K[x1-1, x1, ..., xn], for n≥ 2. Let ' ∈ AutK(Pn) be given by x1 x1-1, x1 x2+x1, ... , xn xn+xn-1. It is proved that the algebra of invariants, Fn':= Pn', is a polynomial algebra in n-1 variables which is generated by [n2] quadratic and [n-12] cubic (free) generators that are given explicitly. Let ∈ AutK(Pn) be given by % ∈ AutK(Pn): x1 x1, x1 x2+x1, ... , xn xn+xn-1. It is well-known that the algebra of invariants, Fn:= Pn, is finitely generated (Theorem of Weitzenb\"ock, Weitz, 1932), has transcendence degree n-1, and that one can give an explicit transcendence basis in which the elements have degrees 1, 2, 3, ..., n-1. However, it is an old open problem to find explicit generators for Fn. We find an explicit vector space basis for the quadratic invariants, and prove that the algebra of invariants Pn, x1 is a polynomial algebra over K[x1, x1-1] in n-2 variables which is generated by [n-12] quadratic and [n-22] cubic (free) generators that are given explicitly. The coefficients of these quadratic and cubic invariants throw light on the `unpredictable combinatorics' of invariants of affine automorphisms and of SL2-invariants.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…