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

The metric pairing is a linear bijection to the dual, and the raised covector in an orthonormal frame

Statement

Let (V,η) be a 4-dimensional Lorentz vector space (Lorentz forms of inertia (3,1,0) on a 4-dimensional real vector space): η is symmetric and bilinear, nondegenerate in the sense that both radicals are {0} (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space), and of inertia (3,1,0). Let V∗ be the algebraic dual (Linear functionals and the algebraic dual V∗=L(V,F)). Then:

(a) The map Φ:V→V∗, Φ(v)(w):=η(v,w), is linear, and it is injective: Φ(v)=0 means η(v,w)=0 for all w∈V, that is v∈rad⁡L(η)={0}.

(b) dim⁡V∗=dim⁡V=4 (The dual family of a finite basis is a basis of the dual space, with the same dimension), so Φ is a linear bijection; equivalently nullity⁡Φ=0 and rank⁡Φ=4 (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T, Rank and nullity of a linear map with finite-dimensional domain).

(c) Consequently for every covector k∈V∗ there is a unique vector k♯∈V with η(k♯,w)=k(w) for all w∈V; the assignment ♯:V∗→V, k↦k♯, is linear and is the inverse of Φ (Invertible linear maps, linear isomorphisms, and inverse linear maps), so (v♭)♯=v for v♭:=Φ(v) and (k♯)♭=k for every k∈V∗; in particular k♯=0 if and only if k=0.

(d) If (e0,e1,e2,e3) is an η-orthonormal ordered basis of V (Every Lorentz form admits an ordered basis with matrix diag(-1,1,1,1)) and ka:=k(ea) are the values of k on that basis, then

k♯=−k0e0+k1e1+k2e2+k3e3,

that is (k♯)0=−k0 and (k♯)i=ki for i=1,2,3 in this basis, and

η(k♯,k♯)=−(k0)2+(k1)2+(k2)2+(k3)2.

Hence, for k≠0 the vector k♯ is nonzero and, in the sense of (Timelike, null, spacelike and causal vectors of a Lorentz vector space), it is null exactly when (k0)2=(k1)2+(k2)2+(k3)2, timelike exactly when (k0)2>(k1)2+(k2)2+(k3)2 (equivalently η(k♯,k♯)<0), and spacelike exactly when (k0)2<(k1)2+(k2)2+(k3)2 (equivalently η(k♯,k♯)>0); for k=0 one has k♯=0, which has no causal character.

No orientation, time orientation or affine structure is used, and no choice principle is used.

Facts & Assumptions

Given: A 4-dimensional real vector space V, a Lorentz form η on V, and the map Φ(v):=η(v,⋅).

[L1]

V is 4-dimensional, and η is symmetric and bilinear with rad⁡L(η)=rad⁡R(η)={0} and inertia (3,1,0) (Lorentz forms of inertia (3,1,0) on a 4-dimensional real vector space, The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).

[L2]

V∗=L(V,R) is the algebraic dual of V, and the assignment B↦B♭ with B♭(v)(w)=B(v,w) is a linear bijection from the bilinear forms on V onto L(V,V∗); in particular B♭ is a linear map for every bilinear form B (Linear functionals and the algebraic dual V∗=L(V,F), Bilinear forms on V correspond linearly and bijectively to linear maps V→V∗, Linear map between vector spaces over the same field).

[L3]

If B=(b1,…,bn) is a basis of a finite-dimensional F-vector space, then its dual family is a basis of the dual space; consequently dim⁡V∗=dim⁡V (The dual family of a finite basis is a basis of the dual space, with the same dimension).

[L4]

There is an η-orthonormal ordered basis (e0,e1,e2,e3) of V, that is, η(ea,eb)=diag⁡(−1,1,1,1)ab for all a,b (Every Lorentz form admits an ordered basis with matrix diag(-1,1,1,1)).

[L5]

For a linear map T with finite-dimensional domain, dim⁡V=nullity⁡T+rank⁡T, where nullity⁡T=dim⁡(ker⁡T) and rank⁡T=dim⁡(im⁡T) (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T, Rank and nullity of a linear map with finite-dimensional domain).

[L6]

A linear map T is invertible, equivalently a linear isomorphism, when there is a linear map S with S∘T=id⁡ and T∘S=id⁡; such an S is unique and written T−1, and T is bijective (Invertible linear maps, linear isomorphisms, and inverse linear maps).

[L7]

A vector v∈V is timelike, null or spacelike according as η(v,v)<0, η(v,v)=0 with v≠0, or η(v,v)>0; the zero vector has none of these characters, and every nonzero vector has exactly one (Timelike, null, spacelike and causal vectors of a Lorentz vector space).

