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

The reversed Cauchy-Schwarz inequality for future timelike vectors

Statement

Let (A,V,η,C+) be the oriented time-oriented affine Minkowski space and let v,w∈V be future timelike vectors. Put a:=−η(v,v)>0 and b:=−η(w,w)>0, the timelike lengths of v and w. Then:

(i) −η(v,w)≥ab>0.

(ii) Equality −η(v,w)=ab holds if and only if v and w are positive proportional, that is w=tv for some real t>0, or v=tw for some real t>0.

(iii) Consequently −η(v,w)>ab whenever v and w are not positive proportional, and η(v,w)<0 in every case.

(iv) For two past timelike vectors v,w the same inequality −η(v,w)≥−η(v,v) −η(w,w) holds, with equality if and only if they are positive proportional, because −v and −w are future timelike and η(−v,−w)=η(v,w).

The statement uses only η and the future cone C+ and involves no chart, frame or choice principle.

Facts & Assumptions

Given: The oriented time-oriented affine Minkowski space (A,V,η,C+) and future timelike vectors v,w∈V, with a:=−η(v,v)>0 and b:=−η(w,w)>0.

[F1]

Inertial frames and charts: at every event o∈A there is an inertial frame (o;e0,e1,e2,e3); its ordered basis is η-orthonormal with η(ea,eb)=diag⁡(−1,1,1,1)ab, its first vector e0 lies in C+, and E(u):=∑auaea is a linear isomorphism E:R4→V, so every vector u∈V has unique coordinates u=u0e0+us with us=u1e1+u2e2+u3e3 (Existence of future-oriented inertial frames at every event, Inertial frames and inertial charts of the affine Minkowski model).

[F2]

Cone coordinates: in an η-orthonormal basis whose first vector is timelike the timelike set is the disjoint union T=T+∪T− with T+={u:u0>∣us∣} and T−={u:u0<−∣us∣}, and T+, T− are exactly the two connected components of T; the time orientation selects one component C+ and C−:=T∖C+ is the other, so with the basis of [F1], where e0∈C+, one has C+=T+ and C−=T−=−C+; hence u is future timelike if and only if u0>∣us∣, and u is past timelike if and only if −u is future timelike (The timelike set has exactly two convex components, described in orthonormal coordinates, Time orientation, future and past timelike/null/causal vectors, and the closed cones).

[F3]

Spatial and bilinear structure: for a frame of [F1], the spatial three-space S:=span⁡(e1,e2,e3)={z∈V:η(e0,z)=0} carries the restriction δ:=η∣S, which is positive definite, and ∣z∣:=δ(z,z) is a norm on S with (e1,e2,e3) a δ-orthonormal basis; since η is bilinear, for all u=u0e0+us and u′=u′0e0+us′ one has η(u,u′)=−u0u′0+δ(us,us′), and in particular η(u,u)=−(u0)2+∣us∣2 (The Euclidean spatial structure and cross product of an inertial frame, Lorentz forms of inertia (3,1,0) on a 4-dimensional real vector space).

[L4]

Finite Cauchy-Schwarz inequality: for reals a0,…,an−1 and b0,…,bn−1 one has (∑k<nakbk)2≤(∑k<nak2)(∑k<nbk2) and ∣∑k<nakbk∣≤∑k<nak2 ∑k<nbk2; equality holds in the first display if and only if the two lists are proportional in the sense that there is a pair (λ,μ)≠(0,0) of reals with λak=μbk for every k<n (The Cauchy-Schwarz inequality for finite sums).

[L5]

Square roots and monotonicity of squaring: every real c≥0 has a unique c≥0 with (c)2=c (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}); for x,y≥0 one has x≤y  ⟺  x2≤y2 and x<y  ⟺  x2<y2 (Squaring is monotone on the nonnegatives); for c>0 the root notation is the rational power c1/2 (Rational powers ar of a positive base).

[L6]

Order arithmetic of R: a product of two positive reals is positive and a product of a positive and a negative real is negative (Sign rules for products and monotonicity of multiplication); inequalities may be added, and a constant may be added to both sides of an inequality (Order is preserved by adding a constant and by adding inequalities); and for reals x,y exactly one of x<y, x=y, x>y holds, a product of reals vanishes only if a factor vanishes, and x≥0 means x>0 or x=0 (Ordered field).

Proof

technique · direct
1.1givenF1F3choose

Fix an event o∈A and an inertial frame (o;e0,e1,e2,e3) with its basis and chart, and write v=v0e0+vs, w=w0e0+ws with spatial parts vs,ws∈S; the coordinates are unique by [F1] and the spatial parts lie in S by the definition of S in [F3].

2.1step 1.1F2F3L5L6

