Alphabeta Math
PropositionStatement: AI-generatedProof: AI-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Point convergence for compact analytic periodic gradient flows

Statement

Assume countable choice. Let V be a nonempty finite set, TV=RV/(2πZ)V the finite phase torus with its flat metric, and U:TV→R a real analytic potential: in every angular chart it is locally represented by a convergent real power series. Let q:[0,∞)→TV be a C1 downward gradient trajectory, meaning q′(t)=−grad⁡U(q(t)) for t>0, with the corresponding right derivative at zero. The gradient is the metric dual of dU, and a critical point is a point where this gradient vanishes. Then q has finite length on a sufficiently late tail and converges to one critical point. A global rotation direction may be neutral; no isolated-critical-point assumption is made.

For 0≤a≤b<∞, write ℓ(a,b)=∫ab∥q′(t)∥ dt for the finite-interval Riemannian length in the flat metric. The length of the tail starting at a is ℓ(a,∞)=sup⁡b≥aℓ(a,b), with value +∞ allowed.

Facts & Assumptions

[F1]

The phase torus is a compact metric space, its angular charts have Euclidean metric, and its metric distance is bounded by the length of a piecewise C1 curve joining its endpoints (Finite phase tori, local lifts and the flat metric).

[F2]

Near any point z of a finite-dimensional Euclidean analytic potential f, there are a neighborhood and constants c>0 and 0<ρ<1 such that ∥∇f(x)∥≥c∣f(x)−f(z)∣ρ. The positive exponent follows from the stated inequality by shrinking the neighborhood and increasing its exponent if necessary (Łojasiewicz inequality and analytic point stability).

[F3]

Along a downward gradient curve, energy is nonincreasing and its derivative is minus the squared gradient norm. If the energy is bounded below, it has a finite limit and the squared speed has finite integral over the positive half-line (Energy dissipation along a downward gradient curve, The Riemannian gradient is the metric dual of the differential).

[F5]

Positive real powers have their usual derivatives, the scalar chain rule applies to differentiable compositions, and the fundamental theorem integrates a continuously differentiable function on a compact interval (Continuity and derivatives of positive-base real powers, Sum, product, quotient, and chain rules from difference quotients, The fundamental theorem of calculus and integration by parts).

[F6]

Countable choice permits the countable selections used below (The Axiom of Countable Choice (AC_ω)).

[F7]

A real analytic germ in m≥1 real variables has an absolutely convergent local power series whose coefficients give a holomorphic complexification on a smaller polydisc. Every holomorphic function on an open subset of Cm is smooth in all its real coordinates; restriction to the real slice is therefore smooth (Real analytic germs in several variables, Holomorphic functions of several variables are smooth and their complex derivatives are holomorphic).

[F8]

The Riemannian speed of a C1 curve is g(q′,q′) and its finite-interval length is the integral of this speed. For the flat metric these are ∥q′∥ and ℓ(a,b) (Riemannian speed and length).

[F9]

Real powers use 0α=0 for α>0 and obey (xr)s=xrs for x>0. A continuous function on a closed real interval, differentiable in its interior, satisfies the mean value theorem (Real powers for positive bases, with the zero-base positive-exponent convention, The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents, Mean value theorem on a closed real interval).

Proof

Given: The torus, analytic potential, and downward gradient trajectory in the Statement.

Goal: Prove finite tail length and convergence to a critical point.

1.1givenF1F3F7

At every point choose an angular chart and put m=∣V∣≥1. The coordinate potential is a real analytic germ in m variables. By [F7], its absolutely convergent series defines a holomorphic complexification on a smaller complex polydisc. The smoothness supplier applies on that open polydisc. Restricting its successive real coordinate difference quotients to the real slice shows that all real coordinate derivatives of the potential exist and are continuous there. Thus U is smooth. In the flat angular metric its gradient coordinates are the first partial derivatives of U, by [F3], so the gradient is smooth as well. Consequently U and its gradient are continuous globally, and the smooth-potential hypothesis of [F3] holds.

