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

Agreement of the domain and prime-quotient valuative formulas

Statement

Assume the Axiom of Choice. For every nonzero commutative domain D, let δ(D) be the supremum of the Krull dimensions of valuation subrings of Frac⁡(D) containing the embedded copy of D. The supremum is taken in {0,1,…,∞}. Then

δ(D)=sup⁡p∈Spec⁡Dδ(D/p).

Thus extending the domain formula to general rings by the supremum over their prime quotients leaves its value on domains unchanged, including the value infinity.

Facts & Assumptions

Given: A nonzero commutative domain D in the classical foundational setting below.

Goal: Compare the domain invariant with its prime-quotient extension.

[F1]

Valuation rings gives the field-membership definition of a valuation ring. The field of fractions Frac(D)=(D∖{0})⁻¹D of an integral domain constructs the fraction field, and Frac(D) is a field and d↦ d/1 embeds the integral domain D gives its field structure and canonical embedding. Krull dimension is the prime-chain supremum of Krull dimension of a nonzero ring.

[F2]

Proper prime ideals and their spectrum use The prime spectrum and vanishing sets. Quotients use The quotient ring R/I with (r+I)(s+I)=rs+I, and R/P is an integral domain if and only if P is a prime ideal ensures that every D/p in the statement is a nonzero domain.

[F3]

A valuation ring is local identifies the nonunits of a valuation ring with its unique maximal ideal. Localisation at a prime ideal: Rₚ=(R setminusp)⁻¹R supplies Vp and its fractions, and Primes of a localization at a prime identifies its primes with those of V contained in p.

[F4]

A[T1,…,Tk] is the polynomial ring in finitely many commuting indeterminates, including k=0, as in Polynomial rings in finitely many commuting indeterminates by iteration.

[F5]

Reference 0 supplies the classical polynomial-dimension tests stated in External input.

[F6]

Assume The Axiom of Choice. It is retained in the imported classical valuation-dimension characterization [F5]; no choice-free reconstruction of that characterization is claimed.

External input

Reference 0 defines c(R) for a domain R as the supremum of the lengths of finite strict chains of valuation overrings ending in Frac⁡(R). For nonzero A, it defines c∗(A)=sup⁡p∈Spec⁡Ac(A/p). Theorem 1.1, (1) iff (3), states for each integer n≥0 that c(R)≤n is equivalent to dim⁡R[T1,…,Tk]≤n+k for every integer k≥0; its final clause gives the same equivalence for c∗(A) and every nonzero commutative ring A. This uses [F4] and the classical setting [F6]. The translation to the Krull dimensions of valuation overrings is local below.

Proof

1.1F1F3givenconstruct

Fix a valuation overring V of a domain R, with fraction field K=Frac⁡(R). Its fraction field is K, since R⊆V⊆K. Any overring W of V in K is again a valuation ring by [F1]. By [F3], it has maximal ideal mW consisting of its nonunits; this is prime because a product is a unit exactly when both factors are units. Hence p=mW∩V is prime. Every s∈V∖p is a unit in W, so Vp⊆W. Conversely, if w∈W∖V, then w−1∈V by [F1], and it is a unit of W, so w−1∉p and w∈Vp. Thus W=Vp. Each Vp is a valuation ring, and [F3] recovers p as the contraction of its unique maximal ideal. These correspondences reverse inclusions: inclusion of primes reverses the denominator sets, and inclusion of overrings preserves units and therefore reverses the contractions of their nonunits. They preserve strictness by being inverse bijections. The endpoints are V=VmV and K=V(0). Finite prime chains in V can be extended by these endpoints, so their length supremum equals that of finite strict chains of valuation overrings from V to K. Taking the supremum over all V containing R yields δ(R)=c(R).

2.1F1F2F4F5F6step 1.1∎

Put ρ(D)=sup⁡p∈Spec⁡Dδ(D/p). These are domain inputs by [F2]. Applying step 1.1 to each quotient gives ρ(D)=c∗(D), and applying it to D gives δ(D)=c(D). For every finite integer n≥0, [F5] identifies both c(D)≤n and c∗(D)≤n with exactly the same test dim⁡D[T1,…,Tk]≤n+k for all k≥0. The hypotheses hold because D is nonzero and [F6] supplies the imported classical setting. Therefore δ(D) and ρ(D) have exactly the same finite upper bounds. Both are in {0,1,…,∞}: fraction fields provide nonempty valuation-overring families, and (0) is a prime of D. Equal finite upper bounds determine the same value, including infinity, proving the equality.

Depends on

Used by · 2

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

External dependencies

Lombardi, Neuwirth and Yengui, Valuative dimension, constructive points of view, arXiv:2311.05218v2 · English introduction, printed p. E3 (PDF page 5), classical definitions immediately preceding Theorem 1.1; Theorem 1.1, (1) iff (3), including its final nonintegral-ring clause

For a domain R, define c(R) by finite strict chains of valuation overrings ending in Frac(R). For a nonzero commutative ring A, set c_*(A)=sup over proper prime p of c(A/p). For each integer n>=0, c(R)<=n is equivalent to dim R[T_1,...,T_k]<=n+k for every integer k>=0. For A not necessarily a domain, the same polynomial test is equivalent to c_*(A)<=n. Only these parts of Theorem 1.1 are imported.

Hypotheses: Classical mathematics with Choice; commutative unital nonzero rings, nonzero domains in the domain clause; n and k nonnegative finite integers; Krull dimension via finite strict prime chains, allowing infinity. No Noetherian, finite-type, or finite-dimensional assumption. Proper primes are used; the trivial ring is excluded from the imported equivalences.

Reading limits: Read the English classical-definition paragraphs, complete Theorem 1.1 and its final clause in the primary arXiv HTML, and corresponding extracted PDF text on p. E3. Also read the subsequent basic-terminology and valuation-ring paragraphs to distinguish constructive conventions. Theorem 1.1 is imported as an established classical characterization, not reconstructed; no reading of its cited Cahen source or the later constructive proofs is claimed. Translation from overring chains to Krull dimensions, and the application comparing the two local formulas, are proved here. The PDF screenshot request failed; no visual PDF inspection is claimed.

Sources