Alphabeta Math
CorollaryStatement: Literature-sourcedProof: Literature-sourcedprecheck 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 prime-spectrum construction is a contravariant functor to topological spaces

Statement

For every ring homomorphism φ:RA, contraction defines a continuous map Spec(φ):Spec(A)Spec(R). These maps satisfy Spec(idR)=idSpec(R)andSpec(ψφ)=Spec(φ)Spec(ψ), so Spec is a contravariant functor from commutative rings to topological spaces.

Facts & Assumptions

Given: Ring homomorphisms φ:RA and ψ:AB of commutative rings.

[L1]

For every ideal IR, Spec(φ)1(V(I))=V(IA), so contraction pulls back vanishing sets to vanishing sets (A ring map induces a contraction map on prime spectra).

[L2]

The Zariski-closed subsets are exactly the vanishing sets (The vanishing sets define the Zariski topology on the prime spectrum).

Proof

technique · direct
1.1

Let ZSpec(R) be closed. By [L2], Z=V(I) for some ideal IR. Then [L1] gives Spec(φ)1(Z)=Spec(φ)1(V(I))=V(IA), which is closed in Spec(A) by [L2]. Therefore Spec(φ) is continuous.

L1L2
1.2

For a prime ideal pR one has Spec(idR)(p)=idR1(p)=p, so Spec(idR)=idSpec(R).

givenalgebra
1.3

For a prime ideal qB, one has Spec(ψφ)(q)=(ψφ)1(q)=φ1(ψ1(q))=Spec(φ)(Spec(ψ)(q)). Hence Spec(ψφ)=Spec(φ)Spec(ψ).

givenalgebra
2.1

Steps 1.1, 1.2, and 1.3 prove that Spec is a contravariant functor to topological spaces.

step 1.1step 1.2step 1.3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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