L-8: Difference between revisions
No edit summary |
|||
| Line 138: | Line 138: | ||
--- | --- | ||
== | == Furstenberg theorem (physical formulation) == | ||
The exponential growth of the product of random matrices | |||
<math display="block"> | |||
\Pi_n = T_n T_{n-1} \cdots T_1 | |||
</math> | |||
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 <math>A</math> as | |||
<math display="block"> | <math display="block"> | ||
\| | \|A\|^2 = \frac{a_{11}^2 + a_{12}^2 + a_{21}^2 + a_{22}^2}{2}. | ||
\frac{ | |||
</math> | </math> | ||
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 <math>n</math> there exists a vector <math>v</math> such that | |||
<math display="block"> | <math display="block"> | ||
\ | \|T_n v\| = \sigma_{\max}(T_n)\, \|v\|, | ||
\ | \qquad \sigma_{\max}(T_n) > 1. | ||
\ | |||
</math> | </math> | ||
The | Equivalently, <math>\sigma_{\max}^2(T_n)</math> is the largest eigenvalue of the symmetric matrix | ||
<math display="block"> | |||
T_n^T T_n. | |||
</math> | |||
=== (ii) Mixing of directions === | |||
The angular dynamics is not confined: under iteration of the product | |||
<math display="block"> | |||
T_n T_{n-1} \cdots T_1, | |||
</math> | |||
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: | |||
<math display="block"> | <math display="block"> | ||
\ | \lim_{n\to\infty} \frac{1}{n} \log \|\Pi_n\| = \gamma > 0, | ||
\ | |||
</math> | </math> | ||
where <math>\gamma</math> 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 | |||
<math display="block"> | <math display="block"> | ||
\ | T_n = | ||
\begin{pmatrix} | |||
V_n-\epsilon & -1 \\ | |||
1 & 0 | |||
\end{pmatrix}. | |||
</math> | </math> | ||
=== (i) Stretching === | |||
We first verify that each matrix expands at least one direction. | |||
For a generic <math>2\times2</math> matrix, the maximal stretching factor is controlled by the largest eigenvalue of <math>T_n^T T_n</math>. Here | |||
<math display="block"> | |||
T_n^T T_n = | |||
\begin{pmatrix} | |||
(V_n-\epsilon)^2+1 & -(V_n-\epsilon) \\ | |||
-(V_n-\epsilon) & 1 | |||
\end{pmatrix}. | |||
</math> | |||
The trace is | |||
<math display="block"> | |||
\mathrm{Tr}(T_n^T T_n) = (V_n-\epsilon)^2 + 2, | |||
</math> | |||
and the determinant is | |||
<math display="block"> | |||
\det(T_n^T T_n) = \det(T_n)^2 = 1. | |||
</math> | |||
Therefore the eigenvalues satisfy | |||
<math display="block"> | |||
\lambda_+ \lambda_- = 1, | |||
</math> | |||
and the largest one obeys | |||
<math display="block"> | |||
\lambda_+ \ge 1. | |||
</math> | |||
More precisely, as soon as <math>V_n-\epsilon \neq 0</math>, one has | |||
<math display="block"> | |||
\lambda_+ > 1. | |||
</math> | |||
Thus each matrix expands at least one direction, except for the fine-tuned case <math>V_n=\epsilon</math>, 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 | |||
<math display="block"> | |||
\theta_n = \arctan\!\left(\frac{\psi_{n-1}}{\psi_n}\right), | |||
</math> | |||
which represents the direction of the vector <math>(\psi_n,\psi_{n-1})</math>. | |||
The transfer matrix induces the map | |||
<math display="block"> | |||
\theta_{n+1} = | |||
\arctan\!\left(\frac{1}{V_n-\epsilon-\tan\theta_n}\right). | |||
</math> | |||
For fixed <math>\theta_n</math>, this expression depends continuously on the random variable <math>V_n</math>. 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 <math>\theta_n</math> is not confined to a finite set of directions: under iteration of the product | |||
<math display="block"> | |||
T_n T_{n-1} \cdots T_1, | |||
</math> | |||
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, | |||
<math display="block"> | |||
\lim_{n\to\infty} \frac{1}{n}\log \|\Pi_n\| = \gamma > 0, | |||
</math> | |||
so the Lyapunov exponent is positive for generic disorder. | |||
--- | --- | ||
Revision as of 00:37, 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
.
The disorder variables are independent random variables drawn from the box distribution
In one dimension the single-particle Hamiltonian corresponds to a tridiagonal matrix
We study the statistical properties of the eigenvalue problem
---
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
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.
---
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.