3
$\begingroup$

There are many different types of decomposition theorem in linear algebra. For example, there are primary decomposition theorem, cyclic decomposition theorem, etc. But I became curious about the history of the decomposition theorem itself and what the first decomposition theorem might have been. What was the decomposition theorem that first appeared, and what is the background or history of its appearance?

Primary decomposition theorem

Suppose that $m_T (x) = f_1(x)^{m_1}f_2(x)^{m_2} . . . f_k(x)^{m_k}$, where $f_1, f_2, . . . , f_k$ are distinct monic irreducible polynomials over $F$. Then $V = V_1 ⊕ V_2 ⊕ · · · ⊕ V_k$, where $V_1, V_2, . . . , V_k$ are $T$-invariant subspaces and the minimal polynomial of $T|V_i$ is $f_i^{m_i}$ for $1≤i≤k$.

Cyclic decomposition theorem

$T$ in $L(V,V)$, $V_n$-dim v.s. $W_0$ proper $T$-admissible subspace. Then there exist nonzero $a_1,…,a_r$ in $V$ and respective $T$-annihilators $p_1,…,p_r$ such that

(i) $V=W_0 ⊕Z(a_1;T) ⊕… ⊕Z(a_r;T)$

(ii) $p_k$ divides $p_{k-1}, k=2,..,r$.

Furthermore, $r, p_1,..,p_r$ uniquely determined by (i),(ii) and $a_i ≠0$. ($a_i$ are not nec. unique).

$\endgroup$
3
  • $\begingroup$ Could you state the theorem you are asking about? $\endgroup$ Commented Jul 6 at 15:10
  • $\begingroup$ @GeraldEdgar Hello, Thank you for your comment! I edited it! $\endgroup$ Commented Jul 6 at 21:25
  • $\begingroup$ You didn't start with... "Let $V$ be a vector space. Let $T$ be a linear transformation on $V$. Let $m_T(x)$ be ..." and so on $\endgroup$ Commented Jul 7 at 0:39

1 Answer 1

2
$\begingroup$

I do think this is a difficult question for a few reasons. What are we to accept as decomposition, because some of these ideas have been reconceptualized over time. Let me illustrate the difficulty by proposing one possible answer:

Daniel Bernoulli proposed that the solution of motion of a string under tension can be described as superposition of oscillations. Today we would say that this is a "Fourier decomposition" and it can indeed be thought of an eigen-decomposition over an infinite-dimensional vector space. But are we granting D. Bernoulli's work too much of a post-hoc lens with this example?

Many decomposition theorems in linear algebra developed throughout the 19th century (see Jordan normal form for example), but the examples that follow your modern notation and their deeper structural understanding with respect to algebraic classification is work of the early 20th century.

But if we think of decomposition more loosely, for example in terms of decomposing some whole into sub-pieces, then basic counting already provides examples (how many equal sized integers can a given integer be "decomposed" into? In this sense the historical roots of decompositions must be ancient.

$\endgroup$
3
  • $\begingroup$ I understood your answer. Thank you for writing a answer. $\endgroup$ Commented Jul 7 at 2:16
  • $\begingroup$ However, there is one sub-question related to the main question. As far as I know, the Jordan canonical form can be derived through the cyclic decomposition theorem. So is the cyclic decomposition form also a theory developed by Jordan and Weierstrass? $\endgroup$ Commented Jul 7 at 2:24
  • 1
    $\begingroup$ @user1274233 The notion of cyclic decomposition (apparently) has its roots in the prehistory to Galois theory, in the discovery of the role of permutations by Lagrange and subsequent work of Ruffini. Primary decomposition is due to Lasker (1905) and generalized by E. Noether (1921). Very useful sources are: Kleiner, I. (2007). A History of Abstract Algebra. Springer, and Alten, et al. (2008) 4000 Jahre Algebra: Geschichte. Kulturen. Menschen. Springer. (German) $\endgroup$
    – Georg Essl
    Commented Jul 7 at 10:32

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.