You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: lectures/eigen_II.md
+7-7Lines changed: 7 additions & 7 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -98,9 +98,9 @@ Left eigenvectors will play important roles in what follows, including that of s
98
98
99
99
We will talk more about this later, but for now, let's define left eigenvectors.
100
100
101
-
A vector $w$ is called a left eigenvector of $A$ if $w$ is an eigenvector of $A^T$.
101
+
A vector $w$ is called a left eigenvector of $A$ if $w$ is an eigenvector of $A^\top$.
102
102
103
-
In other words, if $w$ is a left eigenvector of matrix A, then $A^T w = \lambda w$, where $\lambda$ is the eigenvalue associated with the left eigenvector $v$.
103
+
In other words, if $w$ is a left eigenvector of matrix $A$, then $A^\top w = \lambda w$, where $\lambda$ is the eigenvalue associated with the left eigenvector $v$.
104
104
105
105
This hints at how to compute left eigenvectors
106
106
@@ -141,7 +141,7 @@ print(w)
141
141
142
142
Note that the eigenvalues for both left and right eigenvectors are the same, but the eigenvectors themselves are different.
143
143
144
-
We can then take transpose to obtain $A^T w = \lambda w$ and obtain $w^T A= \lambda w^T$.
144
+
We can then take transpose to obtain $A^\top w = \lambda w$ and obtain $w^\top A= \lambda w^\top$.
145
145
146
146
This is a more common expression and where the name left eigenvectors originates.
147
147
@@ -186,7 +186,7 @@ Now let's consider examples for each case.
186
186
187
187
#### Example 1: irreducible matrix
188
188
189
-
Consider the following irreducible matrix A:
189
+
Consider the following irreducible matrix $A$:
190
190
191
191
```{code-cell} ipython3
192
192
A = np.array([[0, 1, 0],
@@ -200,7 +200,7 @@ We can compute the dominant eigenvalue and the corresponding eigenvector
200
200
eig(A)
201
201
```
202
202
203
-
Now we can go through our checklist to verify the claims of the Perron-Frobenius Theorem for the irreducible matrix A:
203
+
Now we can go through our checklist to verify the claims of the Perron-Frobenius Theorem for the irreducible matrix $A$:
204
204
205
205
1. The dominant eigenvalue is real-valued and non-negative.
206
206
2. All other eigenvalues have absolute values less than or equal to the dominant eigenvalue.
@@ -210,7 +210,7 @@ Now we can go through our checklist to verify the claims of the Perron-Frobenius
210
210
211
211
#### Example 2: primitive matrix
212
212
213
-
Consider the following primitive matrix B:
213
+
Consider the following primitive matrix $B$:
214
214
215
215
```{code-cell} ipython3
216
216
B = np.array([[0, 1, 1],
@@ -226,7 +226,7 @@ We compute the dominant eigenvalue and the corresponding eigenvector
226
226
eig(B)
227
227
```
228
228
229
-
Now let's verify the claims of the Perron-Frobenius Theorem for the primitive matrix B:
229
+
Now let's verify the claims of the Perron-Frobenius Theorem for the primitive matrix $B$:
230
230
231
231
1. The dominant eigenvalue is real-valued and non-negative.
232
232
2. All other eigenvalues have absolute values strictly less than the dominant eigenvalue.
0 commit comments