Skip to content

Commit 635a3f0

Browse files
committed
update matrix notation
1 parent 76799f1 commit 635a3f0

File tree

1 file changed

+7
-7
lines changed

1 file changed

+7
-7
lines changed

lectures/eigen_II.md

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -98,9 +98,9 @@ Left eigenvectors will play important roles in what follows, including that of s
9898

9999
We will talk more about this later, but for now, let's define left eigenvectors.
100100

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$.
102102

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$.
104104

105105
This hints at how to compute left eigenvectors
106106

@@ -141,7 +141,7 @@ print(w)
141141

142142
Note that the eigenvalues for both left and right eigenvectors are the same, but the eigenvectors themselves are different.
143143

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$.
145145

146146
This is a more common expression and where the name left eigenvectors originates.
147147

@@ -186,7 +186,7 @@ Now let's consider examples for each case.
186186

187187
#### Example 1: irreducible matrix
188188

189-
Consider the following irreducible matrix A:
189+
Consider the following irreducible matrix $A$:
190190

191191
```{code-cell} ipython3
192192
A = np.array([[0, 1, 0],
@@ -200,7 +200,7 @@ We can compute the dominant eigenvalue and the corresponding eigenvector
200200
eig(A)
201201
```
202202

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$:
204204

205205
1. The dominant eigenvalue is real-valued and non-negative.
206206
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
210210

211211
#### Example 2: primitive matrix
212212

213-
Consider the following primitive matrix B:
213+
Consider the following primitive matrix $B$:
214214

215215
```{code-cell} ipython3
216216
B = np.array([[0, 1, 1],
@@ -226,7 +226,7 @@ We compute the dominant eigenvalue and the corresponding eigenvector
226226
eig(B)
227227
```
228228

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$:
230230

231231
1. The dominant eigenvalue is real-valued and non-negative.
232232
2. All other eigenvalues have absolute values strictly less than the dominant eigenvalue.

0 commit comments

Comments
 (0)