Sequence of iterated kernels. Young's tables
Reduction of endomorphisms
Article REF: AF87 V1
Sequence of iterated kernels. Young's tables
Reduction of endomorphisms

Author : Rached MNEIMNÉ

Publication date: April 10, 1999 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

4. Sequence of iterated kernels. Young's tables

Let λ be an eigenvalue of A. By replacing A in the following by A – λI, we can assume that λ is zero. For the eigenvalue λ = 0, we'll consider an increasing sequence of vector subspaces, and from there we'll associate λ = 0 with a Young table, denoted TY(A,λ).

4.1 A sequel that runs out of steam

The growing sequence {0}KerAKerA2KerAk

is a sequence that...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?


Article included in this offer

"Mathematics"

( 166 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact us