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

The push-up rule: p << q and q <= r imply p << r, together with the timelike-piece criterion

Statement

Assume Countable Choice and Dependent Choice (The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain) for the absolutely continuous causal-curve calculus and the supplied causal results used below.

Let (M,g,N) be a time-oriented smooth Lorentzian four-manifold (Smooth time-oriented Lorentzian four-manifolds: the geometric objects of the model) with metric-selected connection ∇ and the relations ≪, ≤ of Causal curves, chronological and causal reachability, and inextendibility. Then:

(a) if p≪q and q≤r, then p≪r;

(b) if p≤q and q≪r, then p≪r;

(c) if γ:[a,b]→M is a future causal curve and there are a≤s<t≤b such that γ∣[s,t] is a future timelike curve, then γ(a)≪γ(b);

(d) consequently I+(J+(Ω))=I+(Ω),I−(J−(Ω))=I−(Ω) for every Ω⊆M, and dually J+(I+(Ω))=I+(Ω).

No choice principle beyond the stated assumptions is used.

Facts & Assumptions

Given: A time-oriented smooth Lorentzian four-manifold (M,g,N), points p,q,r∈M with p≪q and q≤r, and a future causal curve γ:[0,1]→M with γ(0)=q, γ(1)=r.

[L1]

p≪q means that there are a<b and a future timelike curve λ:[a,b]→M with λ(a)=p, λ(b)=q; q≤r means q=r or that there is a future causal curve from q to r; the relation ≤ is reflexive and transitive and p≪q implies p≤q; concatenations of finitely many future causal (respectively future timelike) curves are future causal (respectively future timelike) (Causal curves, chronological and causal reachability, and inextendibility, Chart independence, concatenation, reparametrization and transitivity for causal curves clauses (d) and (f)).

[L2]

For every x∈M the set I+(x) is open in M and the set {(y,z):y≪z} is open in M×M (Openness of the chronological future and past, openness of the chronological relation, and closure of future and past sets clauses (a) and (b)).

[L3]

Every point has arbitrarily small strictly convex normal neighborhoods, and the compact image of a curve can be covered by finitely many of them. Such neighborhoods can be chosen inside adapted charts where a local time coordinate is strictly increasing along future causal curves (Existence of strictly convex normal neighborhoods: small coordinate balls are normal neighborhoods of each of their points, Causal cone domination in adapted charts and Lipschitz-graph bounds for causal curves).

[L4]

In a strictly convex normal set C, the causal-cone theorem identifies causal endpoints with future causal or zero position vectors, and a future timelike position vector gives a future timelike radial geodesic (Local causality in a convex normal ball: causal reachability is the exponential cone, the Lorentzian length is bounded by the displacement radius, and null endpoints force the null geodesic clauses (a),(b)).

[L5]

In a strictly convex normal set C, the two-point inverse and D^2(q,r)=g_q(exp_q^{-1}(r),exp_q^{-1}(r)) are smooth on C x C, with dD^2(q,r)(u,w)=2g_q(P(r,q),u)+2g_r(P(q,r),w) (The differential of the squared-displacement function and the position vector of the reversed geodesic clause (c)).

[L6]

The normalized field n=N/sqrt(-g(N,N)) is smooth and future unit timelike. Along a geodesic, causal character and time orientation of its tangent are preserved by parallel transport; the reverse of a past-directed timelike geodesic segment is future timelike (Observers, rest spaces and the spatial projection at an event, Covariant differentiation along curves: metric pairing, parallel transport and geodesic speed, The geodesic initial-value problem and the exponential map of the metric-selected connection).

[L7]

A nonzero future causal vector is paired strictly negatively with every future timelike vector; a nonzero past causal vector is paired strictly negatively with every past timelike vector. A timelike vector whose pairing with a future timelike vector is negative is future-directed (Pairing of an observer with future causal vectors, Timelike, null, spacelike and causal vectors of a Lorentz vector space).

[L8]

Finite concatenations and restrictions of locally absolutely continuous causal or timelike curves retain the corresponding curve class (Chart independence, concatenation, reparametrization and transitivity for causal curves clauses (a),(c),(d)).

Proof

technique · direct
1.1L1L3L8givenconstruct

(Finite local subdivision.) If q=r then p<<r is immediate. Otherwise fix a future causal curve gamma:[0,1]->M from q to r. Cover its compact image by finitely many open sets C_j, each a strictly convex normal neighborhood contained in an adapted chart. A Lebesgue-number subdivision gives 0=t_0<...<t_m=1 such that gamma([t_i,t_{i+1}]) lies in one such C_i. The adapted chart time is strictly increasing on each subarc, so x_i:=gamma(t_i) and x_{i+1}:=gamma(t_{i+1}) are distinct.

