Unit 10, lesson 53

Coupled Systems and Eigenmodes

How a linear update with a symmetric coupling matrix splits into eigenmodes, using mean and difference coordinates, the mode decomposition and an energy quadratic form, and what changes when the coupling is nonsymmetric.

  • Video 53
  • Capstones in Structure and Reconstruction

Two signals are updated together at each step. Each keeps half of its current value and receives a quarter of the other, so the state (1,0)(1, 0) becomes (1/2,1/4)(1/2, 1/4) after one step. Do the two values eventually agree, and does their total stay the same? This lesson writes the rule as a matrix, finds the patterns that evolve independently of each other, uses them to compute every step exactly, measures the decay with an energy, and tests which conclusions survive when the coupling is no longer symmetric. Each answer is checked against the original update rule. Throughout, states are real column vectors and a tuple such as (1,2)(1, 2) stands for a column.

Key terms

Linear update model

Definition A linear update model for nn real quantities is a rule

xk+1=Bxk,k=0,1,2,…,x_{k+1} = Bx_k, \qquad k = 0, 1, 2, \dots,

where xk∈Rnx_k \in \mathbb{R}^n is the state at step kk and B∈Rn×nB \in \mathbb{R}^{n \times n} is a fixed matrix, the coupling matrix. Then xk=Bkx0x_k = B^k x_0 for every k≥0k \ge 0. The entry bijb_{ij} is the factor by which quantity jj at the current step contributes to quantity ii at the next step, so the contribution is bijb_{ij} times the current value of quantity jj. The diagonal entries record what share each quantity keeps, and the entries off the diagonal record how the quantities are coupled. The model assumes that the rule is linear, the same at every step and free of outside input. The total sk=xk,1+⋯+xk,ns_k = x_{k,1} + \cdots + x_{k,n} satisfies sk+1=1TBxks_{k+1} = \mathbf{1}^{\mathsf{T}}Bx_k, where 1\mathbf{1} is the vector of ones, so the total is conserved for every starting state exactly when every column of BB sums to 11.

In plain words Write down how much of each signal flows into each signal in one step. That table is the coupling matrix, and repeating the step means taking powers of it.

Example For two signals that each keep half and receive a quarter of the other,

B=[1/21/41/41/2].B = \begin{bmatrix} 1/2 & 1/4 \\ 1/4 & 1/2 \end{bmatrix}.

From x0=(1,0)x_0 = (1, 0) the first two steps give x1=(1/2,1/4)x_1 = (1/2, 1/4) and x2=(5/16,1/4)x_2 = (5/16, 1/4). Each column of BB sums to 3/43/4, so the total is multiplied by 3/43/4 at every step and runs 11, 3/43/4, 9/169/16. This model attenuates the total rather than conserving it.

Mean and difference coordinates

Definition For x=(x1,x2)∈R2x = (x_1, x_2) \in \mathbb{R}^2, the mean and the half difference are

m=x1+x22,d=x1−x22,m = \frac{x_1 + x_2}{2}, \qquad d = \frac{x_1 - x_2}{2},

so that x1=m+dx_1 = m + d, x2=m−dx_2 = m - d and x=m(1,1)+d(1,−1)x = m(1, 1) + d(1, -1). The orthonormal version uses q+=(1,1)/2q_+ = (1, 1)/\sqrt{2} and q−=(1,−1)/2q_- = (1, -1)/\sqrt{2}, the columns of an orthogonal matrix QQ with QTQ=IQ^{\mathsf{T}}Q = I. The coefficients c=QTxc = Q^{\mathsf{T}}x are

c+=x1+x22=2 m,c−=x1−x22=2 d,\begin{gathered} c_+ = \frac{x_1 + x_2}{\sqrt{2}} = \sqrt{2}\,m, \\[0.4em] c_- = \frac{x_1 - x_2}{\sqrt{2}} = \sqrt{2}\,d, \end{gathered}

with x=Qc=c+q++c−q−x = Qc = c_+q_+ + c_-q_- and ∥x∥2=c+2+c−2=2(m2+d2)\lVert x \rVert^2 = c_+^2 + c_-^2 = 2(m^2 + d^2). For a symmetric coupling matrix with equal diagonal entries aa and off-diagonal entries bb, adding and subtracting the two update equations gives

