L-8: Difference between revisions
| Line 15: | Line 15: | ||
</math> | </math> | ||
The random variables <math>V_i</math> represent on-site disorder. | The random variables <math>V_i</math> represent on-site disorder. | ||
For simplicity we set <math>t=1</math>. | |||
We assume that the disorder variables are independent and identically distributed, uniformly in the interval | |||
<math display="block"> | <math display="block"> | ||
| Line 27: | Line 24: | ||
</math> | </math> | ||
In one dimension the single-particle Hamiltonian | In one dimension, the single-particle Hamiltonian is represented by the tridiagonal matrix | ||
<math display="block"> | <math display="block"> | ||
| Line 47: | Line 44: | ||
\sum_{n=1}^L |\psi_n|^2 = 1 . | \sum_{n=1}^L |\psi_n|^2 = 1 . | ||
</math> | </math> | ||
In the one-particle sector, this becomes a discrete Schrödinger equation. | |||
--- | --- | ||
| Line 86: | Line 85: | ||
== Transfer matrices == | == Transfer matrices == | ||
After multiplying the eigenvalue equation by <math>-1</math> and redefining | |||
<math>-V_n \to V_n</math> and <math>-\epsilon \to \epsilon</math>, the discrete Schrödinger equation reads | |||
<math display="block"> | <math display="block"> | ||
| Line 136: | Line 136: | ||
Thus the wavefunction is controlled by a product of random matrices. | Thus the wavefunction is controlled by a product of random matrices. | ||
=== Remark === | |||
The transfer matrix formulation rewrites the problem as a recursion, starting from initial data and propagating the solution along the chain. | |||
This corresponds to a Cauchy problem rather than a boundary value problem. Nevertheless, the growth properties of the solutions contain direct information about the nature of the eigenstates: exponential growth is associated with localization, while bounded solutions correspond to extended states. | |||
== Furstenberg theorem (physical formulation) == | == Furstenberg theorem (physical formulation) == | ||
Revision as of 17:56, 21 March 2026
Goal. We introduce the Anderson model and study the statistical properties of its eigenstates. In one dimension disorder leads to localization of all eigenstates, which can be understood using products of random matrices.
Anderson model (tight-binding model)
We consider non-interacting particles hopping between nearest-neighbour sites of a lattice in the presence of disorder.
The Hamiltonian reads
The random variables represent on-site disorder. For simplicity we set .
We assume that the disorder variables are independent and identically distributed, uniformly in the interval
In one dimension, the single-particle Hamiltonian is represented by the tridiagonal matrix
We study the statistical properties of the eigenvalue problem
In the one-particle sector, this becomes a discrete Schrödinger equation.
---
Density of states
Without disorder the dispersion relation is
The energy band is therefore
The density of states is
In the presence of disorder the density of states broadens and becomes sample dependent.
---
Transfer matrices
After multiplying the eigenvalue equation by and redefining and , the discrete Schrödinger equation reads
It can be rewritten as
with
Iterating gives
Thus the wavefunction is controlled by a product of random matrices.
Remark
The transfer matrix formulation rewrites the problem as a recursion, starting from initial data and propagating the solution along the chain.
This corresponds to a Cauchy problem rather than a boundary value problem. Nevertheless, the growth properties of the solutions contain direct information about the nature of the eigenstates: exponential growth is associated with localization, while bounded solutions correspond to extended states.
Furstenberg theorem (physical formulation)
The exponential growth of the product of random matrices can be understood as a matrix analogue of the law of large numbers. A sufficient condition for this behavior is provided by a theorem of Harry Furstenberg.
To quantify this growth, we introduce the norm of a matrix as
In physical terms, the theorem relies on two key ingredients:
(i) Stretching
Each matrix must be able to expand at least one direction. This means that for each there exists a vector such that
Equivalently, is the largest eigenvalue of the symmetric matrix
(ii) Mixing of directions
The angular dynamics is not confined: under iteration of the product the direction of a vector can explore the whole angular space. This exploration is not required to be uniform; it is sufficient that all directions are accessible.
Consequence
Under these conditions, the norm of the product grows exponentially with probability one: where is the Lyapunov exponent.
This result is the matrix analogue of the fact that the logarithm of a product of independent random variables becomes self-averaging (see Exercise 15).
Verification of Furstenberg's hypotheses for the Anderson model
We now check explicitly that the transfer matrices of the one-dimensional Anderson model satisfy the two conditions stated above.
The transfer matrices are
(i) Stretching
We first verify that each matrix expands at least one direction.
For a generic matrix, the maximal stretching factor is controlled by the largest eigenvalue of . Here
The trace is and the determinant is
Therefore the eigenvalues satisfy and the largest one obeys
More precisely, as soon as , one has
Thus each matrix expands at least one direction, except for the fine-tuned case , which has zero probability for a continuous disorder distribution. The stretching condition is therefore satisfied almost surely.
(ii) Mixing of directions
We now verify that the angular dynamics is not confined to a finite set of directions.
Define the angle which represents the direction of the vector .
The transfer matrix induces the map
For fixed , this expression depends continuously on the random variable . If the disorder has a continuous distribution (for instance Gaussian), the image of a given angle is not restricted to a finite set.
As a consequence, the sequence is not confined to a finite set of directions: under iteration of the product the angular dynamics can access a continuum of directions.
This exploration is not required to be uniform; it is sufficient that all directions are accessible. This is precisely the mixing condition required by Furstenberg's theorem.
Conclusion
The transfer matrices of the one-dimensional Anderson model satisfy both conditions:
- they expand at least one direction;
- they do not confine the angular dynamics to a finite set.
As a consequence, so the Lyapunov exponent is positive for generic disorder.
---
Localization length
The transfer-matrix recursion corresponds to fixing the wavefunction at one boundary and propagating it through the system.
Typical solutions grow exponentially
However a physical eigenstate must satisfy boundary conditions at both ends of the system. Matching two such solutions leads to exponentially localized eigenstates
The localization length is
Thus in one dimension arbitrarily weak disorder localizes all eigenstates. This result is consistent with the scaling theory of localization discussed earlier, which predicts that for disorder inevitably drives the system toward the insulating regime.
---
Fluctuations
Quantities such as
show strong sample-to-sample fluctuations, while their logarithm is self-averaging.
For instance
so that the logarithm of the wavefunction performs a random walk with a positive drift.