Matrices
An matrix with entries from a field is a @rectangular @array of the form
where each entry is an element of
We call the entries with the diagonal entries of the matrix.
Referenced by (9 direct, 19 transitive)
Direct references:
Transitive (depth 1):
- note-21
- remark-45
- Neural Network
- Conditional Independence Given Intermediate Step
- Ergodic
- note-19
- proof-of-characterization-of-sufficiency
- proof-of-data-processing-inequality
- proof-of-fanos-inequality
- proof-of-processing-cannot-increase-information
- Reversibility of Markov Chains
- Stationary Distribution of an Ergodic Chain
- Strong Asymptotic Equipartition Property (Shannon--McMillan--Breiman)
- Sufficient Statistic
Transitive (depth 2):
Matrix Multiplication
Let be an matrix and be an matrix. We define the product of an , denoted , to be the matrix such that
Note
\@{note-3}
is the @sum of products of corresponding entries from the th @row of and the th @column of
The following mnemonic is helpful:
We can view the matrix product in (at least) four different ways:
- Each entry of is a dot product: The entry
- Each column of is times the corresponding column of : so In other words, the columns of are linear combinations of the columns of
- Each row of is the corresponding row of multiplied by so In other words, the rows of are linear combinations of the rows of
- is a sum of column row outer products: