Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge 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 locus of a point on a round sphere

Example

Assume exactly ACω through the declared dependencies. Let SRn={x∈Rn+1:⟨x,x⟩=R2},R>0,n≥2, with the Riemannian metric induced by the Euclidean inner product. For every p∈SRn and unit v∈TpSRn, the cut time is cp(v)=πR, and the cut locus is the singleton Cut⁡(p)={−p}.

Facts & Assumptions

Given: R>0, an integer n≥2, and a point p on the radius-R round sphere, with the metric induced from Rn+1.

[A1]

ACω is the countable-choice assumption of The Axiom of Countable Choice (ACω). It is used through the induced Levi-Civita connection, maximal-geodesic uniqueness, Hopf--Rinow, and the cut-time/cut-locus interfaces below. No full axiom of choice is used.

[F1]

The level set SRn=F−1(R2) for F(x)=⟨x,x⟩ is nonempty and regular: Ren+1∈SRn, and at every x∈SRn, dFx(x)=2R2≠0. Thus A regular level set is an embedded submanifold gives a smooth boundaryless n-manifold, while The tangent space of a regular level set is the kernel gives TxSRn=x⊥. The inclusion is an immersion, so Pullback of a riemannian metric is riemannian exactly for immersions and Riemannian metric and riemannian manifold make the restricted Euclidean inner product a Riemannian metric (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F2]

The radial scaling x↦x/R is a homeomorphism from SRn to the unit sphere Sn. Since n≥2, For n≥2, the sphere Sn−1 is path-connected and connected makes Sn, and hence SRn, connected. Nonemptiness and the boundaryless manifold property were checked in [F1].

[F3]

In Euclidean coordinates the ambient Levi-Civita derivative is ordinary differentiation (The euclidean levi civita connection). For an embedded submanifold, the induced connection is the tangential projection of the ambient derivative (Induced connection and second fundamental form); under [A1], The induced connection is Levi–Civita identifies it with the Levi-Civita connection of the induced metric.

[F4]

An affine geodesic satisfies Dtγ˙=0 (Geodesic of an affine connection). Under [A1], every initial tangent vector has a unique maximal geodesic (Existence uniqueness and smooth dependence of geodesics), and Geodesically complete Riemannian manifold means each such maximal domain is R.

[F5]

Under [A1], Hopf--Rinow says that a nonempty, connected, boundaryless Riemannian manifold is metrically complete exactly when it is geodesically complete (Hopf–Rinow theorem).

[F6]

On this connected manifold, distance is the infimum of lengths of piecewise-C1 joining paths, and length is the sum of the integrals of Riemannian speed over their smooth pieces (Riemannian distance on a connected manifold, Riemannian speed and length).

[F9]

Under the completeness, connectedness, boundaryless, and ACω hypotheses, the cut time is the supremum of the positive radial minimizing times and the cut locus consists of finite cut-time endpoints (Cut time in a unit tangent direction, Cut point and cut locus of a point).

Verification

technique · explicit great-circle geodesics and an angular length bound
1.1A1F1F2given

The defining function F(x)=⟨x,x⟩ has derivative dFx(w)=2⟨x,w⟩. Since x≠0 on SRn, this derivative is surjective onto R at every level-set point. By [F1], SRn is a nonempty, connected, boundaryless Riemannian n-manifold and TxSRn=x⊥.

1.2F7algebra

Fix q∈SRn and any piecewise-C1 path α:[0,1]→SRn from p to q. On each smooth piece put u(s)=⟨p,α(s)⟩/R2. Cauchy--Schwarz in [F7] gives ∣u∣≤1. Differentiating ∣α∣2=R2 gives ⟨α,α˙⟩=0, and hence u′=⟨p−uα,α˙⟩R2,∣p−uα∣=R1−u2,∣u′∣≤1−u2R∣α˙∣. For 0<ε<1, define θε=arccos⁡((1−ε)u). Its argument lies strictly between −1 and 1, so [F7] and the chain rule give ∣θε′∣=(1−ε)∣u′∣1−(1−ε)2u2≤(1−ε)1−u2R1−(1−ε)2u2∣α˙∣≤∣α˙∣R. The last inequality follows because 1−(1−ε)2u2−(1−ε)2(1−u2)=1−(1−ε)2≥0.

2.1A1F3F4F7step 1.1

