Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-28
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.

Downward-closed intersections of primary components are intrinsic

Statement

Assume the Axiom of Choice.

Let R be a Noetherian commutative ring, let M be a finitely generated left R-module, and let

N=Q1Qr

be a minimal primary decomposition with each Qi pi-primary for a prime ideal pi. Let ΣAssR(M/N) be downward-closed under inclusion. Then

piΣQi

depends only on NM and on Σ, not on the chosen minimal decomposition. When Σ=, the empty intersection is interpreted as M.

Facts & Assumptions

Given: The Axiom of Choice, a Noetherian commutative ring R, a finitely generated left R-module M, a submodule NM, and a minimal primary decomposition N=Q1Qr with each Qi pi-primary for a prime ideal pi.

[L1]

In the Noetherian finite-module setting, a minimal primary decomposition whose component radicals are prime has radical set {p1,,pr}=AssR(M/N) (The radicals in a minimal primary decomposition are intrinsic).

[L2]

Assuming the Axiom of Choice, in the Noetherian finite-module setting, localizing a primary component away from its prime radical keeps it, while localizing at a set meeting its radical turns it into the whole localized module (Localisation of a primary submodule either stays primary or becomes the whole module).

[L3]

In the Noetherian finite-module setting, a primary component with prime radical is recovered by contracting its localization at a multiplicative set disjoint from that radical (A primary component is recovered by contracting its localization away from the radical).

[L4]

Localisation commutes with finite intersections of submodules (Localisation commutes with finite intersections of submodules).

[L5]

If an ideal is contained in a finite union of prime ideals, then it lies in one of them (An ideal contained in a finite union of prime ideals lies in one of them).

[L6]

For a multiplicative subset S, the canonical localization map is λM:MS1M, mm/1 (Localisation of a module at a multiplicative subset).

Proof

technique · direct
1.1

Let ΣAssR(M/N) be downward-closed, and set S=RpΣp. Because the members of Σ are prime, S is multiplicative. If piΣ, then Spi= by definition. If piΣ and Spi=, then pipΣp, so [L5] forces pip for some pΣ. Since piAssR(M/N) by [L1] and Σ is downward-closed, this would imply piΣ, a contradiction. Hence Spi=    piΣ.

L1L5givenalgebra
2.1

By [L4], S1N=i=1rS1Qi. For piΣ, step 1.1 and [L2] say that S1Qi remains a proper localized primary component. For piΣ, step 1.1 and [L2] give S1Qi=S1M. Therefore S1N=piΣS1Qi. When Σ=, the right-hand side is the empty intersection S1M, which matches the fact that 0S and hence S1N=S1M=0.

L2L4step 1.1algebra
3.1

Let λM:MS1M be the canonical map of [L6]. Contracting the equality of step 2.1 back to M gives λM1(S1N)=piΣλM1(S1Qi), because inverse image commutes with intersections. For every piΣ, step 1.1 and [L3] identify λM1(S1Qi) with Qi. Hence λM1(S1N)=piΣQi.

L3L6step 1.1step 2.1algebra
4.1

The left-hand side of step 3.1 depends only on NM and the set S, hence only on NM and on Σ. By [L1], any other minimal primary decomposition has the same associated-prime set, so it yields the same S and therefore the same intersection.

L1step 3.1
5.1

Thus the intersection of the primary components indexed by any downward-closed subset of AssR(M/N) is intrinsic.

step 4.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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