Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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 vector bundle is globally trivial

Statement

Every smooth vector bundle is globally trivial.

Facts & Assumptions

Given: The displayed universal triviality claim.

[L1]

A smooth cocycle defines a smooth vector bundle (Construction of a vector bundle from a smooth cocycle).

[L2]

A smooth vector bundle is trivial if and only if it has a global frame (A vector bundle is trivial if and only if it has a global frame).

Refutation

technique · direct
1.1

Cover S1 by the two standard arcs U0=S1{(1,0)} and U1=S1{(1,0)}. Their overlap has an upper and a lower component. Define a rank-one cocycle by g10=1 on the upper overlap and g10=1 on the lower overlap. By [L1], this glues a smooth line bundle LS1.

L1givenconstruct
2.1

If L were trivial, then [L2] would give a nowhere-zero global frame. In local trivializations that would be given by nowhere-zero functions f0 on U0 and f1 on U1 with f1=f0 on the upper overlap and f1=f0 on the lower overlap. Since U1 is connected, a nowhere-zero continuous f1 has constant sign, but the two overlap equations force opposite signs. This contradiction shows that L is not trivial.

L2step 1.1contradiction

Depends on

Used by

Dependency tree · two levels

9 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