Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Finite-CW real bundles have orthogonal complements under AC

Statement

Assume AC. If X is a finite CW complex and E→X is any finite-rank real vector bundle, then E is isomorphic to a subbundle of a finite trivial bundle and has an orthogonal vector-bundle complement.

Facts & Assumptions

Given: ZF+AC, a finite CW complex X (meaning a CW complex with finitely many cells), and a finite-rank real vector bundle E→X.

[F1]

A CW complex is Hausdorff and is built from closed disks by characteristic maps (CW complex with closure finiteness and weak topology).

[F2]

Every compact topological space is paracompact (Every compact space is paracompact).

[F3]

Under AC and DC, every open cover of a paracompact Hausdorff space admits a locally finite subordinate partition of unity (Under choice and dependent choice, every open cover of a paracompact Hausdorff space admits a locally finite subordinate partition of unity).

[F4]

AC implies the prescribed-initial-point form of DC (AC supplies the dependent-choice instances used in vector-bundle constructions).

[F5]

A finite numerated real vector bundle over a compact Hausdorff base embeds in a finite trivial bundle and has its standard orthogonal complement (A numerated real bundle embeds in a finite trivial bundle).

Proof

technique · finite numeration followed by the explicit embedding
1.1givenF1algebra

If X is empty, the claim is vacuous; assume it is nonempty. Each closed cell of X is the continuous image of a closed disk and hence compact. Since there are finitely many cells, X is a finite union of compact closed-cell images, so it is compact; [F1] gives Hausdorffness.

2.1givenF2F3F4step 1.1choose

By [F2] and step 1.1, X is paracompact and Hausdorff. The bundle's local trivializations form an open cover of X. Compactness gives a finite subcover. Apply [F3] to this cover: its AC and DC hypotheses hold because AC is given and [F4] derives DC. The resulting locally finite partition has only finitely many nonzero members: choose for each point a neighborhood meeting finitely many supports, then take a finite subcover of those neighborhoods by compactness; the union of the finite index sets is finite. Thus the chart subcover and partition give a finite numeration.

3.1F5step 2.1∎

Apply [F5] to this finite numeration. It supplies a fiberwise-linear embedding E↪X×RN and the subbundle F orthogonal to its image in the standard Euclidean metric. The fiberwise orthogonal direct sum is the whole trivial bundle, so E⊕F≅X×RN. AC is used to obtain the partition in [F3] and, through [F4], to discharge its DC hypothesis in step 2.1.

Depends on

Used by

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