Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Right-trivialized differential of the Lie-group exponential

Statement

Assume ACω. Let G be a finite-dimensional real Lie group with Lie algebra g. For Z,Vg, right translation identifies the differential of the exponential with

d(RexpG(Z))expGZ(d(expG)ZV)=n=0adZn(V)(n+1)!.

The operator series converges absolutely in any norm and is denoted

eadZIadZ(V),

with the displayed power series—not division by a possibly singular adZ—as its definition.

More generally, for every finite-dimensional real vector space and every endomorphism B, the linear-ODE exponential used here satisfies

etB=n=0tnBnn!,

with absolute convergence uniformly on compact t-intervals.

Facts & Assumptions

Given: ACω, a finite-dimensional real Lie group G, and Z,Vg.

[F1]

Lie-group exponentials are smooth, and texpG(tW) is the integral curve of WL through the identity. The Lie-group exponential map is smooth with identity differential at zero. One-parameter subgroups are integral curves of left-invariant fields.

[F2]

Left and right translations and their differentials give the standard tangent trivializations. Left and right translations on a Lie group.

[F3]

Assuming countable choice, AdexpG(tZ)=etadZ, where the right side is the linear-ODE exponential. The Axiom of Countable Choice (ACω). Adjoint exponential identity.

[F4]

Linear matrix initial-value problems have unique solutions on compact intervals. Linear matrix ODEs have unique global solutions on a fixed interval.

[F7]

Differentials of smooth maps obey the chain rule. The chain rule for differentials of smooth maps.

Proof

technique · direct
1.1

Put B=adZ. In one basis, the operator series S(t)=n0tnBn/n! converges absolutely and uniformly on compact t-intervals, since its norm is bounded by the scalar exponential majorant n0(tB)n/n!. Coordinatewise termwise differentiation gives S(t)=BS(t) and S(0)=I. By [F4]--[F5], uniqueness therefore identifies S(t) with the linear-ODE exponential etB.

F4F5
1.2

Consider the smooth variation F(s,t)=expG(t(Z+sV)) and write γ(t)=F(0,t)=expG(tZ). Right-trivialize its variational field by ξ(t)=d(Rγ(t)1)γ(t)(sF(0,t)). By [F1], tF(s,t)=d(LF(s,t))e(Z+sV). Differentiate this identity in s, commute the two coordinate partial derivatives, and differentiate the right-trivialization using multiplication and inversion. The two terms containing Z cancel, leaving ξ(t)=Adγ(t)V and ξ(0)=0.

F1F2F7algebra
2.1

Consequently [F3] gives AdexpG(tZ)=S(t) for every real t. This is the exact point where ACω is used.

F3step 1.1
3.1

By steps 2.1 and 1.2, ξ(t)=S(t)V. The uniformly convergent series A(t)=n0tn+1Bn(V)/(n+1)! has A(0)=0 and, coordinatewise by [F5], A(t)=S(t)V. Applying [F6] to ξA on [0,1] gives ξ(1)=A(1)=n0Bn(V)/(n+1)!.

F5F6step 2.1step 1.2
4.1

By the definition of F and the chain rule, sF(0,1)=d(expG)ZV; by the definition of ξ, its value at one is the right translation of that vector by expG(Z). Step 3.1 is therefore exactly the asserted formula.

F2F7step 3.1
5.1

A Lie group is nonempty and boundaryless. In dimension zero both sides are the unique zero vector; in dimension one the bracket vanishes and the formula reduces to dRexp(Z)dexpZ(V)=V. Singular adZ is allowed because the quotient notation means its entire power series. The variation uses the compact interval [0,1] including both endpoints. Countable choice is inherited through [F1] and [F3]; one basis and fixed vectors add no choice. No metric dependence or biconditional is asserted.

F1F2F3F4F5F6F7step 1.1step 2.1step 1.2step 3.1step 4.1

Depends on

Used by

Dependency tree · two levels

75 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources