Skip to main content

Part 8· Appendix B

Appendix B — Prerequisites

This appendix collects the background facts used throughout the theory. Readers familiar with compact Lie groups, spectral graph theory, and basic gauge theory may skip to the main text.


B.1 Compact Lie Groups

Definition. A compact Lie group GG is a group that is also a compact smooth manifold, with smooth group operations.

Examples.

  • U(1)={eiφ:φR}S1U(1) = \{e^{i\varphi}:\varphi\in\mathbb{R}\}\cong S^1 (abelian).
  • SU(2)={AM2×2(C):AA=I,  detA=1}S3SU(2) = \{A\in M_{2\times 2}(\mathbb{C}):A^\dagger A=I,\;\det A=1\}\cong S^3 (non-abelian).
  • Finite groups (with discrete topology).

Fact B.1 (Bi-invariant metric). Every compact Lie group GG admits an Ad\mathrm{Ad}-invariant inner product ,\langle\cdot,\cdot\rangle on its Lie algebra g\mathfrak{g}. The corresponding left-invariant Riemannian metric on GG is automatically bi-invariant. The geodesic distance dGd_G satisfies:

dG(kgk,  khk)=dG(g,h)g,h,k,kG.d_G(k\,g\,k',\;k\,h\,k') = d_G(g,h) \quad\forall\,g,h,k,k'\in G.

Reference: Milnor, Curvatures of left invariant metrics on Lie groups, Adv. Math. 21 (1976), 293--329.

Fact B.2 (Tychonoff for finite products). If GG is compact and SS is a finite set, then GS=iSGG^S=\prod_{i\in S}G is compact. Every continuous real-valued function on GSG^S attains its minimum and maximum.


B.2 Spectral Graph Theory

Setup. Let G=(V,E,W)\mathcal{G}=(V,E,W) be a weighted graph with symmetric weights W(i,j)=W(j,i)0W(i,j)=W(j,i)\ge0. Set d(i)=jW(i,j)d(i)=\sum_j W(i,j), D=diag(d(i))D=\mathrm{diag}(d(i)), A=(W(i,j))A=(W(i,j)).

Definition. The normalised Laplacian is L=ID1/2AD1/2\mathcal{L}=I-D^{-1/2}AD^{-1/2}, with eigenvalues 0=λ1λ2λn0=\lambda_1\le\lambda_2\le\cdots\le\lambda_n.

Fact B.3 (Discrete Cheeger inequality). For the Cheeger constant h:=minSVϕ(S)h:=\min_{\emptyset\ne S\subsetneq V}\phi(S):

λ22    h    2λ2.\frac{\lambda_2}{2}\;\le\;h\;\le\;\sqrt{2\lambda_2}.

The lower bound follows from the variational characterisation of λ2\lambda_2; the upper bound uses the sweep-cut technique of Alon--Milman.

Reference: Chung, Spectral Graph Theory, CBMS Regional Conference Series 92, AMS, 1997.

Fact B.4 (Davis--Kahan sinΘ\sin\Theta theorem). Let L\mathcal{L} have eigenvalues λ1λn\lambda_1\le\cdots\le\lambda_n and let UkU_k be the span of the first kk eigenvectors. If ff satisfies RL(f)μR_{\mathcal{L}}(f)\le\mu with μ<λk+1\mu<\lambda_{k+1}, then the angle between ff and UkU_k is O(μ/(λk+1μ))O(\mu/(\lambda_{k+1}-\mu)).


B.3 Cheeger Constants and Conductance

Definition. For SV\emptyset\ne S\subsetneq V:

ϕ(S)=cut(S,Sˉ)min{vol(S),vol(Sˉ)}.\phi(S)=\frac{\mathrm{cut}(S,\bar S)}{\min\{\mathrm{vol}(S),\mathrm{vol}(\bar S)\}}.

A set SS with ϕ(S)θ\phi(S)\le\theta is called a low-conductance set or (in our theory) a fruit.

Fact B.5 (Conductance and mixing time). For the lazy random walk P~=12(I+D1A)\tilde P=\frac{1}{2}(I+D^{-1}A), the mixing time satisfies:

tmix(ϵ)    12ϕln12ϵt_{\mathrm{mix}}(\epsilon)\;\ge\;\frac{1}{2\phi}\ln\frac{1}{2\epsilon}

where ϕ\phi is the graph conductance.

