Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

UCT as a two-column spectral sequence over the integers

Example

Assume AC. For a bounded-below free integer chain complex C and an abelian group M, the UCT sequence has only resolution columns p=0,1, and its finite decreasing filtration gives 0ExtZ1(Hn1C,M)HnHom(C,M)evHomZ(HnC,M)0. For C1=ZaZb, C0=Zc, da=2c,db=0, and M=Z/2, the nonzero E2 entries are Z/2 at (0,0),(1,0),(0,1). The target is Z/2 in degree zero and (Z/2)2 in degree one.

Facts & Assumptions

Given: The AC and bounded free-complex hypotheses above.

[F1]

UCT has page Extp(HqC,M) and finite decreasing filtration (Universal coefficient spectral sequence).

[F2]

Under AC submodules of free PID modules are free (A submodule of an arbitrary-rank free module over a PID is free).

[F3]

The UCT quotient is evaluation, and its cycle-boundary construction identifies the Ext kernel (The universal coefficient theorem for cohomology over a PID).

[F4]

A chosen cycle retraction supplies a UCT section; a chain shear prevents general naturality (UCT and Kunneth collapse retains an extension problem).

Verification

1.1

Present any abelian group by the free group on its underlying set. F2 makes the kernel free, and AC lifts arbitrary basis images to prove these free groups projective. Thus every such group has a projective resolution of length at most one and Ext vanishes for p>1. In F1 every dr for r2 changes p by at least two, so its source or target vanishes. Therefore E2=E, and F1Hn is the Ext-one term while Hn/F1Hn is the Hom term. The edge is restriction of a Hom cocycle to cycles, hence evaluation as in F3; the boundary quotient defining its kernel is the same free presentation of Hn1C used in F3. This proves the displayed exact sequence with its actual arrows.

F1F2F3
2.1

For the specified C, its homology is H0C=Z/2, H1C=Zb, zero elsewhere. Hom of the presentation Z2Z into M has zero differential, so Hom and Ext-one of Z/2 into M are both M. Hom of Z is M and its positive Ext is zero, using its one-term projective resolution. This gives exactly the three asserted page entries. Directly, Hom(C,M) is M0M2 in degrees zero and one, confirming both targets and zero in all other degrees.

F1step 1.1
3.1

In degree zero F0H0=M,F1H0=0. In degree one, identify a cochain by (x,y)=(f(a),f(b)); then F0H1=M2, F1H1=M0, F2H1=0. Evaluation is (x,y)y and the Ext injection is x(x,0). The section y(0,y) splits this particular extension. But aa+b fixes homology and induces (x,y)(x+y,y), which moves every lift of 1; hence no section is natural in C, in agreement with F4. The finite endpoints prove there is no unresolved convergence issue. AC is used for the general free-kernel argument and optional general sections; this displayed finite calculation itself makes no infinite choices.

F3F4step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

21 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