Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-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.

Covariant and contravariant Hom are left exact

Statement

Let X be a left R-module.

  1. If 0AuBvC is exact, then 0HomR(X,A)uHomR(X,B)vHomR(X,C) is exact.
  2. If AuBpC0 is exact, then 0HomR(C,X)pHomR(B,X)uHomR(A,X) is exact.

Thus covariant and contravariant Hom are left exact.

Facts & Assumptions

Given: The two exact sequences in the statement and a left R-module X.

[F1]

Postcomposition and precomposition define the displayed homomorphisms on Hom groups (The abelian group HomR(M,N) and maps induced by pre- and postcomposition).

[F2]

Exactness means equality of the incoming image and outgoing kernel; the zero endpoints make u injective in the first sequence and p surjective in the second (Exact sequences and short exact sequences of modules).

[L1]

If a homomorphism h:MP vanishes on a submodule N, it factors uniquely through M/N (A module homomorphism vanishing on N factors uniquely through M/N).

Proof

technique · direct
1.1

If uf=0, then u(f(x))=0 for every x, and injectivity of u gives f=0; hence u is injective.

F1F2
1.2

Composability gives vu=0, so imukerv.

F1F2
1.3

If g:XB satisfies vg=0, then g(x)kerv=imu for every x. Injectivity of u gives a unique f(x)A with u(f(x))=g(x); uniqueness makes f linear, so g=uf.

F1F2
1.4

If ph=0, surjectivity of p gives h=0, so p is injective; and up=0 because pu=0.

F1F2
1.5

If g:BX satisfies ug=gu=0, then g vanishes on imu=kerp. By [L1] it factors uniquely through B/kerp, and since p is surjective the rule gˉ(p(b))=g(b) gives the corresponding homomorphism gˉ:CX with g=gˉp=p(gˉ).

F1F2L1
2.1

Steps 1.1 to 1.3 prove the covariant sequence exact, and steps 1.4 and 1.5 prove the contravariant sequence exact.

step 1.1step 1.2step 1.3step 1.4step 1.5

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 28 results over 12 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources