Alphabeta Math
LemmaStatement: 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.

Primes of a localization avoid the denominator set

Statement

Let R be a commutative ring, let SR be a multiplicative subset, and let λ:RS1R be the localization map. Contraction sends each prime ideal of S1R to a prime ideal of R disjoint from S, and extension sends each prime ideal of R disjoint from S back to a prime ideal of S1R. These two operations are inverse and preserve strict inclusion.

Facts & Assumptions

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

[L1]

Ideals of S1R correspond to S-saturated ideals of R, and primes correspond exactly to the prime ideals disjoint from S (Ideals of S1R correspond to S-saturated ideals of R, and prime ideals correspond to primes disjoint from S).

Proof

technique · direct
1.1

The prime-ideal part of [L1] says exactly that if qSpec(S1R), then λ1(q) is a prime ideal of R disjoint from S, and if pSpec(R) with pS=, then S1p is a prime ideal of S1R.

L1
1.2

The same statement [L1] asserts that these assignments are inverse inclusion-preserving bijections. In particular they preserve strict inclusion.

L1
2.1

Therefore primes of the localization are exactly the primes of R that avoid the denominator set.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

12 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