Prerequisites: Chapter 3 (Relational Field).
4.1 Induced Weighted Graph
The scalar part of the relational field defines a weighted graph. The definition of a fruit depends only on this graph (it is gauge-independent).
Definition 4.1 (Induced weighted graph). where .
4.2 Volume, Cut, Conductance
Definition 4.2 (Graph quantities). For non-empty :
Volume:
Cut:
Conductance (Cheeger ratio):
4.3 Properties of Conductance
Lemma 4.3 (Basic properties).
(i) Symmetry: .
(ii) Non-negativity: ; equality iff is an isolated component.
(iii) Upper bound: .
(iv) Gauge invariance: for all .
Proof. (i) by symmetry of ; the in the denominator is symmetric.
(ii) The numerator is a sum of non-negative terms; it vanishes iff for all .
(iii) Volume decomposition: , so ; similarly for .
(iv) By Lemma 3.5, and are gauge-invariant, hence so is .
4.4 Definition of a Fruit
Axiom 4.4 (Fruit threshold). Fix a constant , the "cohesion standard".
Smaller demands stronger cohesion:
- : only strongly cohesive fruits.
- : even weakly cohesive sets count.
Definition 4.5 (Fruit). is a fruit at time if:
(F1) Non-trivial minority: .
(F2) Low conductance: .
Definition 4.6 (Fruit set).
4.5 Basic Properties of Fruits
Proposition 4.7 (Properties).
(i) (finite).
(ii) is gauge-invariant (Lemma 4.3(iv)).
(iii) , (by (F1)).
(iv) Fruits may overlap: is possible.
(v) does not imply .
Proof. (i)--(iii) immediate. (iv) Consider three dense clusters with pairwise overlap. (v) If , then violates (F1).
4.6 Connectivity of Fruits
Definition 4.8 (Minimal fruit). A fruit is minimal if no proper non-empty subset of is itself a fruit.
Lemma 4.9 (Connectivity of minimal fruits). [Corrected] Every minimal fruit is connected in the induced subgraph .
Proof. Suppose is a minimal fruit and is a non-trivial partition with no edges between and inside . We derive a contradiction.
Step 1. Since there are no internal edges between and :
and in particular, for each component ():
(the zero comes from no -- edges). So:
Step 2 (Both components satisfy (F2)). We show that both and satisfy the energy ratio condition (F2). From Theorem A (energy isolation), the internal energy of satisfies:
Since and are disconnected within , the internal energy of decomposes exactly:
The volume likewise decomposes: . We claim that for each :
Indeed, suppose for contradiction that one component, say , has ratio . Then:
where the last inequality uses . This contradicts Theorem A. So both components satisfy (F2), giving for each :
Step 3 (At least one component satisfies (F1)). Since and both volumes are positive, at least one component---say ---satisfies , which is condition (F1).
Conclusion. By Step 2, satisfies (F2). By Step 3, satisfies (F1). Therefore:
So is a fruit---contradicting the minimality of .
Corollary 4.10 (Connectivity of general fruits). Every fruit contains a connected sub-fruit. In particular, every "meaningful" (minimal) fruit is connected.
Proof. Any fruit either is minimal (hence connected by Lemma 4.9) or contains a proper sub-fruit. Iterating produces a minimal sub-fruit, which is connected.
4.7 Spectral Characterisation
Definition 4.11 (Normalised Laplacian). where and . Eigenvalues: .
Discrete Cheeger Inequality
Theorem 4.12 (Discrete Cheeger inequality; Fact B.3). For the Cheeger constant :
Proof sketch.
Lower bound (). Use the variational characterisation of and test with the normalised indicator of any set :
Then and the Rayleigh quotient satisfies .
Upper bound (). Sweep the level sets of the second eigenvector and apply the discrete coarea inequality (Alon--Milman).
Spectral Approximation
Corollary 4.13 (Spectral signature of fruits). If a fruit exists with , then for some , and the normalised indicator of is approximated to accuracy by a linear combination of the first eigenvectors.
Proof sketch. The Rayleigh quotient of 's indicator is . By min-max, for some . Davis--Kahan's theorem (Fact B.4) bounds the angle.
4.8 Energy Isolation (Theorem A)
Theorem A (Energy isolation). For any fruit :
Proof.
Step 1. Volume decomposition:
Step 2. By (F2), . By (F1), . Thus:
Step 3. . Divide by .
Sharpness. Equality holds when and .
4.9 Metastability (Theorem D)
Definition 4.14 (Random walk). Transition matrix: . Lazy version: .
Theorem D (Metastability). Let (the stationary distribution restricted to ). The escape time from under satisfies:
Proof.
Step 1. Define the restricted sub-stochastic matrix for (zero otherwise). Row sums are (leakage). The lazy version is .
Step 2. Let denote the conductance of viewed as a chain on with absorbing boundary. By the Sinclair--Jerrum bound (Fact B.6), the spectral gap satisfies .
Step 3. The internal conductance is bounded by the external conductance: . This is because any internal cut either has the same cut value as a cut of (contributing to ), or the absorbing boundary provides additional "leakage" but does not reduce conductance.
Step 4. For the lazy chain, the spectral gap is .
Step 5. The expected absorption time (escape time) from the stationary distribution satisfies the standard bound (see Levin--Peres--Wilmer, Theorem 12.4):
Interpretation. A random walk starting inside a fruit remains trapped for steps. For , the expected escape time is at least 10 steps.