Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-12
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 cohomology universal coefficient sequence splits nonnaturally

Statement

Assume AC. The cohomology universal coefficient sequence for every space or pair and every abelian coefficient group G splits as abelian groups. Thus Hn(X,A;G)ExtZ1(Hn1(X,A;Z),G)HomZ(Hn(X,A;Z),G). An isomorphism requires choices of cycle projections; this assertion supplies no natural splitting in spaces and coefficients. Absolute cohomology is the case A=.

Facts & Assumptions

[F1]

Topological universal coefficient short exact sequence for cohomology supplies 0EιVβW0, with E,V,W the displayed groups.

[F2]

Singular UCT extension from cycle projections proves that u[uqπn] is a linear right inverse to evaluation for a fixed cycle projection. A free PID complex decomposes into two-term cycle-boundary pieces supplies πn under The Axiom of Choice.

Proof

Given: The free integral singular complex C of (X,A), and the groups E,V,W in [F1]. Assume AC.

1.1

Choose the cycle projection πn:CnZn from [F2] and let q:ZnHn be the quotient. For uW, define s(u)=[uqπn]. It is a cocycle because qπn kills Bn; restriction to Zn is uq, so βs(u)=u. Additivity follows from (u+v)qπn=uqπn+vqπn.

F2given
2.1

Define T:EWV by T(e,u)=ιe+s(u). If it is zero, apply β to obtain u=0, then injectivity of ι gives e=0. For any vV, the element vs(βv) has zero evaluation, so exactness gives a unique eE with ιe=vs(βv). Thus v=T(e,βv). The inverse is additive because this equation determines e uniquely and all its other maps are additive. Hence T is the claimed isomorphism.

F1step 1.1
3.1

If πn is another cycle projection, both sections have the same composite with β, so their difference has image in ιE. For each u, the difference is the class [uq(πnπn)]. No argument above makes this class zero, nor supplies projections compatible with all maps of spaces. Thus the constructed direct-sum map depends on the supplied projections; a failure of natural splitting is not inferred merely from this dependence. The separate counterexample page addresses nonexistence. For fixed C and fixed πn, coefficient postcomposition does commute with s by its formula.

F1step 1.1step 2.1
4.1

At n=0, E=0 and β is an isomorphism, so its inverse is the unique section. For an empty space, equal pair A=X, or G=0, all groups are zero; for a point in degree zero, T identifies G with Hom(Z,G) by evaluation at 1. AC enters through [F2] to supply the projections for arbitrary-rank chains and is already assumed in [F1]. The inverse construction in step 2.1 uses unique elements, not a further choice function.

F1F2step 1.1step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

14 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