Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generated
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.

Worked geometry of the phase level sets of a future null wave covector

Example

This worked example computes the geometry of the phase level sets of a future null wave covector. Let (A,V,η,C+) be the oriented time-oriented affine Minkowski space, let k be a future null wave covector with frame data (ϖ,s) in an inertial frame (o;e0,e1,e2,e3) (Frame data of a future null wave covector: the unique pair (ϖ,s) with ∣s∣=1), so that ϖ>0, ∣s∣=1 and k has components ka=(−ϖ,ϖs1,ϖs2,ϖs3) in this frame, and let θ be an affine phase function with wave covector k (Affine phase functions and wave covectors on affine Minkowski space). Then:

(a) k(k♯)=η(k♯,k♯)=0, since the raised vector is k♯=ϖ(e0+s1e1+s2e2+s3e3); hence θ is constant on every line p+Rk♯.

(b) The direction subspace ker⁡k={v:k(v)=0}={v:v0=s⋅vvec} is 3-dimensional; for v∈ker⁡k one has η(v,v)=∣vvec∣2−(s⋅vvec)2≥0 by the finite Cauchy-Schwarz inequality, with equality exactly when vvec is a real multiple of s, that is exactly when v lies in the line span⁡(k♯); hence the restriction of η to ker⁡k is positive semidefinite with radical the line span⁡(k♯), and the only null direction contained in ker⁡k is the line through k♯, with future ray k♯ and past ray −k♯.

(c) Every nonempty level set Σ={p:θ(p)=θ(p0)} is the affine hyperplane p0+ker⁡k through p0, whose normal covector is the null covector k; it contains the two null rays p0+R≥0k♯ and p0+R≤0k♯, and all its other direction vectors are spacelike.

The verification is exact algebra; no choice principle is used.

Facts & Assumptions

Given: An oriented time-oriented affine Minkowski space (A,V,η,C+), a future null wave covector k with frame data (ϖ,s) in an inertial frame (o;e0,e1,e2,e3), and an affine phase function θ with dθ=k.

[L1]

ϖ>0, ∣s∣=1, ka=(−ϖ,ϖs1,ϖs2,ϖs3), k♯=ϖ(e0+s1e1+s2e2+s3e3), and k♯ is nonzero future null with k(k♯)=η(k♯,k♯)=0 (Frame data of a future null wave covector: the unique pair (ϖ,s) with ∣s∣=1, clauses (a)-(d)).

[L2]

k(v)=ϖ(−v0+s1v1+s2v2+s3v3) for every v=v0e0+vvec, and k(v)=0 if and only if θ is constant on every line p+Rv (Affine phase functions and wave covectors on affine Minkowski space, clauses (b)-(c)); ker⁡k is a 3-dimensional linear subspace when k≠0.

[L3]

For the frame, η(v,w)=−v0w0+δ(vvec,wvec) with δ(vvec,wvec)=∑iviwi and ∣vvec∣2=δ(vvec,vvec) (The Euclidean spatial structure and cross product of an inertial frame).

[L4]

Cauchy-Schwarz in root form: ∣∑k<nakbk∣≤∑k<nak2∑k<nbk2, with equality in the squared form exactly when the two lists are proportional in the sense that some (λ,μ)≠(0,0) has λak=μbk for all k; in the frame this gives ∣s⋅vvec∣≤∣s∣ ∣vvec∣ with equality exactly when s and vvec are proportional (The Cauchy-Schwarz inequality for finite sums, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[L5]

A vector is spacelike when η(v,v)>0, null when nonzero with η(v,v)=0, and the zero vector has no causal character (Timelike, null, spacelike and causal vectors of a Lorentz vector space).

[L6]

k♯ is future null and −k♯ is past null, and every nonzero vector in cl⁡(C+) is future causal (Time orientation, future and past timelike/null/causal vectors, and the closed cones, The timelike set has exactly two convex components, described in orthonormal coordinates).

Verification

technique · direct
1.1L1L2L3

Clause (a). By [L1], k♯=ϖ(e0+∑isiei) with ϖ>0 and ∣s∣=1, so η(k♯,k♯)=ϖ2(−1+∑isi2)=ϖ2(∣s∣2−1)=0 by [L1, L3], and k(k♯)=η(k♯,k♯) by [L1]. For every p∈A and λ∈R the defining identity of the phase gives θ(p+λk♯)=θ(p)+λk(k♯)=θ(p), so θ is constant on the lines p+Rk♯.

2.1step 1.1L2L3L4

Clause (b), kernel and sign. By [L2] and ϖ>0, v∈ker⁡k is equivalent to v0=s⋅vvec, and ker⁡k is a 3-dimensional subspace [L2]. For v∈ker⁡k, substituting v0=s⋅vvec into [L3] gives η(v,v)=−(s⋅vvec)2+∣vvec∣2; by [L4] with ∣s∣=1 this is ≥0, and it is 0 exactly when ∣s⋅vvec∣=∣vvec∣, which by the equality clause of [L4] holds exactly when vvec=λs for some real λ. For such a v, v0=s⋅vvec=λ, so v=λ(e0+∑isiei)=λϖ−1k♯ lies in span⁡(k♯); conversely every multiple of k♯ lies in ker⁡k because k(k♯)=0 by step 1.1. For every w∈ker⁡k one has η(k♯,w)=k(w)=0, so this line lies in the radical; conversely a radical vector has zero self-pairing and thus lies in this line by the equality calculation. Hence η∣ker⁡k is positive semidefinite, its radical is span⁡(k♯), and its only null elements are the nonzero multiples of k♯.

3.1step 2.1L1L5L6

Clause (b), null directions. By [L1] and [L6] the vector k♯ is future null and −k♯ is past null, so the nonzero multiples of k♯ are exactly the two rays R>0k♯ (future null) and R>0(−k♯) (past null) of the line span⁡(k♯); combined with step 2.1 and [L5], the line through k♯ is the only null direction contained in ker⁡k.

4.1step 1.1step 2.1step 3.1L2L5∎

Clause (c). By [L2] and step 2.1 the kernel of the nonzero functional k is the 3-dimensional subspace ker⁡k, and the level set Σ={p:θ(p)=θ(p0)} is the affine hyperplane p0+ker⁡k through p0; its direction subspace is ker⁡k, whose normal covector is k (the linear functional defining the direction subspace), and k is null by hypothesis. Since k♯∈ker⁡k by step 1.1, both rays p0+R≥0k♯ and p0+R≤0k♯ lie in Σ; every other direction vector of Σ lies in ker⁡k outside span⁡(k♯) and is spacelike by steps 2.1 and 3.1 and [L5]. This proves (a), (b) and (c). The computation is exact algebra and no choice principle was used.

Depends on

Dependency tree · 2 levels

Sources