Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-27
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.

The reduced quotient by the nilradical

Statement

Let R be a commutative ring and let N=Nil(R). Then R/N is reduced. Moreover, if φ:RA is a ring homomorphism to a reduced commutative ring A, then there is a unique ring homomorphism φ:R/NA with φ=φπ, where π:RR/N is the quotient map.

Facts & Assumptions

Given: A commutative ring R, its nilradical N=Nil(R), and the quotient map π:RR/N.

[L1]

The nilradical is the ideal of nilpotent elements, and a ring is reduced exactly when its nilradical is zero (The nilradical and reduced rings).

Proof

technique · direct
1.1

Let x+NR/N be nilpotent. Then (x+N)m=N for some m1, so xmN. By [L1], some power of xm is zero, hence some power of x is zero, so xN. Therefore x+N=0+N, and the only nilpotent element of R/N is zero. Thus R/N is reduced by [L1].

L1givenalgebra
1.2

Let φ:RA with A reduced. If xN, then xm=0 for some m1, so φ(x)m=0. Reducedness of A forces φ(x)=0, so Nkerφ. Therefore φ(x+N):=φ(x) is well-defined, and it is unique because π is surjective.

L1givenalgebra
2.1

The quotient by the nilradical is reduced and is universal among maps from R to reduced rings.

step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

2 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