Frobenius normal form

Replace a square matrix over a field by the unique block diagonal matrix of companion matrices determined by its divisibility-ordered invariant factors, thereby deciding similarity without splitting the characteristic polynomial.

Version

v3 · 2026-09-19 · History

Domain-specific #

1891

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomains

Linear Algebra, Matrix Similarity and Module Structure → Mathematics

Core Idea

The Frobenius normal form, also called the invariant-factor rational canonical form, is the block diagonal matrix \(C(f_1)\oplus\cdots\oplus C(f_r)\) similar to \(A\), where the monic nonconstant invariant factors satisfy \(f_1\mid f_2\mid\cdots\mid f_r\). Regard the vector space as an \(F[x]\)-module with \(x\) acting by \(T\); the structure theorem over the principal ideal domain \(F[x]\) decomposes it into cyclic modules \(F[x]/(f_i)\), and each cyclic summand has companion matrix \(C(f_i)\)

How would you explain it like I'm…

The Official Block Picture

Sometimes two number machines look different but really do the same job, just described in a different way. To check, you rewrite each machine in one standard way, built from simple blocks lined up in a fixed order. If the standard versions match, the machines are really the same. That standard way is the Frobenius normal form.

Standard Matrix Fingerprint

A matrix is a grid of numbers that describes a way of moving and stretching space. If you change your point of view, the grid changes, but the movement is really the same; such matrices are called similar. The Frobenius normal form is a standard grid you can always turn a matrix into. It is made of square blocks along the diagonal, each built from a polynomial, and the polynomials go in an order where each one divides the next. Two matrices are similar exactly when they have the same Frobenius normal form.

Rational Canonical Form

Two square matrices A and B are similar if B = P⁻¹AP for some invertible P, meaning they represent the same linear map in different bases. The Frobenius normal form (rational canonical form) is a unique representative of each similarity class over a fixed field. It is a block-diagonal matrix of companion matrices C(f_1), …, C(f_r), where the f_i are monic polynomials called invariant factors and each divides the next. The block sizes add up to the matrix size. Unlike the Jordan form, it does not require factoring polynomials into roots, so it works over any field. It differs from the version built from elementary divisors, so the convention must be stated.

 

Given a linear map T on a finite-dimensional vector space V over a field F, regard V as an F[x]-module with x acting as T. Since F[x] is a principal ideal domain, the structure theorem decomposes V into cyclic modules F[x]/(f_1) ⊕ … ⊕ F[x]/(f_r), with monic nonconstant invariant factors f_1 | … | f_r. Each cyclic summand has companion matrix C(f_i), so A is similar to the block-diagonal matrix C(f_1) ⊕ … ⊕ C(f_r). That matrix is the Frobenius normal form. To compute it, find the invariant factors from the Smith form of xI − A, discard the unit factors, order the rest by divisibility, and check that the degrees sum to n. The minimal polynomial is f_r and the characteristic polynomial is the product of the f_i. Two matrices are similar over F exactly when their forms coincide. The elementary-divisor (primary) variant is a different convention and must be declared if used.

Scope of Application

Frobenius normal form applies when the analyst can specify a finite-dimensional vector space over a field \(F\), a linear endomorphism \(T\), and a matrix \(A\) representing \(T\) in a chosen basis and establish that the blocks are companion matrices of the uniquely determined invariant factors in divisibility order and their direct sum represents the same similarity class over the fixed field. The entry fixes the invariant-factor Frobenius form over a field; unrelated Frobenius forms for differential equations, algebras, and nonnegative matrices remain outside scope.

Clarity

A clear claim names the carrier, governing rule, assumptions, and recognition test. This matters because Frobenius normal form and rational canonical form are sometimes used for two related block conventions, while Frobenius form also names unrelated constructions. The disciplined statement is that the object counts as Frobenius normal form exactly when the blocks are companion matrices of the uniquely determined invariant factors in divisibility order and their direct sum represents the same similarity class over the fixed field

Manages Complexity

The abstraction compresses invariant-factor form, elementary-divisor primary form, matrices versus abstract operators, algorithmic Smith-form construction, and finite-field or rational-field computation into a stable carrier, rule, invariant, and failure boundary. It makes comparison tractable while retaining the variables that control validity.

Compression can hide assumptions. A responsible use therefore declares base field, matrix size, similarity relation, cyclic summands, invariant factors, companion convention, characteristic polynomial, minimal polynomial, factorization requirement, and field extension and returns to the full diagnostic whenever a convention or boundary case changes.

Abstract Reasoning

1. Type the carrier. Establish a finite-dimensional vector space over a field \(F\), a linear endomorphism \(T\), and a matrix \(A\) representing \(T\) in a chosen basis and reject examples from a different problem.
2. Lock the rule. Express that the blocks are companion matrices of the uniquely determined invariant factors in divisibility order and their direct sum represents the same similarity class over the fixed field independently of one notation or implementation.

Knowledge Transfer

Transfer within linear algebra is strong when new cases preserve the same carrier, mechanism, and diagnostic. The move from Over \(\mathbb Q\), the companion matrix \(C(x^2+1)=\begin{pmatrix}0&-1\\1&0\end{pmatrix}\) is already the Frobenius form of its similarity class because its sole invariant factor is \(x^2+1\). to If a four-dimensional operator has invariant factors \(f_1=x-1\) and \(f_2=(x-1)(x^2+1)\), its form is \(C(f_1)\oplus C(f_2)\); another matrix over the same field is similar exactly when it yields the same ordered factors. demonstrates that continuity.

Relationships to Other Abstractions

Current abstraction Frobenius normal form Domain-specific

Parents (1) — outgoing typed relations

• Frobenius normal form is a kind of Canonical Form Prime

  The construction supplies one distinguished matrix for every similarity equivalence class and makes two matrices similar exactly when their canonical representatives coincide.

Hierarchy path (1) — routes to 1 parentless root

• Frobenius normal form → is a kind of Canonical Form → presupposes Equivalence Relation

Neighborhood in Abstraction Space

Frobenius normal form sits in a crowded region of the domain-specific corpus (18^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Vector Spaces & Linear Structures (17 abstractions)

Nearest neighbors

• Linear group — 0.91
• Linear map — 0.91
• Triple system — 0.91
• Rational dependence — 0.90
• Dimension (vector space) — 0.90

Computed from structural-signature embeddings · 2026-10-25