Alphabeta Math
TheoremStatement: 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.

Existence of strictly convex normal neighborhoods: small coordinate balls are normal neighborhoods of each of their points

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 geodesics as in The geodesic initial-value problem and the exponential map of the metric-selected connection. Let p∈M and let O⊆M be an open neighborhood of p. Then there are a chart (U,x) around p with x(p)=0 and a radius r>0 such that C:=x−1(Br), Br={y∈R4:∣y∣e<r} based at 0=x(p), is contained in O and has the following properties.

(a) Normal neighborhood of each point. For every q∈C define Wq:={u∈Eq: exp⁡q(tu)∈C for every t∈[0,1]}, where Eq is the exponential domain of The geodesic initial-value problem and the exponential map of the metric-selected connection clause (d). Then Wq is an open star-shaped neighborhood of 0 in TqM, and exp⁡q∣Wq:Wq→C is a diffeomorphism onto C.

(b) Unique contained joining segment. For all q,q′∈C there is exactly one geodesic segment joining q to q′ whose image is contained in C, namely xq,q′:[0,1]→C,xq,q′(t)=exp⁡q(t v(q,q′)), where v(q,q′) is the two-point inverse velocity of The joint exponential map: smoothness, invertible differential at the diagonal, and the small-velocity two-point inverse clause (c). For q≠q′ the points xq,q′(t), 0<t<1, lie in C strictly inside the coordinate ball, i.e. ∣x(xq,q′(t))∣e<r; and xq′,q is the time reverse of xq,q′ up to affine reparametrization.

(c) Strict convexity. In the terminology of Normal neighborhoods, convex normal sets, the position vector and the squared-displacement function clause (b), C is a strictly convex normal neighborhood; in particular the position vector P(q,q′)=d(exp⁡q)v(q,q′)(v(q,q′)) and the squared displacement D2(q,q′)=gq(v(q,q′),v(q,q′)) are defined for all q,q′∈C.

Facts & Assumptions

Given: A time-oriented smooth Lorentzian four-manifold (M,g,N) with metric-selected connection ∇, a point p∈M and an open neighborhood O∋p.

[L1]

Point-normal charts exist: there is a chart (U0,x) around p with x(p)=0 and Γabc(p)=0; the Christoffel symbols are the smooth chart functions of Christoffel symbols of an affine connection (Point-normal and exponential coordinate charts of the metric-selected connection clause (a)).

[L2]

By The joint exponential map: smoothness, invertible differential at the diagonal, and the small-velocity two-point inverse there are a chart (U,x) around p with x(p)=0, radii r0,ρ>0, a constant Λ≥0 and s0∈(0,r0) such that, writing ∣v∣x for Euclidean coordinate components, V={(q,v):q∈x−1(Br0), ∣v∣x<ρ},x−1(Bs0)×x−1(Bs0)⊆W=Φ(V), Φ(q,v)=(q,exp⁡qv) maps V diffeomorphically onto W, and for q,r∈x−1(Bs0) the velocity v(q,r) satisfies ∣v(q,r)∣x≤Λ∣x(q)−x(r)∣e and v(q,q)=0. We take this chart also to satisfy [L1]; this is legitimate because both statements are valid in every chart sufficiently small around p, and we may first fix the point-normal chart and then apply the joint-exponential construction inside it.

[L3]

Containment and speed bound, with ∥Γ∥ the Euclidean bilinear operator norm of Convexity of the squared Euclidean radius along small contained geodesics: segments with endpoints in a small ball stay in the ball: if a geodesic segment γ:[0,1]→U has image in the coordinate ball x−1(Br1) with ∥Γ∥Br1‾ r1≤1100 and r1≤14, and if its image is contained in x−1(Br) for some r≤r1, then ∣x˙(0)∣e≤4r (Speed bounds along geodesics in a chart, and small initial velocity of every geodesic segment contained in a small ball clause (b)); and, for 0≤t≤1 with 4∥Γ∥Br1‾ ∣x˙(0)∣et≤1, ∣x˙(t)∣e≤43∣x˙(0)∣e (Speed bounds along geodesics in a chart, and small initial velocity of every geodesic segment contained in a small ball clause (a)).

