01.01.16 · foundations / linear-algebra

Invariant subspaces and the primary decomposition

shipped3 tiersLean: none

Anchor (Master): Shilov *Linear Algebra* Ch. 6–7; Hoffman-Kunze *Linear Algebra* Ch. 6–7 (annihilating polynomials, primary decomposition, cyclic decomposition); Hoffman-Kunze §7.5 (the Jordan and rational forms); Lang *Algebra* Ch. XIV (modules over a PID and canonical forms); Jacobson *Basic Algebra I* Ch. 3

Intuition Beginner

A linear map moves the whole space around at once, and that can be hard to picture all together. The trick is to look for pieces of the space that the map keeps to themselves. A direction, a plane, or a larger slab is kept to itself by the map if every vector inside it lands back inside it. Such a piece is called an invariant subspace. Inside one, the map is its own self-contained transformation, and you can study it without watching what happens everywhere else.

Eigenvectors are the smallest example. An eigenvector sits on a line that the map only stretches, so the line is kept to itself. The bigger idea is that you can often slice the whole space into several such pieces that the map never mixes, and then the complicated map becomes a stack of simpler maps, one per piece. The matrix in matching coordinates falls into separate blocks along the diagonal, with empty corners, because no piece feeds into another.

The primary decomposition is the cleanest way to do this slicing. It groups directions by which eigenvalue, or which repeated-root factor, controls them. Each group is a slab the map keeps to itself, and the groups together fill the whole space. You break one hard problem into a handful of easy ones, each tied to a single eigenvalue.

Visual Beginner

The picture shows a space split into two slabs that a linear map never mixes. On the left, a transformation acts on all of three-dimensional space at once, arrows pointing every which way. On the right, the same space is drawn as a horizontal plane stacked with a vertical line through it; the map sends plane-vectors back into the plane and line-vectors back into the line, so the two pieces stay separate forever.

Two facts are visible. Because each slab is kept to itself, the matrix in coordinates adapted to the slabs has its non-zero entries gathered into square blocks on the diagonal, with zeros in the corners. And because the slabs together fill the whole space, studying the map on each slab separately tells you everything about the map.

Worked example Beginner

Take the three-by-three matrix

Step 1. Read off the eigenvalues from the diagonal of this upper-triangular matrix: and .

Step 2. Find the slab for the eigenvalue . Solve . The vector works, because . So the line through is kept to itself, and on it the map just multiplies by .

Step 3. Find the slab for the eigenvalue . Look at the second and third coordinates, where the active block is . The vectors and span a plane. Check it is kept to itself: stays in the plane, and stays in the plane. So this plane is a second slab.

Step 4. Confirm the two slabs fill the space and do not overlap. The line and the plane together span all three coordinates, and they share only the zero vector, so every vector splits uniquely into a line-part plus a plane-part.

Step 5. See the block structure. In the basis , the matrix is already block-diagonal: a one-by-one block holding , and a two-by-two block holding , with zeros in the corners.

What this tells us: the eigenvalue owns a one-dimensional slab and the eigenvalue owns a two-dimensional slab. The map never mixes them, so the single three-dimensional problem became one easy problem on a line plus one small problem on a plane.

Check your understanding Beginner

Formal definition Intermediate+

Let be a field, a finite-dimensional -vector space, and a linear operator in the sense of 01.01.05. The role of the spectral theorem 01.01.13 in this unit is as the orthogonal model case: when is normal on an inner-product space, the invariant decomposition below is the orthogonal eigenspace decomposition, and the present unit drops both the inner product and the diagonalisability hypothesis.

Definition (invariant subspace). A subspace is -invariant if , that is for every . The zero subspace and the whole space are -invariant for every . The kernel , the image , each eigenspace , and each generalised eigenspace are -invariant; for the generalised eigenspace, commutes with , so carries its kernel into itself.

Induced operators. If is -invariant, the restriction , , is a well-defined operator on . The operator also descends to the quotient : the induced operator , , is well-defined precisely because makes the rule independent of the coset representative.

Block-triangular and block-diagonal forms. Choose a basis of and extend to a basis of . Because , the matrix of in this basis is block upper-triangular,

