Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Smooth Banach vector bundle and section

Definition

Let M be a smooth (C) Banach manifold modelled on the real Banach space E (Countable base Banach manifold and smooth map) and let F be a real Banach space whose norm topology is second countable (Banach space). This countability hypothesis makes the product U×F, with its product atlas, a Banach manifold in the library's second-countable convention.

A smooth Banach vector bundle over M with fibre F is a smooth Banach manifold E together with a surjective smooth map π:EM (Countable base Banach manifold and smooth map) such that:

  1. every fibre Ep:=π1(p), pM, is a real vector space;
  2. for every pM there is an open neighbourhood U of p and a local trivialization, a diffeomorphism Φ:π1[U]U×F satisfying pr1Φ=π, whose restriction Φq:=pr2ΦEq:EqF is a linear isomorphism for every qU;
  3. cocycle condition: if Φ over U and Ψ over V are local trivializations, then on π1[UV], ΨΦ1(q,v)=(q, g(q)v) for a map g:UVB(F) into the bounded operators on F (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators) whose representative in every base chart is C in the Banach-space sense, and g(q) is invertible for every qUV.

A smooth section of π is a smooth map s:ME with πs=idM. Its zeros are the points pM with s(p)=0, the zero of the vector space Ep. In a local trivialization Φ over U the section corresponds to the smooth map σ:=pr2Φs:UF, and s(p)=0 if and only if σ(p)=0.

At a zero p of s the vertical derivative of s at p is

Dvs(p):TpMEp,Dvs(p)(ξ):=Φp1(Dσ(p)ξ),

where Φ is any local trivialization around p and Dσ(p) is the differential of the smooth manifold map σ at p, the target F being read with its single identity chart; ξ denotes a tangent vector in TpM.

Remarks

DσΨ(p)=g(p)DσΦ(p)+Dg(p)σΦ(p)=g(p)DσΦ(p),

the last term vanishing because σΦ(p)=0. Since Ψp=g(p)Φp as linear isomorphisms EpF, the two prescriptions give the same element of Ep.

  • Fibrewise linear structure is intrinsic. The linear structure on Ep is part of the data, and each trivialization restricts to a linear isomorphism on it. The transition maps are fibrewise bounded linear and depend smoothly on the base; the vector bundle axioms are not restated here as a list of identities because they are exactly the conditions 1–3 above.

  • The zero section. The assignment p0Ep is a smooth section, the zero section, whose vertical derivative at every point is the zero operator. Transversality of a section s to the zero section is the condition that at every zero p the map Dvs(p) is surjective with complemented kernel (A complemented closed subspace of a normed space); it is the hypothesis of the next theorem on this page, where the zero set is straightened.

  • Ranks and dimension. Nothing is assumed about the dimension of F or of E beyond the second-countability convention above; the fibre may be infinite dimensional and second countable, which is exactly the case the infinite-dimensional transversality theorem below needs. When dimF< and Dvs(p) is onto, its kernel has finite codimension in TpM and is therefore automatically complemented, so the local condition of transversality reduces to surjectivity (Closed finite-codimensional subspaces are complemented).

Depends on

Used by

Dependency tree · two levels

34 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