Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Suppose $\Gamma$ is a finitely generated subgroup of $SL(n,\mathbb{Z})$, given as a list of generators. We would like to (somewhat efficiently) try to compute the Zariski closure of $\Gamma$, which is a (real) algebraic group. The method should be computer assisted but rigorous.

In the cases we are considering, $\Gamma$ will usually be Zariski dense in $SL(n,\mathbb{R})$, so the algorithm we are looking for should be optimized for that case. Also we would like just to know the answer, so having the program run forever if $\Gamma$ is not Zariski dense in $SL(n,\mathbb{R})$ is fine for us: we will just analyze that example further.

We can probably come up with some ad-hoc method for doing this, but I was wondering if anyone on MO has some interesting ideas or references.

share|improve this question
1  
The tag I added is probably more appropriate here than 'lie-groups' (where the Zariski topology is not the usual one). Also, I'm not sure in what ambient algebraic group it's most natural to take the Zariski closure, though in characteristic 0 the older language of Chevalley or Hochschild might allow you to work primarily over $\mathbb{R}$. –  Jim Humphreys Oct 14 at 13:19

4 Answers 4

If you expect the subgroup to be Zariski-dense, there is a simple algorithm which works most of the time: compute the modular projection modulo a set of $m.$ If the projection is onto for any $m > 3,$ the subgroup is Zariski dense (This is a theorem of T. Weigel -- I think there is a weaker version due to Alex Lubotzky: Lubotzky, Alexander(IL-HEBR) One for almost all: generation of SL(n,p) by subsets of SL(n,Z). Algebra, K-theory, groups, and education (New York, 1997), 125–128, Contemp. Math., 243, Amer. Math. Soc., Providence, RI, 1999. 20G30 ). To check that the modular projection is onto is not trivial, and really depends on where you get your groups. In many cases you can use Zalesskii-Serezhkn's characterization (if the generators are transvection), or something like Chris Hall's theorem should work for $SL(n)$ (Hall, Chris(1-MI) Big symplectic or orthogonal monodromy modulo l. (English summary) Duke Math. J. 141 (2008), no. 1, 179–203. -- he treats the symplectic case, but the SL case should not be harder, there you just need irreducibility and the normalizer to contain a transvection). In general, there is the Neumann-Praeger algorithm to see if a set of matrices generate $SL(n, p)$ -- there may be better algorithms implemented in Magma (for Neumann-Praeger, see the paper by these authors).

share|improve this answer

An algorithm which computes the Zariski closure of a finitely generated matrix group is available in H. Derksen, E. Jeandel, P. Koiran `Quantum automata and algebraic groups', Journal of Symbolic Computation 39 (2005) 357–37.

Note that there are some inaccuracies in the paper (e.g. the statement of Theorem 11).

share|improve this answer

In fact, the last word on this is my recent paper; but the punchline is that the subgroup is Zariski-dense if and only if there are two non-commuting elements, such that the Galois group of the characteristic polynomial of one of them is the full symmetric group.

share|improve this answer
    
this seems to give a criterion for Zarski density in SL(n), whereas the OP seems to ask for a procedure to compute the Zariski closure of any f.g. subgroup of $SL(n,Z)$. –  Venkataramana Oct 15 at 2:10
    
@Venkataramana I did not read the question carefully (two years ago :)) Obviously, constructing the Zariski closure is a much harder question. –  Igor Rivin Oct 15 at 13:43
    
I liked your paper! It is just that I did not immediately see this dealt with arbitrary Zariski closure case. Now you assure that this does not. –  Venkataramana Oct 15 at 15:26

This is going to be too long for a comment but not really an "answer". Suppose for example that the Zariski closure is connected and that $\Gamma$ is torsion free (this can be achieved by passing to a finite index subgroup of the finitely generated group $\Gamma$, but I do not know how to do it algorithmically). Given a generator $\theta $ of infinite order, take the Zariski closure $C(\theta)$ of the group generated by $\theta$; this is an abelian infinite Zariski closed subgroup and hence determines an element $X$ in the Lie algebra. You can take the smallest module in the Lie algebra generated by conjugates of $X$ by elements $w$ of $\Gamma$; since you are dealing with a finite dimensional space, you need only look at finitely many words $w$ in the generators. This gives the Lie algebra of the Zariski closure, and the corresponding Lie group should be the Zariski closure.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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