Proof

technique · direct
1.1L1L2given

The map Φ is linear, and ker⁡Φ={0}. Since η is a bilinear form on V, its associated map η♭ lies in L(V,V∗) and η♭(v)(w)=η(v,w)=Φ(v)(w) for all v,w, so Φ=η♭ is linear by [L2]. If Φ(v)=0, then η(v,w)=0 for every w∈V, so v lies in the left radical of η, which is {0} by [L1]; conversely Φ(0)=0 by linearity (equivalently η(0,⋅)=0), so ker⁡Φ={0}.

1.2L3L4algebra

The map Φ is surjective. Fix an η-orthonormal ordered basis (e0,e1,e2,e3) of V [L4], with dual family (e0,e1,e2,e3), a basis of V∗ by [L3]. For all a,b one has Φ(ea)(eb)=η(ea,eb)=ηaaδab with ηaa∈{−1,1}, by [L4], and the functional ηaaea takes the same values on the basis (eb); two linear functionals that agree on a basis agree on every vector, so Φ(ea)=ηaaea, which exhibits ea=ηaaΦ(ea) as a scalar multiple of Φ(ea) (here ηaa−1=ηaa). Hence every element of the basis (ea) of V∗ lies in the linear span of Φ(e0),…,Φ(e3), so that span is all of V∗; therefore Φ is surjective.

2.1step 1.1step 1.2L1L3L5L6

The map Φ is a linear bijection, dim⁡V∗=dim⁡V=4, and the inverse assignment ♯ exists with the stated properties. By step 1.1 Φ is injective and by step 1.2 it is surjective, hence bijective; by [L3] and [L1], dim⁡V∗=dim⁡V=4; and [L5] applied to the linear map Φ gives the same picture independently, nullity⁡Φ=dim⁡ker⁡Φ=0 and rank⁡Φ=4=dim⁡V∗, with rank⁡Φ=dim⁡im⁡Φ and im⁡Φ=V∗ by step 1.2. By [L6] the inverse Φ−1:V∗→V is a well-defined linear map, unique, and satisfies Φ−1∘Φ=id⁡V and Φ∘Φ−1=id⁡V∗. Writing k♯:=Φ−1(k) for k∈V∗, we get η(k♯,w)=Φ(k♯)(w)=k(w) for every w∈V; any c with η(c,w)=k(w) for all w satisfies Φ(c)=k, hence c=k♯ by injectivity of Φ, which is the asserted uniqueness. The two inverse equations are exactly (v♭)♯=v for v♭=Φ(v) and (k♯)♭=k, and k♯=0 holds if and only if k=Φ(k♯)=Φ(0)=0. This proves (a), (b) and (c).

3.1step 1.2step 2.1L1L4algebra

Component formula. Let k∈V∗ and keep the orthonormal basis (ea) of step 1.2; put c0:=−k0 and ci:=ki for i=1,2,3, where ka=k(ea), and set c:=c0e0+c1e1+c2e2+c3e3. For every basis vector eb, bilinearity and orthonormality [L1, L4] give η(c,eb)=∑acaη(ea,eb)=cbηbb; hence η(c,e0)=−c0=k0=k(e0) and η(c,ei)=ci=ki=k(ei) for i=1,2,3. The functionals w↦η(c,w) (linear in its second argument by [L1]) and k agree on the basis (eb), hence on all of V; therefore Φ(c)=k, and uniqueness in step 2.1 yields c=k♯=−k0e0+k1e1+k2e2+k3e3.

4.1step 2.1step 3.1L4L7∎

Quadratic form and causal trichotomy. With k♯=∑acaea from step 3.1, bilinearity and orthonormality give η(k♯,k♯)=∑a,bcacbη(ea,eb)=∑a(ca)2ηaa=−(c0)2+(c1)2+(c2)2+(c3)2=−(k0)2+(k1)2+(k2)2+(k3)2, because (c0)2=(k0)2 and ci=ki. If k≠0 then k♯≠0 by step 2.1, so [L7] applies: k♯ is null exactly when this value is 0, that is when (k0)2=(k1)2+(k2)2+(k3)2; timelike exactly when it is negative, that is when (k0)2>(k1)2+(k2)2+(k3)2; and spacelike exactly when it is positive, that is when (k0)2<(k1)2+(k2)2+(k3)2. If k=0 then k♯=0 by step 2.1 and the zero vector has no causal character by [L7]. No orientation, time orientation or affine structure was used, and no choice principle was used.

Depends on

Dependency tree · 2 levels

Sources