LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)

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.

A finite affine extension of a polynomial ring has dimension at most the number of variables

Statement

Let $k$ be a field, let $A$ be a finite-type $k$ -domain, and suppose $A$ is module-finite over a polynomial subring $k [y_{1}, \dots, y_{d}]$ . Then $\dim A \leq d$ .

Facts & Assumptions

Given: A field $k$ , a finite-type $k$ -domain $A$ , and a module-finite inclusion $k [y_{1}, \dots, y_{d}] \subseteq A$ .

[L1]

The polynomial ring $k [y_{1}, \dots, y_{d}]$ has dimension $d$ (A polynomial ring in n variables over a field has dimension n).

[L2]

In an integral extension, comparable primes with the same contraction are equal (Comparable primes with the same contraction are equal under an integral map).

Proof

technique · direct

1.1L2given

A module-finite extension is integral, so any strict prime chain in $A$ contracts to a strict prime chain in $k [y_{1}, \dots, y_{d}]$ by [L2].

2.1L1step 1.1

The base ring has dimension $d$ by [L1], so no strict prime chain there has length greater than $d$ . Therefore no strict prime chain in $A$ has length greater than $d$ .

3.1step 2.1∎

Hence $\dim A \leq d$ .

A finite affine extension of a polynomial ring has dimension at most the number of variables

Statement

Facts & Assumptions

Proof

Depends on

Dependency tree · 2 levels

Sources