markdown
Quadratic forms, minimal polynomials, and Jordan form - Basic Exercisesmd eec6df3
exercise/math/linear-algebra/quadratic-forms-minimal-polynomials-and-jordan-form.exercise.n.md

Quadratic forms二次形式にじけいしき, minimal polynomials最小多項式さいしょうたこうしき, and Jordan form - Basic Exercises

date2026-06-06document_iddoc_c93a95d880e00a983edaf7a88b281565description二次形式、正定値性、最小多項式、ジョルダン標準形を、対角化できる場合とできない場合の違いから確認する演習である。prerequisites二次形式と正定値行列 / 最小多項式の基本 / ジョルダン標準形の入口type問題演習content_typeexercisestatusactiverelateddata/lecture/math/linear-algebra/quadratic-forms-and-positive-definite-matrices.lecture.n.md / data/lecture/math/linear-algebra/minimal-polynomial-basics.lecture.n.md / data/lecture/math/linear-algebra/introduction-to-jordan-canonical-form.lecture.n.md / data/exercise/math/linear-algebra/eigenvalues-diagonalization-and-extensions.exercise.n.md
mathlinear-algebraexercisequadratic-formminimal-polynomialjordan-form
data/lecture/math/linear-algebra/quadratic-forms-and-positive-definite-matrices.lecture.n.md data/lecture/math/linear-algebra/minimal-polynomial-basics.lecture.n.md data/lecture/math/linear-algebra/introduction-to-jordan-canonical-form.lecture.n.md

1Exercise plan

A quadratic form二次形式にじけいしき studies signs and stretching along directions. A minimal polynomial最小多項式さいしょうたこうしき and Jordan normal formジョルダン標準形ひょうじゅんけい record non-diagonalizable information that eigenvalues固有値こゆうち alone do not show.


2Problem 1

Determine whether

q(x,y)=2x2+2xy+2y2

is positive definite正定値せいていち.

2.1Answer example

The corresponding symmetric matrix対称行列たいしょうぎょうれつ is

C=(2112).

Its eigenvalues固有値こゆうち are 3 and 1, both positive. Therefore q is positive definite.

2.2Explanation

A quadratic form can be read along eigendirections固有方向こゆうほうこう. If every eigenvalue coefficient is positive, every nonzero input gives a positive value.


3Problem 2

Write

q(x,y,z)=2x2+2xy+3y2-z2

as a symmetric matrix対称行列たいしょうぎょうれつ, and classify it as positive definite, positive semidefinite非負定値ひふていち, or indefinite不定ふてい.

3.1Answer example

The corresponding matrix is

S=(21013000-1).

Since q(1,0,0)=2>0 and q(0,0,1)=-1<0, the form is indefinite.

3.2Explanation

Positive definiteness requires positivity for all nonzero vectors. If both positive and negative directions exist, the form is indefinite.


4Problem 3

For

J=(1101),

explain why the minimal polynomial最小多項式さいしょうたこうしき is (t-1)2.

4.1Answer example

J-I=(0100)0,

but

(J-I)2=(0000).

Thus the monic polynomial of lowest degree sending J to the zero matrix is (t-1)2.

4.2Explanation

The eigenvalue alone suggests (t-1), but J-I0 shows that a nilpotent off-diagonal part remains. Jordan form records exactly this information.


5Problem 4

Find the minimal polynomials最小多項式さいしょうたこうしき of

D=(1001),E=(1002),J=(1101),

and explain what the characteristic polynomial特性多項式とくせいたこうしき alone cannot distinguish.

5.1Answer example

Since D-I=0,

mD(t)=t-1.

For E, (E-I)(E-2I)=0 and neither single factor suffices, so

mE(t)=(t-1)(t-2).

For J, J-I0 but (J-I)2=0, so

mJ(t)=(t-1)2.

5.2Explanation

Both D and J have characteristic polynomial (t-1)2. But D is diagonal and J is not diagonalizable対角化可能たいかくかかのう. The minimal polynomial detects this through whether a repeated factor is needed.


6Problem 5

Suppose N=A-λI acts nilpotently冪零べきれい on a 4-dimensional space and

