Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Local formula for distance from the centre of a normal neighbourhood

Statement

Assume ACω. Let (M,g) be a connected Riemannian manifold without boundary, and suppose expp:Bρ(0p)U is a diffeomorphism, where ρ>0. Then, for every vBρ(0p), dg(p,expp(v))=vgp.

More sharply, every piecewise C1 competitor from p to expp(v) whose image is not contained in U has length strictly greater than vgp.

Thus an exponential normal ball of radius s<ρ is exactly the intersection of U with the open dg-ball of radius s centred at p; the displayed equality itself makes no assertion about points of that metric ball lying outside U.

Facts & Assumptions

Given: The connected boundaryless Riemannian manifold, normal exponential ball, and vector in the statement.

[A1]
[F1]

Under [A1], Radial geodesics minimize length in a normal neighborhood says that the radial segment to expp(w) has length wgp and minimizes among piecewise smooth curves contained in U. Riemannian distance on a connected manifold defines dg as the infimum of lengths of all piecewise C1 curves between its endpoints. These two competitor classes are not silently identified.

Proof

technique · direct
1.1

Put R=vgp and q=expp(v). By [F1], the radial segment texpp(tv) has length R, so the infimum defining distance satisfies dg(p,q)R.

F1given
1.2

Fix s with 0<s<ρ, and put Us=expp(Bs(0p)) and Ks=expp(Bs(0p)). If dimM=n1, instantiate one basis of TpM and apply [F2] to make it orthonormal. Its coordinate isometry identifies Bs(0p) with the closed Euclidean s-ball, which is compact; continuity of the coordinate inverse and of expp makes Ks compact. If n=0, the closed tangent ball is the singleton {0p} and the same conclusion is immediate. Since a manifold is Hausdorff, [F2] makes Ks closed in M. Moreover Us is open, UsKsU, and injectivity of expp gives KsUs=expp({w:wgp=s}).

F2given
1.3

We first bridge the two competitor classes in [F1]. Let d:[u,w]U be any piecewise C1 curve from p to expp(z) and put S=zgp>0 and h(t)=expp1(d(t))gp. For 0<δ<S, continuity and [F4] give a time with h=δ; its level set is nonempty, closed in [u,w], and compact, so [F4] gives its greatest time τδ. One has h(t)>δ on (τδ,w], since a later value at most δ would cross the level again before h(w)=S. Thus d avoids p throughout [τδ,w]. Subdivide this interval at its finitely many C1 breakpoints. On each resulting piece, smoothness of r away from p, the C1 chain rule and the polar identity in [F4] give dg2=(h)2+dg2, hence dgh. Integrating on each nondegenerate piece using [F4], summing, and telescoping the radial increments yields Lg(d)Lg(d[τδ,w])h(w)h(τδ)=Sδ. This holds for every δ(0,S), so Lg(d)S. For S=0 the same bound is simply nonnegativity of length. No derivative of r at p has been used.

F4F3given
2.1

Let c:[a,b]M be any piecewise C1 curve from p to q. If its image is contained in U, step 1.3 gives Lg(c)R. Suppose instead that it leaves U, and choose the explicit radius s=(R+ρ)/2, so R<s<ρ. The set E=c1(MUs) is nonempty because a point outside U is outside Us; it is closed in [a,b] because Us is open. By [F3], E has a least element τ. Since c(a)=pUs and Us is open, τ>a.

F3step 1.2step 1.3given
3.1

For every t<τ one has c(t)UsKs, while c(τ)Us. Continuity gives c(τ)Us, and the closed set Ks contains Us, so c(τ)KsUs. Thus c(τ)=expp(w) for a unique w with wgp=s, and the prefix c[a,τ] is piecewise C1 and lies in KsU. Applying the piecewise C1 estimate in step 1.3 to this prefix gives Lg(c)Lg(c[a,τ])s>R. Hence every competitor from p to q has length at least R.

step 1.2step 1.3step 2.1
4.1

Steps 2.1--3.1 cover respectively the competitors contained in U and those leaving it, and step 3.1 gives the promised strict inequality in the latter case. Combining the lower bound for all competitors with step 1.1 gives dg(p,q)=R, including R=0, where injectivity gives q=p and the radial curve is constant.

F1step 1.1step 1.3step 2.1step 3.1
5.1

For 0<s<ρ, the equality just proved says Us=UBdg(p,s): a point of U has the unique form expp(w) and belongs to either side exactly when wgp<s. Empty M supplies no centre; in dimension zero only v=0 occurs, and dimension one is already covered by the closed-interval Euclidean ball. The endpoints v=ρ and s=ρ are excluded by the open normal ball, while v=0 was handled in step 4.1. Assumption [A1] is used through [F1] for the radial upper bound and [F4] for the polar lower bound; the one orthonormal basis at the fixed point and the unique last-crossing and first-exit times require no additional choice. There is no iff claim.

A1F1F2F3F4step 1.2step 1.3step 4.1

Source locator

Datar, preceding minimality argument on p.137 and Proposition 19.1.2 on p.140. The source states that geodesic balls are metric balls; the proof above isolates the pointwise formula and supplies the first-exit compactness details.

Depends on

Used by

Dependency tree · two levels

109 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