Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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 spectrum of a Noetherian ring is a Noetherian topological space

Statement

Assume the Axiom of Choice.

Let R be a Noetherian commutative ring. Then Spec(R) is a Noetherian topological space.

Facts & Assumptions

Given: A Noetherian commutative ring R and the Axiom of Choice.

[L1]

A topological space is Noetherian exactly when every descending chain of closed subsets stabilizes (Noetherian topological spaces via ACC on opens or DCC on closed subsets).

[L2]

Every Zariski-closed subset has a unique radical defining ideal (Every Zariski-closed subset has a unique radical defining ideal).

Proof

technique · direct
1.1

Let Z0Z1Z2 be a descending chain of closed subsets of Spec(R). By [L2], each Zn has a unique radical defining ideal an with Zn=V(an).

L2givenchoose
2.1

Since Zn+1Zn, every prime ideal in Zn+1 also lies in Zn. Therefore an=pZnppZn+1p=an+1. Thus a0a1a2 is an ascending chain of ideals.

L2step 1.1algebra
3.1

By [L3], the ideal chain from step 2.1 stabilizes: there is N such that an=aN for all nN. Then Zn=V(an)=V(aN)=ZN for all nN. Hence the closed chain stabilizes.

L3step 2.1
4.1

By [L1], stabilization of every descending closed chain means that Spec(R) is Noetherian.

L1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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