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

Assuming countable choice, the global differential of a smooth map is smooth

Statement

Assume ACω. If F:M→N is smooth, then the global differential dF:TM→TN is a smooth map.

Facts & Assumptions

Given: The axiom ACω and a smooth map F:M→N.

[F1]

The global differential sends v∈TpM to dFp(v) (The global differential or tangent map).

[L1]

In bundle charts, the fiber coordinates of dFp are given by the Jacobian matrix of the coordinate representative of F (Coordinate formula for the differential).

[L2]

Assuming ACω, tangent bundles carry the smooth structures induced by bundle charts (Assuming countable choice, the tangent bundle has a canonical smooth 2n-manifold structure).

Proof

technique · direct
1.1F1L1L2given

Choose charts (U,x) on M and (V,y) on N with F(U)⊆V, and let F~:=y∘F∘x−1. In the induced bundle charts, [L1] gives y~∘dF∘x~−1(a,v)=(F~(a),DF~(a)v).

2.1step 1.1

The map a↦F~(a) is smooth, the matrix entries of DF~(a) are smooth, and matrix-vector multiplication is polynomial in those entries and the components of v. Therefore the displayed local formula is smooth.

3.1L2step 2.1∎

Since this holds in bundle charts, [L2] implies that dF:TM→TN is smooth.

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