Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Clean energy critical manifolds in Clifford-centriole polygon spaces

Statement

Assume AC. Let P be SO(p) or a Clifford centriole Pl with the normalized trace metric, and let (o,q) be its indicated pole pair (I,−I) or (Jl,−Jl) in one component. For a fixed energy bound c, choose a convexity radius r>0 and a mesh n with c/n<r2. The short-edge polygon energy has compact sublevels in each path component. Its critical points are precisely sampled smooth constant-speed geodesics. Its Hessian has the same index and kernel as the path index form. The critical loci in a bounded sublevel form a finite union of compact Morse–Bott manifolds, with Hessian kernel equal to the tangent to the endpoint-fixing isotropy orbit.

Facts & Assumptions

[A1]

The Axiom of Choice is assumed; it implies the countable-choice assumptions in the differential-geometric suppliers. No stronger choice principle is introduced. (The Axiom of Choice).

[F1]

The spaces are compact totally geodesic matrix symmetric spaces; their ambient connection and curvature satisfy ∇XY=[X,Y]/2 and R(Y,X)X=−ad⁡X2Y/4. (Clifford centrioles and geodesic tangent conditions).

[F2]

For fixed endpoints, the Hessian of E=∫01∣γ′∣2 is twice the index form, including the correct piecewise endpoint and corner terms. (Second variation formula for energy, Integration by parts for the index form).

[F3]

Fixed-endpoint null fields of the index form are Jacobi fields; prescribed initial value and derivative determine a unique Jacobi field. Killing variations restrict to Jacobi fields. (Jacobi fields are the null solutions of the index form with fixed endpoints, Existence and uniqueness of jacobi fields from initial data, Killing fields restrict to Jacobi fields along geodesics).

[F4]

A map with invertible derivative admits a local inverse; the tubular-neighborhood theorem supplies the normal slices used here. (The Euclidean inverse function theorem, The tubular neighbourhood theorem in a smooth ambient manifold).

Proof technique: direct construction.

Given: The data and hypotheses in the Statement.

Proof

technique · direct construction
1.1A1F1F2construct

Put x0=o, xn=q, and let Qn be the open set of (x1,…,xn−1)∈Pn−1 with dist⁡(xj−1,xj)<r. Define En=n∑jdist⁡(xj−1,xj)2. On En≤c every edge length is at most c/n<r. Thus this sublevel is closed in the compact product and lies inside Qn. A fixed path component is closed here: sufficiently close vertex families yield pointwise short-geodesic homotopies. First variation at a vertex is twice the incoming velocity minus twice the outgoing velocity. Hence the critical polygons are exactly sampled smooth geodesics.

1.2F1F3algebra

For l≥1 write h={Z∈so(p):[Z,Ji]=0 (i<l)}, k={Z∈h:[Z,Jl]=0} and m={Z∈h:ZJl=−JlZ}. Then h=k⊕m, [m,m]⊆k, and TJlPl=mJl. Along γ(t)=exp⁡(tX)Jl, X∈m, the parallel curvature operator is −ad⁡X2/4 on m. It is nonnegative since ad⁡X is skew-adjoint for the trace metric. In a parallel eigenframe, a Jacobi field vanishing at zero is tV on the zero eigenspace and sin⁡(κt)V/κ on an eigenspace of eigenvalue κ>0. The terminal value vanishes precisely for the latter directions with κ∈πN.

2.1F2F3step 1.1algebra

At a critical geodesic decompose any endpoint-zero H1 field as W=J+Z, where J is the unique edgewise Jacobi field with the same vertex values and Z vanishes at every vertex. Short convex edges have no conjugate points, so those Jacobi interpolants exist uniquely. Integration by parts on every edge gives I(J,Z)=0. On the edgewise zero-vertex space the index form is positive definite: if Y is the Jacobi fundamental matrix with Y(0)=0 and Y′(0)=I, then before the first conjugate point S=Y′Y−1 is symmetric and satisfies S′+S2+R=0. Expanding ∣Z′−SZ∣2 and integrating gives I(Z,Z)=∫∣Z′−SZ∣2; the boundary terms vanish, first for smooth zero-endpoint fields and then by H1 approximation. Equality forces Z′=SZ and the zero terminal value forces Z=0. Thus the polygon Hessian is twice I on the interpolant space and has exactly the full Hessian's index and kernel.

3.1F1F3step 2.1step 1.2algebra

For such an eigenvector Y∈m put B=[X,Y]/(4κ)∈k. The identity ad⁡X2Y=−4κY gives [B,X]=Y. Conjugation of γ by exp⁡(sB) is a geodesic variation fixing both Jl and −Jl, with initial derivative YJl. By uniqueness it is the corresponding Jacobi field. Therefore all endpoint-zero Jacobi fields are tangent to the orbit of the compact centralizer of J1,…,Jl. For l=0 use conjugation in SO(p), which fixes I and −I, with the same bracket calculation. Its orbit is compact and embedded; its tangent is exactly the Hessian kernel by step 2.1.

4.1F4step 1.1step 3.1construct∎

Choose a normal slice to one such orbit. The Hessian on that slice is invertible. Apply the inverse theorem to the normal component of the differential of En in slice coordinates: its only zero near the zero section is the zero section. Hence the critical locus near that orbit is exactly the orbit, proving the Morse–Bott condition. The critical locus in a compact energy sublevel is compact, so finitely many such neighborhoods cover it. Each contains just one critical component; consequently there are finitely many components and critical values. No classification of all symmetric spaces or centriole chains is needed.

Depends on

Used by

Dependency tree · two levels

75 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources