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

Natural singular-cohomology identities are detected on finite regular complexes

Statement

Assume AC. Fix a prime p and m,n≥0. Suppose that for every space X there is a map

RX:Hm(X;Fp)⟶Hn(X;Fp)

natural in the sense that f∗RX(x)=RK(f∗x) for every continuous f:K→X. If RK=0 for every finite regular cell complex K, then RX=0 for every space X. Neither additivity of R nor a simultaneous finite model for all classes is required.

Facts & Assumptions

Given: AC, the prime p, nonnegative degrees m,n, and the natural family R in the statement.

[F1]

Singular chain groups are made of finite formal sums (Singular simplices and singular chain groups with coefficients); their boundary squares to zero, and homology is cycles modulo boundaries (The singular chain complex and singular homology).

[F2]

Over Fp, singular cochains are the full linear dual of the singular chains (Singular cochain complex with coefficients).

[F3]

The singular-cochain coboundary is δψ=ψ∂ (Singular cochain complex with coefficients).

[F4]

A continuous map pulls a cohomology class back by precomposition with its induced singular chain map (Singular cohomology is contravariantly functorial).

[F5]

The mod-p Kronecker pairing is well-defined and natural: ⟨f∗α,z⟩=⟨α,f∗z⟩ (The kronecker pairing is independent of cocycle and cycle representatives).

[F6]

AC supplies a choice function for every family of nonempty sets (The Axiom of Choice).

Proof

technique · realize each individual singular cycle on a finite Delta complex, subdivide it to a finite regular complex, and use evaluation to detect the cohomology class
1.1F1

Realize a mod-p singular cycle on a finite regular complex. Let z∈Zn(X;Fp) and write its finite support as z=∑r=1Narσr. Form the finite Delta complex Pz generated by these labeled top simplices and all their iterated face restrictions: two face occurrences are attached to the same lower simplex exactly when they are the same singular simplex of X, and all attaching maps are the corresponding order-preserving affine face maps. The simplicial identities make these attachments compatible in lower dimensions. Mapping the cell labeled by a singular simplex τ by τ itself gives a continuous map g:Pz→X.

Put ξ=∑rar[σr]Pz in the Delta-chain group. For every labeled (n−1)-simplex τ, its coefficient in ∂ξ is exactly the coefficient of the singular basis element τ in ∂z, hence is zero in Fp. Thus ξ is a mod-p cycle and g∗[ξ]=[z]. This construction also covers n=0: Pz is the finite discrete set of labeled vertices in the support, carrying their coefficients ar.

The second barycentric subdivision Kz of a Delta complex is a finite simplicial complex, hence a finite regular cell complex. The affine subdivision operator is a chain map and the cone calculation ∂T+T∂=1−S makes it chain-homotopic to the identity. Therefore the subdivided cycle ζ and the composite f:Kz→Pz→X satisfy

f∗[ζ]=[z].

All face identifications, coefficient operations, and subdivisions here are finite prescribed operations; no choice principle is used.

1.2F2F3F6

Prove that evaluation detects a mod-p cohomology class. Let a degree-n cocycle φ vanish on every degree-n cycle. If n=0, every zero-chain is a cycle and hence φ=0. Suppose n>0. For u∈Bn−1=∂Cn(X;Fp), choose any c with ∂c=u and define b0(u)=φ(c). This is well-defined: two choices differ by a cycle, on which φ vanishes. It is linear by using sums and scalar multiples of preimages. By [F6], choose a vector-space complement M with Cn−1=Bn−1⊕M, and extend b0 by zero on M to a cochain b. Then [F3] gives

δb(c)=b(∂c)=b0(∂c)=φ(c)

for every c∈Cn. Thus φ=δb. Consequently, if a class in Hn(X;Fp) pairs to zero with every homology class, it is zero. The sole AC use is the complement of the possibly infinite-dimensional boundary subspace.

2.1givenF4F5step 1.1step 1.2

Apply the finite hypothesis to every evaluation cycle. Fix a space X and x∈Hm(X;Fp), and put α=RX(x). For any mod-p n-cycle z, choose f:Kz→X and ζ as in step 1.1. Naturality of R and the assumed finite-complex vanishing give

f∗α=f∗RX(x)=RKz(f∗x)=0.

By [F5] and f∗[ζ]=[z],

⟨α,[z]⟩=⟨α,f∗[ζ]⟩=⟨f∗α,[ζ]⟩=0.

Step 1.2 now yields α=0. Since X and x were arbitrary, RX=0 for every space.

3.1F1F2F3F6step 1.1step 1.2step 2.1∎

Check empty, zero, endpoint, and degeneracy cases. If X is empty, its chain, homology, and cohomology groups in the stated degrees are zero. The zero cycle may be represented by the empty finite complex and evaluates to zero. The case n=0 was handled separately in the evaluation-detection step; degree m=0 requires no change because naturality alone is used on the input. A one-term zero-cycle with any nonzero coefficient is represented by one weighted vertex. Degenerate singular simplices are still finite basis elements and may label cells whose map to X is degenerate. Both implications in the displayed naturality equality are literal equalities, not directions of a biconditional. Finite face identification and subdivision use no choice; AC is used only for the complement in step 1.2.

Depends on

Dependency tree · 2 levels

Sources