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

Prime ideals of a localization are exactly the primes disjoint from the denominator set

Statement

Let R be a commutative ring, let SR be a multiplicative subset, and let λ:RS1R be the localization map. Then contraction along λ induces an inclusion-preserving bijection Spec(S1R){pSpec(R):pS=}. Its inverse sends p to S1p.

Facts & Assumptions

Given: A commutative ring R, a multiplicative subset SR, and the localization map λ:RS1R.

[L1]

Every localization map induces a spectrum map by contraction (A ring map induces a contraction map on prime spectra).

[L2]

Primes of the localization correspond exactly to primes of R disjoint from S (Primes of a localization avoid the denominator set).

Proof

technique · direct
1.1

By [L1], contraction along λ gives a map from Spec(S1R) to Spec(R).

L1
1.2

The localization-prime correspondence [L2] says that this map lands exactly in the primes disjoint from S, and that extension and contraction are inverse inclusion-preserving bijections on that subset.

L2
2.1

Therefore Spec(S1R) is identified with the primes of R that avoid the denominator set.

step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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