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 on a flat rectangular torus from the Dirichlet cell

Example

Assume exactly the declared ACω assumption. Let a,b>0, let Λ=aZ×bZ, and give Q=R2/Λ its quotient flat metric. Write q:R2→Q for the quotient projection and fix p=[x0]∈Q. The period-coordinate charts identify TpQ with R2. Put D=[−a/2,a/2]×[−b/2,b/2],D∘=(−a/2,a/2)×(−b/2,b/2). Define the radial tangent cut domain including zero by Cp={0}∪{tu:∣u∣=1, 0<t<cp(u)}. Then Cp=D∘; equivalently, the positive tangent cut domain is D∘∖{0}. For each unit u=(u1,u2), cp(u)=min⁡ ⁣({a2∣u1∣:u1≠0}∪{b2∣u2∣:u2≠0}), where the displayed minimum is over the nonempty set of defined terms. Moreover, Cut⁡(p)={[x0+w]:w∈∂D}. Opposite edges of D are identified in Q. A relative-interior edge class has exactly two nearest lattice lifts from p, and the four corners represent one class with four nearest lattice lifts.

Facts & Assumptions

Given: Positive periods a,b, the lattice quotient set Q=R2/Λ with its quotient topology, the quotient map q, and p=[x0]. The period-coordinate flat metric is constructed below.

[A1]

Exactly ACω is assumed (The Axiom of Countable Choice (ACω)). Its uses below are through geodesic existence and uniqueness, Hopf--Rinow, and the cut-time and cut-locus interfaces.

[F1]

In the quotient topology, V⊆Q is open exactly when q−1[V] is open in R2; the quotient classes are those of the given lattice equivalence relation (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

[F2]

For every real z there is a unique integer n with n≤z<n+1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

[F3]

A topological 2-manifold without boundary is Hausdorff, second-countable, and locally homeomorphic to open subsets of R2; a smooth manifold has a maximal smooth atlas (Topological manifolds without boundary: Hausdorff, second-countable, and locally Euclidean spaces, Smooth manifolds and their smooth charts).

[F4]

A Riemannian metric is a smooth positive-definite symmetric two-tensor; in coordinates it is enough to check that its matrices are smooth, symmetric, and positive definite, with the usual tensor change-of-coordinate law (Riemannian metric and riemannian manifold, Coordinate criterion for a riemannian metric).

[F5]

The Euclidean inner product on R2 induces the norm ∣z∣=⟨z,z⟩ (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F6]

Squaring preserves order on nonnegative reals, and every nonnegative real has its unique nonnegative square root, so coordinatewise minima minimize the Euclidean norm (Squaring is monotone on the nonnegatives, Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}).

[F7]

A chart tangent vector has the pointwise Riemannian norm determined by its metric matrix (Pointwise norm and angle from a riemannian metric).

[F8]
[F9]

A covering has evenly covered neighbourhoods, and every path has a unique lift after its starting point is fixed (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings, Existence and uniqueness of path lifts through a covering map). A piecewise C1 path has a finite chartwise subdivision; once this quotient is shown to be covered, composing those pieces with local inverse charts makes its lift piecewise C1 (Piecewise c one curve on a manifold).

[F10]

Riemannian speed is the norm of velocity, length is the sum of its speed integrals over the finite smooth pieces, and length is unchanged by finite subdivision. On a connected Riemannian manifold distance is the infimum of these lengths (Riemannian speed and length, Riemannian length is independent of piecewise c one subdivision, Riemannian distance on a connected manifold).

[F12]

In coordinates the Levi-Civita symbols are given by the Christoffel formula, and geodesics satisfy the coordinate geodesic equation (Christoffel formula for the levi civita connection, Coordinate geodesic equation). Under [A1], initial data determine a unique maximal geodesic; the exponential map evaluates it at time one, and geodesic completeness means all maximal geodesics have domain R (Existence uniqueness and smooth dependence of geodesics, Domain and exponential map of a connection, Geodesically complete Riemannian manifold).

[F14]

Under [A1], Hopf--Rinow makes a geodesically complete nonempty connected boundaryless Riemannian manifold complete for its Riemannian distance (Hopf–Rinow theorem).

