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

Thom diagonal and zero-section collapse

Definition

For a metric bundle ξB, define on the disk bundle vπ(v)[v]B+Th(ξ). Every vS(ξ) maps to the smash-product basepoint, independently of its base coordinate. The quotient universal property therefore gives the Thom diagonal δξ:Th(ξ)B+Th(ξ);[v]π(v)[v].

The zero section is s:BD(ξ), s(b)=0b. It is continuous in every vector-bundle chart and is a section of π.

If an embedding i:BM is supplied with tubular data consisting of an embedding e:D(ξ)M satisfying es=i and that is a homeomorphism onto a closed neighborhood K, carries the interior of D(ξ) onto an open neighborhood N of B, and carries S(ξ) onto KN, the associated collapse is the based map c:M+Th(ξ) that sends xK to [e1(x)] and sends MN and the disjoint basepoint to the Thom basepoint. On KN the two formulas agree because e1(x)S(ξ), so closed pasting makes the displayed map continuous. This is a definition conditional on supplied tubular data; no tubular-neighborhood existence theorem is asserted.

For an empty base the Thom diagonal is the unique based map. In rank zero it is the ordinary based diagonal B+B+B+. Sphere points, the complement of the tubular neighborhood, and all quotient basepoints map to the stated basepoint. Identity bundle charts and the zero vector give the literal formulas. All maps are explicit and choice-free.

Depends on

Used by

Dependency tree · two levels

10 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