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

Localization preserves exact sequences of modules

Statement

Let R be a commutative ring with identity, let S⊆R contain 1, be closed under multiplication, and not contain 0, and let 0→M′→fM→gM′′→0 be an exact sequence of R-modules. The localization S−1M is the module of fractions m/s, with (m,s)∼(m′,s′) exactly when some t∈S satisfies t(s′m−sm′)=0. Then

0⟶S−1M′→S−1fS−1M→S−1gS−1M′′⟶0

is exact.

Statement references

[Module localization and support] Atiyah–Bott, Section 3, printed pp. 5–7

Facts & Assumptions

Given: A commutative ring R, a multiplicative set S, and the exact module sequence in the statement.

Proof

Given: The exact sequence and the fraction definition of localization in the statement.

1.1givenconstruct

The map S−1f is injective. If f(m′)/s=0, the fraction relation gives tf(m′)=0 for some t∈S. Then f(tm′)=0; injectivity of f gives tm′=0, so m′/s=0 in S−1M′.

1.2givenchoose

The map S−1g is surjective. For any m′′/s∈S−1M′′, surjectivity of g supplies m∈M with g(m)=m′′, and m/s maps to m′′/s.

2.1givenstep 1.1algebra

Let m/s∈S−1M lie in the kernel of S−1g. The zero-fraction criterion gives t∈S with tg(m)=0, hence g(tm)=0. Exactness of the original sequence gives m′∈M′ with f(m′)=tm. Since t∈S is invertible in the localization, m/s=tm/(ts)=f(m′)/(ts), which lies in the image of S−1f.

3.1givenstep 1.1step 1.2step 2.1∎

Conversely g∘f=0, so every fraction in the image of S−1f maps to zero under S−1g. Step 2.1 proves the reverse inclusion at the middle term, and steps 1.1 and 1.2 prove exactness at the two ends. If a module is zero, the same fraction criterion yields the unique zero map; no choice principle or flatness assumption is used beyond choosing one preimage for one element in step 1.2.

Dependency tree · 0 levels

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

Sources