[L4]

Convexity: if a geodesic segment γ:[0,1]→U has image in x−1(Br1) with ∥Γ∥Br1‾ r1≤12 and both endpoints satisfy ∣x(γ(i))∣e≤r2 for i=0,1, where r2<r1, then its image lies in the closed ball x−1(Br2‾), and along it f′′≥∣x˙∣e2 for f=∣x∣e2 (Convexity of the squared Euclidean radius along small contained geodesics: segments with endpoints in a small ball stay in the ball clauses (a) and (b)). Moreover a convex function attaining its maximum at an interior point of an interval is constant on that interval.

[L5]

Smooth dependence of geodesics on initial data and the local diffeomorphism theorem: the evaluation (t,q,v)↦γq,v(t) is smooth on its open domain and d(exp⁡q)u is invertible whenever (q,u)∈V (The geodesic initial-value problem and the exponential map of the metric-selected connection clause (b), The joint exponential map: smoothness, invertible differential at the diagonal, and the small-velocity two-point inverse clause (c), The smooth inverse function theorem on manifolds).

[L6]

If C is an open set and exp⁡q:Wq→C is injective with invertible differential at every point, then it is a diffeomorphism onto C (The smooth inverse function theorem on manifolds: a bijective smooth map whose differential is everywhere invertible is a diffeomorphism onto its image, the inverse being smooth because it is a local inverse of a local diffeomorphism and bijectivity makes the local inverses patch).

Proof

technique · direct
1.1L1L2construct

(Setup and choice of r.) Fix the point-normal chart (U,x) of [L1] and shrink it to satisfy [L2] with constants r0,ρ,Λ,s0. Since Γ(p)=0 by [L1] and the Christoffel symbols are continuous on the coordinate domain [L1], we may choose r1>0 with r1≤r0 and ∥Γ∥Br1‾ r1≤1100,r1≤14,x−1(Br1)⊆O. Choose r>0 with r≤min⁡{r18Λ′′, s02, ρ32Λ′, 1100 max⁡(Γ0Λ′,1), 14}, where Λ′:=max⁡(Λ,1), Λ′′:=max⁡(83Λ,1) and Γ0:=∥Γ∥Br1‾. Then C=x−1(Br)⊆O∩x−1(Bs0).

2.1L3step 1.1algebra

(The two-point geodesic stays in the larger ball.) Let q,q′∈C‾ and let Γ0:=∥Γ∥Br1‾. Put u:=v(q,q′)∈TqM, so ∣u∣x≤Λ∣x(q)−x(q′)∣e≤2Λr≤ρ16<ρ and (q,u)∈V; let γ:[0,1]→M, γ(t)=exp⁡q(tu), be the corresponding geodesic. Since ∣u∣x≤2Λr and r≤1100max⁡(Γ0Λ′,1), we have 4Γ0∣u∣x≤8Γ0Λr≤8100<1, so δ=1 satisfies 4Γ0∣u∣xδ≤1; [L3] then gives, as long as the image stays in x−1(Br1), ∣x˙(t)∣e≤43∣u∣x≤83Λr,∣x(γ(t))−x(q)∣e≤83Λr. Since ∣x(q)∣e≤r and 83Λr≤r1/8<r1−r by the choice of r, an exit from x−1(Br1) at the first parameter T would require displacement at least r1−r, while the speed estimate bounds it by 83Λr. This is a contradiction; hence the whole image lies in x−1(Br1).

3.1step 2.1L2L4algebra

