Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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.

k[x,y]/(xy) and Z[x]/(x2−2) are Noetherian without classifying their ideals

Example

Let k be a field. The rings

k[x,y]/(xy)andZ[x]/(x2−2)

are Noetherian (The quotient ring R/I with (r+I)(s+I)=rs+I). The argument sees only that each is a quotient of a polynomial ring in finitely many variables over a Noetherian base ring; it inspects neither ring further, and in particular it does not depend on whether the ring has zero divisors, which the first one does.

Facts & Assumptions

Given: A field k, the polynomial rings k[x,y] and Z[x], and the ideals (xy)⊆k[x,y] and (x2−2)⊆Z[x].

[L1]

For an ideal I of a ring R the quotient ring R/I has the additive cosets of I as elements and multiplication (r+I)(s+I)=rs+I (The quotient ring R/I with (r+I)(s+I)=rs+I).

[L2]

Polynomial rings in finitely many commuting indeterminates are defined by R[x1,…,x0]:=R and R[x1,…,xn+1]:=R[x1,…,xn][xn+1] (Polynomial rings in finitely many commuting indeterminates by iteration).

[L3]

A commutative R-algebra is of finite type over R exactly when it is isomorphic as an R-algebra to a quotient R[x1,…,xn]/a for some n∈N and some ideal a (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras).

[L5]

Every commutative algebra of finite type over a Noetherian commutative ring is a Noetherian ring (Every algebra of finite type over a Noetherian ring is a Noetherian ring).

[L6]

For commutative rings R,S, a unital ring homomorphism φ ⁣:R→S and s∈S, there is a unique unital ring homomorphism R[x]→S extending φ on constants and sending x to s (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

[L7]

For S⊆R, (S) is the intersection of all two-sided ideals containing S, so S⊆(S); ({a}) is written (a) (The ideal generated by a subset and principal ideals).

[L8]

In a commutative ring, (S) consists of finite sums ∑risi, and (a)=Ra (In a commutative ring, (S) consists of finite sums ∑risi, and (a)=Ra).

Verification

technique · direct
1.1L1L2L3L7given

Each ring is a quotient of a polynomial ring in finitely many indeterminates over its base ring: k[x,y] is k[x1,x2] after renaming the indeterminates, and Z[x] is Z[x1]. Being such a quotient is exactly the condition of being an algebra of finite type over that base ring, so k[x,y]/(xy) is of finite type over k and Z[x]/(x2−2) is of finite type over Z.

1.2L4given

The base rings k and Z are Noetherian.

2.1L5step 1.1step 1.2

An algebra of finite type over a Noetherian commutative ring is a Noetherian ring, so both displayed rings are Noetherian.

3.1L1L6L7L8step 1.1step 2.1∎

The first ring has zero divisors, and the argument above never asked. Let π denote the quotient map k[x,y]→k[x,y]/(xy). Evaluating at 0 in the last indeterminate gives a ring homomorphism ε ⁣:k[x][y]→k[x] that fixes k[x] and sends y to 0. Every element of (xy) is f⋅xy with f∈k[x,y], and ε(f⋅xy)=ε(f) ε(x) ε(y)=ε(f) x⋅0=0, whereas ε(x)=x≠0; so x∉(xy) and π(x)≠0. Exchanging the roles of the two indeterminates gives π(y)≠0 in the same way. Yet π(x)π(y)=π(xy)=0.

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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