1.2F5F9algebra

For α>0, [F5] gives (xα)′=αxα−1>0 on (0,∞). Applying the mean value theorem in [F9] on each closed positive interval proves strict monotonicity. Given ε>0, set δ=ε1/α>0. The iterated-power law gives δα=ε, so 0<x<δ implies 0<xα<ε. Together with 0α=0, this proves continuity from the right at zero and xα→0 as x↓0. It applies in particular to α=1−ρ>0.

2.1givenF1F3F4F6step 1.1choose

By compactness and [F4], U is bounded below. Put E(t)=U(q(t)) and L=lim⁡t→∞E(t). By [F3], E(t)≥L and ∫0∞∥q′(t)∥2dt<∞. For each positive integer n, the integral over [n,n+1] tends to zero as n→∞; choose sn∈[n,n+1] with ∥q′(sn)∥2 no larger than that integral. Such a point exists by continuity, since otherwise the integral would exceed itself.

3.1F1F3F4step 1.1step 2.1

By sequential compactness, a subsequence of q(sn) converges to some p∈TV. Since q′=−grad⁡U and the gradient is continuous, step 2.1 gives grad⁡U(p)=0. Continuity of U and sn→∞ give U(p)=L. Restricting to this subsequence, write its times as tn.

4.1F1F2step 3.1choose

Choose an angular chart centered at p and a closed metric ball of radius r>0 around p inside that chart and inside a neighborhood where [F2] applies to the coordinate representation of U. Because the chart metric is Euclidean, the Euclidean gradient norm in [F2] equals the flat gradient norm. Thus there are c>0 and 0<ρ<1 such that ∥grad⁡U(x)∥≥c∣U(x)−L∣ρ throughout this ball.

5.1F3F5F8step 4.1step 1.2algebra

Write e(t)=E(t)−L≥0. While q stays in the ball and e>0, the chain rule, [F3], [F5], and step 4.1 give −ddte(t)1−ρ≥c(1−ρ)∥q′(t)∥. By [F8], integration therefore bounds the length between any two such times a<b by [e(a)1−ρ−e(b)1−ρ]/[c(1−ρ)]. If e first reaches zero, monotonicity and e≥0 make it zero thereafter; [F3] then makes the gradient and speed zero thereafter. By step 1.2 the energy-power term tends to zero as the upper endpoint approaches that first zero T. Continuity of the speed at T gives a bound K on a small one-sided neighborhood, so ∫bT∥q′(t)∥ dt≤K(T−b)→0 as b↑T. Taking these limits extends the length bound across that time. If e(a)=0 initially, the curve is already stationary and the bound is zero.

6.1F1F8step 3.1step 1.2step 5.1choose

Since q(tn)→p and e(tn)→0, choose n so that d(q(tn),p)+e(tn)1−ρ/[c(1−ρ)]<r. If the curve ever left the ball after tn, continuity would give a first time on its boundary. The distance from q(tn) to that boundary point is at most the intervening length, which step 5.1 bounds by e(tn)1−ρ/[c(1−ρ)]; the triangle inequality then contradicts its distance r from p. Hence the whole tail stays in the ball. Taking the supremum of its finite-interval lengths gives ℓ(tn,∞)≤e(tn)1−ρ/[c(1−ρ)]<∞.

7.1F1F8step 3.1step 1.2step 5.1step 6.1∎

The estimate in step 5.1 applies to every later pair of times, so ℓ(a,∞) for a≥tn is at most e(a)1−ρ/[c(1−ρ)], which tends to zero by step 1.2. For any t≥tn and any later subsequence time tj≥t, the distance d(q(t),q(tj)) is at most this remaining length. Letting j→∞ and using q(tj)→p proves d(q(t),p)→0 as t→∞. Thus the trajectory converges to the critical point p and has finite tail length.

Depends on

Used by · 3

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.