with the matrix of the restriction, the matrix of the induced operator on the quotient, and recording how pushes the complementary directions back toward . If a complementary invariant subspace exists — a -invariant with — then choosing the inside forces , and the matrix is block-diagonal,

The existence of a complementary invariant subspace is the difference between a block-triangular reduction (always available from a single invariant subspace) and a block-diagonal splitting (which decouples the operator into independent pieces).

Definition (annihilating and minimal polynomial). The polynomials with form a non-zero ideal of ; its monic generator is the minimal polynomial of (developed in 01.01.11). Over , which is a principal ideal domain, factors uniquely as

with distinct monic irreducible polynomials and . The subspaces are the primary components of under . When contains all eigenvalues, each and the primary components are the generalised eigenspaces .

Notation: is the restriction of to an invariant subspace ; or is the induced operator on ; denotes an internal direct sum; ; for the stabilised index . The symbol denotes the monic greatest common divisor in , and two polynomials are coprime when their is .

Counterexamples to common slips

  • An invariant subspace need not have an invariant complement. On the operator keeps the horizontal line to itself, but no second -invariant line exists, since is the only invariant line. So admits a block-triangular form but no block-diagonal split.
  • The primary decomposition keys off the minimal polynomial, not the characteristic polynomial. Using in place of gives the same subspaces here because once reaches the stabilisation index, but the exponents in are the smallest that produce the full primary component.
  • "Each primary component is an eigenspace" fails whenever . The component is the generalised eigenspace; it equals the ordinary eigenspace only when contributes a square-free factor to .

Key theorem with proof Intermediate+

Theorem (primary decomposition; Hoffman-Kunze §6.8 [source pending]; Shilov Ch. 7 [source pending]). Let be a linear operator on a finite-dimensional -vector space with minimal polynomial , the distinct monic irreducibles. Set . Then

each is -invariant, the minimal polynomial of is exactly , and the projection along the other summands is a polynomial in .

Proof. For each put . The polynomials have no common irreducible factor: any irreducible dividing all of them would divide while being coprime to , yet is the only factor of absent from , so such a common divisor would have to be a unit. Hence . Because is a principal ideal domain, Bézout's identity supplies polynomials with

Evaluate at and define . Then , and each is a polynomial in , so the commute with and with one another.

The are projections onto the . For the product is divisible by , because between them and already carry every factor of to at least its full multiplicity (the factor appears in , the factor appears in , and every other appears in both). Thus , whence for . Multiplying by gives , so each is idempotent, and is the internal direct sum attached to a complete system of orthogonal idempotents.

It remains to identify with . If , then for the polynomial is divisible by , so and hence ; from this gives , so . Conversely, , and , so ; therefore , which puts . The two inclusions give , and the direct sum is .

Invariance and the induced minimal polynomial. Each is -invariant because commutes with and so preserves its kernel. Let be the minimal polynomial of . Since kills , we have , so with . The polynomial annihilates on every summand, hence on , so . Comparing with forces , so and .

Bridge. The primary decomposition builds toward the canonical-form theory of 01.01.11: once splits into the invariant pieces on which acts with minimal polynomial , classifying reduces to classifying a single operator whose minimal polynomial is a prime power, which is exactly the local problem the Jordan and rational forms solve. This is exactly the linear-algebra face of the Chinese remainder theorem: the coprime factorisation and the Bézout identity are the ring-level statement , read off on the -module . The foundational reason the projections are polynomials in is that they are the images of the idempotents of that product ring, so they commute with everything commutes with and require no choice of basis or inner product. The construction generalises the orthogonal eigenspace splitting of the spectral theorem 01.01.13 by replacing orthogonal projection with algebraic projection, and it appears again in 01.02.05 (the Jordan-Hölder and nilpotent theory) where the same coprime-idempotent mechanism organises a solvable or nilpotent action into its primary blocks. Putting these together, the primary decomposition is the field-agnostic, inner-product-free engine underneath every later canonical form.

Exercises Intermediate+

Lean formalization Intermediate+

