Algebra I Flashcards

1
Q

Equivalent matrices

A

š“,šµ ∈ Kᵐ⋅ⁿ are equivalent if there exists invertible matrices P ∈ Kᵐ⋅ᵐ, Q ∈ Kⁿ⋅ⁿ s.t. šµ = Pš“Q.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Monic

A

A polynomial with coeffs in a field K is monic if the coeff of the highest power is 1.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Minimal polynomial of a matrix š“

A

The min. polynomial of a matrix š“ (or corresponding linear operator T) is the unique monic polynomial μ_š“(š‘„) of minimal degree s.t. μ_š“(š“) = 0 (or μ_š“(T) = 0).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Similar matrices

A

š“,šµ ∈ Kⁿ⋅ⁿ are similar if there exists invertible matrix P ∈ Kⁿ⋅ⁿ s.t. šµ = Pā»Ā¹š“P.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Characteristic polynomial

A

The char polynomial of an nƗn matrix š“ is
p_š“(š‘„) = det(š“ - š‘„Iā‚™)
where Iā‚™ is the nƗn identity matrix.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Jordan chain

A

A Jordan chain of length k is a sequence of non-zero vectors v₁,…,vā‚– ∈ Kⁿ⋅¹ that satisfies
Av₁ = Ī»v₁, Avįµ¢ = Ī»vįµ¢ + vįµ¢-₁, 2 ≤ i ≤ k, for some eigenvalue Ī» of š“ ∈ Kⁿⁿ.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Generalised eigenspace

A

Given T: V → V linear and Ī» ∈ K an eval of T, the generalised eigenspace of T corresponding to Ī» is
{š‘„ ∈ V | (T - Ī»šˆ)ⁱ(š‘„) = 0 for some i ∈ ℤ}.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Jordan block

A

The Jordan block with eigenvalue Ī» of degree k is a kƗk matrix J_{Ī»,k} = (γᵢⱼ), s.t.
γᵢ,įµ¢ = Ī» for 1 ≤ i ≤ k,
γᵢ,įµ¢ā‚Šā‚ = 1 for 1 ≤ i < k,
γᵢⱼ = 0 for j ≠ i, j ≠ i+1.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Block sum of š“,šµ

A

Let š“ ∈ Kᵐ⋅ᵐ, šµ ∈ Kⁿ⋅ⁿ. š“ āŠ• šµ, the block sum of š“ and šµ, is the (m+n)Ɨ(m+n) matrix with block form
š“ 0ā‚˜,ā‚™
0ā‚™,ā‚˜ šµ

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Jordan basis of T map

A

Let T: V → V be linear. A Jordan basis for T and V is a finite basis E of V s.t. ∃ Jordan blocks J₁, … Jā‚– s.t.
[ETE] = J₁ āŠ• … āŠ• Jā‚–.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Cayley-Hamilton theorem

A

Let c_š“(š‘„) be the char polynomial of a matrix š“, then c_š“(š“) = 0.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Jordan basis of š“ matrix

A

A Jordan basis for a matrix š“ ∈ Kⁿ⋅ⁿ is a basis of Kⁿ⋅¹ which is a union of Jordan chains.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

[FTE] matrix of T wrt two bases

A

Let T: V → W be a linear map. Let E = (e₁, …, eā‚™) be a basis of V, F = (f₁, …, fā‚˜) be a basis of W.
Then ∃! aᵢⱼ, āˆ€ 1 ≤ i ≤ n, 1 ≤ j ≤ m, s.t. T(eā±¼) = āˆ‘_{i=1, m} aᵢⱼfįµ¢.
We write [FTE] = (aᵢⱼ)ᵢⱼ as the matrix of T wrt E and F.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Rules of powers in char and min polynomial

A
c_š“(š‘„) = āˆ_{š‘–=1, k} (šœ†įµ¢ - š‘„)ⁿⁱ where nįµ¢ is the number of times šœ†įµ¢ appears on the diag of  š“'s JCF.
šœ‡_š“(š‘„) = āˆ_{š‘–=1, k} (x - šœ†įµ¢)ᵐⁱ where mįµ¢ is the length of the longest chain for šœ†įµ¢.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly