Alphabeta Math
LemmaStatement: 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 isomorphisms glue over two trivializing opens

Statement

Let U,V be open in B. Suppose an oriented metric bundle has compatible normalized Thom classes on U, V, and W=UV, and cup product with each is a Thom isomorphism. Then the local classes glue to a unique normalized Thom class on UV, and cup product with it is an isomorphism.

Facts & Assumptions

Given: The ordered two-open cover and the compatible local Thom data in the statement.

[F1]

Thom isomorphism for a trivial oriented bundle supplies the local isomorphisms when the three restrictions are trivial; the proof below uses only the isomorphisms stipulated in the statement.

[F2]

Mayer vietoris sequence in singular cohomology gives the base two-open sequence with its difference convention.

[F3]

Relative singular cochain complex and The cover-small inclusion is a chain homotopy equivalence give the same small-chain construction for the disk/sphere pair.

[F4]

Relative cup product for an excisive triad gives the small-chain relative cup product, and Cup product Leibniz identity gives its cochain Leibniz rule. Relative cup products are natural and connector-compatible then gives naturality and the pair-connector identities.

[F5]

The Five Lemma for modules turns an isomorphism on four neighboring terms of an exact ladder into one on the middle term.

Proof

technique · relative Mayer–Vietoris and the five lemma
1.1

Put DT=D(ξ)T and ST=S(ξ)T. Let CU(DUV,SUV) be the quotient of C(DU)+C(DV) by its sphere subcomplex. The small-chain subdivision of [F3] makes its inclusion in the ordinary relative chain complex a chain-homotopy equivalence. There is a degreewise split exact chain sequence 0C(DW,SW)C(DU,SU)C(DV,SV)CU(DUV,SUV)0, where the last map is addition and the first is the signed pair of inclusions. Dualizing this split sequence gives a termwise exact cochain sequence whose first term is the small relative cochain complex and whose other maps are restriction and restriction-difference. Transporting its cohomology through the small-chain equivalence gives the ordinary relative Mayer–Vietoris sequence. The usual kernel/image chase in [F2] fixes its connecting map and signs.

F2F3
2.1

Compatibility says (uU,uV) lies in the kernel of the relative difference map. Exactness in step 1.1 supplies uHn(DUV,SUV;R) restricting to both local classes. Each fiber lies in at least one open set, so these restrictions show that u is normalized.

F1step 1.1
3.1

For every k, place the base Mayer–Vietoris sequence from [F2] over the relative sequence of step 1.1 shifted by n, and use cup product with u vertically. Restrictions commute by relative naturality in [F4]. For the Mayer–Vietoris connector, choose a cochain on one member lifting a difference cocycle. The lower connector is represented by its coboundary. The Leibniz rule in [F4], together with δu=0, says that the coboundary of the lifted cochain cupped with u is its coboundary cupped with u, up to the fixed degree sign. Thus the connector square commutes with that unit sign by a direct calculation in the termwise split small-cochain sequences of step 1.1. The four outer vertical maps at the U, V, and W terms are the stipulated local Thom isomorphisms. Hence [F5] makes the middle map Hk(UV;R)Hk+n(DUV,SUV;R) an isomorphism.

F2F4F5step 1.1step 2.1
4.1

If u is another normalized gluing class, the isomorphism in step 3.1 writes uu=πau for a unique aH0(UV;R). Restriction to any fiber evaluates a at its basepoint times the orientation generator; normalization makes this zero, so a vanishes on every component and u=u. If U, V, or W is empty, the sequence reduces to an identity or disjoint finite additivity and the same argument applies. Rank zero, the zero ring, a one-set cover, zero classes, both difference-map endpoints, and every graded connector sign are included. Exactness supplies one class for one compatible pair; it does not choose an indexed family, so no AC is used.

F2F4step 1.1step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

29 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