Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck pass
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.

Convexity of the squared Euclidean radius along small contained geodesics: segments with endpoints in a small ball stay in the ball

Statement

Let (M,g,N) be a time-oriented smooth Lorentzian four-manifold with metric-selected connection ∇ (Smooth time-oriented Lorentzian four-manifolds: the geometric objects of the model, Metric compatibility, torsion freedom and the metric-selected connection class) and let geodesics be those of The geodesic initial-value problem and the exponential map of the metric-selected connection. Let (U,x) be a smooth chart of M and write x=(x0,x1,x2,x3) with its Euclidean norm ∣⋅∣e on x(U)⊆R4; write Bs:={y∈R4:∣y∣e<s} and, for a compact subset K⊆U, let ∥Γ∥K:=sup⁡y∈x(K) sup⁡∣u∣e=∣v∣e=1∣Γ(y)[u,v]∣e, where Γ(y)[u,v]a=∑b,c=03Γabc(y)ubvc. Thus this is the Euclidean bilinear operator norm, not the maximum of the individual coefficients; set ∥Γ∥∅=0. The Christoffel symbols are the smooth chart functions of Christoffel symbols of an affine connection.

(a) Second-derivative inequality. Let γ:J→U be a geodesic and let f:J→R, f(t):=∣x(γ(t))∣e2, where the norm is the Euclidean norm of the chart image. At every parameter t∈J, f′′(t)=2∣x˙(t)∣e2−2 x(t)⋅Γ(x(t))[x˙(t),x˙(t)], where Γ(x)[x˙,x˙] is the vector with components ∑i,jΓaij(x)x˙ix˙j and ⋅ is the Euclidean scalar product. Consequently, along every geodesic whose image lies in a fixed compact K⊆U, f′′≥2(1−∥Γ∥K ∣x(γ)∣)∣x˙∣e2. In particular, if x(K)⊆Br1 and ∥Γ∥K r1≤12 then f′′≥∣x˙∣e2≥0 at every parameter of such a geodesic.

(b) Maximum principle. Let γ:[0,1]→U be a geodesic whose image is contained in a compact K with x(K)⊆Br1 and ∥Γ∥K r1≤12, and suppose ∣x(γ(0))∣e≤r2 and ∣x(γ(1))∣e≤r2 for some r2<r1. Then ∣x(γ(t))∣e≤r2for every t∈[0,1].

Facts & Assumptions

Given: A time-oriented smooth Lorentzian four-manifold (M,g,N) with metric-selected connection ∇, a chart (U,x) and a geodesic γ:J→U.

[L1]

In a chart, a smooth curve t↦x(t) is (the coordinate representative of) a geodesic if and only if x¨a+∑i,jΓaij(x)x˙ix˙j=0 for a=0,1,2,3 (Coordinate geodesic equation, Christoffel symbols of an affine connection).

[L3]

The Christoffel symbols are smooth on x(U) (Christoffel symbols of an affine connection), so ∥Γ∥K<∞ for every compact K⊆U.

[L4]

A convex function h on [0,1] satisfies the chord bound h(t)≤(1−t)h(0)+th(1) for every t∈[0,1], and hence h(t)≤max⁡{h(0),h(1)} (Convex, strictly convex, concave, strictly concave, and midpoint-convex real functions on an interval).

Proof

technique · direct
1.1L1L2algebra

(Computation of f′′.) Write x=x(γ(t)), x˙=x˙(t), x¨=x¨(t) and Γ=Γ(x(t)). Since f=∣x∣e2=∑a(xa)2, f′=2∑axax˙a,f′′=2∑a((x˙a)2+xax¨a)=2∣x˙∣e2+2 x⋅x¨. By the geodesic equation of [L1], x¨a=−∑i,jΓaijx˙ix˙j, so f′′=2∣x˙∣e2−2 x⋅Γ(x)[x˙,x˙].

2.1step 1.1L3algebra

(Bound.) By Cauchy–Schwarz in R4 and [L3], ∣x⋅Γ(x)[x˙,x˙]∣≤∣x∣e ∣Γ(x)[x˙,x˙]∣e≤∣x∣e ∥Γ∥K ∣x˙∣e2 whenever the image of γ lies in K. Substituting into step 1.1 gives the displayed inequality, and if x(K)⊆Br1 with ∥Γ∥Kr1≤12, then f′′≥2(1−12)∣x˙∣e2=∣x˙∣e2≥0. This proves (a).

3.1step 2.1L2L4algebra∎

(Maximum principle.) Let K and r2<r1 be as in (b), so the image of γ lies in K and x(K)⊆Br1 with ∥Γ∥Kr1≤12. By step 2.1, f′′≥0 on the interval [0,1]; since f is twice differentiable there by [L2], [L2] makes f convex on [0,1]. By [L4], f(t)≤max⁡{f(0),f(1)}≤r22 for every t∈[0,1], that is, ∣x(γ(t))∣e≤r2. This proves (b) and completes the proof.

Remarks

Depends on

Dependency tree · 2 levels

Sources