Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 smooth vector bundle admits a connection

Statement

Assume AC. Every finite-rank smooth real vector bundle over a Hausdorff second-countable smooth manifold, with boundary allowed, admits a connection. No canonicity or smaller sufficient choice bound is asserted.

Facts & Assumptions

Given: The bundle EM and full AC.

[F1]

Compatible local one-form matrices determine a connection; a single frame with zero matrix gives the componentwise derivative (Local connection forms glue exactly when they obey the transformation law).

[F2]

Smooth partitions subordinate to open covers exist in the boundaryless and boundary settings (Smooth partitions of unity exist on manifolds, Smooth partitions of unity exist on manifolds with boundary). Here their constructions are used under full AC, including the point-indexed subordinate chart choices, shrinking choices and the family of bump choices; the advertised smaller choice bound is not used.

[F3]

A locally finite sum of smooth sections is smooth (Locally finite linear combinations of sections are smooth).

[A1]

AC supplies choices from arbitrary families of nonempty sets (The Axiom of Choice).

Proof

1.1

Choose a trivializing open cover together with a smooth frame on each member, using AC for any simultaneous frame selections. Apply the partition construction to obtain smooth ρi0, with locally finite supports, iρi=1, and an assigned framed open set Ui containing suppρi. Multiple indices may be assigned to the same original member. Full AC supplies all selections used in the subordinate-coordinate-ball and shrinking constructions, as well as the countable bump selections. In boundary charts the nested bumps are restricted from Euclidean balls to half-balls; the compact-annulus exhaustion proof of local finiteness uses only relative openness and compact closures and is unchanged by this restriction. Thus the boundary partition assertion is used under the same stronger assumption.

F2A1given
2.1

On Ui, let (i) be the connection with zero matrix in its chosen frame. For a global section s, form ρi(i)(sUi) on Ui and extend it by zero to M. This is a smooth section of Hom(TM,E): every point outside its closed support has a neighbourhood on which it is zero, and that support lies in Ui. The supports of these extended sections form a locally finite family because each is contained in suppρi.

F1step 1.1construct
3.1

Define s=iρi(i)s, with the extensions in step 2.1 understood. This is smooth by local finiteness. Real linearity follows termwise, and on a neighbourhood where the sum is finite, (fs)=iρi(dfs+f(i)s)=(iρi)dfs+fs=dfs+fs. The weights multiply the local operators; they are not arguments differentiated by those operators. This proves the connection law.

F3step 1.1step 2.1
4.1

If M is empty the zero operator is the required connection. Rank-zero bundles also have the unique zero operator, and a zero-dimensional base has no nonzero one-forms. For a supplied global frame one may simply use its zero-matrix connection without any partition or AC; rank one uses the same construction as all finite ranks. The theorem's full-AC assumption is confined to existence by the chosen cover route; statements starting with an already supplied connection do not use that route.

F1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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