Symbolic matrices and "integrity" of their inverse
I have to solve the following problem:
Does a matrix G∈GL(n,Z) exists such that G×A×G−1=B being A,B given matrices in Q?
Doing everything by hand, I finally find myself with a bunch of symbolic matrices. Now I have to check if they can lay inside GL(n,Z), i.e. if there are integer values for the variables in the matrix such that the matrix is integer, invertible and with integer inverse.
E.g.: (x00y) does the trick only for x=y=1.
Is there a quick method within Sage to solve that last problem?
Thanks!
An integer matrix is in GL(n,Z) (i.e., invertible with integer inverse) if and only if its determinant is 1 or -1 (from wikipedia: a square matrix over a commutative ring is invertible if and only if its determinant is a unit in that ring.) This might help you...
It does help me indeed, thanks! I should have known that... My main concern now is how to find out whether a polynomial equation (det=+/-1) has integer roots or not. "assume()" does not the trick :(
This is in general an undecidable question - see http://en.wikipedia.org/wiki/Hilbert%27s_tenth_problem. However, for specific cases you might be able to find a solution.
"Integrality" would be a better word than "integrity".
Thanks a lot for the comments, Parzan and Palmieri! What do you think about erasing the question? I don't think it is useful for anybody.