Show Non-Singular Matrix A Has Non-Zero Minimal Polynomial Coefficient

Click For Summary

Homework Help Overview

The problem involves a complex n x n matrix A and its minimal polynomial q(x), with the goal of showing that if A is non-singular, then the constant term α₀ must be non-zero. Participants are exploring the implications of the minimal polynomial's properties and the non-singularity of the matrix.

Discussion Character

  • Conceptual clarification, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants are examining the relationship between the minimal polynomial and the non-singularity of the matrix A. There are attempts to manipulate the expression q(A) and explore the consequences of assuming α₀ equals zero.

Discussion Status

Several participants are actively engaging with the problem, suggesting different approaches to analyze the implications of assuming α₀ is zero. There is a recognition that this assumption may lead to a contradiction regarding the degree of the minimal polynomial, but clarity on the next steps is still being sought.

Contextual Notes

Participants are working under the constraints of the problem statement and are questioning the validity of their assumptions and reasoning without reaching a definitive conclusion.

azdang
Messages
80
Reaction score
0
Here is my problem:

Let A be a complex n x n matrix with minimal polynomial q(x)=the sum from j=0 to m of [tex]\alpha_j x^j[/tex] where [tex]m\leq n[/tex] and [tex]\alpha_m[/tex] = 1.

Show: If A is non-singular then [tex]\alpha_0[/tex] does not equal 0.

So, I get that 0=q(A)=[tex]\alpha_0 I_n + \alpha_1 A + \alpha_2 A^2 +...+A^m[/tex], but I'm not sure what to do here. I assume we will have to use the fact that A is non-singular, but I'm not sure how. Does it maybe involve multiplying both sides by x on the right side? Any hints would be much appreciated! :)
 
Physics news on Phys.org
Assume a0 is zero. See if you can find a way to reduce the degree of the minimal polynomial such that A is still a zero
 
So, first, I've tried rewriting q(A) like this:
0=[tex]\alpha_0 I_n+(\alpha_1+\alpha_2 A+...+A^{m-1})A[/tex]

Then, if [tex]\alpha_0[/tex] is 0, then 0=[tex](\alpha_1+\alpha_2 A+...+A^{m-1})A[/tex].

So, if we multiply both sides by a nonzero vector x, we have:
0=[tex](\alpha_1+\alpha_2 A+...+A^{m-1})Ax[/tex].
But since x is nonzero and A is nonsingular, this cannot equal 0. Therefore, [tex]\alpha_0[/tex] must equal 0. Is my reasoning correct? I'm still not sure. Thanks!
 
You don't know that [tex]\alpha_1 + ... + A^{m-1}[/tex] is non-singular. Instead of applying both operators to a vector, try multiplying on the right by A-1 and see what you have
 
Well, then [tex]\alpha_1 + \alpha_2 A+...+A^{m-1}[/tex]=0. But I don't see how that helps because if we are assuming that [tex]\alpha_0[/tex] is 0, and then [tex]\alpha_1 + \alpha_2 A+...+A^{m-1}[/tex]=0, q(A) still equals 0, so it would give us what we want. I must be missing something :confused:
 
Hey guys, I'm still having problems with this. As Office_Shredder suggested, I assume [tex]\alpha_0[/tex] is 0, and then multiply by the inverse of A on the right side of each side which leaves me with:

0=[tex]\alpha_1 + \alpha_2 A+...+A^{m-1}[/tex], but what to do with this I can't seem to see.
 
Oh! Does this last equation set equal to 0 imply that the there would have to be a polynomial of lower degree (m-1)? Which would be impossible because we were talking about the minimal polynomial to begin with.
 
Yea, that last statement sounds about right.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
6
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
4K