[F15]

For a complete, connected, boundaryless Riemannian manifold, cut time in a unit direction is the supremum of positive times at which radial distance equals time (Cut time in a unit tangent direction).

[F16]

The cut locus consists of the finite cut-time endpoints over all unit directions (Cut point and cut locus of a point).

Proof

technique · quotient path lifting and the rectangular Dirichlet cell
1.1F2F5F6

For z∈R, set n=⌊z+1/2⌋ using [F2]. Then −1/2≤z−n<1/2. If m≥n+1, then ∣z−m∣≥∣z−n∣; if m≤n−1, then again ∣z−m∣≥∣z−n∣. Equality for a second integer occurs exactly at the half-period boundary. Applying this to z=(yi−xi)/Li for L1=a,L2=b shows that each coordinate has an attained nearest lattice translate. The squared Euclidean norm is minimized coordinatewise, so min⁡λ∈Λ∣y−x+λ∣=δ12+δ22,δi=min⁡k∈Z∣yi−xi+kLi∣. This minimum is zero exactly when y−x∈Λ.

2.1F1F3F4F13step 1.1

The quotient projection is open: for open U⊆R2, q−1(q(U))=⋃λ∈Λ(U+λ), which is open, so [F1] makes q(U) open. The images of rational balls therefore form a countable base. If q(x)≠q(y), [F2] and step 1.1 give δ=min⁡λ∈Λ∣y−x+λ∣>0. Choose r>0 with 2r<δ. If q(B(x,r)) met q(B(y,r)), some x′∈B(x,r) and y′∈B(y,r) would satisfy x′−y′∈Λ, yielding a lattice translate of y−x of norm ∣y′−x′∣<2r, a contradiction. Thus Q is Hausdorff. For 0<ε<min⁡(a,b)/2, each rectangle Ux=x+(−ε,ε)2 has pairwise disjoint lattice translates; q∣Ux is an open continuous bijection onto the open set q(Ux), hence a chart. On overlaps the coordinate changes are locally translations by elements of Λ, so they are smooth. The coordinate metric matrices are the constant identity matrix; [F4] makes this a smooth positive flat metric. The same disjoint-translate description of q−1(q(Ux)) shows these charts evenly cover their images, so q is a covering and a local isometry. Projected straight segments join every pair of classes, so Q is path-connected and connected by [F13]. It is nonempty because it contains q(0), and its charts have no boundary.

3.1F5F7F8F9F10F11step 1.1step 2.1

Fix x,y∈R2 and any piecewise C1 path α in Q from q(x) to q(y). Lift it from x by [F9]. On each path piece lying in a quotient chart, its lift lies in one translated sheet and is the chartwise inverse of α; hence the lift is piecewise C1 and has the same coordinate speed. Its endpoint is y+λ for some λ∈Λ. Refine to a common finite subdivision and write Δj=α~(tj+1)−α~(tj). By [F11], ∣Δj∣≤∫tjtj+1∣α~′(t)∣ dt. The increments telescope, the triangle inequality in [F8] bounds their sum, and the local isometry preserves speed. Therefore ∣y−x+λ∣=∣α~(1)−α~(0)∣≤∑j∣Δj∣≤Lg(α). By step 1.1 this is at least min⁡μ∈Λ∣y−x+μ∣. Taking the infimum over all paths gives the same lower bound for dg(q(x),q(y)).

3.2A1F12step 2.1

For every x∈R2 and w∈Tq(x)Q≅R2, define γx,w(t)=q(x+tw) for all t∈R. In every quotient chart its coordinates are affine and the metric coefficients are constant, so [F12] gives zero Christoffel symbols and the geodesic equation. This is a global geodesic with the prescribed initial data. Uniqueness in [F12] shows that every maximal geodesic is this one; hence Q is geodesically complete and exp⁡q(x)(w)=q(x+w). This includes w=0, whose geodesic is constant.

4.1F10step 1.1step 3.1

