Alphabeta Math
PropositionStatement: 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-invariant fields carry the opposite Lie bracket

Statement

Assume ACω. For X,Yg=TeG, let XR,YR be their ordinary right-invariant smooth extensions, and let [X,Y]G be the tangent bracket defined through left-invariant fields. Then

[XR,YR]=[X,Y]GR.

Thus evaluation identifies ordinary right-invariant fields with the opposite Lie algebra gop, not with the left-invariant bracket. The countable-choice assumption is used exactly through the supplied invariant-extension and tangent-bracket results.

Facts & Assumptions

Given: ACω, a Lie group G with inversion inv(g)=g1, and X,Yg=TeG.

[F1]

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

[F2]

Multiplication and inversion are smooth, and inversion is involutive. Lie group.

[F3]

Left- and ordinary right-invariant fields use Lg(h)=gh and Rg(h)=hg. Left- and right-invariant vector fields.

[F4]

Left and right invariant extensions exist uniquely and satisfy ZgL=d(Lg)eZ and ZgR=d(Rg)eZ. Left-invariant vector fields evaluate isomorphically at the identity.

[F5]

The tangent bracket satisfies [XL,YL]=[X,Y]GL. Lie bracket on the tangent space of a Lie group.

[F6]

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

[F7]

Tangent spaces of products split canonically as direct sums. Canonical tangent and cotangent splittings for products.

[F8]

The differential is defined by pullback of germs, and is a linear map. The differential of a smooth map, The differential sends derivations to derivations and is linear.

[F9]

Diffeomorphism pushforward preserves vector-field brackets. Diffeomorphism pushforward preserves Lie brackets.

[F10]

The field bracket is the commutator [U,V]f=U(Vf)V(Uf). The Lie bracket of smooth vector fields.

Proof

technique · direct
1.1

Let m:G×GG be multiplication and let j1(g)=(g,e), j2(g)=(e,g). Under [F7], d(j1)e(A)=(A,0) and d(j2)e(B)=(0,B). Since mj1=mj2=idG, the chain rule [F6] and linearity [F8] give dm(e,e)(A,B)=A+B.

F2F6F7F8algebra
2.1

The map gm(g,inv(g)) is constant at e. By [F8], its differential annihilates every tangent vector because derivations annihilate constant germs. Applying [F6] and step 1.1 gives 0=dm(e,e)(Z,d(inv)eZ)=Z+d(inv)eZ. Hence d(inv)e=idg.

F2F6F8step 1.1algebra
3.1

For hG, the identity invLh=Rh1inv and [F6] give d(inv)hd(Lh)eZ=d(Rh1)ed(inv)eZ=d(Rh1)eZ. By [F4], as h varies this says inv(ZL)=(Z)R=ZR.

F3F4F6step 2.1
4.1

Inversion is a diffeomorphism by [F2]. Apply [F9], step 3.1, and [F5]: [XR,YR]=[XR,YR]=[invXL,invYL]=inv[XL,YL]=inv([X,Y]GL)=[X,Y]GR. The first equality uses the bilinearity visible directly in the commutator formula [F10].

F5F9F10step 3.1algebra
5.1

A Lie group is nonempty. If dimG=0, all fields and brackets vanish; in dimension one the tangent bracket vanishes by alternation, so the displayed identity again reads zero equals zero. No metric or nondegeneracy condition occurs, and the group is boundaryless by convention. The stated ACω is inherited through [F3], [F4], and [F5]; the product differential, inversion, and bracket calculation are canonical and add no choice. The proposition is a one-way sign identity, not a biconditional.

F1F2F3F4F5F6F7F8F9F10step 1.1step 2.1step 3.1step 4.1

Depends on

Used by

Dependency tree · two levels

30 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