Skip to main content

Part 0· SCC Hero · T14

T14 — Gradient Flow Convergence (Łojasiewicz)

updated 616 words2 min read

Hero · W4 Capstone group · Cat A. Source: C-0014 / P-0014. Verification: E-0020:E-0022. Canonical version: CV-1.0. Full proof: Canonical Spec — Part 5 · §13.

Statement

The projected gradient flow on the constraint manifold Σm\Sigma_m,

u˙=ΠΣmE(u),\dot u = -\Pi_{\Sigma_m} \nabla \mathcal{E}(u),

starting from any u0Σmu_0 \in \Sigma_m, converges to a critical point of EΣm\mathcal{E}|_{\Sigma_m}.

When the energy is analytic — equivalently, when the distinction parameter bD=0b_D = 0 (or ε\varepsilon-smoothed) so that the absolute value |\cdot| in the gradient indicator gtg_t is replaced by an analytic surrogate — convergence is exponential, with rate determined by the Łojasiewicz–Simon inequality.

Projected gradient flow on the constraint manifold Σ_m (here n = 3 simplex with mass m = 1). Trajectories from various initial points (open circles) descend to critical points (filled squares). The uniform field u ≡ c at the centroid is a saddle (star); corner-region attractors are non-trivial minimizers.

Proof idea

Convergence to critical point. Three standard ingredients:

  1. Bounded below. E\mathcal{E} is bounded below on the compact manifold Σm\Sigma_m (by T1).
  2. Monotone decrease. Gradient flow decreases energy: ddtE(u(t))=ΠΣmE(u(t))20\frac{d}{dt}\mathcal{E}(u(t)) = -\|\Pi_{\Sigma_m}\nabla \mathcal{E}(u(t))\|^2 \leq 0.
  3. LaSalle / accumulation. Compactness of Σm\Sigma_m ensures accumulation points; monotone decrease forces the gradient to vanish at any accumulation point; therefore accumulation points are critical points of EΣm\mathcal{E}|_{\Sigma_m}.

Exponential rate via Łojasiewicz. For analytic functions on compact semi-algebraic sets (which includes Σm\Sigma_m), the Łojasiewicz–Simon inequality holds: for some θ(0,1/2]\theta \in (0, 1/2] and C>0C > 0,

E(u)E(u)1θCΠΣmE(u)|\mathcal{E}(u) - \mathcal{E}(u^*)|^{1-\theta} \leq C \|\Pi_{\Sigma_m}\nabla \mathcal{E}(u)\|

near any critical point uu^*. Combined with the gradient flow equation, this gives:

  • If θ=1/2\theta = 1/2: exponential convergence, u(t)uCeλt|u(t) - u^*| \leq C e^{-\lambda t}.
  • If θ<1/2\theta < 1/2: polynomial convergence u(t)uCtθ/(12θ)|u(t) - u^*| \leq C\, t^{-\theta/(1-2\theta)}.

The analyticity requirement is non-trivial: the absolute value in the original gtg_t definition breaks analyticity. Setting bD=0b_D = 0 in the distinction operator (or smoothing) is required for the Łojasiewicz machinery, which is why bD=0b_D = 0 is a fixed commitment of the theory (CN13 / Part 4 §11.1 #13).

\square

Why this is a hero

T14 is the dynamical existence theorem. T1 secures static existence of minimizers; T14 secures that the minimizers are reachable by gradient descent. Without T14, the variational framework would be a description of fixed points without a constructive route — minimizers might exist but be inaccessible.

The Łojasiewicz inequality is the workhorse: it guarantees that gradient flow on analytic energies on compact semi-algebraic sets does not get stuck in slow drifts or exhibit pathological convergence. This is far stronger than what generic smooth functions provide.

The analyticity requirement is also load-bearing for SCC's design choices. The decision to set bD=0b_D = 0 (the gradient term in the distinction operator) was driven specifically by T14: keeping the explicit gradient term breaks analyticity, breaks Łojasiewicz, breaks T14, and breaks dynamic accessibility of minimizers. Boundary sensitivity (axiom D-Ax3) is preserved through the spatial structure of Pt(1u)P_t(1-u) instead — a clean architectural trade-off.

Logical dependencies

  • Builds on: T1 (energy bounded below on compact Σm\Sigma_m), analyticity of energy (bD=0b_D = 0 commitment), Łojasiewicz–Simon for analytic functions on compact semi-algebraic sets.
  • Builds into: T-Persist-1(b) (basin escape uses gradient flow + Łojasiewicz), T-PreObj-1 (gradient flow attracts to multi-peak F≥2 — explicit dynamic statement requiring T14 to make sense), every implementation that runs scc/optimizer.py find_formation (relies on T14 guaranteeing convergence).

See also