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

Finite-free chain evaluation under the Blanchfield coefficient hypotheses

Statement

Let R be an associative unital ring with 1≠0 and no zero divisors, embedded as a unital subring in a division ring K, let N=K/R as a right R-module, and let C∗ be a chain complex of right R-modules with C0,C1 finite free and Cj=0 for j<0. If either H0(C∗)=0 or every right ideal of R is principal, then restriction to cycles induces an isomorphism of abelian groups κ:H1(Hom⁡R(C∗,N))⟶Hom⁡R(H1(C∗),N). If the coefficient Hom groups carry a compatible commuting left action, this is an isomorphism for that action as well. No choice principle is assumed.

Facts & Assumptions

Given: The displayed ring embedding, finite supplied free bases in degrees zero and one, and one of the two alternatives in the Statement. Write Z1=ker⁡d1, B1=im⁡d2, and B0=im⁡d1.

Proof

1.1givenconstructalgebra

A cochain f:C1→N is a cocycle precisely when f(B1)=0. Restricting to Z1 therefore induces a map H1=Z1/B1→N. A coboundary gd1 vanishes on Z1, so this induces the stated well-defined map κ. It is onto if every map Z1→N vanishing on B1 extends to C1. It is injective if every map B0→N extends to C0: indeed a cocycle restricting to zero on Z1 factors uniquely through d1:C1→B0, and such an extension expresses it as a coboundary.

1.2givenconstructalgebra

For the principal-right-ideal alternative, N is right divisible: given n=q+R∈N and 0≠a∈R, the element qa−1+R multiplied on the right by a equals n. We prove by induction on m that any right-linear map f:S→N from any right submodule S⊆Rm extends to Rm. For m=0 this is immediate. Let the projection of S to the last coordinate be the right ideal J. If J=0, apply induction on the first m−1 coordinates and give the last basis vector value zero. Otherwise write J=aR with a≠0 and take z=(z′,a)∈S. Then S=S′⊕zR, where S′=S∩(Rm−1×0): subtract zr from an element with last coordinate ar, and uniqueness follows from the absence of zero divisors.

2.1step 1.1givenconstructalgebra

If H0=0, then d1:C1→C0 is onto. Lift the finitely many given basis vectors of C0 and extend linearly to a section s:C0→C1. This gives C1=Z1⊕s(C0). Extend a map from Z1 by zero on the second summand to prove surjectivity in step 1.1. Here B0=C0, so the extension required for injectivity is automatic. The section uses only finitely many selections.

2.2step 1.2constructalgebra

Extend f∣S′ to g:Rm−1→N by induction. Right divisibility supplies v∈N with va=f(z)−g(z′). Define the extension on Rm by (u,r)↦g(u)+vr. It agrees with f on S′ and on z, hence on all of S. This completes the finite induction, using one ideal generator, one lift, and one division at each of finitely many stages. It does not use a maximal extension argument or an infinite family of choices.

3.1step 1.1step 2.1step 2.2algebra∎

Apply the extension result of step 2.2 first to Z1⊆C1 and then to B0⊆C0, using the supplied finite bases. These are exactly the surjectivity and injectivity requirements of step 1.1. The first alternative was established in step 2.1, so κ is an isomorphism in either case. Restriction and passage to cycles commute with every compatible left coefficient action; thus the inverse, being unique, also respects that action.

Used by

Nothing in the library uses this result yet.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources