Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Global existence, uniqueness and differentiability of the retarded root

Statement

Let c>0, 0≤v∗<c, and z:R→R3 be C1 with ∣z′(s)∣≤v∗ for all s. For every (x,t)∈R3×R there is exactly one real root s=s(x,t) of t−s=∣x−z(s)∣/c, and s≤t. Equality holds exactly when x=z(t). Thus on the open off-instantaneous-worldline domain D={(x,t):x≠z(t)} one has s<t, r=∣x−z(s)∣=c(t−s)>0, and the root is C1. With n=(x−z(s))/r, β=z′(s)/c, and κ=1−n⋅β, its derivatives are ∂ts=1/κ and ∇xs=−n/(cκ), where 1−v∗/c≤κ≤1+v∗/c. If z is Ck, for an integer k≥1, the root is Ck on D; in particular a C3 trajectory gives a C3 root. A smooth trajectory gives a smooth root. No higher regularity follows from a merely C1 trajectory. These claims concern an all-time uniformly subluminal prescribed history; no finite-history or nonuniform-light-speed-limit assertion is made.

Facts & Assumptions

Given: Reals c>0 and 0≤v∗<c, a C1 map z:R→R3 with ∣z′(s)∣≤v∗ for all s, and a point (x,t)∈R3×R. The Euclidean norm ∣⋅∣ is that of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn and Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation.

[L1]

If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz: if f:[a,b]→Rm is continuous on [a,b], differentiable at every point of (a,b) and ∥f′∥≤M there, then ∥f(u)−f(v)∥≤M∣u−v∣ for all u,v∈[a,b]; and if f′ is integrable then ∫abf′=f(b)−f(a).

[L2]

The reverse triangle inequality in a normed space: ∣∥u∥−∥v∥∣≤∥u−v∥; Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation makes ∣⋅∣ a norm on R3, so this reverse triangle inequality and the ordinary triangle inequality hold for ∣⋅∣.

[L3]

Continuity of the data and of g: The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral and Ck Euclidean maps and diffeomorphisms make Ck maps and their derivatives componentwise, and A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions with A function differentiable at c is continuous at c make a differentiable R3-valued map continuous. Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function gives continuity of sums and scalar multiples on real domains. For maps on a Euclidean domain, continuity of sums follows directly from ∣a+b∣≤∣a∣+∣b∣; continuity of a composite follows by first taking the outer continuity tolerance and then the inner continuity radius. In particular z is continuous, s↦x−z(s) is continuous, the norm is 1-Lipschitz and continuous, and gx(s)=s+∣x−z(s)∣/c is continuous on R.

[L4]
[L5]

The parametrized implicit function theorem with Ck regularity: for k,m,n≥1, p∈N, open U⊆Rm+n+p and F:U→Rn of class Ck, if F(a,b,λ0)=0 and DyF(a,b,λ0) is invertible, then near (a,λ0) the equation F(x,y,λ)=0 is equivalent to y=φ(x,λ) for a unique Ck map φ, and Dφ=−DyF−1D(x,λ)F. Ck Euclidean maps are closed under componentwise algebra and composition: finite sums, products and composites of Ck Euclidean maps are Ck.

[L6]

A local inverse of a Ck regular map is Ck: a Ck map with invertible derivative at a point has Ck local inverses there. Continuity and derivatives of positive-base real powers: (xα)′=αxα−1 on (0,∞), in particular (d/dh)h3/2=(3/2)h1/2 for h>0; Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0: sums, scalar multiples, products and quotients of differentiable functions are differentiable with the usual rules.

[L7]

Cutoffs and compact bounds. In ZF, for compact K⊆Ω⊆R with Ω open there is χ∈Cc∞(Ω) with 0≤χ≤1 and χ=1 on a neighbourhood of K (Test function cutoffs and euclidean localization). Closed bounded real intervals are compact (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line), and a continuous real function on a nonempty compact metric space attains finite extrema (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value). These supply the cutoff and the bounds on f,f′ in the sharpness branch.

Proof

1.1L1L3

For all s1,s2∈R the restriction of z to the interval with endpoints s1,s2 is continuous with derivative bounded by v∗ at interior points, so [L1] gives ∣z(s2)−z(s1)∣≤v∗∣s2−s1∣; consequently z, and by [L3] each map s↦gx(s)=s+∣x−z(s)∣/c, is continuous.

2.1step 1.1L2algebra

For s2>s1 the reverse triangle inequality [L2] gives ∣x−z(s2)∣≥∣x−z(s1)∣−∣z(s2)−z(s1)∣, so by step 1.1 gx(s2)−gx(s1)≥(s2−s1)−v∗c(s2−s1)=(s2−s1)(1−v∗c)>0: the map gx is strictly increasing and gx(s)≥s for every s. Moreover ∣x−z(s)∣≤∣x−z(0)∣+∣z(s)−z(0)∣≤∣x−z(0)∣+v∗∣s∣, so for s<0 one has gx(s)≤s+∣x−z(0)∣−v∗sc=s(1−v∗c)+∣x−z(0)∣c.

3.1step 1.1step 2.1L3L4algebra

Given t, put C=∣x−z(0)∣/c and choose s+=max⁡(t,0)+1 and s−=min⁡(0,t,t−C1−v∗/c)−1, so that s−<t<s+; step 2.1 gives gx(s+)≥s+>t and gx(s−)<t. Since gx is continuous by step 1.1, Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on [a,b] takes every value between f(a) and f(b) on the nondegenerate interval [s−,s+] supplies a root s of gx(s)=t, i.e. of t−s=∣x−z(s)∣/c. If s1<s2 were two roots then gx(s1)=gx(s2) would contradict the strict increase of step 2.1, so this root is unique; it satisfies s≤t because gx(s)≥s, with s=t if and only if ∣x−z(t)∣=0, that is if and only if x=z(t). Hence off the instantaneous trajectory, where x≠z(t), one has s<t and r=∣x−z(s)∣=c(t−s)>0, and the set D={(x,t):x≠z(t)} is open because z is continuous.

