← Latest papers
🔢 mathematics

Shortest Geodesic Loops, Sectional Curvature, and Injectivity Radius of the Stiefel Manifold

This paper determines the length of the shortest nontrivial geodesic loops and the exact injectivity radius of the Stiefel manifold under a one-parameter family of Riemannian metrics by combining existing and new bounds on sectional curvature.

Original authors: Jakob Stoye, Simon Mataigne, P. -A. Absil, Ralf Zimmermann

Published 2026-06-24
📖 5 min read🧠 Deep dive

Original authors: Jakob Stoye, Simon Mataigne, P. -A. Absil, Ralf Zimmermann

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine the Stiefel manifold not as a scary math equation, but as a vast, multi-dimensional playground made of "orthogonal frames." Think of these frames as rigid, right-angled scaffolds floating in space. Mathematicians and data scientists use this playground to solve complex problems, from optimizing robot movements to analyzing statistical data.

To navigate this playground, you need a map and a set of rules for how to walk. In math, these rules are called metrics. The paper explores a whole family of these rulebooks, controlled by a single "dial" called β\beta.

  • Turn the dial to 0.5, and you get the "canonical" rules (the standard way).
  • Turn it to 1, and you get the "Euclidean" rules (the way we measure distance in flat, everyday space).
  • Turn it anywhere else, and you get a new, slightly warped version of the playground.

The authors of this paper wanted to answer three specific questions about this playground for every setting of the dial:

  1. How far can you walk in a straight line before you start looping back on yourself?
  2. How "curvy" is the playground?
  3. What is the maximum distance you can travel in a straight line before you are guaranteed to be taking the shortest possible path?

Here is the breakdown of their discoveries using simple analogies.

1. The Shortest Loop (The "Round-Trip" Problem)

Imagine you are walking on the surface of this playground. You start at a point, walk in a perfectly straight line (a geodesic), and eventually, the path curves back to bring you exactly where you started. This is a geodesic loop.

The paper asks: What is the shortest distance you can walk to return to your starting point?

  • The Discovery: The authors found a simple formula for the length of this shortest loop, depending on how you turned the β\beta dial.
    • If the dial is set low (small β\beta), the loop is shorter.
    • If the dial is set high (large β\beta), the loop is longer.
    • Specifically, the length is either 2π2\pi (about 6.28 steps) or 2β×2π\sqrt{2\beta} \times 2\pi, whichever is smaller.
  • The Analogy: Think of the playground as a giant, flexible trampoline. If you stretch the trampoline one way (changing β\beta), the distance it takes to walk a full circle around a bump changes. The authors calculated exactly how much that distance changes for every possible stretch.

2. The Curvature (The "Hilliness" of the Ground)

To know how far you can walk safely, you need to know how curvy the ground is. In math, this is called sectional curvature.

  • If the ground is very curvy (like a tiny sphere), you might loop back on yourself very quickly.

  • If the ground is flatter, you can walk further.

  • The Discovery: Previous research had a "gap" in their knowledge. They knew how curvy the ground was for some settings of the dial, but not for the middle range (specifically between certain values of β\beta).

  • The Fix: The authors filled this gap. They calculated the exact maximum "hilliness" for the missing middle range. They proved that for these settings, the ground is never more curvy than a specific limit (a value of 1). This is crucial because the curvier the ground, the sooner you might get lost or loop back.

3. The Injectivity Radius (The "Safe Walking Zone")

This is the most important result. The injectivity radius is the "Safe Walking Zone." It is the maximum distance you can walk in a straight line from your starting point and be 100% sure that you are taking the shortest possible path to your destination.

  • The Problem: If you walk too far, the "straight" line might curve around the playground and meet another "straight" line coming from the other direction. At that point, your path is no longer the unique shortest one.
  • The Discovery: By combining their new loop measurements and their new curvature maps, the authors determined the exact size of this Safe Walking Zone for almost all settings of the dial.
    • For low and high settings: They found the exact number. For example, if you set the dial to 0.5 (the standard way), the safe zone is exactly π\pi (half the loop length).
    • For the middle settings: They couldn't find the exact number, but they narrowed it down to a very tight interval. They proved the safe zone is definitely between two specific values, and the true value is likely right in the middle (within a 3% margin of error).

The "Klingenberg" Rule

The paper relies on a famous mathematical rule (Klingenberg's theorem) which acts like a traffic light:

  • Green Light: If the ground isn't too curvy, your safe walking distance is determined by how far you have to walk to complete a loop.
  • Yellow Light: If the ground is very curvy, your safe walking distance is determined by the curvature itself.

The authors used their new data to flip the switch on this rule for the Stiefel manifold, finally giving us the precise "traffic limits" for this mathematical playground.

Summary

In short, this paper is a comprehensive survey of a complex mathematical shape. The authors:

  1. Measured the shortest "round-trip" distance for every possible version of the shape.
  2. Mapped the maximum "curvature" (bumpiness) for every version, filling in a missing piece of the puzzle.
  3. Combined these to define the exact "safe walking distance" (injectivity radius) for almost all versions, telling us exactly how far we can go before the rules of "shortest path" break down.

This is vital for anyone using this shape for optimization or data science, as it tells them the limits of their algorithms before they start making mistakes by taking non-optimal paths.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →