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.
Relative path-shortening connectivity from index bounds
Statement
Assume AC. Let be or a Clifford centriole with normalized trace metric and indicated antipodal pole pair in one component. In a fixed endpoint-path component suppose every geodesic which is not energy-minimizing in that component has index at least . Then the inclusion of constant-speed minimizing geodesics into the path space, and into the continuous compact-open path space, is -connected: every map of a finite CW pair with , taking to the minima, deforms relative to into the minima.
Facts & Assumptions
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).
Bounded short-edge polygon energies have compact sublevels, finitely many clean critical manifolds, and the same geodesic index as the path energy. (Clean energy critical manifolds in Clifford-centriole polygon spaces).
Critical manifolds with negative normal rank greater than the parameter dimension can be bypassed relatively; a small clean minimum neighborhood retracts onto its minimum locus. (Relative Morse–Bott crossing by negative normal disk bundles).
Proof
Given: The data and hypotheses in the Statement.
For a continuous compact family , joint continuity on gives a uniform mesh whose edges lie in convex balls. Replace each edge by its unique shortest geodesic and interpolate pointwise using the short geodesic joining the old and new values. With a sufficiently fine mesh this fixes all constant-speed minimizing geodesics, so fixes the prescribed map on . The resulting polygon energy has a finite bound by compactness. Refine the mesh by a multiple until , where is a convexity radius. This refinement changes neither the polygon paths nor their energy, and places the family in the compact polygon sublevel of [F1].
The same operations preserve and depend continuously in its topology. On a convex coordinate ball they are compositions with smooth maps whose first two derivatives are bounded on a compact neighborhood. The one-dimensional estimate and the chain rule give continuity: the derivative difference is bounded by a constant times the difference plus the difference times a bounded derivative. The estimate follows by writing and choosing with . Compact families therefore have a uniform convex mesh. On an interval of length , Cauchy–Schwarz gives , so their polygon energies stay bounded.
Increase slightly to a regular value and refine the mesh if needed so that [F1] still gives a compact sublevel. List the finitely many critical values below this bound and choose regular levels separating them, enclosing every component at the same value in the same crossing band. The polygon domain is a finite-dimensional boundaryless manifold and all these closed bands are compact by [F1], so the precise crossing hypotheses of [F2] hold. Apply [F2] successively from the highest nonminimum level downwards. Every nonminimum handle has negative rank at least , so the family can bypass it relative to . It reaches a small minimum neighborhood, whose normal contraction takes it to the minimum locus and fixes . The endpoint path component and its minimum energy are retained throughout. This proves the claimed finite-CW relative connectivity in both topologies, without any assertion of a global deformation retraction or continuously convergent infinite-time flow.
Depends on
Used by
Dependency tree · two levels
19 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
- Eschenburg–Hanke, Bott–Thom isomorphism, Hopf bundles and Morse theory (2021), expanded local argument (standard reference, not scraped)