403/503 – The fundamental theorem of algebra via linear algebra

The argument we gave in class for the existence of eigenvectors for operators on finite dimensional complex vector spaces (and for the existence of invariant planes for operators on finite dimensional real vector spaces) uses the fundamental theorem of algebra. One can actually prove the existence of eigenvectors without appealing to this result, although the argument is more complicated.

As a corollary, one obtains a linear algebra proof of the fundamental theorem of algebra, which seems like a nice outcome.

The details can be found in a nice paper by Harm Derksen, currently available through his website or in JSTOR (American Mathematical Monthly, Vol. 110 (7) (2003), 620-623). A variation of the proof (perhaps more accessible) is in this paper by Keith Conrad, currently available through his website.

There is a slight disadvantage to both papers (which is perhaps the reason why I am not presenting their result in class) if we want to follow the approach of the textbook, and avoid introducing determinants at this stage. The problem is Corollary 4 in Conrad’s paper or Lemma 4 in Derksen’s, that operators on odd dimensional real vector spaces admit eigenvectors. Their proofs use determinants. The proof we gave (or are in the midst of giving) in lecture avoids determinants, but of course uses the fundamental theorem (so we can find an invariant plane and then argue by induction).

Can you find a way of obtaining this result without appealing to either determinants or the fundamental theorem, so we have a proof of the existence of eigenvectors compatible with the philosophy of the textbook and entirely self-contained?

(Note that an odd degree polynomial with real coefficients has a real root, and this can be proved very easily. From this, the argument for operators on does not require the fundamental theorem, and we can extend this to operators on , again avoiding the theorem, because we have explicit formulas that allow us to factor a quartic into the product of two quadratics. Can we find an argument for operators on ?)

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Friday, February 26th, 2010 at 3:01 pm and is filed under 403/503: Linear Algebra II. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

I thought about this question a while ago, while teaching a topics course. Since one can easily check that $${}|{\mathbb R}|=|{\mathcal P}({\mathbb N})|$$ by a direct construction that does not involve diagonalization, the question can be restated as: Is there a proof of Cantor's theorem that ${}|X|

First of all, note (as Monroe does in his question) that if $\mathbb P,\mathbb Q$ are ccc, then $\mathbb P\times\mathbb Q$ is $\mathfrak c^+$-cc, as an immediate consequence of the Erdős-Rado theorem $(2^{\aleph_0})^+\to(\aleph_1)^2_2$. (This is to say, if $\mathbb P$ and $\mathbb Q$ do not admit uncountable antichains, then any antichain in their product ha […]

The technique of almost disjoint forcing was introduced in MR0289291 (44 #6482). Jensen, R. B.; Solovay, R. M. Some applications of almost disjoint sets. In Mathematical Logic and Foundations of Set Theory (Proc. Internat. Colloq., Jerusalem, 1968), pp. 84–104, North-Holland, Amsterdam, 1970. Fix an almost disjoint family $X=(x_\alpha:\alpha

At the moment most of those decisions come from me, at least for computer science papers (those with a 68 class as primary). The practice of having proceedings and final versions of papers is not exclusive to computer science, but this is where it is most common. I've found more often than not that the journal version is significantly different from the […]

The answer is no in general. For instance, by what is essentially an argument of Sierpiński, if $(X,\Sigma,\nu)$ is a $\sigma$-finite continuous measure space, then no non-null subset of $X$ admits a $\nu\times\nu$-measurable well-ordering. The proof is almost verbatim the one here. It is consistent (assuming large cardinals) that there is an extension of Le […]

R. Solovay proved that the provably $\mathbf\Delta^1_2$ sets are Lebesgue measurable (and have the property of Baire). A set $A$ is provably $\mathbf\Delta^1_2$ iff there is a real $a$, a $\Sigma^1_2$ formula $\phi(x,y)$ and a $\Pi^1_2$ formula $\psi(x,y)$ such that $$A=\{t\mid \phi(t,a)\}=\{t\mid\psi(t,a)\},$$ and $\mathsf{ZFC}$ proves that $\phi$ and $\psi […]

A notion now considered standard of primitive recursive set function is introduced in MR0281602 (43 #7317). Jensen, Ronald B.; Karp, Carol. Primitive recursive set functions. In 1971 Axiomatic Set Thoory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967) pp. 143–176 Amer. Math. Soc., Providence, R.I. The concept is use […]

The power of a set is its cardinality. (As opposed to its power set, which is something else.) As you noticed in the comments, Kurepa trees are supposed to have countable levels, although just saying that a tree has size and height $\omega_1$ is not enough to conclude this, so the definition you quoted is incomplete as stated. Usually the convention is that […]

The key problem in the absence of the axiom of replacement is that there may be well-ordered sets $S$ that are too large in the sense that they are longer than any ordinal. In that case, the collection of ordinals isomorphic to an initial segment of $S$ would be the class of all ordinals, which is not a set. For example, with $\omega$ denoting as usual the f […]