Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-30
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.

Tangent-bundle chart transitions are smooth with smooth inverses

Statement

If (U,x) and (V,y) are smooth charts on M, then the transition map y~x~1 on x~(π1(UV)) is smooth, and so is its inverse.

Facts & Assumptions

Given: Smooth charts (U,x) and (V,y) with nonempty overlap.

[F1]

The induced tangent-bundle chart records the base coordinate together with the coefficients in the coordinate tangent basis (The induced tangent bundle chart).

[L1]

Tangent bases transform by the Jacobian of the coordinate change (Change-of-coordinate formula for tangent bases).

[L2]

Matrix inversion preserves Ck regularity on the general linear group (Matrix inversion preserves Ck regularity where the determinant is nonzero).

Proof

technique · direct
1.1

If v=ivixip, then [L1] gives v=jwjyjp with w=J(a)v, where a:=x(p) and J(a)=D(yx1)(a). Hence y~x~1(a,v)=(yx1(a),J(a)v).

F1L1given
2.1

The base part yx1 is smooth, the matrix-valued map aJ(a) is smooth, and matrix-vector multiplication is polynomial in the entries; therefore the transition map is smooth.

step 1.1
3.1

Reversing the roles of x and y gives the inverse transition, whose fiber matrix is J(a)1. The smoothness of this inverse matrix field follows from [L2], so the inverse transition is smooth.

L1L2step 1.1

Depends on

Used by

Dependency tree · two levels

11 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