Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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.

Localisation of modules is exact

Statement

If 0⟶M′→fM→gM′′⟶0 is a short exact sequence of R-modules, then 0⟶S−1M′→S−1fS−1M→S−1gS−1M′′⟶0 is a short exact sequence of S−1R-modules.

Facts & Assumptions

Given: A commutative ring R, a multiplicative subset S⊆R, and a short exact sequence 0→M′→fM→gM′′→0.

[L1]

Localisation is naturally (S−1R)⊗R− (Localisation of modules is extension of scalars).

[L2]

Tensoring a right-exact sequence with a fixed module preserves right exactness (Tensoring is right exact).

[L3]

Injective module homomorphisms remain injective after localisation (Injective module maps remain injective after localisation).

[L4]

A short exact sequence is exact, with left map injective and right map surjective (Exact sequences and short exact sequences of modules).

Proof

technique · direct
1.1L1L2L4

By [L4], the tail M′→fM→gM′′→0 is exact. Using [L1] to identify localisation with tensor product, [L2] gives an exact sequence S−1M′→S−1fS−1M→S−1gS−1M′′→0.

1.2L3L4

The map f is injective by [L4], so [L3] makes S−1f injective.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 show that the localised sequence is short exact.

Depends on

Used by

…and 22 more results.

Dependency tree · two levels

16 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