Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

The finite Thom detector is an integral homology isomorphism below 2r−1

Statement

Assume AC. For f_r:T_r→P_r, f_{r*}:H_i(T_r;Z)→H_i(P_r;Z) is an isomorphism for i<2r−1 and a surjection for i=2r−1. No endpoint injectivity is asserted.

Facts & Assumptions

Given: AC; a rank r≥2; the detector fr:Tr→Pr; D=2r−1; and the integral singular-chain mapping cone Cf of fr.

[F1]

The mod-two comparison identifies the mod-two cohomology of source and target through degree D (The finite Thom detector is a mod-two cohomology isomorphism below 2r), and the away-from-two Thom and K(F2,q) calculations give rational and odd-primary vanishing of both reduced cohomologies below 2r (Unoriented Thom cohomology away from two and its strict endpoint, Finite type and odd-primary acyclicity of K(F₂,q)).

[F2]

The source and target have finitely generated integral homology and the cone has finitely generated homology with a degreewise split exact sequence (Integral finite generation of universal real and oriented Thom homology, Finite products and comparison cones have homological finite type); the finite-generation cohomological-UCT comparison converts vanishing field cohomology into vanishing cone homology (Finite-generation cohomological UCT gives integral cone comparison); AC underlies the field choices (The Axiom of Choice).

Proof

technique · direct
1.1givenF1

Set D=2r−1. The finite-type lemma and the away-from-two Thom theorem prove that for every field F of characteristic different from two, both reduced cohomology groups H̃^i(T_r;F) and H̃^i(P_r;F) vanish for 0<i<2r. In degree zero both spaces are connected, so the ordinary H⁰ map is also an isomorphism. The mod-two comparison above proves the F₂ cohomology isomorphism through every degree k≤D. Therefore f_r^* is an isomorphism in ordinary cohomology for F=Q and every F_p, in all degrees 0≤i≤D.

2.1step 1.1F2

Let C_f be the integral singular-chain mapping cone of f_r. The integral finite-generation theorem and the finite-product cone lemma prove H_i(T_r;Z) and H_i(P_r;Z) are finitely generated, so its cone long exact sequence makes H_i(C_f) finitely generated in every degree. The cone is free degreewise as an abelian chain complex. For each field F, the degreewise-split cone cochain sequence gives H^{i−1}(P_r;F)→H^{i−1}(T_r;F)→H^i(Hom(C_f,F)) →H^i(P_r;F)→H^i(T_r;F). The adjacent cohomology isomorphisms force H^i(Hom(C_f,F))=0 for 0≤i≤D (with negative groups zero at i=0). The cohomological UCT over Z surjects this zero group onto Hom(H_i(C_f),F). Thus Hom(H_i(C_f),Q)=0 and Hom(H_i(C_f),F_p)=0 for every prime p. A finitely generated abelian group with all these Hom groups zero is zero: Q detects any nonzero free summand, and F_p detects any nonzero p-primary cyclic summand. Therefore H_i(C_f)=0 for i≤D. The integral cone exact sequence yields the stated isomorphism for i<D and surjection at D.

3.1step 2.1F2∎

f_{r*} is an isomorphism for i<D=2r−1, f_{r*} is surjective for i=D=2r−1. This is exactly the endpoint needed below. It gives no injectivity assertion at degree 2r−1 and uses no comparison at or beyond 2r. The proof is the application of the finite-generation cohomological-UCT comparison; the finite-product cone computation independently records the same strict conclusion.

Depends on

Used by

Dependency tree · two levels

70 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