# How many possible factorizations are there for a square matrix, and how can we know?

Given a square matrix A, how many possible factorization CB=A is there, and how can this number be calculated? I understand that there are many ways of decomposing a matrix that yields matrix multiplications with special properties (e.g., A = LU, etc.), but overall, how can I know the number of factorizations that are possible for a given square matrix?

Put differently, is there an indefinite number of factorizations that are not necessarily relying on neat matrices (e.g., operations over identity matrices, inverse matrices, triangular, etc.) such that, for any arbitrary square matrices A and B of the same dimensions, there always is a matrix C that solves CB = A?

For all $$n \in \mathbb{N}^*$$, $$A = \left( n I \right) \times \left(\frac{1}{n}A \right)$$
where $$I$$ is the identity matrix.
• Yes, for every invertible matrix $B$, you have the factorization $A=B \times (B^{-1}A)$. – TheSilverDoe Mar 19 at 22:31