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 is a group that is also a compact smooth manifold, with smooth group operations.
Examples.
- (abelian).
- (non-abelian).
- Finite groups (with discrete topology).
Fact B.1 (Bi-invariant metric). Every compact Lie group admits an -invariant inner product on its Lie algebra . The corresponding left-invariant Riemannian metric on is automatically bi-invariant. The geodesic distance satisfies:
Reference: Milnor, Curvatures of left invariant metrics on Lie groups, Adv. Math. 21 (1976), 293--329.
Fact B.2 (Tychonoff for finite products). If is compact and is a finite set, then is compact. Every continuous real-valued function on attains its minimum and maximum.
B.2 Spectral Graph Theory
Setup. Let be a weighted graph with symmetric weights . Set , , .
Definition. The normalised Laplacian is , with eigenvalues .
Fact B.3 (Discrete Cheeger inequality). For the Cheeger constant :
The lower bound follows from the variational characterisation of ; 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 theorem). Let have eigenvalues and let be the span of the first eigenvectors. If satisfies with , then the angle between and is .
B.3 Cheeger Constants and Conductance
Definition. For :
A set with is called a low-conductance set or (in our theory) a fruit.
Fact B.5 (Conductance and mixing time). For the lazy random walk , the mixing time satisfies:
where 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 , the spectral gap satisfies:
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 be a sequence of connections on a principal -bundle over a closed Riemannian 4-manifold with . Then, after passing to a subsequence and applying gauge transformations, converges smoothly on to a smooth connection , where for a universal constant . The bubble energies satisfy .
The discrete analogue:
- Bounded cut energy replaces the energy bound.
- The door threshold plays the role of .
- Door count parallels .
Reference: Uhlenbeck, Connections with bounds on curvature, Comm. Math. Phys. 83 (1982), 31--42.
B.5 Lojasiewicz--Simon Gradient Inequality
Fact B.8 (Lojasiewicz inequality, finite-dimensional). Let be a real-analytic function on a compact Riemannian manifold . For every critical value of , there exist and such that in a neighbourhood of :
Consequence. The negative gradient flow converges as , and the trajectory has finite length:
This is used in Theorem H to guarantee convergence of the discrete Yang--Mills gradient flow on the compact space .
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 -bundle assigns to each path in the base manifold a parallel transport map in . The curvature measures the failure of parallel transport around infinitesimal loops to be trivial.
In the discrete setting:
- An edge -label is the parallel transport from to .
- The holonomy around a triangle is .
- means the triangle is "flat" (transits are compatible).
- A gauge transformation changes the local frame at each node: .
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.