Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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 commutes with finite intersections of submodules

Statement

Let N1,,Nr be submodules of a left R-module M. Then

S1 ⁣(i=1rNi)=i=1rS1Ni

inside S1M.

Facts & Assumptions

Given: A commutative ring R, a multiplicative subset SR, a left R-module M, and submodules N1,,NrM.

[L1]

Localisation identifies kernels with the kernels of localised maps (Localisation commutes with kernels images and cokernels).

[L2]

Localisation commutes with quotient modules and finite direct sums (Localisation commutes with quotient modules and arbitrary direct sums).

[L3]

The direct sum has its universal diagonal map into a family of targets (Universal property of a direct sum of modules, The direct sum of an indexed family of modules).

Proof

technique · direct
1.1

Let δ:Mi=1rM/Ni be the diagonal map δ(m)=(m+N1,,m+Nr). By construction, kerδ=i=1rNi.

L3algebra
2.1

By [L1], S1(iNi)ker(S1δ). By [L2], the codomain of S1δ identifies with i(S1M/S1Ni), and under this identification S1δ is the diagonal map S1Mi(S1M/S1Ni).

L1L2step 1.1
3.1

An element of S1M lies in the kernel of that diagonal map exactly when its image in every quotient S1M/S1Ni is zero, that is, exactly when it lies in every submodule S1Ni. Therefore ker(S1δ)=iS1Ni.

step 2.1algebra
4.1

Combining steps 2.1 and 3.1 gives S1(iNi)=iS1Ni inside S1M.

step 2.1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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