The computation of invariant fields and a constructive version of a theorem by Rosenlicht (Q2468659)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The computation of invariant fields and a constructive version of a theorem by Rosenlicht |
scientific article |
Statements
The computation of invariant fields and a constructive version of a theorem by Rosenlicht (English)
0 references
25 January 2008
0 references
Let \(G\) be an algebraic group. In Section 1 an action of \(G\) on a field \(K\) fixing a subfield \(k\) over which \(K\) is finitely generated is considered. In this situation the author studies the so called Derksen ideal and shows that the coefficients of all polynomials in a monic reduced Gröbner basis of the Derksen ideal generate the invariant field \(K^G\). An algorithm is presented which tests a rational function for invariance and represents it in terms of the generators of \(K^G\). In Section 2 the question of how the Derksen ideal can be computed is addressed. In this section the author considers the situation where \(G\) rationally acts on an irreducible algebraic variety \(X\) and presents an algorithm for computing the Derksen ideal. In Section 3 an action of a linear algebraic group \(G\) on an affine variety \(X\) is considered and an algorithm is given that computes a nonempty open invariant subset \(U\) of \(X\) such that all \(G\)-orbits in \(U\) are separated by rational invariants defined on \(U\).
0 references
algebraic group action
0 references
invariant field
0 references