Statement
Let be a normalized co-occurrence statistic between items (e.g. a PMI-like quantity). Translation-symmetry assumption: for items belonging to a semantic continuum with coordinates ,
i.e. the statistic depends only on the distance between items along the continuum, not on their absolute positions. A matrix with this property, restricted to a lattice, is circulant (if the underlying coordinate is periodic — a closed loop) or Toeplitz (if it is open) — and such matrices have eigenvectors that are exactly discrete Fourier / sinusoidal modes, regardless of the specific shape of the kernel .
Intuition
If how related two items feel depends only on how far apart they are along some shared axis — not on which specific pair you picked — then the algebra of “distance-only” matrices takes over and forces the eigenvectors into sinusoids, the same way a physical system with translation-invariant interactions (e.g. a uniform vibrating string or a periodic crystal lattice) is diagonalized by Fourier modes regardless of the details of the interaction strength function.
Properties
- Circulant case (periodic coordinate) degenerate sin/cos eigenmode pairs. For a periodic lattice of size , a circulant matrix’s eigenvectors are for ; real eigenvectors pair up as combinations at each frequency, generically appearing with equal eigenvalues (degenerate pairs) — this is the mechanism proposed to underlie Circle (fundamental frequency) and would, if two independent periodic coordinates combine, underlie Torus.
- Toeplitz case (open coordinate) quantized, non-degenerate sinusoidal modes. Without periodicity, boundary effects perturb the eigenmodes away from a simple lattice into a self-consistent quantization condition, and the resulting eigenvalues are generically non-degenerate (no forced pairing) — the proposed mechanism behind 1D continuum manifold.
- Slowest modes are linearly decodable from few components. Since the top eigenmodes (largest eigenvalues) are the lowest-frequency Fourier modes in either case, a handful of leading principal components already captures most of the coordinate’s variation — connecting this hypothesis to Linear Direction-style decodability of continuous coordinates from a low-rank probe.
- Robust to targeted removal of specific entries. Because the predicted eigenmodes are a collective effect of many entries sharing the same underlying distance-dependence, removing a bounded number of individual entries of (as opposed to changing the global kernel itself) generically leaves the dominant eigenmodes’ structure intact — a robustness property distinguishing “many items collectively carrying a shared latent variable” from “a few specific co-occurrences doing all the work.”
- A generative mechanism, not a claimed shape itself. The hypothesis explains why circles and rippled 1D continua would arise (a mechanism, tied to corpus-statistics structure) — it is not itself a claimed geometric shape, which is why it lives among the hypothesis nodes rather than the structure nodes (Circle, 1D continuum manifold).
Relative to constructive-interference
This hypothesis explains why a co-occurrence/PMI matrix built from corpus statistics might already be circulant or Toeplitz (translation-invariant relatedness Fourier-mode eigenvectors) — a claim about the input statistics. Constructive Interference Hypothesis answers a different question: given such structure exists (in a feature covariance , not necessarily the same object as this hypothesis’s ), when does a trained, bottlenecked, weight-decayed network’s own learned weights actually inherit those top eigenmodes, rather than default to a near-orthogonal packing that ignores the correlation entirely? The two mechanisms are complementary rather than competing: one supplies a reason the relevant matrix would have circular/Fourier structure, the other supplies the training-dynamics reason a compressed representation would surface that structure instead of overriding it.
Exercises
Base
- Write down the circulant matrix with first row (i.e. each subsequent row is a cyclic shift of the previous one).
Solution
Each row is the previous row shifted one position to the right, with wraparound — the defining property of a circulant matrix.
- Is the matrix from Exercise 1 also Toeplitz (constant along diagonals)? Is every circulant matrix Toeplitz?
Solution
Yes, it is Toeplitz (check: every diagonal, going down-right, has constant entries — e.g. the main diagonal is all ‘s, the first superdiagonal is all ‘s where present). In general, every circulant matrix is a special case of a Toeplitz matrix (one where the diagonals additionally “wrap around” consistently with the rest of the pattern) — circulant Toeplitz, but not conversely: a generic Toeplitz matrix (e.g. from an open, non-periodic kernel) need not have the wraparound consistency that makes it circulant.
Middle
- Verify that is an eigenvector of the circulant matrix from Exercise 1 (with ) for , and find its eigenvalue.
Solution
For : (constant vector). Multiplying by the matrix: row 1 gives ; row 2 gives ; similarly rows 3,4 give . So , confirming is an eigenvector with eigenvalue — which equals the row sum, as expected for the constant eigenvector of any circulant (or more generally any matrix with constant row sums).
- For a general circulant matrix with first row , derive the eigenvalue corresponding to eigenvector , in terms of the ‘s and .
Solution
The circulant matrix has entries . Then . Substituting , i.e. : . So is indeed an eigenvector, with eigenvalue — the discrete Fourier transform of the first row, evaluated at frequency . This holds for any choice of (any kernel ), which is exactly the sense in which “the eigenvectors are automatically Fourier modes regardless of the specific shape of the kernel.”
Pro
- Show that for a real, symmetric circulant matrix (, i.e. the kernel depends only on the cyclic distance ), the eigenvalues and coincide, producing the degenerate pairing referenced in the Properties section.
Solution
From Exercise 4, (using for integer ) (complex conjugate of , since conjugating gives and the are real). But is already real whenever the satisfy the symmetry (a direct computation, or the general fact that a real symmetric circulant has a real spectrum) — so . Since and are complex conjugate eigenvectors with the same real eigenvalue, their real and imaginary parts (proportional to and of the same frequency) span a 2-dimensional eigenspace at that shared eigenvalue — the degenerate sin/cos pair.
- A Toeplitz (non-circulant) matrix has entries for , with no wraparound. Explain concretely, via a small example, why generally fails to be an exact eigenvector in this case, in terms of the “missing” wraparound terms that the circulant computation in Exercise 4 relied on.
Solution
Take , kernel (say the kernel vanishes beyond distance 1), giving Toeplitz matrix (note , whereas a circulant version would instead wrap around and use there, i.e. treat index-distance on a length-3 cycle as equivalent to distance the other way). Testing : the circulant eigenvector derivation in Exercise 4 relied on every term appearing with the cyclic distance, but the actual Toeplitz matrix uses (non-cyclic distance) — for the pair , the Toeplitz matrix has while the circulant computation implicitly would have used (since ). This mismatch at the boundary (row 0’s interaction with the far end, and symmetrically row ‘s interaction with the near end) is exactly the “missing wraparound terms” — direct multiplication will not come out proportional to in general because these edge entries break the clean cyclic-shift structure the circulant proof depended on. This is the algebraic origin of the “boundary effects perturb the eigenmodes away from a simple lattice” property claimed for the open (Toeplitz) case.