Puzzles

Inspired by a colleague's excellent example, I've collected a few mathy physics puzzles here, each encountered in different research projects. If you've solved some of them and want to hear more about the research behind the puzzle, reach out or come by my office!

Wilson loops on discrete paths

There's an important object in topology called the Wilson operator (or sometimes, the holonomy):

U(C)=PeiCA(k)dk. \bm{U}(\mathcal{C}) = \mathop{\mathrm{P}}\mathrm{e}^{\mathrm{i}\oint_{\mathcal{C}} \mathbf{A}(\mathbf{k})\cdot\mathrm{d}\mathbf{k}}.

Here, A(k)\mathbf{A}(\mathbf{k}) is a Hermitian matrix (the Berry connection) with elements Anm(k)=in(k)km(k)A_{nm}(\mathbf{k}) = \mathrm{i}\langle n(\mathbf{k})|\nabla_{\mathbf{k}}m(\mathbf{k})\rangle and n(k)|n(\mathbf{k})\rangle and m(k)|m(\mathbf{k})\rangle are Bloch states of momentum k\mathbf{k} in bands nn and mm (which ranges over some finite set of bands; even one band is interesting). The P\mathrm{P} denotes path-ordering, by which we mean that "earlier" points in the k-path C\mathcal{C} must occur "before" "later" points. More precisely, if the path C\mathcal{C} is closed, starting at a point k0\mathbf{k}_0 and ending at kN+1=k0\mathbf{k}_{N+1} = \mathbf{k}_0, we imagine passing through C\mathcal{C} by traversing ki\mathbf{k}_i in the order i=1,,Ni = 1, \ldots, N with NN \rightarrow \infty, and define the path-ordered exponential of a k-dependent operator O(k)\mathbf{O}(\mathbf{k}) by

PeiCA(k)dk=limNeiO(kN)δNeiO(k1)δ1ieiO(ki)δi, \mathop{\mathrm{P}}\mathrm{e}^{\mathrm{i}\oint_{\mathcal{C}} \mathbf{A}(\mathbf{k})\cdot\mathrm{d}\mathbf{k}} = \lim_{N\rightarrow\infty} \mathrm{e}^{\mathrm{i}\mathbf{O}(\mathbf{k}_N)⋅\bm{\delta}_N} \cdots \mathrm{e}^{\mathrm{i}\mathbf{O}(\mathbf{k}_1)⋅\bm{\delta}_1} \equiv \overleftarrow{\prod_i} \mathrm{e}^{\mathrm{i}\mathbf{O}(\mathbf{k}_i)⋅\bm{\delta}_i},

where δi=ki+1ki\bm{\delta}_i = \mathbf{k}_{i+1} - \mathbf{k}_i and δi0|\bm{\delta}_i| \rightarrow 0 as NN \rightarrow \infty.

Can you explain why this a meaningful definition. And why do we need to bother with specifying an ordering? Try to see if you can find any interesting properties of U(C)\bm{U}(\mathcal{C}) (there are many)!

Okay, finally, the real question. Suppose you discretize C\mathcal{C} in a finite but large number of steps (i.e., NN finite): can you find an asymptotically correct expression for U(C)\bm{U}(\mathcal{C}) which only involves matrix products of matrices M(ki,kj)\mathbf{M}(\mathbf{k}_i, \mathbf{k}_j) with elements Mnm(ki,kj)=n(ki)m(kj)M_{nm}(\mathbf{k}_i, \mathbf{k}_j) = \langle n(\mathbf{k}_i) | m(\mathbf{k}_j)\rangle. A good starting point is trying to rewrite eiA(ki)δi\mathrm{e}^{\mathrm{i}\mathbf{A}(\mathbf{k}_i)⋅\bm{\delta}_i} in terms of the matrices M(ki,kj)\mathbf{M}(\mathbf{k}_i,\mathbf{k}_j).

If you make it to the end: congratulations, you now have a gauge-invariant numerical scheme to calculate Berry phases (the arguments of the eigenvalues of U(C)\bm{U}(\mathcal{C}))!

More to come

This page remains a work-in-progress: more puzzles will be added some day :).

© Thomas Christensen. Built with Franklin.jl.