Alphabeta Math
TheoremStatement: 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.

The Lie-group exponential map is smooth with identity differential at zero

Statement

Assume ACω. For a finite-dimensional real Lie group G, the exponential map

expG:g=TeGG

is smooth, satisfies expG(0)=e, and, under the canonical identification T0gg, has differential

d(expG)0=idg.

The countable-choice assumption is used exactly through the supplied smooth tangent-bundle trivialization and one-parameter-subgroup results.

Facts & Assumptions

Given: ACω and a finite-dimensional real Lie group G with identity e and Lie algebra g=TeG.

[F1]

ACω is countable choice. The Axiom of Countable Choice (ACω).

[F2]

The exponential map is the total map expG(Y)=γY(1). Exponential map of a Lie group.

[F3]

Assuming ACω, the map (g,Y)d(Lg)eY is a smooth vector-bundle trivialization G×gTG. Translations are diffeomorphisms and their differentials trivialize the tangent bundle.

[F4]

Assuming ACω, every Yg determines a unique global one-parameter subgroup γY, and γY(t)=d(LγY(t))eY. One-parameter subgroups are integral curves of left-invariant fields.

[F5]

The maximal flow of a smooth vector field has open domain, is smooth on that domain, and is uniquely determined by its maximal integral curves. The fundamental theorem on flows.

[F6]

The scaling identity is γY(a)=expG(aY) for all aR. Exponential scales one-parameter subgroups.

[F7]

Every one-parameter subgroup satisfies γ(0)=e. One-parameter subgroup of a Lie group.

[F8]

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

Proof

technique · direct
1.1

On the product manifold M=G×g, define X(g,Y):=(d(Lg)eY,0)TgG×TYg=T(g,Y)M. Its first component is the smooth map supplied by [F3], and its second component is the zero field on the vector space g. Hence X is a smooth vector field on M.

F3construct
2.1

For (g,Y)M, define cg,Y:RM by cg,Y(t)=(gγY(t),Y). By [F4], [F8], and LgLγY(t)=LgγY(t), cg,Y(t)=(d(Lg)γY(t)d(LγY(t))eY,0)=(d(LgγY(t))eY,0)=Xcg,Y(t). Thus cg,Y is an integral curve of X through (g,Y) and is defined on all of R. Every maximal integral curve of X is therefore global. By [F5], the global flow is smooth and is Ψ(t,(g,Y))=(gγY(t),Y).

F3F4F5F8step 1.1algebra
3.1

Restricting this smooth flow to (t,(e,Y)) and projecting to G shows that (t,Y)γY(t) is smooth. Restricting further to t=1 gives the map YγY(1)=expG(Y), which is smooth by [F2].

F2F5step 2.1
4.1

By [F6] with a=0 and [F7], expG(0)=γX(0)=e. Fix Xg and consider qX(a)=aX. Applying [F8] to expGqX and then [F6] gives d(expG)0(X)=ddaa=0expG(aX)=ddaa=0γX(a)=γX(0)=X. Hence d(expG)0 is the identity under T0gg.

F4F6F7F8step 3.1algebra
5.1

Lie groups are nonempty and boundaryless. If dimG=0, then g=0, the exponential maps the unique vector to e, and its differential is the identity of the zero space; in dimension one the proof is unchanged. The global curves in step 2.1 remove finite-time endpoint issues. No metric or nondegeneracy condition occurs. The only choice use is the stated ACω, inherited through [F2]--[F4] and especially the smooth tangent-bundle trivialization [F3]; forming one product field and restricting its flow adds no choice. No biconditional is asserted.

F1F2F3F4F5F6F7F8step 1.1step 2.1step 3.1step 4.1

Depends on

Used by

Dependency tree · two levels

26 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