Frobenius normal form

Frobenius normal form

In linear algebra, the Frobenius normal form, Turner binormal projective form or rational canonical form of a square matrix "A" is a canonical form for matrices that reflects the structure of the minimal polynomial of "A" and provides a means of detecting whether another matrix "B" is similar to "A" without extending the base field "F".

Motivating example

The Frobenius normal form "M" of a matrix "A" is generally calculated by means of a similarity transformation. What this implies is that there is an invertible matrix "P" so "P"−1"AP" = "M". Since every matrix has a characteristic polynomial, then every matrix can be transformed by a similarity transformation to its Frobenius normal form.

For example, consider:

:A=egin{pmatrix}-2 & -1 & -2 & -1 & 1 & 0 \-2 & -1 & -2 & -1 & 1 & 1 \ 2 & 1 & 2 & 1 & 0 & 0 \ 2 & 1 & 0 & 1 & -3 & -1\ -2 & 0 & -2 & 0 & 0 & 0 \ 2 & -2 & 0 & 0 & 0 & 0 end{pmatrix}.

The characteristic polynomial of "A" is "x"6+6"x"4+12"x"2+8 = ("x"2 + 2)3 = "p"("x"). The minimal polynomial of this matrix is "x"2 + 2.

We will then have one block in the Frobenius normal form as :A_1 = egin{pmatrix}0 & -2 \1 & 0 end{pmatrix}.

The characteristic polynomial of "A"1 is indeed "x"2 +2.

Since "p" factors into solely terms of the form "x"2 + 2, we expect the other two blocks comprising the normal form of the matrix to be identical to "A"1. So, we can simply write down the Frobenius normal form:

:M = A_1 oplus A_2 oplus A_3 = egin{pmatrix} 0 & -2 & 0 & 0 & 0 & 0 \ 1 & 0 & 0 & 0 & 0 & 0 \ 0 & 0 & 0 & -2 & 0 & 0 \ 0 & 0 & 1 & 0 & 0 & 0 \ 0 & 0 & 0 & 0 & 0 & -2 \ 0 & 0 & 0 & 0 & 1 & 0 end{pmatrix}.The characteristic and minimal polynomials of "M" are the same as those of "A", which we would expect, since "M" can be obtained via a similarity transformation "P"−1"AP"="M", and determinants are similarity invariant. For this matrix "A", "P" is

:P = egin{pmatrix} 0 & 0 & 0 & 0 & 0 & -2 \ 0 & 0 & 0 & 1 & 0 & -2 \ -1/2 & 0 & 0 & 0 & 1 & 2 \ 1 & 1 & 0 & -1 & 0 & 0 \ 0 & 1 & 0 & 0 & 0 & -2 \ 0 & 0 & 1 & 0 & 0 & 0 end{pmatrix}.

General case and theory

Fix a base field "F" and consider a finite-dimensional vector space "V" over "F". Given a polynomial "p"("x") ∈ "F" ["x"] , there is associated to it a companion matrix "C" whose characteristic polynomial is "p"("x"). If the field "F" contains the eigenvalues of "C" ("i.e.", the roots of "p"("x")), then "p"("x") factors into linear factors over "F". In this case, one can show that there is a Jordan normal form for "C" which in some sense comes as close to diagonalizing "C" as possible. When the base field "F" does not contain the eigenvalues of "C", it is not possible to construct the Jordan normal form and another canonical form must be used. This is where the Frobenius normal form aids us. We recall the following

Theorem: Let "V" be a finite-dimensional vector space over a field "F", and "A" a square matrix over "F". Then "V" (viewed as an "F" ["x"] -module with the action of "x" given by "A" and extending by linearity) satisfies the "F" ["x"] -module isomorphism

:"V" ≅ "F" ["x"] /("a"1("x")) ⊕ … ⊕ "F" ["x"] /("a""n"("x"))

where the "a""i"("x") ∈ "F" ["x"] may be taken to be non-units, unique as monic polynomials, and can be arranged to satisfy the relation

:"a"1("x") | … | "a""n"("x")

where "a | b" is notation for "a" divides "b".

"Sketch of Proof": Apply the structure theorem for finitely generated modules over a principal ideal domain to "V", viewing it as an "F" ["x"] -module. Note that any free "F" ["x"] -module is infinite-dimensional over "F", so that the resulting direct sum decomposition has no free part since "V" is finite-dimensional. The uniqueness of the invariant factors requires a separate proof that they are determined up to units; then the monic condition ensures that they are uniquely determined. The proof of this latter part is omitted. See [DF] for details.

Given an arbitrary square matrix, the elementary divisors used in the construction of the Jordan normal form do not exist over "F" ["x"] , so the invariant factors "a""i"("x") as given above must be used instead. These correspond to factors of the minimal polynomial "m"("x") = "a""n"("x"), which (by the Cayley-Hamilton theorem) itself divides the characteristic polynomial "p"("x") and in fact has the same roots as "p"("x"), not counting multiplicities. Note in particular that the Theorem asserts that the invariant factors have coefficients in "F".

As each invariant factor "a""i"("x") is a polynomial in "F" ["x"] , we may associate a corresponding block matrix "C""i" which is the companion matrix to "a""i"("x"). In particular, each such "C""i" has its entries in the field "F".

Taking the matrix direct sum of these blocks over all the invariant factors yields the rational canonical form of "A". Where the minimal polynomial is identical to the characteristic polynomial, the Frobenius normal form is the companion matrix of the characteristic polynomial. As the rational canonical form is uniquely determined by the unique invariant factors associated to "A", and these invariant factors are independent of basis, it follows that two square matrices "A" and "B" are similar if and only if they have the same rational canonical form.

References

* [DF] David S. Dummit and Richard M. Foote. "Abstract Algebra". 2nd Edition, John Wiley & Sons. pp. 442, 446, 452-458. ISBN 0-471-36857-1.

External links

* [http://mathworld.wolfram.com/RationalCanonicalForm.html Rational Canonical Form (Mathworld)]

Algorithms

* [http://www-lmc.imag.fr/cathode2/Cirm/abstract/abs_storjohann/abs_storjohann.html An O("n"3) Algorithm for Frobenius Normal Form]
* [http://portal.acm.org/ft_gateway.cfm?id=281570&type=pdf An Algorithm for the Frobenius Normal Form (pdf)]
* [http://www.numbertheory.org/pdfs/canonical.pdf A rational canonical form Algorithm (pdf)]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Jordan normal form — In linear algebra, a Jordan normal form (often called Jordan canonical form)[1] of a linear operator on a finite dimensional vector space is an upper triangular matrix of a particular form called Jordan matrix, representing the operator on some… …   Wikipedia

  • Ferdinand Georg Frobenius — Infobox Scientist name = PAGENAME box width = image size =150px caption = PAGENAME birth date = October 26, 1849 birth place = Charlottenburg death date = August 3, 1917 death place = Berlin residence = citizenship = nationality = German… …   Wikipedia

  • Canonical form — Generally, in mathematics, a canonical form (often called normal form or standard form) of an object is a standard way of presenting that object. Canonical form can also mean a differential form that is defined in a natural (canonical) way; see… …   Wikipedia

  • Frobenius group — In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non trivial elementfixes more than one point and some non trivial element fixes a point. They are named after F. G. Frobenius. Structure The… …   Wikipedia

  • Normal matrix — A complex square matrix A is a normal matrix if where A* is the conjugate transpose of A. That is, a matrix is normal if it commutes with its conjugate transpose. If A is a real matrix, then A*=AT. Hence, the matrix is normal if ATA = AAT.… …   Wikipedia

  • Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… …   Wikipedia

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

  • Structure theorem for finitely generated modules over a principal ideal domain — In mathematics, in the field of abstract algebra, the structure theorem for finitely generated modules over a principal ideal domain is a generalization of the fundamental theorem of finitely generated abelian groups and roughly states that… …   Wikipedia

  • Matrix (mathematics) — Specific elements of a matrix are often denoted by a variable with two subscripts. For instance, a2,1 represents the element at the second row and first column of a matrix A. In mathematics, a matrix (plural matrices, or less commonly matrixes)… …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”