Diagonalizable

Beklemishev et al. (1999)); the logic of explicit proofs (see Artëmov (2001)); applications of provability logic in proof theory (see Beklemishev bimodal provability logics with provability operators for different theories (see Beklemishev (1994, 1996)); and provability algebras, also called diagonalizable algebras or Magari algebras (see Shavrukov (1993, 1997)). ❋ L.C. (2003)

If the elements of the matrices are "disconnected", so that we can isolate certain sub-matrices sub-square, or sub-rectangles, in mathematical language, it is "block-diagonalizable". ❋ Sun Bin (2005)

Chapter 10: Spectral variation of diagonalizable matrices; ❋ Unknown (2009)

This constitutes a very nice way to get a diagonalizable mass matrix from the see-saw mechanism. ❋ Unknown (2009)

Such a mass matrix is called "form-diagonalizable" since it is diagonalized by the TBM matrix for all values of a, b, d. ❋ Unknown (2009)

King's answer: form dominance is a general framework for achieving form-diagonalizable elements starting from the see-saw mechanism. ❋ Unknown (2009)

For technical reasons, the matrix A must be diagonalizable. ❋ Unknown (2008)

If you encounter one of the unusual exceptions, I suggest checking to make sure that the matrix is diagonalizable. ❋ Unknown (2008)

"form dominance", a mechanism to achieve a form-diagonalizable effective neutrino mass matrix from the type-I see-saw. ❋ Unknown (2009)

-Yo, did you [review] Diagonalizability for our [Linear] [final]? - Diagowho? ❋ Selim5 (2018)