KnowraDiagonalizationLinked fromLinked fromThe 13 pages that link to Diagonalization, each with the reason it gives.All 13Related 10Narrower topic 1Compared with 2EigenvalueRelated: A full eigenvector basis makes the transformation act by independent eigenvalue scalings.Computability theoryRelated: It underlies proofs that some computable functions and decision procedures cannot exist.Jordan normal formCompared with: Diagonalization is simpler but fails when the matrix lacks enough eigenvectors.Linear operatorRelated: A diagonal form reduces the operator's action to independent coordinate scalings.Matrix exponentialRelated: For diagonalizable matrices, exponentiation reduces to exponentiating eigenvalues.EigenvectorRelated: A basis of eigenvectors makes the transformation's action diagonal.Universal Turing machineRelated: Diagonal arguments establish limits on what universal computation can decide.Cantor's diagonal argumentNarrower topic: Cantor’s proof is a foundational example of this general method.Square matrixRelated: It simplifies powers and functions of a square matrix when enough independent eigenvectors exist.Cayley–Hamilton theoremCompared with: The theorem holds even for matrices that cannot be diagonalized.Diagonal matrixRelated: Changing basis can expose a diagonal matrix that makes the original transformation easier to analyze.Blum's speedup theoremRelated: The speedup proof builds a function that defeats successive candidate programs.Rasiowa–Sikorski lemmaRelated: The proof meets the first dense set, then the second, continuing through the whole list.