mk+1=(a+b) mk,dk+1=(a−b) dk.\begin{aligned} m_{k+1} &= (a + b)\,m_k, \\[0.4em] d_{k+1} &= (a - b)\,d_k. \end{aligned}

Changing coordinates does not change the state. The same vector xx is described by two signal values or by two pattern coefficients.

In plain words Instead of tracking the two signals, track their average level and how far apart they are. When the coupling treats both signals alike, these two numbers do not influence each other.

Example For the model above, a+b=3/4a + b = 3/4 and a−b=1/4a - b = 1/4, so at each step the mean is multiplied by 3/43/4 and the half difference by 1/41/4. Take x=(3,1)x = (3, 1). Then m=2m = 2 and d=1d = 1, so c+=22c_+ = 2\sqrt{2} and c−=2c_- = \sqrt{2}, and indeed ∥x∥2=10=8+2\lVert x \rVert^2 = 10 = 8 + 2. One step gives Bx=(7/4,5/4)Bx = (7/4, 5/4), with mean 3/2=(3/4)⋅23/2 = (3/4) \cdot 2 and half difference 1/4=(1/4)⋅11/4 = (1/4) \cdot 1.

Eigenmode

Definition In a linear update model with coupling matrix B∈Rn×nB \in \mathbb{R}^{n \times n}, an eigenmode is a nonzero vector q∈Rnq \in \mathbb{R}^n with Bq=λqBq = \lambda q for a real number λ\lambda, the factor of the mode. The line spanned by qq is invariant, since every vector cqcq on it goes to λcq\lambda cq. So a state that starts in the mode stays in it, with xk=λkx0x_k = \lambda^k x_0. The mode decays when ∣λ∣<1\lvert \lambda \rvert < 1, keeps its size when ∣λ∣=1\lvert \lambda \rvert = 1 and grows when ∣λ∣>1\lvert \lambda \rvert > 1, and a negative factor flips the sign of the state at every step. A real matrix can also have nonreal eigenvalues, which come in conjugate pairs and describe oscillating patterns, but the models in this lesson have real ones.

In plain words An eigenmode is a pattern of values that the update only rescales. Once the signals are in that pattern they stay in it, and only the overall size and sign can change.

Example For the model above,

B[11]=34[11],B[1−1]=14[1−1].\begin{gathered} B\begin{bmatrix} 1 \\ 1 \end{bmatrix} = \frac{3}{4}\begin{bmatrix} 1 \\ 1 \end{bmatrix}, \\[0.4em] B\begin{bmatrix} 1 \\ -1 \end{bmatrix} = \frac{1}{4}\begin{bmatrix} 1 \\ -1 \end{bmatrix}. \end{gathered}

The symmetric mode q+q_+, two equal signals, has factor 3/43/4, and the antisymmetric mode q−q_-, two opposite signals, has factor 1/41/4. The vector (1,0)(1, 0) is not a mode, because B(1,0)=(1/2,1/4)B(1, 0) = (1/2, 1/4) is not a multiple of it.

Mode decomposition

Definition Let B∈Rn×nB \in \mathbb{R}^{n \times n} be symmetric. By the spectral theorem Rn\mathbb{R}^n has an orthonormal basis q1,…,qnq_1, \dots, q_n with Bqi=λiqiBq_i = \lambda_i q_i and every λi\lambda_i real. Let QQ be the orthogonal matrix with these columns and Λ=diag⁡(λ1,…,λn)\Lambda = \operatorname{diag}(\lambda_1, \dots, \lambda_n). Then B=QΛQTB = Q\Lambda Q^{\mathsf{T}}, and for every x0x_0 and every k≥0k \ge 0

xk=Bkx0=∑i=1nλik ci qi,ci=qiTx0,\begin{aligned} x_k &= B^k x_0 = \sum_{i=1}^{n} \lambda_i^k\, c_i\, q_i, \\[0.4em] c_i &= q_i^{\mathsf{T}}x_0, \end{aligned}

which is the matrix identity Bk=QΛkQTB^k = Q\Lambda^kQ^{\mathsf{T}}. For the proof, induction gives Bkqi=λikqiB^kq_i = \lambda_i^kq_i. Orthonormality gives x0=∑iciqix_0 = \sum_i c_iq_i with ci=qiTx0c_i = q_i^{\mathsf{T}}x_0, and linearity finishes the argument. So each mode coefficient evolves on its own, multiplied by its factor at every step. Only the formula for the coefficients uses orthonormality. For a diagonalizable matrix B=PΛP−1B = P\Lambda P^{-1} the same expansion holds along the columns of PP with c=P−1x0c = P^{-1}x_0.

