Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (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.

Path transport composes and transforms covariantly

Statement

For transport as in Connection path transport, with composition convention [δ]∘[γ]=[δ∗γ] meaning first traverse γ and then δ,

Uδ∗γ(1)=Uδ(1)Uγ(1),Uγˉ(1)=Uγ(1)−1.

Let E=(E0,E1,E2,E3) be the tetrad of Connection path transport. For each x∈U, let Ex:R4→TxM send the standard basis vector eI to EI(x); because the tetrad vectors are a basis, Ex is an invertible real-linear map, hence a linear isomorphism (Invertible linear maps, linear isomorphisms, and inverse linear maps). A groupoid is a category in which every morphism is an isomorphism (Isomorphism, groupoid, and connected category). Define the target groupoid T(U) to have base-point-tagged objects τx:=(x,TxM) for x∈U and morphisms τx→τy the tagged triples (τx,τy,L) where L:TxM→TyM is a real-linear isomorphism; identities and composition are tagged identity maps and ordinary composition (Category, object, morphism, domain, codomain, identity, composition, and hom-collection). A covariant functor assigns objects and morphisms and preserves identities and composition (Covariant functor, identity functor, composite functor, and contravariant functor). The functor from the thin path groupoid Thin path groupoid to T(U) sends x to τx and sends [γ]:x→y to the tagged tangent-space arrow

(τx,τy,Ey Uγ(1) Ex−1):τx⟶τy.

Here Uγ(1) acts on tetrad components, while Ey and Ex−1 convert between components and tangent vectors. Under the supplier convention e′=Λe, the component matrix in the changed local frame satisfies

Uγ′(1)=Λ(γ(1))Uγ(1)Λ(γ(0))−1.

Facts & Assumptions

Given: The transport ODE and curvature convention of Local Lorentz tetrad and connection, a piecewise-smooth path, and a smooth local Lorentz frame change Λ.

[F1]

Connection path transport: transport solves U′=−ω(γ˙)U with initial value I; on concatenated pieces the later piece multiplies on the left.

[F2]

Thin path groupoid: composition is represented by path concatenation, the identity by a constant path, and inverse by the reversed path.

[F3]

Connection transport is invariant under thin homotopy: thin-homotopic path representatives have the same transport matrix.

[F4]

Local Lorentz tetrad and connection: a Lorentz connection is η-skew, so ωTη+ηω=0; under e′=Λe, ω′=ΛωΛ−1−dΛ Λ−1.

[F5]

Isomorphism, groupoid, and connected category: in a groupoid every morphism has a two-sided inverse.

[F6]

Covariant functor, identity functor, composite functor, and contravariant functor: a covariant functor assigns objects and morphisms and preserves identity morphisms and composition.

[F7]

Invertible linear maps, linear isomorphisms, and inverse linear maps: a linear isomorphism is a linear map with a two-sided linear inverse.

[F8]

Category, object, morphism, domain, codomain, identity, composition, and hom-collection: a category has tagged morphisms with specified domains and codomains, identities, and associative composition.

Proof

technique · direct
1.1givenF1algebra

On the constant path the coefficient ω(γ˙) is zero, so the unique solution is U(t)=I. If γ is followed by δ, solve on the two parameter intervals with the terminal value from the first interval as initial value for the second. The second solution is Uδ(t)Uγ(1), so uniqueness gives Uδ∗γ(1)=Uδ(1)Uγ(1).

1.2givenF1F4algebra

Write η=diag⁡(−1,1,1,1). Along each smooth segment the derivative is ddt(UTηU)=UT(−ωTη−ηω)U=0 by [F4]; continuity across the finite segment endpoints gives U(t)TηU(t)=η throughout. Since η is nonsingular, each U(t) is invertible.

2.1givenF1F2F3step 1.2algebra

Let U(t) solve along γ. The matrix V(s):=U(1−s)U(1)−1 starts at I and, since γˉ˙(s)=−γ˙(1−s), satisfies V′(s)=−ω(γˉ˙(s))V(s). Hence uniqueness gives Uγˉ(1)=U(1)−1. By [F3], transport is independent of the representative of a thin class; [F1]–[F2] and the identities in steps 1.1–1.2 therefore give well-defined component maps on the thin path groupoid.

3.1F1F2F5F6F7F8step 1.1step 2.1algebra

For [γ]:x→y and [δ]:y→z, the associated tangent arrows compose as (EzUδEy−1)∘(EyUγEx−1)=EzUδUγEx−1=EzUδ∗γEx−1 by step 1.1. Constant paths give identity tangent maps, and reversed paths give inverse tangent maps by step 2.1. Thus the stated object and arrow assignments define a functor into T(U) by [F6], with arrows in the stated groupoid by [F5].

4.1givenF1F4algebra∎

Put U~(t)=Λ(γ(t))U(t)Λ(γ(0))−1. Differentiating and using U′=−ω(γ˙)U gives U~′(t)=(dΛ(γ˙)Λ−1−Λω(γ˙)Λ−1)U~(t)=−ω′(γ˙)U~(t) by the transformation law [F4]. Its initial value is I, so uniqueness identifies U~ with transport in the changed frame and gives the endpoint formula. Since Ex′=ExΛ(x)−1, the corresponding tangent map is frame independent: Ey′Uγ′(1)(Ex′)−1=EyUγ(1)Ex−1. This is a local frame covariance statement; it is a principal-bundle gauge action only when Λ has the global extension required by the cited gauge-group definition.

Remarks

The endpoint covariance is summarized by the commutative diagram below; the diagram records the source and target frame maps, while the proof above establishes the equality by differentiating the ODE.

R4E;°(0)R4E;°(1)R4E0;°(0)R4E0;°(1)U°¤(°(0))¤(°(1))U0°

No ordinary-homotopy invariance is asserted here. The design's ordinary-homotopy comparison is a separate flatness-dependent result; the thin path groupoid is the interface proved in this item.

Depends on

Dependency tree · 2 levels

Sources