Fix x∈SRn and w∈TxSRn. If w=0, the constant curve is a geodesic on all of R. Otherwise set a=∣w∣ and define γx,w(t)=cos⁡(at/R)x+Rasin⁡(at/R)w,t∈R. Since ⟨x,w⟩=0 and ∣x∣=R, ∣w∣=a, the trigonometric identity in [F7] gives ∣γx,w(t)∣=R; differentiating gives γx,w(0)=x, γ˙x,w(0)=w, ∣γ˙x,w(t)∣=a, and γ¨x,w(t)=−(a2/R2)γx,w(t). The acceleration is normal to the sphere, so its tangential projection vanishes. By [F3] this curve is an affinely parametrized geodesic. It is defined for every real t; uniqueness in [F4] identifies it with the maximal geodesic for (x,w). Therefore the sphere is geodesically complete.

2.2F6F7F8step 1.2algebra

On each smooth piece, [F8] yields ∣θε(b)−θε(a)∣≤∫ab∣θε′∣≤R−1∫ab∣α˙∣. Summing over the pieces and using the triangle inequality gives ∣θε(1)−θε(0)∣≤Lg(α)/R. As ε↓0, continuity of the principal inverse cosine in [F7] gives Rarccos⁡ ⁣(⟨p,q⟩R2)≤Lg(α). This lower bound holds for every competitor in [F6].

3.1A1F5F9step 1.1step 2.1

The nonempty, connected, boundaryless hypotheses follow from step 1.1. Hopf--Rinow [F5] and geodesic completeness from step 2.1 therefore make (SRn,dg) metrically complete, as required by [F9].

3.2F1F6F7step 2.1step 2.2

Put θ=arccos⁡(⟨p,q⟩/R2)∈[0,π]. Since ∣p∣=∣q∣=R and ⟨p,q⟩=R2cos⁡θ, ∣q−cos⁡θ p∣2=R2sin⁡2θ, so θ=0 implies q=p and θ=π implies q=−p. If 0<θ<π, define v=(q−cos⁡θ p)/(Rsin⁡θ). Direct inner-product calculation gives v∈p⊥ and ∣v∣=1. The geodesic in step 2.1 with initial data (p,v) reaches q at time Rθ and has unit speed. If θ=0 then q=p and the constant path has length zero. If θ=π then q=−p; because n≥2, p⊥ contains a unit vector v, and the same formula reaches −p at time πR with unit speed. Thus a path of length Rθ exists in every case. Combining this upper bound with step 2.2 proves dg(p,q)=Rarccos⁡ ⁣(⟨p,q⟩R2).

4.1A1F7F9step 2.1step 3.2

Let v∈TpSRn be any unit vector. Step 2.1 gives its radial geodesic γv(t)=cos⁡(t/R)p+Rsin⁡(t/R)v. Hence ⟨p,γv(t)⟩/R2=cos⁡(t/R), and step 3.2 gives dg(p,γv(t))=Rarccos⁡(cos⁡(t/R)). For 0<t≤πR, the inverse-cosine definition in [F7] makes this equal to t. For t>πR, its range [0,π] gives dg(p,γv(t))≤πR<t. Thus the positive minimizing-time set is exactly (0,πR], including the endpoint, and [F9] yields cp(v)=πR.

5.1A1F1F3F4F5F9step 2.1step 3.2step 4.1∎

At the finite endpoint, every unit direction has γv(πR)=−p. Since n≥2, the tangent space has unit vectors, so the cut-point set in [F9] is nonempty and equals {−p}. The empty case cannot occur because p is supplied and SRn contains Ren+1; the zero- and one-dimensional spheres are outside the stated n≥2 claim. The zero initial vector in the completeness check was treated in step 2.1, and the degenerate angular case q=p in step 3.2. The radius is strictly positive; the cut-time definition excludes t=0, includes t=πR, and every later time fails strictly by step 4.1. Choosing a unit vector for the single antipodal path in step 3.2 uses only the nonzero finite-dimensional tangent space for that supplied p, not a choice function on a family. Exactly the declared ACω is propagated through [F3]--[F5] and [F9]; no full AC is used. This example makes no iff claim.

Source locator

Eschenburg, Comparison Theorems in Riemannian Geometry, Section 5, Example 5.1 (printed p.16), states without proof that every unit-sphere direction has cut time π and remains shortest up to the antipode. Lee, Riemannian Manifolds, Chapter 10, printed p.190 / PDF P206, lines 7559--7571, supplies the finite cut-point and cut-locus convention. The induced-sphere geodesic formula, angular distance lower bound, radius-R scaling, and exact cut-time calculation are proved locally above.

Depends on

Used by

Dependency tree · two levels

154 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