Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-30
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.

Cut time in a unit tangent direction

Definition

Assume countable choice, as in The Axiom of Countable Choice (ACω). Let (M,g) be a complete, connected, boundaryless Riemannian manifold, let p∈M, and let v∈TpM be a unit vector. Hopf–Rinow (Hopf–Rinow theorem) makes the radial geodesic γv(t)=exp⁡p(tv) defined for every t∈R. Its cut time is

cp(v):=sup⁡{t>0:dg(p,exp⁡p(tv))=t}∈(0,+∞].

We write c(v) when p is fixed. The set in the supremum is nonempty: Sufficiently short geodesic segments are uniquely minimizing gives equality for every sufficiently small t>0. The value +∞ is allowed when every positive radial segment minimizes. This definition alone does not assert that a finite supremum is attained.

For a zero-dimensional manifold the unit sphere in each tangent space is empty, so there are no directions on which to evaluate cp. In dimension one the two unit directions, when present, are treated separately by the same formula. The only choice assumption here is the declared ACω carried by the cited global and local geodesic results; fixing one p and v makes no use of a choice function on a family of directions and does not invoke full AC.

Depends on

Used by

Dependency tree · two levels

35 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