Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

Three projective degrees suffice for twisted first-homology comparison

Statement

Let R be any unital ring, let S be a left R-module, and let C2→d2C1→d1C0→ϵCS⟶0,D2→δ2D1→δ1D0→ϵDS⟶0 be augmented complexes of left R-modules, exact at C1,C0,S and at D1,D0,S. Suppose each of the six modules Ci,Di, 0≤i≤2, is projective. No exactness at C2,D2 or further degrees is required. There are augmentation-preserving chain maps through degree 2 between these complexes lifting 1S. For every right R-module N, any such comparison induces the same isomorphism of abelian groups H1(N⊗RC∙) ≅ H1(N⊗RD∙). These isomorphisms are inverse under reversing the complexes, compose for a third such complex, and are natural in homomorphisms of right coefficient modules. In particular a supplied augmentation-preserving chain map through degree 2 induces this isomorphism; its construction need not be the one chosen in the proof. Tensoring is not assumed exact, and N need not be flat. This is a comparison of supplied algebraic complexes, not an assertion that a presentation complex is a deformation retract or a homotopy-equivalent spine of another space.

Facts & Assumptions

Given: The possibly noncommutative ring, left augmented complexes and their exactness and projectivity as stated, and the right coefficient module N.

[F1]

A projective left module lifts any map from it across a surjective left-module map (Projective modules and the lifting property). Only a finite succession of such lifts will be needed.

[F2]

The tensor product pairs a right module with a left module and is generated by finite sums of elementary tensors, with the balanced relation (nr)⊗c=n⊗(rc) (The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums). In this generality the result is an abelian group, not an automatically defined R-module.

Proof

1.1F1givenconstructalgebra

Construct comparison maps in just three degrees. Lift ϵC:C0→S across the surjection ϵD using projectivity of C0, obtaining f0:C0→D0. The image of f0d1 lies in ker⁡ϵD=im⁡δ1, because ϵDf0d1=ϵCd1=0. Regard δ1:D1→ker⁡ϵD as a surjection, and use projectivity of C1 to lift this map to f1:C1→D1 with δ1f1=f0d1. Now δ1f1d2=f0d1d2=0, so f1d2 maps into ker⁡δ1=im⁡δ2. Lift it across D2→ker⁡δ1 by projectivity of C2, obtaining f2 with δ2f2=f1d2. This gives all required chain and augmentation identities. Reversing C,D produces a map g in exactly the same finite way. No exactness in degree2 was used.

2.1F1step 1.1givenconstructalgebra

Uniqueness up to the homotopy needed in degree one. More generally let f,f′:C→D be any two comparison maps lifting the same 1S, and put ai=fi−fi′. Since ϵDa0=0, projectivity of C0 and exactness at D0 give h0:C0→D1 with δ1h0=a0. The map a1−h0d1:C1→D1 has zero composite with δ1, because δ1a1=a0d1. By exactness at D1 and projectivity of C1, it therefore lifts to h1:C1→D2 with δ2h1=a1−h0d1. Thus a0=δ1h0 and a1=δ2h1+h0d1. No further homotopy degree is needed for first homology. This construction applies in particular to the two comparisons gf and 1C, and also to fg and 1D.

3.1F2step 1.1step 2.1givenconstructalgebra

Tensor the actual identities, without a flatness assumption. For each left-linear map u used above, define 1⊗u on elementary tensors by n⊗c↦n⊗u(c). It respects the balanced relation since u(rc)=ru(c), and it respects the additive relations in [F2]. Consequently these induced maps respect sums, differences, compositions and every chain identity above. If z∈N⊗RC1 satisfies (1⊗d1)z=0, the second identity of step2.1 becomes ((1⊗f1)−(1⊗f1′))z=(1⊗δ2)(1⊗h1)z, an actual boundary. Chain maps preserve cycles and boundaries, so this proves equality of their induced first-homology maps. Apply it to gf,1C and fg,1D to show that the induced maps of f and g are mutually inverse. This uses preserved homotopy identities, not preserved exactness of the tensored augmented complexes. In particular no flatness of N has entered.

4.1F1F2step 1.1step 2.1step 3.1givenalgebra∎

Compatibility, finite choice use and limits. A composite of augmentation-preserving comparisons is again such a comparison, so the uniqueness in step3.1 identifies its first-homology map with the unique comparison to the third complex. For a homomorphism q:N→N′ of right modules, the tensor maps q⊗1 commute with all 1⊗fi on each elementary tensor and hence on finite sums; this proves naturality. The same uniqueness shows that a separately supplied geometric or algebraic comparison induces exactly this isomorphism. Each lift in steps1.1–2.1 is supplied by the projectivity of its particular domain, and the proof takes only finitely many successive witnesses, including the reverse map and the two finite homotopies. No choice of lifts in all degrees, all objects or all coefficient modules is required: independence specifies a unique resulting map for each N. Zero modules, zero differentials compatible with the exactness assumptions, and the zero coefficient module obey the same equations. The proof neither constructs a topological spine nor assumes that arbitrary coefficient tensoring preserves exactness. This proves all the stated assertions with the prescribed left/right sides over an arbitrary ring.

Depends on

Used by

Dependency tree · two levels

9 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