Mathlib carries invariant submodules, generalised eigenspaces, and the spanning of generalised eigenspaces over an algebraically closed field, but the field-agnostic primary decomposition with polynomial projectors is not packaged as one named theorem. The readable view of the intended statements:

import Mathlib.LinearAlgebra.Eigenspace.Triangularizable
import Mathlib.RingTheory.Coprime.Basic
import Mathlib.FieldTheory.Minpoly.Field

variable {K V : Type*} [Field K] [AddCommGroup V] [Module K V]
  [FiniteDimensional K V] (f : Module.End K V)

/-- A subspace is f-invariant iff it is carried into itself.
Mathlib spelling: `p ≤ p.comap f`. -/
def IsInvariant (p : Submodule K V) : Prop := p ≤ p.comap f

/-- Primary decomposition: if `minpoly K f = ∏ pᵢ ^ eᵢ` with the `pᵢ`
distinct monic irreducibles, then `V = ⨆ i, ker (pᵢ f) ^ eᵢ` as an
internal direct sum, each summand f-invariant, each projection a
polynomial in f. NOT a single named Mathlib theorem. -/
theorem primary_decomposition
    {ι : Type*} [Fintype ι] (p : ι → Polynomial K) (e : ι → ℕ)
    (hirr : ∀ i, Irreducible (p i))
    (hdist : Function.Injective p)
    (hmin : minpoly K f = ∏ i, (p i) ^ (e i)) :
    DirectSum.IsInternal
      (fun i => LinearMap.ker (((p i) ^ (e i)).aeval f)) :=
  sorry  -- Bézout: ∑ gᵢ fᵢ = 1 with fᵢ = m / pᵢ^eᵢ; projectors Pᵢ = gᵢ(f) fᵢ(f)

The proof gap to a clean contribution: (i) form and obtain the Bézout identity from IsCoprime on the pairwise-coprime ; (ii) define and show , for , ; (iii) identify with LinearMap.ker ((p i ^ e i).aeval f) to package DirectSum.IsInternal. Each step is reachable from Mathlib's coprimeness and eigenspace machinery, but no current named lemma presents the primary decomposition with its polynomial projectors or derives the Jordan-Chevalley split as a corollary.

Advanced results Master

Theorem (generalised eigenspace decomposition over an algebraically closed field; Shilov Ch. 7 [source pending]). Let be algebraically closed and act on a finite-dimensional with distinct eigenvalues . Writing for the multiplicity of in ,

and equals the algebraic multiplicity of in the characteristic polynomial. This is the primary decomposition specialised to linear irreducible factors. The chain stabilises at index — the exponent in the minimal polynomial — and the stable space is the full generalised eigenspace . On each the operator is nilpotent, which is the entry point to the Jordan refinement of 01.01.11.

Theorem (Jordan-Chevalley decomposition). Over a perfect field with splitting into linear factors over , there is a unique pair of operators on with

and moreover and are polynomials in with zero constant term in the appropriate sense. Concretely, acts as the scalar on the generalised eigenspace , with the primary projection, and acts as on , hence nilpotent there. The semisimple part records the eigenvalue data and the nilpotent part records the failure of diagonalisability. Because is a polynomial in (each is), the splitting is intrinsic: no basis, no inner product, no diagonalising change of coordinates is chosen.

Theorem (cyclic / rational canonical refinement; Frobenius 1878 [source pending]; Hoffman-Kunze Ch. 7 [source pending]). Each primary component decomposes further as a direct sum of -cyclic subspaces , each isomorphic as a -module to for some , and on a cyclic subspace the matrix of is the companion matrix of . This is the structure theorem for the finitely generated torsion -module over the principal ideal domain . The invariant-factor form collects the cyclic pieces into a chain with and ; the elementary-divisor form lists the prime powers directly. Over an algebraically closed field the elementary divisors are and the companion matrices become Jordan blocks, recovering 01.01.11; over a general field the companion matrices stay, giving the rational canonical form valid without enlarging .

