Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 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.

An idempotent partitions the spectrum into complementary clopen subsets

Statement

Let R be a commutative ring and let eR satisfy e2=e. Then Spec(R)=D(e)D(1e)=V(1e)V(e), and both D(e) and D(1e) are clopen.

Facts & Assumptions

Given: A commutative ring R and an idempotent eR.

[L1]

D(f) is the set of prime ideals that do not contain f, and D(fg)=D(f)D(g) (Principal distinguished subsets of the prime spectrum, Distinguished-subset identities).

[L2]

A prime ideal is proper and has the factor property abpap or bp (Prime ideals and maximal ideals in a commutative ring).

Proof

technique · direct
1.1

Since e(1e)=0, every prime ideal p contains e or 1e by [L2]. It cannot contain both, because then 1=e+(1e) would lie in p, contradicting properness. Therefore each prime lies in exactly one of D(e) and D(1e), so Spec(R)=D(e)D(1e).

L1L2given
2.1

A prime ideal lies in D(e) exactly when it does not contain e, which by step 1.1 is equivalent to containing 1e. Hence D(e)=V(1e). Similarly D(1e)=V(e). Since vanishing sets are closed and distinguished opens are open, both subsets are clopen.

L1step 1.1algebra
3.1

Thus an idempotent partitions the spectrum into complementary clopen subsets.

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

8 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