Step 1.1 supplies a translate λ∗ attaining the minimum. The projection of the straight segment from x to y+λ∗ has constant speed ∣y−x+λ∗∣, so [F10] gives its length as that norm. Combining it with step 3.1 proves the attained quotient-distance formula dg(q(x),q(y))=min⁡λ∈Λ∣y−x+λ∣=δ12+δ22.

4.2A1F14F15F16step 2.1step 3.2

The model is nonempty, connected, boundaryless, and geodesically complete by steps 2.1 and 3.2. Hopf--Rinow [F14], under exactly [A1], makes (Q,dg) complete. Thus the completeness hypotheses of [F15] and [F16] hold.

5.1A1F5F7F15step 1.1step 3.2step 4.1

Let u=(u1,u2) be a unit vector and put τ(u)=min⁡ ⁣({a2∣u1∣:u1≠0}∪{b2∣u2∣:u2≠0}). The set is nonempty and 0<τ(u)<∞. For 0<t≤τ(u), tu∈D; step 1.1 says zero is a nearest lattice translate, including a tie when a coordinate reaches a face. Steps 3.2 and 4.1 then give dg(p,exp⁡p(tu))=∣tu∣=t. If t>τ(u), choose a nonzero coordinate ui attaining the minimum. Then ∣tui∣>Li/2, where L1=a,L2=b. Adding the opposite period to that coordinate strictly reduces its absolute value, leaves the other coordinate unchanged, and gives a projected straight competitor of length strictly less than ∣tu∣=t. Hence dg(p,exp⁡p(tu))<t. The minimizing-time set is exactly (0,τ(u)], so [F15] gives cp(u)=τ(u).

6.1F15F16step 2.1step 4.2step 5.1

For v≠0, write v=∣v∣u with ∣u∣=1. The formula for τ(u) in step 5.1 shows ∣v∣<τ(u) exactly when ∣v1∣<a/2 and ∣v2∣<b/2. Adjoining v=0 proves both inclusions Cp=D∘; omitting zero gives the positive domain D∘∖{0}. For each unit u, step 5.1 puts τ(u)u on ∂D, so every finite cut endpoint lies in {[x0+w]:w∈∂D}. Conversely, given w∈∂D, w≠0; put u=w/∣w∣. For each nonzero coordinate, its candidate exit time is Li∣w∣/(2∣wi∣)≥∣w∣, with equality on every face coordinate, so τ(u)=∣w∣ and [x0+w] is a cut endpoint. Thus Cut⁡(p)={[x0+w]:w∈∂D}, proving both set inclusions.

7.1F2F5step 1.1step 6.1

In one coordinate, a point strictly between the two half-periods has one nearest period representative, while either endpoint ±Li/2 has exactly two, differing by Li. Independence of the two coordinates makes each relative-interior edge point have exactly two nearest lattice lifts and each corner have four. Opposite edges differ by a lattice vector and therefore have the same image. A vertical-edge image and a horizontal-edge image meet only when both coordinates are half-periods; all four corners then give the same corner class. This is the stated branch intersection.

8.1

The torus is nonempty and two-dimensional; a,b>0 rule out a collapsed period. The zero tangent vector is included in Cp but is not a unit direction. Directions with one zero coordinate are covered by omitting that coordinate's quotient from the minimum in step 5.1. The cut-time supremum is over t>0, its endpoint τ(u) is included and minimizing, and every later time fails strictly. The two set equalities in step 6.1 were proved in both directions. The only choice assumption is [A1] through geodesic uniqueness, Hopf--Rinow [F14] and the cut interfaces [F15, F16]; coordinate rounding is determined by [F2], path lifts are unique from a specified start, and no full AC or family selection is used. No other dimension or iff claim is made. [A1, F2, F12, F14, F15, F16, step 2.1, step 3.2, step 4.2, step 5.1, step 6.1, step 7.1] QED

Source locator

Lee, Riemannian Manifolds: An Introduction to Curvature, Chapter 10, printed p.190 / PDF P206, lines 7559–7568, defines cut points and the cut locus and gives the flat-cylinder example where geodesics wrapping past halfway cease to minimize. This passage does not establish the rectangular-torus distance formula or Dirichlet cell; those are derived locally in steps 1.1–4.2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

176 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