-
Recent Posts
Tags
- Cayley-Hamilton Theorem
- characters
- Chinese remainder theorem
- Compression
- Diophantine approximation
- Dirichlet's theorem
- Dirichlet's approximation theorem
- Dirichlet's unit theorem
- Domino
- Dynamics
- eigenvalues
- Entropy
- Euclid
- Fourier transform
- gaussian integers
- Generic Matrix
- Geometry
- Geometry of numbers
- Homogeneous spaces
- Hyperbolic space
- isoperimetric inequality
- Klein group
- lattice
- Lattices
- Linearity testing
- mediant
- Minkowski's Theorem
- mobius
- Number Theory
- Peg Solitaire
- Pell's equations
- planar geometry
- poinare disk
- prime numbers
- Pythagoras
- radar
- random walk
- self similar sets
- shortest vector problem
- Sierpinski carpet
- Sierpinski triangle
- SL_2(Z)
- stochastic matrices
- Weak Law of Large Numbers
Archives
Monthly Archives: December 2013
The generic matrix and the Cayley–Hamilton theorem
Sometime during the first course in linear algebra we all learn the famous Cayley-Hamilton theorem which states the following: Theorem: Let be an matrix over a field , and denote by its characteristic polynomial. Then . The “easy” proof for … Continue reading
Ofir David 