Math 2.0

example

Circulant matrix

Example

Let FF be a field and let c0,c1,…,cn−1∈Fc_0, c_1, \dots, c_{n-1} \in F. The circulant matrix with first column (c0,c1,…,cn−1)T(c_0, c_1, \dots, c_{n-1})^T is the n×nn \times n matrix CC with entries Cij=c(i−j) mod nC_{ij} = c_{(i - j) \bmod n}, for 0≤i,j≤n−10 \le i, j \le n - 1. Each column is the previous column shifted down by one place, with the last entry moved to the top. For n=3n = 3: C=(c0c2c1c1c0c2c2c1c0).C = \begin{pmatrix} c_0 & c_2 & c_1 \\ c_1 & c_0 & c_2 \\ c_2 & c_1 & c_0 \end{pmatrix}.

Remarks

Some authors define circulant matrices by their first row; the two conventions give transposed matrices. Over C\C, the vectors (1,ωk,ω2k,…,ω(n−1)k)(1, \omega^k, \omega^{2k}, \dots, \omega^{(n-1)k}) with ω=e2πi/n\omega = e^{2\pi i/n} are eigenvectors of every n×nn \times n circulant matrix. The product of two circulant matrices of the same order is circulant, and circulant matrices commute with each other.

Explanations

L1 human

In a circulant matrix, each column is the column before it, rotated down by one step. All the information is in the first column. The discrete Fourier transform diagonalises all of these matrices at the same time.

What this node needs for W3
  • a person confirmed each agent-written section: rule P04 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Matrix definition
  2. Square matrix definition
  3. Circulant matrix example

Sources

  1. Web https://en.wikipedia.org/wiki/Circulant_matrix, Definition