Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-29
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.

Integral extensions lift finite prime chains from the base

Statement

Assume the Axiom of Choice.

Let f:AB be an integral ring map, let

p0p1pn

be a finite chain of prime ideals in A, and let q0 be a prime ideal of B with f1(q0)=p0. Then there exist prime ideals

q0q1qn

of B such that f1(qi)=pi for every i.

Facts & Assumptions

Given: An integral ring map f:AB, a finite prime chain p0pn in A, and a prime q0 of B over p0.

[L1]

Assuming the Axiom of Choice, the going-up theorem lifts one prime extension step at a time (Going up for integral ring maps).

Proof

technique · induction on the chain length
1.1

For n=0, the given prime q0 already lifts the chain.

L1basegiven
1.2

Fix n0 and assume the statement for chains of length n. Let p0pnpn+1 be a chain of length n+1. By the induction hypothesis, there are primes q0qn over p0,,pn.

ihgiven
2.1

Apply [L1] to the inclusion pnpn+1 and the prime qn. This yields a prime qn+1qn with contraction pn+1.

L1step 1.2
3.1

Step 1.1 is the base case, and steps 1.2 and 2.1 provide the induction step. Therefore every finite prime chain in A lifts to one in B once the first prime upstairs is fixed.

step 1.1step 1.2step 2.1discharge-induction

Depends on

Used by

Dependency tree · two levels

4 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