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 becomes 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 stands for a column.
Key terms
Linear update model
Definition A linear update model for real quantities is a rule
where is the state at step and is a fixed matrix, the coupling matrix. Then for every . The entry is the factor by which quantity at the current step contributes to quantity at the next step, so the contribution is times the current value of quantity . 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 satisfies , where is the vector of ones, so the total is conserved for every starting state exactly when every column of sums to .
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,
From the first two steps give and . Each column of sums to , so the total is multiplied by at every step and runs , , . This model attenuates the total rather than conserving it.
Mean and difference coordinates
Definition For , the mean and the half difference are
so that , and . The orthonormal version uses and , the columns of an orthogonal matrix with . The coefficients are
with and . For a symmetric coupling matrix with equal diagonal entries and off-diagonal entries , adding and subtracting the two update equations gives
Changing coordinates does not change the state. The same vector 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, and , so at each step the mean is multiplied by and the half difference by . Take . Then and , so and , and indeed . One step gives , with mean and half difference .
Eigenmode
Definition In a linear update model with coupling matrix , an eigenmode is a nonzero vector with for a real number , the factor of the mode. The line spanned by is invariant, since every vector on it goes to . So a state that starts in the mode stays in it, with . The mode decays when , keeps its size when and grows when , 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,
The symmetric mode , two equal signals, has factor , and the antisymmetric mode , two opposite signals, has factor . The vector is not a mode, because is not a multiple of it.
Mode decomposition
Definition Let be symmetric. By the spectral theorem has an orthonormal basis with and every real. Let be the orthogonal matrix with these columns and . Then , and for every and every
which is the matrix identity . For the proof, induction gives . Orthonormality gives with , 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 the same expansion holds along the columns of with .
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 both coefficients are , so
At this is , and at it is . A check in the original coordinates confirms the second step, since . The total is and the difference is , so the difference divided by the total is . Both signals tend to , 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 the quadratic form is . It is positive definite when for every nonzero , which happens exactly when every eigenvalue of is positive. In the two-signal model take
Then
which is positive for and measures both the disagreement and the size of the signals. Since , it has the same eigenvectors , with eigenvalues and . In mode coordinates , and one step gives
so at each step the energy of a state is multiplied by at most . Watch for this. Under a change of coordinates with invertible, the update matrix becomes , a similarity, while the energy becomes , a congruence. The two rules agree only when , that is when 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 has energy . After one step, has energy . The mode formula agrees, since gives . Now use the coordinates and , that is with having columns and . This is not orthogonal, and
So the energy is , while the update factors stay and . At , where , this again gives .
Nonsymmetric coupling
Definition When the coupling matrix is not symmetric, the real spectral theorem does not apply, and has no orthonormal basis of eigenvectors of . If has linearly independent eigenvectors in , for example because it has distinct eigenvalues in , then with , the mode coordinates are , and
The eigenvectors need not be orthogonal, so in general is not , 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 . Otherwise and are complex, and the sum is still the real vector . If is defective there is no eigenbasis at all. Jordan chains then supply the missing directions and add factors polynomial in . A Schur form , with unitary and upper triangular, always exists over . Its change of basis is always orthonormal, and its factor is diagonal exactly when 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 ,
Now , so the symmetric pattern is no longer a mode. The characteristic polynomial is , with the distinct roots , about and . Eigenvectors are , and , so they are not orthogonal. The matrix is still diagonalizable, and both factors lie between and , so every state still decays. For a defective coupling, the matrix with rows and has the single eigenvalue and only the eigenvector line spanned by . Its th power has on the diagonal and in the upper-right corner.
Check yourself
- In the model with having rows and , start from . Find the mode coefficients, the state , and the first two updates, and check them in the original coordinates.
Show the answer
The sum of the entries is and the difference is , so and . Hence
with and . Directly, , and applying again gives . The state stays on the antisymmetric line and never approaches the symmetric pattern, because that mode was absent from the start.
- Keep with rows and , and use the update with step size . For which does every state tend to ? What happens at ?
Show the answer
The eigenvectors of are eigenvectors of , with factors and . Every state tends to exactly when both factors lie strictly between and . The first condition gives and the second gives , so the answer is . The value gives the original . At ,
and . The antisymmetric state flips sign forever without decaying. An update that subtracts a positive definite matrix is not stable for every step size.
- For the nonsymmetric with rows and , start from . Find the coordinates of in the eigenvectors , compute and , and explain why projecting onto each eigenvector gives the wrong coordinates.
Show the answer
Solve . The first entry gives and the second gives , so and . Using , and ,
because and . Directly, and , which confirms both. Projecting gives for each eigenvector, and , which is not . The projection formula needs orthogonal modes, and here .