(Interior containment for distinct endpoints.) By step 2.1 the image of γ lies in x−1(Br1). Its endpoints satisfy ∣x(q)∣e,∣x(q′)∣e≤r, and ∥Γ∥Br1‾r1≤1100≤12; [L4] applied with r2=r<r1 gives ∣x(γ(t))∣e≤r on [0,1]. If q≠q′ and ∣x(γ(t0))∣e=r for some t0∈(0,1), the convex function f(t)=∣x(γ(t))∣e2 attains its maximum r2 at an interior point, hence is constant by [L4]. Then f′′≡0 while [L4] gives f′′≥∣x˙∣e2, so x˙≡0 and γ is constant, contradicting q≠q′. Thus γ((0,1))⊂C for distinct endpoints. If q=q′, then v(q,q)=0 by [L2] and γ is the constant geodesic.

4.1step 3.1L2L3given

(Uniqueness on the closure.) Let η:[0,1]→C‾ be any geodesic segment from q to q′. No interior-containment assumption is needed for this uniqueness argument. Its image lies in Br‾⊂x−1(Br1‾). For every r′∈(r,r1), apply L3 with compact set K=x−1(Br1‾) and radius r′; its hypotheses hold because r′<r1≤1/4 and Γ0r′≤Γ0r1≤1/100. The image lies in K∩x−1(Br′), so ∣x˙η(0)∣e≤4r′. Letting r′↓r gives ∣x˙η(0)∣e≤4r≤ρ/(8Λ′)<ρ. Thus (q,η′(0))∈V and Φ(q,η′(0))=(q,q′)=Φ(q,v(q,q′)). Injectivity of Φ∣V gives η′(0)=v(q,q′), and uniqueness for the geodesic initial-value problem gives η=γ. This also excludes every nonconstant geodesic loop in C‾ when q=q′, so the unique degenerate segment is constant. Together with step 3.1 this proves the closure-endpoint condition in the definition and the uniqueness assertion in (b).

4.2L2L5step 3.1construct

(The domains Wq.) Fix q∈C and let Wq be as in (a). It is star-shaped by construction: if u∈Wq and λ∈[0,1], the segment t↦exp⁡q(tλu), t∈[0,1], is the initial arc of t↦exp⁡q(tu) by the scaling rule of The geodesic initial-value problem and the exponential map of the metric-selected connection clause (c), hence lies in C and λu∈Wq. It is open: if u∈Wq, the geodesic γq,u is defined on [0,1] with image in the open set C; choosing ε>0 with γq,u([0,1+ε])⊂C (possible by [L5] since γq,u(1)∈C is an interior point and the geodesic extends) and using smooth dependence on initial data [L5], all u′ sufficiently close to u have γq,u′([0,1+ε])⊂C, so u′∈Wq. And exp⁡q(Wq)=C: the inclusion ⊆ is by definition of Wq; for q′∈C the velocity v(q,q′) lies in Wq by step 3.1 and exp⁡q(v(q,q′))=q′.

5.1step 4.2L2L3L5L6

(exp⁡q:Wq→C is a diffeomorphism.) It is smooth because exp⁡q is smooth on its domain [L5]; it is surjective by step 4.2; it is injective: if exp⁡q(u)=exp⁡q(u′)=q′ with u,u′∈Wq, then the segments of u and u′ lie in C, so [L3] gives ∣u∣x,∣u′∣x≤4r<ρ; hence (q,u),(q,u′)∈V and Φ(q,u)=(q,q′)=Φ(q,u′) forces u=u′. Finally, for u∈Wq we have ∣u∣x≤4r<ρ and q∈x−1(Br)⊆x−1(Bs0), so (q,u)∈V and d(exp⁡q)u is invertible by [L5]. A bijective local diffeomorphism onto C is a diffeomorphism by [L6]. This proves (a).

6.1step 3.1step 4.1step 5.1given∎

(Conclusion.) Steps 2.1, 3.1 and 4.1 establish (b); steps 4.2 and 5.1 establish (a); together with the definitions of Normal neighborhoods, convex normal sets, the position vector and the squared-displacement function this gives (c). This completes the proof.

Remarks

Depends on

Dependency tree · 2 levels

Sources