4.1step 3.1L1algebra

Fix (x0,t0)∈D, let s0=s(x0,t0), r0=∣x0−z(s0)∣=c(t0−s0)>0, n0=(x0−z(s0))/r0, β0=z′(s0)/c and κ0=1−n0⋅β0. Since ∣n0∣=1 and ∣β0∣≤v∗/c<1, one has 1−v∗/c≤κ0≤1+v∗/c and κ0>0.

5.1step 4.1L5algebra

Define F(x,τ,y)=c2(τ−y)2−∣x−z(y)∣2 on R5. Each component of z is Ck and the expression is a finite sum of products of Ck functions composed with z, so F is Ck by [L5]. At the base point of step 4.1, F(x0,t0,s0)=c2(t0−s0)2−r02=0, and computing the partial y-derivative along the differentiable curve y↦z(y) gives ∂yF(x0,t0,s0)=−2c2(t0−s0)+2(x0−z(s0))⋅z′(s0)=−2cr0+2r0 c β0⋅n0=−2cr0κ0≠0. The parametrized implicit function theorem [L5] (with y=s, parameters (x,τ)) therefore gives open neighbourhoods P∋(x0,t0), Q∋s0 and a unique Ck map φ:P→Q with F(x,τ,φ(x,τ))=0 on P and Dφ=−DyF−1D(x,τ)F.

6.1step 5.1step 3.1L3L5

By [L3] the map (x,τ)↦φ(x,τ)−τ is continuous and negative at (x0,t0) because φ is continuous with φ(x0,t0)=s0<t0; shrinking P if necessary, φ(x,τ)<τ there. On that neighbourhood F=0 reads c2(τ−φ)2=∣x−z(φ)∣2 with τ−φ>0, hence τ−φ=∣x−z(φ)∣/c, that is gx(φ)=τ; by uniqueness of the root (step 3.1) φ=s. Thus s is Ck on a neighbourhood of (x0,t0); since (x0,t0)∈D and k≥1 were arbitrary (and a smooth z is Ck for every k), s is Ck on D, and smooth when z is smooth.

6.2step 4.1step 5.1L1algebra

Reading off the displayed derivative formula at the base point of step 5.1, ∂τF(x0,t0,s0)=2c2(t0−s0)=2cr0 and ∂xiF(x0,t0,s0)=−2(x0−z(s0))i=−2r0n0,i, so ∂ts=∂τφ=−∂τF/∂yF=1/κ0 and ∂xis=−∂xiF/∂yF=−n0,i/(cκ0); since the point was arbitrary in D, the same formulas hold on all of D, with 1−v∗/c≤κ≤1+v∗/c by step 4.1.

7.1step 6.2L6L7algebra

For the sharpness clause use [L7] with K=[−1,1]⊂(−2,2) to choose χ∈C∞(R) with 0≤χ≤1, χ=1 on (−1,1) and χ=0 outside (−2,2), and put f(s)=χ(s)∣s∣3/2. Then f is C1: on (0,1) it equals s3/2 with derivative (3/2)s1/2, on (−1,0) it equals (−s)3/2 with derivative −32(−s)1/2 by [L6]; away from 0 it is the smooth product of χ and ∣s∣3/2, and its derivative vanishes outside the compact cutoff support, and at 0 the difference quotient is ∣h∣3/2/h=sgn⁡(h)∣h∣1/2→0, so f′(0)=0; f′ is continuous on the compact interval [−2,2] and zero outside it, so [L7] gives a finite bound Cf:=max⁡[−2,2]∣f′∣; the same supplier bounds f globally. Choose ε>0 with εCf<c/2 and set z(s)=(εf(s),0,0), a C1 trajectory with ∣z′∣≤v∗:=εCf<c; fix L>2εsup⁡sf(s) and x=(L,0,0), so ∣x−z(s)∣=L−εf(s) and the equation gx(s)=t reads s+(L−εf(s))/c=:g(s)=t. One has g′(s)=1−εf′(s)/c≥1−εCf/c>1/2>0, so g is strictly increasing, and the root map s is the inverse of g. At 0 one has g(0)=L/c=:t0 and g′(0)=1−εf′(0)/c=1, hence s′(t0)=1/g′(0)=1≠0; if s were C2 near t0, then by [L6] (applied to the C2 map s with invertible derivative 1 at t0) its local inverse, namely g, would be C2 near 0. But f′(h)=(3/2)h1/2 for small h>0, so (g′(h)−g′(0))/h=−εc⋅(3/2)h1/2h=−3ε2ch−1/2→−∞ as h↓0: g is not twice differentiable at 0, a contradiction. Hence a merely C1 trajectory need not give a C2 root.

8.1step 3.1step 4.1step 6.1step 6.2step 7.1∎

Collecting: existence, uniqueness, s≤t with equality exactly on x=z(t), and the open domain D with s<t, r>0 are step 3.1; Ck (hence C1, and smooth for smooth z) regularity on D is step 6.1; the derivative formulas and the bound 1−v∗/c≤κ≤1+v∗/c are steps 4.1 and 6.2; the non-improvement witness for a merely C1 trajectory is step 7.1. No Choice principle is used anywhere.

Depends on

Dependency tree · 2 levels

Sources