Reference: Levin, Peres, Wilmer, Markov Chains and Mixing Times, AMS, 2009.

Fact B.6 (Sinclair--Jerrum conductance bound). For a reversible Markov chain with conductance Φ\Phi, the spectral gap γ\gamma satisfies:

Φ22    γ    2Φ.\frac{\Phi^2}{2}\;\le\;\gamma\;\le\;2\Phi.

Reference: Sinclair and Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Inform. Comput. 82 (1989), 93--133.


B.4 Uhlenbeck Compactness

The theory's treatment of doors and existence parallels Uhlenbeck's compactness theorem in continuous gauge theory.

Fact B.7 (Uhlenbeck compactness, informal). Let {Ak}\{A_k\} be a sequence of connections on a principal GG-bundle over a closed Riemannian 4-manifold MM with MFAk2E\int_M|F_{A_k}|^2\le E. Then, after passing to a subsequence and applying gauge transformations, AkA_k converges smoothly on M{p1,,pL}M\setminus\{p_1,\ldots,p_L\} to a smooth connection AA_\infty, where LE/ϵ0L\le E/\epsilon_0 for a universal constant ϵ0>0\epsilon_0>0. The bubble energies el=limr0limkBr(pl)FAk2e_l=\lim_{r\to0}\lim_{k\to\infty}\int_{B_r(p_l)}|F_{A_k}|^2 satisfy lelE\sum_l e_l\le E.

The discrete analogue:

  • Bounded cut energy cut(F,Fˉ)θvol(F)\mathrm{cut}(F,\bar F)\le\theta\cdot\mathrm{vol}(F) replaces the energy bound.
  • The door threshold τ\tau plays the role of ϵ0\epsilon_0.
  • Door count Σθvol(F)/τ|\Sigma|\le\theta\cdot\mathrm{vol}(F)/\tau parallels LE/ϵ0L\le E/\epsilon_0.

Reference: Uhlenbeck, Connections with LpL^p bounds on curvature, Comm. Math. Phys. 83 (1982), 31--42.


B.5 Lojasiewicz--Simon Gradient Inequality

Fact B.8 (Lojasiewicz inequality, finite-dimensional). Let f:MRf:M\to\mathbb{R} be a real-analytic function on a compact Riemannian manifold MM. For every critical value cc of ff, there exist C>0C>0 and α[12,1)\alpha\in[\frac{1}{2},1) such that in a neighbourhood of f1(c)f^{-1}(c):

gradf(x)    Cf(x)cα.\|\mathrm{grad}\,f(x)\|\;\ge\;C\,|f(x)-c|^\alpha.

Consequence. The negative gradient flow x˙=gradf(x)\dot x=-\mathrm{grad}\,f(x) converges as tt\to\infty, and the trajectory has finite length:

0x˙(t)dt  <  .\int_0^\infty\|\dot x(t)\|\,dt\;<\;\infty.

This is used in Theorem H to guarantee convergence of the discrete Yang--Mills gradient flow on the compact space GFG^{F^\circ}.

Reference: Lojasiewicz, Sur les trajectoires du gradient d'une fonction analytique, Seminari 1984, Univ. Bologna, 1984.


B.6 Parallel Transport and Discrete Connections

In continuous differential geometry, a connection on a principal GG-bundle assigns to each path in the base manifold a parallel transport map in GG. The curvature FAF_A measures the failure of parallel transport around infinitesimal loops to be trivial.

In the discrete setting:

  • An edge GG-label gt(i,j)Gg_t(i,j)\in G is the parallel transport from ii to jj.
  • The holonomy around a triangle (i,j,k)(i,j,k) is Ωt(i,j,k)=gt(i,j)gt(j,k)gt(k,i)\Omega_t(i,j,k)=g_t(i,j)\,g_t(j,k)\,g_t(k,i).
  • Ωt=e\Omega_t=e means the triangle is "flat" (transits are compatible).
  • A gauge transformation h:VGh:V\to G changes the local frame at each node: gth(i,j)=h(i)gt(i,j)h(j)1g_t^h(i,j)=h(i)\,g_t(i,j)\,h(j)^{-1}.

This is the standard framework of lattice gauge theory, originating in Wilson's formulation of lattice QCD.

Reference: Wilson, Confinement of quarks, Phys. Rev. D 10 (1974), 2445--2459.