1.2L6givenalgebra

(Normalization.) At any base point x use the specified smooth future unit timelike vector n_x=N_x/sqrt(-g_x(N_x,N_x)); no unit-length hypothesis on the original time-orientation field N is needed.

1.3L2L4L5L6L7givenconstruct

(Pushing up one causal segment.) Let x,y be distinct points in one C_i with a future causal curve in C_i from x to y, and suppose p<<x. By [L4] the position vector v=exp_x^{-1}(y) is future causal and nonzero. If v is timelike, the radial geodesic gives x<<y and hence p<<y. Suppose v is null. For small epsilon>=0 let x_epsilon=exp_x(-epsilon n_x); this is defined and lies in C_i for epsilon small, and x_epsilon tends to x. Define H(epsilon)=D^2(x_epsilon,y). By [L5], H is differentiable at zero, H(0)=g_x(v,v)=0, and H'(0)=2g_x(P(y,x),-n_x)<0, because the reversed null geodesic has past-directed null terminal tangent P(y,x), while -n_x is past timelike ([L6],[L7]). Thus H(epsilon)<0 for all sufficiently small positive epsilon. The inverse vector exp_{x_epsilon}^{-1}(y) varies continuously with epsilon and at epsilon=0 is future null, so for small positive epsilon it is future timelike: its timelike character follows from H(epsilon)<0 and its future orientation follows by continuity of its pairing with the smooth future unit field n. By [L4] the radial segment in C_i gives x_epsilon<<y. Since I^+(p) is open and x belongs to it, choose epsilon small enough that x_epsilon also belongs to I^+(p). Then p<<x_epsilon<<y, so p<<y. This proves the local push-up step.

2.1step 1.1step 1.3givenconstruct

(Finite induction along gamma.) Put x_i=gamma(t_i). Initially p<<x_0=q. If p<<x_i, apply step 1.3 to the causal subarc from x_i to x_{i+1} in C_i to obtain p<<x_{i+1}. Finite induction gives p<<x_m=r, proving (a). No uniform perturbation radius along the entire arc is used.

3.1step 1.1step 2.1

(Conclusion of (a).) Step 2.1 proves that p<<q and q<=r imply p<<r, including the reflexive case handled in step 1.1.

4.1step 3.1givenconstruct

(Clause (b).) Consider the time reverse: (M,g,−N) is again a time-oriented smooth Lorentzian four-manifold, its chronological and causal relations are the reverse relations ≪rev={(x,y):y≪x} and ≤rev={(x,y):y≤x}, and every object used in the proof of (a) is defined by the same formulas with N replaced by −N. Suppose p≤q and q≪r; in the reversed orientation r≪revq and q≤revp, so (a) applied in the reversed orientation gives r≪revp, that is, p≪r.

5.1step 3.1step 4.1givenL1

(Clause (c).) Let γ and s<t be as in (c). The subcurve γ∣[s,t] is a future timelike curve, so γ(s)≪γ(t) by definition; the segment γ∣[a,s] gives γ(a)≤γ(s), and clause (b) yields γ(a)≪γ(t); the segment γ∣[t,b] gives γ(t)≤γ(b), and clause (a) yields γ(a)≪γ(b).

6.1step 3.1step 4.1given∎

(Clause (d).) Let Ω⊆M and z∈I+(J+(Ω)): there is y∈J+(Ω) and x∈Ω with x≤y and y≪z. Then x≪z by (b), so z∈I+(Ω); the reverse inclusion is trivial because x≤y for y=x. This proves the first identity, the second is its time reverse, and J+(I+(Ω))=I+(Ω) follows from the same argument with x≪y, y≤z.

Remarks

  • What the proof uses. Only the openness of chronology, the convex normal neighbourhood cone description, the smooth joint inverse exponential with its first-order differential, and one elementary cone computation. No completeness or global causal condition is used; the stated choice premises are inherited from the local causal suppliers, and the argument is equally valid for every smooth Lorentzian manifold of dimension at least two.

  • Use. Clause (a) is the input that makes the chronological volume function strictly monotone in The Geroch volume function: a continuous strictly increasing time function whose levels are Cauchy sets, and clause (c) is used in The existence of a Cauchy set implies strong causality and compact causal diamonds to convert the closure of the causal relation into a chronological relation between two points of a Cauchy set.

  • Finite propagation. The perturbation is chosen separately at each vertex of a fixed finite normal-region subdivision. Openness of chronology permits each local perturbation after that vertex has been reached; no cover contained in I+(p) and no uniform increment along the arc is assumed.

Depends on

Dependency tree · 2 levels

Sources