Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passaudited 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.

Identifying the coefficient algebra in a concrete Artin–Tate tower

Example

Let k be a field and take the tower

A=k  ⊆  B=k[t2,t3]  ⊆  C=k[t]

inside the polynomial ring k[t]. Here C is of finite type over A, generated by t, and C is module-finite over B with module generators y1=1 and y2=t.

Running The Artin–Tate coefficient subalgebra is a Noetherian algebra of finite type on this tower collects the coefficients

t=0⋅y1+1⋅y2,y1y1=1⋅y1+0⋅y2,y1y2=y2y1=0⋅y1+1⋅y2,y2y2=t2⋅y1+0⋅y2,

so the coefficients are 0, 1 and t2 and the coefficient subalgebra is A′=k[t2]. It is of finite type over k and Noetherian, and B is a finite A′-module, generated by 1 and t3. The Artin–Tate lemma (Artin–Tate lemma: an intermediate ring over which a finite-type algebra is module-finite is itself of finite type) therefore returns that B is of finite type over k, which is directly visible here: B=k[t2,t3].

Facts & Assumptions

Given: A field k, the polynomial ring C=k[t], the subalgebra B=k[t2,t3] of C, and A=k.

[L1]

R[a1,…,an] is the smallest subring of A containing the image of R and a1,…,an; an algebra is of finite type over R when it equals such a subring for a finite list, and module-finite when it is finitely generated as an R-module (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras).

[L2]

A subset S of a ring is a subring when 1∈S and S is closed under addition, additive inverses and multiplication (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication).

[L3]

R[x] is the set of finitely supported functions N→R, with coefficientwise addition and the convolution product (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution).

[L4]

In the Artin–Tate setup, with C=A[t1,…,tr], a B-module generating list y1,…,yn of C with y1=1C, and coefficients zij,zijk∈B satisfying ti=∑jzijyj and yiyj=∑kzijkyk, the A-subalgebra A′⊆B generated by those coefficients satisfies A⊆A′⊆B, is of finite type over A, and is a Noetherian ring (The Artin–Tate coefficient subalgebra is a Noetherian algebra of finite type).

[L5]

In that setup C is module-finite over A′ and B is module-finite over A′ (In the Artin–Tate setup the intermediate ring is module-finite over the coefficient subalgebra).

[L7]

For commutative rings A⊆B⊆C, each a subring of the next, with A Noetherian, C of finite type over A and C module-finite over B, the ring B is of finite type over A (Artin–Tate lemma: an intermediate ring over which a finite-type algebra is module-finite is itself of finite type).

Verification

technique · direct
1.1L1L2L3given

B=k+t2k[t]. The set k+t2k[t] is a subring of k[t]: it contains 1, is closed under addition and additive inverses, and (c+t2f)(c′+t2f′)=cc′+t2(cf′+c′f+t2ff′); it contains t2 and t3, so it contains B. Conversely ta∈B for every a≥2, being (t2)m when a=2m and t3(t2)m when a=2m+3, and k⊆B, so k+t2k[t]⊆B. Hence k⊆B⊆C with each a subring of the next, and C=k[t] is of finite type over k.

2.1L1L2L3step 1.1

C=B⋅1+B⋅t, so C is module-finite over B with generators y1=1 and y2=t. Indeed any g∈k[t] splits as g=g0+g1t+t2h with g0,g1∈k and h∈k[t], and then g=(g0+t2h)⋅1+g1⋅t with both coefficients in B by step 1.1. Note also t∉B: an element of k+t2k[t] has coefficient 0 at t1, whereas t has coefficient 1 there.

3.1L1L4step 2.1

With r=1, t1=t, n=2, y1=1 and y2=t, the required relations hold with the coefficients displayed in the Example: t=0⋅1+1⋅t; y1y1=1; y1y2=y2y1=t; and y2y2=t2=t2⋅1+0⋅t, where t2∈B. The collected coefficients are therefore 0, 1 and t2, and the k-subalgebra of B they generate is A′=k[t2], since 0 and 1 already lie in k.

4.1L4L5L6step 3.1

A′=k[t2] is of finite type over the Noetherian ring k and is Noetherian, and B is module-finite over A′ with generators 1 and t3. For the last point, A′ is the k-span of the powers t2m, so A′⋅1 is the k-span of the even powers of t and A′⋅t3 is the k-span of the odd powers t2m+3. By step 1.1 the ring B is the k-span of 1 and of all ta with a≥2, so every basis monomial of B lies in one of these two A′-submodules; hence every element of B lies in their sum, and B=A′⋅1+A′⋅t3.

5.1L1L6L7step 4.1∎

The tower now satisfies every hypothesis of the Artin–Tate lemma: k is Noetherian, C is of finite type over k, and C is module-finite over B. The lemma returns that B is of finite type over k; assembling its generating list from the collected coefficients and the A′-module generators of B gives k[t2,1,0,t3]=k[t2,t3], which is B as presented.

Remarks

  • The coefficient subalgebra is smaller than B here. A′=k[t2] is a polynomial ring in one variable and B=k[t2,t3] is not; the lemma does not claim A′=B, only that A′ is Noetherian and that B is a finite A′-module.

  • The coefficients depend on the chosen module generators. Replacing y2=t by y2=t+t2, which also works since t=y2−t2⋅1, changes the structure constants and can change A′; only the conclusion is independent of the choice.

  • Nothing here uses the characteristic of k. Every computation above is an identity between polynomials with coefficients 0 and 1, so the example runs unchanged over F2 and over Q.

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