Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

The Whitney-sum monoid of complex vector bundles

Definition

For a compact Hausdorff space X, let

VectC(X)

be the set of isomorphism classes of finite-rank complex vector bundles over X. Here a finite-rank bundle is allowed to have locally varying rank: it is a finite disjoint clopen decomposition X=jXj together with a fixed-rank bundle in the sense of Real and complex topological vector bundles over each Xj. Equivalently, its fiber-dimension function is locally constant; compactness of X makes its image finite and its rank fibers clopen. Thus no single global rank is imposed, but the notion is reduced to the library's fixed-rank bundles on finitely many clopen pieces.

Define

[E]+[F]=[EF],0=[0X],

where 0X=X×C0. This is well-defined on isomorphism classes by Bundle maps, sections, subbundles, and isomorphisms and Whitney sum, tensor, dual, Hom, and exterior-power bundles, applied on the finite common refinement of the two rank decompositions. The fiberwise swap, reassociation, and zero maps are bundle isomorphisms, so Whitney sum makes VectC(X) a commutative monoid.

When X=, every total space of a bundle over X is empty. Hence there is one isomorphism class, and VectC() is the one-element monoid.

Depends on

Used by

Dependency tree · two levels

7 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