Theorem (module-theoretic reading). The data is the same as a finitely generated torsion module over , with acting as ; the primary decomposition is the decomposition of this module into its -primary components, and the cyclic refinement is the structure theorem for modules over a PID. The annihilator of the module is , its order ideal is , and the equivalence is the Chinese remainder isomorphism whose idempotents are the projections . This identification turns every canonical-form theorem of linear algebra into a special case of the classification of finitely generated modules over a principal ideal domain.

Synthesis. The single operative fact is that carries a -module structure with acting as , and the minimal polynomial is the annihilator of that module. The coprimeness of the prime-power factors, expressed through the Bézout identity , manufactures a complete system of commuting idempotents , and these idempotents are the primary projections; this is the Chinese remainder theorem realised on the module . From that one construction the entire canonical-form hierarchy unfolds: the primary decomposition is immediate, the Jordan-Chevalley split with a polynomial in is its scalar-versus-nilpotent reading, and the cyclic refinement of each primary component is the PID structure theorem that produces the rational canonical form over any field and the Jordan form over an algebraically closed one. Because the projections are polynomials in , every step is intrinsic and basis-free, which is why the decomposition survives the loss of an inner product that the spectral theorem 01.01.13 required: orthogonal projection is replaced by algebraic projection, diagonalisability is replaced by a nilpotent remainder, and the result holds over fields where eigenvectors may not even exist. The primary decomposition, the generalised eigenspace splitting, the Jordan-Chevalley decomposition, and the cyclic / rational canonical form are four readings of the single statement that a finitely generated torsion -module is the direct sum of its primary components.

Full proof set Master

Proposition (uniqueness of the Jordan-Chevalley decomposition). Let be a field over which splits into linear factors, and suppose are two decompositions with semisimple, nilpotent, , and . Then and .

Proof. From with commuting, both and commute with ; in fact, by the primary decomposition is a polynomial in , so and commute with every operator commuting with . In particular and commute with and , since and are themselves polynomials in by the same construction applied to the second decomposition.

Consider . The left side is a difference of two commuting semisimple operators, hence semisimple: commuting semisimple (diagonalisable) operators are simultaneously diagonalisable, and a difference of simultaneously diagonalisable operators is diagonalisable. The right side is a difference of two commuting nilpotent operators, hence nilpotent: if , , and , the binomial expansion of has every term containing or , so . An operator that is both semisimple and nilpotent has minimal polynomial both square-free and a power of , so its minimal polynomial is , forcing the operator to be . Therefore and .

Proposition (the primary projections are the unique idempotents that are polynomials in and project onto the components). Let be the primary decomposition of . The projections onto along are the unique operators that are simultaneously (a) polynomials in , (b) idempotent, (c) satisfy and for .

Proof. Existence is the key theorem: has all three properties. For uniqueness, suppose also satisfies (a)–(c). Both and act as the identity on and as on each with , since (c) forces this on each summand. Because , an operator is determined by its action on each summand, so as operators. The hypothesis that is a polynomial in is not even needed for this uniqueness, but it is what makes canonical: the projections attached to any -invariant direct-sum decomposition need not be polynomials in , whereas the primary projections always are, because they descend from the idempotents of .

Proposition (the induced operator on a quotient has minimal polynomial dividing ). Let be -invariant and the induced operator on . Then and , and when with also invariant, taking .

Proof. For any polynomial , . Taking gives for all , so on , whence . Likewise , so . When with both summands invariant, a polynomial annihilates iff it annihilates both and , because on the block-diagonal form; the smallest such monic is the least common multiple of and , and via the isomorphism . Hence .

Proposition (Cayley-Hamilton from the primary decomposition). With and over an algebraically closed field, for each , hence and .

Proof. On the generalised eigenspace the restriction has minimal polynomial by the key theorem, and its characteristic polynomial is because is its only eigenvalue. The index of nilpotency of is at most , since a nilpotent operator on a -dimensional space satisfies . Thus . Multiplying over , divides , and since on each component hence on , also . The primary decomposition thereby recovers the Cayley-Hamilton identity of 01.01.08 as a divisibility consequence rather than an independent computation.

Connections Master