In plain words Split the starting state into modes, let each mode shrink or grow by its own factor, and add the pieces back up. The modes never mix.

Example For x0=(1,0)x_0 = (1, 0) both coefficients are c±=1/2c_\pm = 1/\sqrt{2}, so

xk=12[(3/4)k+(1/4)k(3/4)k−(1/4)k].x_k = \frac{1}{2}\begin{bmatrix} (3/4)^k + (1/4)^k \\ (3/4)^k - (1/4)^k \end{bmatrix}.

At k=1k = 1 this is (1/2,1/4)(1/2, 1/4), and at k=2k = 2 it is (5/16,1/4)(5/16, 1/4). A check in the original coordinates confirms the second step, since B(1/2,1/4)=(1/4+1/16,1/8+1/8)=(5/16,1/4)B(1/2, 1/4) = (1/4 + 1/16, 1/8 + 1/8) = (5/16, 1/4). The total is (3/4)k(3/4)^k and the difference is (1/4)k(1/4)^k, so the difference divided by the total is (1/3)k(1/3)^k. Both signals tend to 00, and on the way they become nearly equal relative to their size, because the slow symmetric mode dominates whenever its coefficient is not zero.

Energy quadratic form

Definition For a symmetric H∈Rn×nH \in \mathbb{R}^{n \times n} the quadratic form is E(x)=xTHxE(x) = x^{\mathsf{T}}Hx. It is positive definite when E(x)>0E(x) > 0 for every nonzero xx, which happens exactly when every eigenvalue of HH is positive. In the two-signal model take

H=[2−1−12],B=I−14H.H = \begin{bmatrix} 2 & -1 \\ -1 & 2 \end{bmatrix}, \qquad B = I - \tfrac{1}{4}H.

Then

E(x)=2x12−2x1x2+2x22=(x1−x2)2+x12+x22,\begin{aligned} E(x) &= 2x_1^2 - 2x_1x_2 + 2x_2^2 \\[0.4em] &= (x_1 - x_2)^2 + x_1^2 + x_2^2, \end{aligned}

which is positive for x≠0x \ne 0 and measures both the disagreement and the size of the signals. Since H=4(I−B)H = 4(I - B), it has the same eigenvectors q±q_\pm, with eigenvalues 4(1−3/4)=14(1 - 3/4) = 1 and 4(1−1/4)=34(1 - 1/4) = 3. In mode coordinates E=c+2+3c−2E = c_+^2 + 3c_-^2, and one step gives

E(Bx)=916c+2+316c−2≤916E(x),E(Bx) = \tfrac{9}{16}c_+^2 + \tfrac{3}{16}c_-^2 \le \tfrac{9}{16}E(x),

so at each step the energy of a state is multiplied by at most 9/169/16. Watch for this. Under a change of coordinates x=Pcx = Pc with PP invertible, the update matrix becomes P−1BPP^{-1}BP, a similarity, while the energy becomes cT(PTHP)cc^{\mathsf{T}}(P^{\mathsf{T}}HP)c, a congruence. The two rules agree only when P−1=PTP^{-1} = P^{\mathsf{T}}, that is when PP is orthogonal.

In plain words The energy is one number that is large when the signals are large or disagree. Writing it in mode coordinates shows exactly how fast it falls, and it changes coordinates by its own rule, not by the rule for the update matrix.

Example The start x0=(1,0)x_0 = (1, 0) has energy 22. After one step, x1=(1/2,1/4)x_1 = (1/2, 1/4) has energy (1/4)2+1/4+1/16=3/8(1/4)^2 + 1/4 + 1/16 = 3/8. The mode formula agrees, since c±2=1/2c_\pm^2 = 1/2 gives (9/16)(1/2)+(3/16)(1/2)=3/8(9/16)(1/2) + (3/16)(1/2) = 3/8. Now use the coordinates mm and dd, that is x=Pcx = Pc with PP having columns (1,1)(1, 1) and (1,−1)(1, -1). This PP is not orthogonal, and

