Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31
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.

Every short exact sequence of smooth vector bundles splits

Statement

Every short exact sequence of smooth vector bundles over one base,

0EiGqF0,

admits a smooth splitting s:FG with qs=idF.

Facts & Assumptions

Given: A short exact sequence of smooth vector bundles over one base M.

[L1]

Constant-rank kernels and images of bundle maps over one base are smooth subbundles (Constant-rank kernels and images of bundle maps over one base are subbundles).

[L2]

Every vector subbundle has a smooth complement (Every vector subbundle has a smooth complement).

[L3]

A fibrewise bijective smooth bundle map over the identity is a bundle isomorphism (A fibrewise bijective smooth bundle map over a diffeomorphism is a bundle isomorphism).

Proof

technique · direct
1.1

Exactness gives i(E)=kerqG. By [L1], this image is a smooth subbundle of G. Choose a smooth complement HG to i(E) by [L2], so Gp=i(Ep)Hp for every pM.

L1L2givenchoose
2.1

Because ker(qHp)=Hpi(Ep)=0 and qp is surjective, qH:HF is fibrewise bijective. By [L3] it is a smooth bundle isomorphism, so its inverse s:FHG is smooth and satisfies qs=idF. Thus the sequence splits.

L3step 1.1algebra

Depends on

Used by

Dependency tree · two levels

15 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