Martin Rubey wrote: > I tried to demonstrate Cayley Hamilton in Sage, but failed. Here is what I > tries: >
Alternatively, you could do everything in polynomial rings: sage: R.<x1,x2,x3,x4>=QQ[] sage: m=matrix(R, 2, [x1,x2,x3,x4]) sage: m [x1 x2] [x3 x4] sage: m.charpoly() x^2 + (-x1 - x4)*x - x2*x3 + x1*x4 sage: f=m.charpoly() sage: f(m) [0 0] [0 0] Jason --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