dimkerN=2,dimkerN2=3,dimkerN3=4.

Find the sizes of the Jordan blocks for λ.

6.1Answer example

dimkerN gives the number of Jordan blocks, so there are 2 blocks. The differences are

2,1,1.

This means there are 2 blocks of size at least 1, 1 block of size at least 2, and 1 block of size at least 3. Hence the block sizes are 3 and 1.

6.2Explanation

The growth of dimkerNk records how long the Jordan chainsジョルダン are.


7Problem 6

For

A=(210021002),

let N=A-2I. Find kerN, kerN2, and kerN3, construct one Jordan chainジョルダン, and compute etA.

7.1Answer example

N=(010001000),

so N(x,y,z)T=(y,z,0)T. Therefore

kerN=span(e1),kerN2=span(e1,e2),kerN3=R3.

Since

Ne1=0,Ne2=e1,Ne3=e2,

the vectors e1,e2,e3 form a Jordan chain. Also A=2I+N and N3=0, so

etA=e2t(I+tN+t22N2)=e2t(1tt2201t001).

7.2Explanation

When eigenvectors are not enough, generalized eigenvectors一般化いっぱんか固有こゆうベクトル fill the missing directions. The nilpotent part冪零成分べきれいせいぶん produces polynomial factors in etA.


10Supplementary theorem-check problems

10.1Problem 7

For

H=(2113),

check positive definiteness正定値性せいていちせい by three methods: eigenvalues, leading principal minors, and completing the square.

10.2Answer example

The eigenvalues are roots of

det(H-λI)=(2-λ)(3-λ)-1=λ2-5λ+5,

so

λ=5±52,

both positive. The leading principal minors are 2>0 and detH=5>0, also showing positive definiteness. Finally,

2x2+2xy+3y2=2(x+y2)2+52y2,

which is positive for every nonzero (x,y).

10.3Explanation

For a real symmetric 2×2 matrix, these three readings agree: positive eigenvalues, positive leading principal minors, and a sum of positive squares.

10.4Problem 8

State and prove, in the real symmetric case, why a quadratic form二次形式にじけいしき q(x)=xTAx is positive definite if and only if all eigenvalues of A are positive.

10.5Answer example

By the spectral theorem, there is an orthogonal matrix Q such that

QTAQ=diag(λ1,,λn).

Put y=QTx. Since Q is invertible and preserves length, x0 if and only if y0. Then

q(x)=xTAx=yTdiag(λ1,,λn)y=iλiyi2.

If every λi>0, this sum is positive for every nonzero y. Conversely, if some λj[PARSE ERROR: Undefined("Command(\"le\")")]0, taking y=ej gives q(x)=λj[PARSE ERROR: Undefined("Command(\"le\")")]0 in the corresponding eigen-direction, so the form is not positive definite.

10.6Explanation

The spectral theorem turns a quadratic form into independent squared coordinates. Positive definiteness is therefore exactly positivity of every coefficient in those coordinates.

10.7Problem 9

For a complex matrix whose minimal polynomial splits, explain why being diagonalizable対角化可能たいかくかかのう is equivalent to the minimal polynomial最小多項式さいしょうたこうしき having no repeated linear factor. Check this on D and J from Problem 4.

10.8Answer example

If a matrix is diagonalizable with diagonal entries among λ1,,λs, then

i=1s(t-λi)

annihilates the matrix, so the minimal polynomial has only distinct linear factors. Conversely, if the minimal polynomial has no repeated factor, the primary decomposition has no nontrivial nilpotent part on any eigenspace, so the matrix is a direct sum of eigenspaces and is diagonalizable. For the diagonal matrix D, the minimal polynomial has distinct factors. For the Jordan block J, a squared factor is needed, so it is not diagonalizable.

10.9Explanation

Repeated factors in the minimal polynomial detect the nilpotent part of Jordan blocks. No repeated factor means every Jordan block has size 1.


raw .n.md をコピー
loc をコピー (filepath:line ~ line)
copy share link
copy encoded share link
path をコピー
copy share link
copy encoded share link
copy share link
copy encoded share link
タブを全て閉じる