Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passaudited 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.

A redundant four-term decomposition cleans up to (x)∩(x,y)2

Example

In R=k[x,y], the ideal I=(x)∩(x2,y)∩(x,y)2∩(x,y)2 cleans up to the minimal decomposition I=(x)∩(x,y)2=(x2,xy).

Facts & Assumptions

Given: The polynomial ring R=k[x,y] and the displayed decomposition of I.

[L1]

A finite primary decomposition can be stripped of redundant components (A finite primary decomposition can be stripped of redundant components).

[L2]

In a finite primary decomposition of a submodule of a finitely generated module over a Noetherian commutative ring, equal-radical primary components can be combined into one primary component (Equal-radical primary components can be combined).

Verification

technique · direct
1.1givenalgebra

The ideal (x) is prime because R/(x)≅k[y]. The quotients R/(x2,y)≅k[x]/(x2) and R/(x,y)2 are local rings whose maximal ideals are square-zero, so every zero divisor is nilpotent. Hence (x2,y) and (x,y)2 are (x,y)-primary, while (x) is (x)-primary. Thus the displayed intersection is a primary decomposition.

2.1L1step 1.1algebra

Since (x,y)2=(x2,xy,y2)⊆(x2,y), the factor (x2,y) is redundant, and the repeated copy of (x,y)2 is redundant as well. Fact [L1] therefore cleans the four-term intersection down to I=(x)∩(x,y)2.

3.1L2step 1.1step 2.1algebra

The two surviving radicals are (x) and (x,y), already distinct. If one first combines the two equal-radical components (x,y)2 and (x,y)2, [L2] replaces them by their intersection, which is again (x,y)2. Hence both cleanup orders lead to the same two-term presentation.

3.2step 2.1algebra

Finally, (x)∩(x,y)2=(x)∩(x2,xy,y2)=(x2,xy), because an element in the intersection has the form xf with f∈(x,y). The decomposition is irredundant: x∈(x)∖(x,y)2 and y2∈(x,y)2∖(x). Together with the distinct radicals, this proves minimality.

4.1step 3.1step 3.2∎

This example isolates the two routine cleanup moves in a primary decomposition: deletion of redundant components and combination of equal radicals.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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