P−1BP=[3/4001/4],PTHP=[2006].\begin{gathered} P^{-1}BP = \begin{bmatrix} 3/4 & 0 \\ 0 & 1/4 \end{bmatrix}, \\[0.4em] P^{\mathsf{T}}HP = \begin{bmatrix} 2 & 0 \\ 0 & 6 \end{bmatrix}. \end{gathered}

So the energy is E=2m2+6d2E = 2m^2 + 6d^2, while the update factors stay 3/43/4 and 1/41/4. At x0=(1,0)x_0 = (1, 0), where m=d=1/2m = d = 1/2, this again gives 22.

Nonsymmetric coupling

Definition When the coupling matrix B∈Rn×nB \in \mathbb{R}^{n \times n} is not symmetric, the real spectral theorem does not apply, and Rn\mathbb{R}^n has no orthonormal basis of eigenvectors of BB. If BB has nn linearly independent eigenvectors p1,…,pnp_1, \dots, p_n in Cn\mathbb{C}^n, for example because it has nn distinct eigenvalues in C\mathbb{C}, then B=PΛP−1B = P\Lambda P^{-1} with P=[p1 ⋯ pn]P = [p_1 \ \cdots \ p_n], the mode coordinates are c=P−1x0c = P^{-1}x_0, and

xk=PΛkP−1x0=∑i=1nλik ci pi.x_k = P\Lambda^kP^{-1}x_0 = \sum_{i=1}^{n} \lambda_i^k\, c_i\, p_i.

The eigenvectors need not be orthogonal, so in general cic_i is not pi∗x0/∥pi∥2p_i^{*}x_0 / \lVert p_i \rVert^2, and arguments that used an orthonormal mode basis, such as the energy computation above, do not carry over unchanged. When every eigenvalue is real, the eigenvectors can be taken in Rn\mathbb{R}^n. Otherwise PP and cc are complex, and the sum is still the real vector Bkx0B^kx_0. If BB is defective there is no eigenbasis at all. Jordan chains then supply the missing directions and add factors polynomial in kk. A Schur form B=UTU∗B = UTU^{*}, with UU unitary and TT upper triangular, always exists over C\mathbb{C}. Its change of basis is always orthonormal, and its factor TT is diagonal exactly when BB is normal. Only then do the Schur coordinates evolve independently as modes.

In plain words Without symmetry the modes can lean toward each other. When there are still enough independent modes, powers can be computed from them, but in general the coordinates come from solving a linear system, not from dot products.

Example Change the upper-right coupling to 1/21/2,

C=[1/21/21/41/2].C = \begin{bmatrix} 1/2 & 1/2 \\ 1/4 & 1/2 \end{bmatrix}.

Now C(1,1)=(1,3/4)C(1, 1) = (1, 3/4), so the symmetric pattern is no longer a mode. The characteristic polynomial is χC(t)=(t−1/2)2−1/8\chi_C(t) = (t - 1/2)^2 - 1/8, with the distinct roots λ±=1/2±2/4\lambda_\pm = 1/2 \pm \sqrt{2}/4, about 0.8540.854 and 0.1460.146. Eigenvectors are p±=(±2,1)p_\pm = (\pm\sqrt{2}, 1), and p+⋅p−=−2+1=−1p_+ \cdot p_- = -2 + 1 = -1, so they are not orthogonal. The matrix is still diagonalizable, and both factors lie between 00 and 11, so every state still decays. For a defective coupling, the matrix with rows (1/2,1/4)(1/2, 1/4) and (0,1/2)(0, 1/2) has the single eigenvalue 1/21/2 and only the eigenvector line spanned by e1e_1. Its kkth power has (1/2)k(1/2)^k on the diagonal and k(1/2)k−1/4k(1/2)^{k-1}/4 in the upper-right corner.

Check yourself

  1. In the model with BB having rows (1/2,1/4)(1/2, 1/4) and (1/4,1/2)(1/4, 1/2), start from x0=(1,−1)x_0 = (1, -1). Find the mode coefficients, the state xkx_k, and the first two updates, and check them in the original coordinates.
Show the answer

The sum of the entries is 00 and the difference is 22, so c+=0c_+ = 0 and c−=2/2=2c_- = 2/\sqrt{2} = \sqrt{2}. Hence

xk=(1/4)k2 q−=(1/4)k(1,−1),x_k = (1/4)^k \sqrt{2}\, q_- = (1/4)^k (1, -1),

