Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Thom spaces of zero and trivial bundles

Statement

Naturally in B, Th(0B)=B+;Th(B×Rn)=B+Sn=ΣnB+, and the trivial disk/sphere pair is (B×Dn,B×Sn1).

Facts & Assumptions

Given: A space B, the zero bundle, and the product bundle with its standard Euclidean metric.

[F1]

Disk, sphere, and Thom spaces of a metric vector bundle defines the disk, sphere, and based quotient, including the empty-sphere convention in rank zero.

Proof

technique · calculate the defining quotients
1.1

In rank zero each fiber is the singleton zero vector, so [F1] gives D(0B)=B and S(0B)=. By the based-quotient convention, Th(0B)=B+.

F1
1.2

For B×Rn with the product metric, the norm depends only on the second coordinate, hence (D,S)=(B×Dn,B×Sn1). Collapsing the second subspace gives (B×Dn)/(B×Sn1)B+(Dn/Sn1)=B+Sn.

F1
2.1

By definition B+Sn=ΣnB+. Every displayed map sends (b,v) by the identity formula and therefore commutes with pullback along a map BB. For B= both sides are the one-point based space; for n=0, S1= and step 1.2 reduces to step 1.1; for n=1 the boundary consists of the two endpoints. Zero and unit radii and the quotient basepoint are preserved, and no choice is used.

F1step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

2 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