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

Real and complex topological vector bundles

Definition

Fix F{R,C} and n0. A rank-n F-vector bundle over X is a locally trivial bundle p:EX in the sense of Locally trivial fiber bundle, together with an F-vector-space structure on every fiber Ex=p1(x), whose local charts

ϕi:p1(Ui)Ui×Fn

restrict on every fiber to linear isomorphisms ExFn. Here Mn(F)Fn2 has its Euclidean topology and GLn(F) has the subspace topology; its underlying algebraic set is the one fixed in Invertible matrices and the general linear group GLn(F). The transition from chart ϕi to ϕj is therefore

ϕjϕi1(x,v)=(x,gji(x)v)

for a continuous gji:UiUjGLn(F). Indeed, evaluating the continuous chart change at each standard basis vector gives the matrix columns continuously, and its values are invertible because the chart change is fiberwise linear. Our index convention gives

gii=I,gki=gkjgji.

Rank is fixed in this definition. The case n=0 is the bundle XX with zero-dimensional fibers, and X= is allowed.

The bundle is numerable if it has a linear trivializing cover (Ui) together with a locally finite partition of unity (ρi) such that suppρiUi. The charts and the subordinate partition, when specified, are called a numeration.

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