In mathematics, Birkhoff factorization or Birkhoff decomposition, introduced by George David Birkhoff (1909), is a generalization of the LU decomposition (i.e. Gauss elimination) to loop groups.
The factorization of an invertible matrix
with coefficients that are Laurent polynomials in
is given by a product
has entries that are polynomials in
{\displaystyle M^{0}=\mathrm {diag} (z^{k_{1}},z^{k_{2}},...,z^{k_{n}})}
is diagonal with
has entries that are polynomials in
For a generic matrix we have
Birkhoff factorization implies the Birkhoff–Grothendieck theorem of Grothendieck (1957) that vector bundles over the projective line are sums of line bundles.
There are several variations where the general linear group is replaced by some other reductive algebraic group, due to Alexander Grothendieck (1957).
Birkhoff factorization follows from the Bruhat decomposition for affine Kac–Moody groups (or loop groups), and conversely the Bruhat decomposition for the affine general linear group follows from Birkhoff factorization together with the Bruhat decomposition for the ordinary general linear group.
There is an effective algorithm to compute the Birkhoff factorization.
We present the algorithm for matrices with determinant 1, i.e.
We follow the book by Clancey-Gohberg [1], where also the general case can be found.
First step: Replace
Second step: Permute the rows and factor out the highest possible power of
in each row, while staying in
The permutation has to ensure that the highest powers of
Third step: Perform row operations such that at least one row becomes zero modulo
Repeat the second and third step until the determinant is 1 again.
Then gathering all matrices and dividing by
Note that as long as the determinant of the matrix is not 1 again, the determinant is zero modulo
, hence the rows are linearly dependent modulo
Therefore the third step can be carried out.
The first step is done by replacing
{\displaystyle zM}
Repeating step 2 gives : Therefore
This article about matrices is a stub.
You can help Wikipedia by expanding it.