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 a mod-two cohomology isomorphism below 2r

Statement

Assume AC. For the detector f_r:T_r→P_r, the pullback f_r*:H̃ᵏ(P_r;F₂)→H̃ᵏ(T_r;F₂) is an isomorphism for every k<2r. No comparison is asserted at k=2r.

Facts & Assumptions

Given: AC; a rank r≥2; the finite detector fr:Tr→Pr of Finite Thom classifying detector map with its finite product of Eilenberg–Mac Lane factors; and the stable-coordinate isomorphism of the degreewise constancy lemma.

[F1]

The detector exists and is continuous, and its coordinate factors represent the chosen rank-r classes (The finite Thom classifying detector map exists and is continuous, Finite Thom classifying detector map); the Thom spaces are (r−1)-connected with the described cell structure (Universal real Thom spaces are (r−1)-connected).

[F2]

The strict metastable theorem identifies H~q+i(K(F2,q);F2) with Ai for 0≤i<q, and the polynomial presentation controls products of generators (Metastable cohomology of mod-two Eilenberg–Mac Lane spaces, Polynomial mod-two cohomology of Eilenberg–Mac Lane spaces); each factor is finite-dimensional in mod-two homology in every degree, so finite-product Künneth applies, and cohomology over a field is dual to homology (Finite type and odd-primary acyclicity of K(F₂,q), Cohomological Kunneth cross product is a ring isomorphism).

[F3]

The free-module decomposition of stable Thom cohomology provides the basis of H~k(Tr;F2) in the range r≤k<2r; AC underlies the global choices (The Axiom of Choice).

Proof

technique · direct
1.1givenF1

For k<r, the Thom-cell description gives H̃^k(T_r)=0. Every factor K(F₂,r+d_b) is (r−1)-connected, so the finite product has zero reduced cohomology in degrees below r. Thus f_r^* is an isomorphism in this range.

2.1step 1.1F2F3

Now let r≤k<2r and put e=k−r, so 0≤e≤r−1. The stable-coordinate isomorphism gives H̃^k(T_r;F₂) ≅ M^e = ⊕_{b∈B(r), d_b≤e} A^{e−d_b}m_b. The last equality is the graded free-module decomposition; generators with d_b>e cannot contribute because A has no negative degrees.

3.1step 2.1F2

The strict metastable theorem gives, strictly for 0≤i<q, H̃^{q+i}(K(F₂,q);F₂) ≅ A^i, a ↦ a(ι_q). For a factor indexed by b∈B_d, q=r+d. In total degree k<2r, its operation degree is i=k−q=e−d. When i≥0, i ≤ r−d−1 < r+d=q, so the strict Eilenberg–Mac Lane theorem applies. A product of two positive-degree polynomial generators, whether in one factor or in two factors, has degree at least 2r because every q≥r. Hence below 2r the cohomology of the finite product P_r is the direct sum of the single-factor operation classes H~k(Pr;F2)≅⨁b∈B(r), db≤eAe−db.

4.1step 3.1F2F3

H̃^k(P_r;F₂) ≅ ⊕_{b∈B(r), d_b≤e} A^{e−d_b}. Here finite-product Künneth applies: each factor has finite-dimensional F₂ homology in every degree by the finite-type lemma, hence finite-free homology over F₂; the polynomial presentation of the Eilenberg–Mac Lane cohomology gives the stated cohomology basis. The classifying-map evaluation identity gives fr∗(a(ιr+db))=a(mr,b).

5.1step 4.1F3∎

Under the stable-coordinate identification, the right side is exactly a·m_b. The free-module decomposition above says these classes form a basis of H̃^k(T_r). Thus f_r^* is an isomorphism for every k<2r. The endpoint is intentionally excluded. At degree 2r, products of two degree-r classes can occur in P_r, and the strict Eilenberg–Mac Lane computation does not identify them by the argument above. No claim at 2r is used.

Depends on

Used by

Dependency tree · two levels

60 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