Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

All complex vector bundles over the circle are trivial

Example

Every finite-rank complex vector bundle over S1 is trivial, including the rank-zero bundle. This contrasts with the nontrivial Möbius real line bundle.

Facts & Assumptions

Given: a rank-n complex vector bundle E→S1, where n≥0.

[F1]

Clutching over S1 represents E by a map g:S0→GL⁡n(C), and homotopic clutching maps give isomorphic bundles (Clutching classifies vector bundles over spheres in the stable range).

Verification

technique · direct
1.1constructalgebra

Suppose first that n>0. Every A∈GL⁡n(C) has polar form A=UP with U unitary and P positive definite. The path U((1−t)P+tI) joins A to U through invertible matrices. By the finite-dimensional spectral theorem, U=Wdiag⁡(eiθ1,…,eiθn)W∗ for real angles θj, and Wdiag⁡(ei(1−t)θ1,…,ei(1−t)θn)W∗ joins U to I. Hence GL⁡n(C) is path connected.

2.1F1step 1.1

The two values of g can therefore be joined independently to I, producing a homotopy S0×I→GL⁡n(C) from g to the constant identity map. By [F1], E is isomorphic to the identity-clutched bundle, which is S1×Cn.

3.1F1step 2.1∎

If n=0, then GL⁡0(C) is a point and the same conclusion is forced. The real argument fails at step 1.1 because GL⁡1(R)=R× has two components; the clutching values in different components give the Möbius line. No choice principle is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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