Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

BMT transport constraint and restricted-ansatz algebra

Statement

Assume Countable Choice for the canonical tangent-bundle smooth structure supplied by the GR items below. Let (M,g,N) be a smooth time-oriented Lorentzian four-manifold with its metric-compatible connection ∇, let c>0, and let I⊆R be a nonempty open interval of proper-time values. Let z:I→M be a C2 future timelike curve and set U:=dz/dτ, with g(U,U)=−c2. For a C1 vector field V along z, define its covariant derivative by the pullback connection DτV:=(z∗∇)∂/∂τV; in a chart this means (DτV)a=dVa/dτ+Γabc(z(τ))UbVc. Let Fτ be a continuous alternating two-form along z. Define Fτ♯ by g(Fτ♯(v),w)=Fτ(w,v). Then Fτ♯ is skew-adjoint with respect to g.

For constants α,a,b∈R, consider a C1 vector field s along z satisfying the restricted linear transport equations DτU=αF♯(U),Dτs=α(aF♯(s)+bc2U κ),κ:=g(s,F♯(U)). For every τ0∈I and initial value s(τ0) there is a unique solution on each compact subinterval of I containing τ0. Along any such solution, ddτg(U,s)=α(1−a−b)κ. Consequently, the orthogonality constraint g(U,s)=0 is preserved when a+b=1, and on that constraint g(s,s) is constant. For the coefficient comparison, fix a parameter value τ and put n:=U(τ)/c. Then n is an observer at z(τ) and its rest space is the three-dimensional positive-definite subspace Eτ:=n⊥=U(τ)⊥ (the observer and projection conventions are those of Observers, rest spaces and the spatial projection at an event and The observer rest-space decomposition and the spatial projection). Choose an orientation of Eτ and a positively oriented orthonormal basis (e1,e2,e3); set e0:=n. For v∈Eτ, write v=(g(v,e1),g(v,e2),g(v,e3)), use (u×v)i=ϵijkujvk, and define B by Fij:=F(ei,ej)=ϵijkBk. Let PU(v):=v+g(U,v)U/c2, the projection onto Eτ, and fix a target coefficient G∈R. The rest-space matching condition means the pointwise equality (PU(Dτs))i=αG (s×B)i(i=1,2,3) for every s,B∈R3, when s(τ)∈Eτ. Thus it compares spatial components of the covariant derivative at the event, not the derivative of components in an unspecified moving tetrad. For α≠0, if the coefficients both preserve g(U,s)=0 for every initially orthogonal datum and every allowed alternating field and satisfy this matching condition, then a=G and b=1−G. Conversely, these coefficients satisfy both requirements. This uniqueness is only within the displayed two-term ansatz; no uniqueness among all covariant spin-transport laws is asserted. If α=0, the rest-space matching condition does not identify a or b.

Facts & Assumptions

Given: The stated Lorentzian manifold, its metric-compatible connection, c>0, a C2 future timelike proper-time curve, a continuous alternating two-form along that curve, real coefficients α,a,b, and an initial vector s(τ0).

[A1]

Countable Choice, inherited from the GR smooth-structure supplier The Axiom of Countable Choice (ACω), is the only choice assumption used by the GR connection interface.

[A2]

The restricted transport equations, real coefficients, continuous alternating two-form, proper-time normalization, and initial spin vector are exactly the data in the Statement.

[F1]

The metric-selected connection is metric-compatible: along a curve, the covariant derivative differentiates the metric pairing by the Leibniz rule and the metric derivative vanishes. Existence and uniqueness of the metric-selected connection of a nondegenerate metric, and its extension to tensor fields

[F2]

A continuous locally Lipschitz vector field on an open Euclidean domain has a unique local solution through each initial point, and solutions with the same initial data agree on common intervals. Picard-Lindelöf local existence and uniqueness for first-order systems

[F3]

At a point of the curve, U/c is an observer; its orthogonal complement is a three-dimensional positive-definite rest space with projection hU/c, as specified in Observers, rest spaces and the spatial projection at an event and proved in The observer rest-space decomposition and the spatial projection. The coordinate cross product in a chosen positively oriented orthonormal basis is (u×v)i=ϵijkujvk. The cross product in R3

[F4]

The coefficient comparison uses the pointwise projected rest-space matching condition in the Statement for every s,B; it is a matching condition, not a claim about measured magnetic moments.

Proof

technique · direct
1.1givenA1F1algebra

Alternation gives g(F♯v,w)=F(w,v)=−F(v,w)=−g(v,F♯w), so F♯ is g-skew. By [F1] and the product rule, ddτg(U,s)=g(DτU,s)+g(U,Dτs)=ακ+α(a g(U,F♯s)+b g(U,U)c2κ). Skew-adjointness gives g(U,F♯s)=−κ, and g(U,U)=−c2; therefore the derivative equals α(1−a−b)κ.

1.2givenF2algebra

In any chart along a compact subinterval, the spin equation is a linear system s˙=A(τ)s with continuous coefficients: the connection coefficients, U, F, and g are continuous on the compact curve image. Its right-hand side is locally Lipschitz in s, so [F2] gives local existence and uniqueness. The coefficient norm is bounded on each compact chart subinterval, say by C; iterating the integral equation gives ∥s(τ)∥≤∥s(τ0)∥∑n≥0(C∣τ−τ0∣)n/n!=∥s(τ0)∥eC∣τ−τ0∣. Hence no finite endpoint blow-up occurs there, and finitely many chart subintervals cover any compact part of I; uniqueness patches the solutions across chart overlaps.

2.1givenF1step 1.1algebra

If a+b=1, step 1.1 makes g(U,s) constant, so its zero initial value remains zero. On this constraint, 12ddτg(s,s)=g(s,Dτs)=α(a g(s,F♯s)+bc2g(s,U)κ)=0, since F♯ is skew and g(s,U)=0.

3.1givenA2F3F4step 1.1algebra∎

At the fixed event, e0=U/c and g(U,s)=0 give s=∑jsjej. The projection PU kills the term proportional to U, while for every spatial index i, g(F♯(s),ei)=F(ei,s)=Fijsj=ϵijkBksj=(s×B)i by [F3]. Thus the projected equation is (PU(Dτs))i=αa(s×B)i. For α≠0, matching [F4] for all s,B forces a=G (choose a nonzero cross product). Independently, requiring preservation for every initially orthogonal datum and every alternating F forces a+b=1 by step 1.1: nonzero κ is attainable, for example by taking s=e1 and an alternating F with F(e1,e0)≠0. Hence b=1−G. The equations do not identify a,b when α=0.

Remarks

The proof is a conditional calculation for an already specified smooth connection and transport equation. The Countable Choice requirement is inherited through the supplied GR tangent-bundle and connection construction; no choice is used in the coefficient algebra.

Depends on

Dependency tree · 2 levels

Sources