Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Polynomial diagonal differences form a regular sequence

Statement

For R=k[x1,…,xn] over a field k, write Re≅k[x1,…,xn,y1,…,yn] and ui=xi−yi. The ordered sequence (u1,…,un) is regular on the Re-module Re, and multiplication induces Re/(u1,…,un)≅R. This includes n=0.

Facts & Assumptions

Given: A field k, R=k[x1,…,xn], the two canonical copies of R in Re, and the ordered differences ui.

[F1]

The diagonal construction sets ui=xi⊗1−1⊗xi and identifies Re=R⊗kR (The polynomial diagonal Koszul bimodule complex).

[F2]

A sequence is regular on a module when every successive quotient is nonzero and the next multiplication map is injective, and the final quotient is nonzero (Regular Sequence On A Module).

[F3]

Tensor products of commutative k-algebras satisfy the coproduct mapping property (Universal mapping property of the tensor product of commutative algebras).

[F4]

A polynomial ring has the unique evaluation homomorphism for any assigned family of generator values (Universal property of a polynomial ring on an arbitrary family of indeterminates).

Proof

technique · direct
1.1F1F3F4givenalgebra

Put S=k[X1,…,Xn,Y1,…,Yn]. By [F4] the assignments Xi↦xi⊗1 and Yi↦1⊗xi define a k-algebra map S→R⊗kR. By [F3] the two polynomial maps from the copies of R into S induce a map R⊗kR→S. The composites fix every polynomial generator, so these maps are inverse; [F1] identifies ui with Xi−Yi.

2.1step 1.1F4givenalgebra

For 1≤i≤n, substitution Yr↦Xr for r<i gives S/(X1−Y1,…,Xi−1−Yi−1)≅k[X1,…,Xn,Yi,…,Yn]: the inverse includes the displayed remaining variables, and both composites fix their generators. This quotient is a nonzero polynomial ring over k.

2.2step 1.1F1F4givenalgebra

Substituting every Yr↦Xr gives S/(X1−Y1,…,Xn−Yn)≅k[X1,…,Xn] by the same inverse-on-generators check. Under [F1] this is the multiplication quotient Re/(u1,…,un)≅R, which is nonzero; for n=0 both rings are k and the map is the identity.

3.1step 2.1givenalgebra

In the quotient of step 2.1, write Ci=k[X1,…,Xi−1,Xi+1,…,Xn,Yi,…,Yn], so that it is Ci[Xi] and Yi∈Ci. If 0≠f∈Ci[Xi] has degree d and leading coefficient c≠0, then (Xi−Yi)f has degree d+1 with the same nonzero leading coefficient c. Thus multiplication by ui is injective on each successive quotient.

4.1step 2.1step 2.2step 3.1F2given∎

Steps 2.1 and 2.2 give every required nonzero successive quotient and the nonzero final quotient; step 3.1 gives injectivity at each position. By [F2] this is precisely regularity on Re. When n=0, there are no injectivity conditions and the final quotient k is nonzero, so the empty sequence is regular as well.

Depends on

Used by

Dependency tree · two levels

15 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