with x1=(1/4,−1/4)x_1 = (1/4, -1/4) and x2=(1/16,−1/16)x_2 = (1/16, -1/16). Directly, B(1,−1)=(1/2−1/4,1/4−1/2)=(1/4,−1/4)B(1, -1) = (1/2 - 1/4, 1/4 - 1/2) = (1/4, -1/4), and applying BB again gives (1/16,−1/16)(1/16, -1/16). The state stays on the antisymmetric line and never approaches the symmetric pattern, because that mode was absent from the start.

  1. Keep HH with rows (2,−1)(2, -1) and (−1,2)(-1, 2), and use the update Bh=I−hHB_h = I - hH with step size h>0h > 0. For which hh does every state tend to 00? What happens at h=2/3h = 2/3?
Show the answer

The eigenvectors q±q_\pm of HH are eigenvectors of BhB_h, with factors 1−h1 - h and 1−3h1 - 3h. Every state tends to 00 exactly when both factors lie strictly between −1-1 and 11. The first condition gives 0<h<20 < h < 2 and the second gives 0<h<2/30 < h < 2/3, so the answer is 0<h<2/30 < h < 2/3. The value h=1/4h = 1/4 gives the original BB. At h=2/3h = 2/3,

B2/3=[−1/32/32/3−1/3],B_{2/3} = \begin{bmatrix} -1/3 & 2/3 \\ 2/3 & -1/3 \end{bmatrix},

and B2/3(1,−1)=(−1,1)B_{2/3}(1, -1) = (-1, 1). The antisymmetric state flips sign forever without decaying. An update that subtracts a positive definite matrix is not stable for every step size.

  1. For the nonsymmetric CC with rows (1/2,1/2)(1/2, 1/2) and (1/4,1/2)(1/4, 1/2), start from x0=(0,2)x_0 = (0, 2). Find the coordinates of x0x_0 in the eigenvectors p±=(±2,1)p_\pm = (\pm\sqrt{2}, 1), compute x1x_1 and x2x_2, and explain why projecting x0x_0 onto each eigenvector gives the wrong coordinates.
Show the answer

Solve a(2,1)+b(−2,1)=(0,2)a(\sqrt{2}, 1) + b(-\sqrt{2}, 1) = (0, 2). The first entry gives a=ba = b and the second gives a+b=2a + b = 2, so a=b=1a = b = 1 and xk=λ+kp++λ−kp−x_k = \lambda_+^kp_+ + \lambda_-^kp_-. Using λ++λ−=1\lambda_+ + \lambda_- = 1, λ+−λ−=2/2\lambda_+ - \lambda_- = \sqrt{2}/2 and λ+λ−=det⁡C=1/8\lambda_+\lambda_- = \det C = 1/8,

x1=(2(λ+−λ−), λ++λ−)=(1,1),x2=(2(λ+2−λ−2), λ+2+λ−2)=(1,3/4),\begin{aligned} x_1 &= \bigl(\sqrt{2}(\lambda_+ - \lambda_-), \ \lambda_+ + \lambda_-\bigr) \\[0.4em] &= (1, 1), \\[0.4em] x_2 &= \bigl(\sqrt{2}(\lambda_+^2 - \lambda_-^2), \ \lambda_+^2 + \lambda_-^2\bigr) \\[0.4em] &= (1, 3/4), \end{aligned}

because λ+2+λ−2=(λ++λ−)2−2λ+λ−=3/4\lambda_+^2 + \lambda_-^2 = (\lambda_+ + \lambda_-)^2 - 2\lambda_+\lambda_- = 3/4 and λ+2−λ−2=(λ+−λ−)(λ++λ−)=2/2\lambda_+^2 - \lambda_-^2 = (\lambda_+ - \lambda_-)(\lambda_+ + \lambda_-) = \sqrt{2}/2. Directly, C(0,2)=(1,1)C(0, 2) = (1, 1) and C(1,1)=(1,3/4)C(1, 1) = (1, 3/4), which confirms both. Projecting gives p±⋅x0/∥p±∥2=2/3p_\pm \cdot x_0 / \lVert p_\pm \rVert^2 = 2/3 for each eigenvector, and (2/3)(p++p−)=(0,4/3)(2/3)(p_+ + p_-) = (0, 4/3), which is not x0x_0. The projection formula needs orthogonal modes, and here p+⋅p−=−1p_+ \cdot p_- = -1.

How this lesson connects