The primary decomposition is the inner-product-free generalisation of the orthogonal eigenspace splitting of the spectral theorem 01.01.13. Where the spectral theorem requires a normal operator and produces orthogonal projections onto eigenspaces, the primary decomposition requires only a minimal polynomial and produces algebraic projections — polynomials in — onto generalised eigenspaces, dropping both normality and the inner product, and it remains valid over fields with no eigenvectors at all.

The cyclic refinement of each primary component is exactly the input to the Jordan and minimal-polynomial theory of 01.01.11: that unit takes a single operator with prime-power minimal polynomial and builds its Jordan chains, which is the per-component problem the primary decomposition isolates. The rational canonical form named there over a general field is the companion-matrix assembly of the same cyclic pieces.

The coprime-idempotent mechanism reappears in the group setting of 01.02.05 (solvable, nilpotent, and Jordan-Hölder structure): the primary decomposition of a single operator and the decomposition of a nilpotent or solvable linear action into characteristic blocks are two instances of the same use of commuting idempotents and stable filtrations to break a hard action into local pieces.

Historical & philosophical context Master

The classification of a single linear substitution by its canonical block form is due to Camille Jordan, whose 1870 Traité des substitutions et des équations algébriques gave the canonical form of a linear substitution first over finite fields, in the service of Galois theory, and then over the complex numbers [Jordan 1870]. The decomposition that underlies the block form — the splitting of the space according to the prime-power factors of an annihilating polynomial — was placed on its modern algebraic footing by Frobenius, whose 1878 memoir on linear substitutions and bilinear forms introduced the minimal polynomial, the invariant factors, and the rational canonical form, valid over an arbitrary field and not requiring the eigenvalues to lie in it [Frobenius 1878]. The recognition that all of this is the structure theory of finitely generated modules over the principal ideal domain , with the primary decomposition as the coprime-primary splitting and the canonical forms as the cyclic decomposition, is the ideal-theoretic viewpoint codified by Krull and the abstract-algebra tradition of the 1920s and 1930s [Krull 1935]. Shilov's Linear Algebra presents the invariant-subspace and canonical-form development in the concrete operator language used here, while Hoffman and Kunze give the primary decomposition theorem in the coprime-annihilator form whose proof this unit follows.

Bibliography Master

@book{Jordan1870,
  author    = {Jordan, Camille},
  title     = {Trait{\'e} des substitutions et des {\'e}quations alg{\'e}briques},
  publisher = {Gauthier-Villars},
  address   = {Paris},
  year      = {1870}
}

@article{Frobenius1878,
  author  = {Frobenius, Ferdinand Georg},
  title   = {{\"U}ber lineare Substitutionen und bilineare Formen},
  journal = {Journal f{\"u}r die reine und angewandte Mathematik},
  volume  = {84},
  year    = {1878},
  pages   = {1--63}
}

@book{Krull1935,
  author    = {Krull, Wolfgang},
  title     = {Idealtheorie},
  series    = {Ergebnisse der Mathematik und ihrer Grenzgebiete},
  publisher = {Springer},
  address   = {Berlin},
  year      = {1935}
}

@book{HoffmanKunze1971,
  author    = {Hoffman, Kenneth and Kunze, Ray},
  title     = {Linear Algebra},
  edition   = {2nd},
  publisher = {Prentice-Hall},
  address   = {Englewood Cliffs, NJ},
  year      = {1971}
}

@book{Shilov1977,
  author    = {Shilov, Georgi E.},
  title     = {Linear Algebra},
  publisher = {Dover Publications},
  address   = {New York},
  year      = {1977},
  note      = {Translation of the 1971 Russian edition, transl. R. A. Silverman}
}

@book{Jacobson1985,
  author    = {Jacobson, Nathan},
  title     = {Basic Algebra I},
  edition   = {2nd},
  publisher = {W. H. Freeman},
  address   = {New York},
  year      = {1985}
}

@book{Lang2002,
  author    = {Lang, Serge},
  title     = {Algebra},
  edition   = {3rd, revised},
  series    = {Graduate Texts in Mathematics},
  volume    = {211},
  publisher = {Springer},
  year      = {2002}
}