Since v and w are future timelike, [F2] gives v0>∣vs∣ and w0>∣ws∣; as ∣vs∣,∣ws∣≥0 by [F3], this yields v0>0, w0>0, and by strict monotonicity of squaring on the nonnegatives (v0)2>∣vs∣2 and (w0)2>∣ws∣2, so a2=(v0)2−∣vs∣2>0 and b2=(w0)2−∣ws∣2>0, whence a=(v0)2−∣vs∣2>0 and b=(w0)2−∣ws∣2>0 by uniqueness of the nonnegative root.

2.2step 1.1F3L4algebra

By bilinearity [F3], −η(v,w)=v0w0−δ(vs,ws); applying the finite Cauchy-Schwarz inequality [L4] to the coordinates of vs and ws in the δ-orthonormal basis (e1,e2,e3) gives ∣δ(vs,ws)∣≤∣vs∣ ∣ws∣, hence δ(vs,ws)≤∣vs∣ ∣ws∣ and −η(v,w)≥x for x:=v0w0−∣vs∣ ∣ws∣.

3.1step 2.1L6algebra

The algebraic identity x2−((v0)2−∣vs∣2)((w0)2−∣ws∣2)=(v0∣ws∣−w0∣vs∣)2≥0 holds by expansion, so x2≥a2b2; moreover x=w0 (v0−∣vs∣)+∣vs∣ (w0−∣ws∣) is a sum of a positive real and a nonnegative real, so x>0 and in particular x≥0.

4.1step 2.1step 2.2step 3.1L5L6

Since x≥0 and ab>0 with x2≥(ab)2, monotonicity of squaring on the nonnegatives [L5] gives x≥ab, and with step 2.2 this yields −η(v,w)≥ab>0, which is (i); equivalently η(v,w)≤−ab<0.

5.1step 2.2step 3.1step 4.1algebra

Assume now −η(v,w)=ab. Then the chain ab=−η(v,w)≥x≥ab of steps 2.2 and 4.1 is equality at both places, so δ(vs,ws)=∣vs∣ ∣ws∣, and from x=ab and the identity of step 3.1 we get (v0∣ws∣−w0∣vs∣)2=x2−(ab)2=0, that is v0∣ws∣=w0∣vs∣.

6.1step 2.1step 5.1L6

Case vs=0: then v0∣ws∣=w0∣vs∣=0 by step 5.1, and v0>0, so ∣ws∣=0 and hence ws=0; therefore v=v0e0 and w=w0e0 with v0,w0>0, and v=(v0/w0)w exhibits v as a positive multiple of w.

6.2step 2.1step 5.1L6

Case ws=0: symmetrically w0∣vs∣=v0∣ws∣=0 with w0>0 gives vs=0, and v0>0 gives w=(w0/v0)v, so w is a positive multiple of v.

6.3step 5.1L4L5L6algebra

Case vs≠0 and ws≠0: the equality δ(vs,ws)=∣vs∣ ∣ws∣>0 of step 5.1 is the equality case of the finite Cauchy-Schwarz inequality [L4] for two nonzero lists, so there are reals (λ,μ)≠(0,0) with λvs=μws; here λ≠0 (otherwise ws=0) and μ≠0 (otherwise vs=0), so vs=cws with c:=μ/λ, and then δ(vs,ws)=c ∣ws∣2 while ∣vs∣=∣c∣ ∣ws∣, so c ∣ws∣2=∣c∣ ∣ws∣2 with ∣ws∣2=δ(ws,ws)>0; hence c=∣c∣≥0, and c>0 because c ∣ws∣2=∣vs∣ ∣ws∣>0; finally v0∣ws∣=w0∣vs∣=w0c∣ws∣ with ∣ws∣>0 gives v0=cw0, so v=v0e0+cws=c (w0e0+ws)=cw with c>0.

7.1step 6.1step 6.2step 6.3

The three cases of steps 6.1-6.3 exhaust the possibilities, so equality −η(v,w)=ab forces v and w to be positive proportional; this is the forward implication of (ii).

8.1step 2.1F3L5algebra

Conversely, if v=tw with t>0, then bilinearity gives −η(v,w)=−t η(w,w)=tb2 and −η(v,v)=−t2η(w,w)=t2b2, so a=tb by uniqueness of the nonnegative square root, whence −η(v,w)=tb⋅b=ab; the case w=tv is identical, and together with step 7.1 this proves (ii).

9.1step 4.1step 7.1step 8.1

For (iii): if v and w are not positive proportional then equality fails by (ii), so −η(v,w)>ab by step 4.1, while η(v,w)<0 holds in every case again by step 4.1.

10.1step 4.1step 7.1step 8.1F2F3∎

For (iv): if v,w are past timelike then −v,−w are future timelike by [F2], with −η(−v,−v)=−η(v,v), −η(−w,−w)=−η(w,w) and η(−v,−w)=η(v,w) by bilinearity [F3]; steps 4.1, 7.1 and 8.1 applied to −v,−w therefore give −η(v,w)=−η(−v,−w)≥ab, with equality exactly when −v,−w are positive proportional, that is exactly when v,w are positive proportional.

Depends on

Dependency tree · 2 levels

Sources