Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

The polynomial diagonal Koszul bimodule complex

Definition

Let k be a field and let R=k[x1,…,xn] for n≥0. Since R is commutative, identify its enveloping algebra Re=R⊗kRop (Enveloping algebra and the bimodule–module dictionary) with R⊗kR. Write xiL=xi⊗1 and xiR=1⊗xi for the two copies of each polynomial generator, and put

ui:=xiL−xiR.

The diagonal Koszul bimodule complex is the Koszul complex K(u1,…,un;Re) defined in Koszul Complex Of A Sequence With Coefficients, augmented by the multiplication map μ:Re→R. Its degree-p term is free over Re on symbols

θi1∧⋯∧θip(1≤i1<⋯<ip≤n),

and its differential is

d(θi1∧⋯∧θip)=∑r=1p(−1)r−1uir θi1∧⋯∧θir^∧⋯∧θip.

The augmentation is a chain map because μ(ui)=0 for every i; the Koszul differential squares to zero by the defining alternating deletion formula. There are (np) displayed basis symbols in degree p, and no terms above degree n.

When deg⁡intxi=2, assign each θi homological degree 1 and internal degree 2. Then the differential lowers homological degree by 1 and preserves internal degree; degree p is a direct sum of (np) copies of Re{2p} under the shift convention M{r}d=Md−r from Associative graded algebras, bimodules, and internal shifts. Internal grading adds no super sign.

For n=0, the sequence and exterior generators are empty, R=k and Re=k; the complex is k in degree zero and μ:k→k is the identity.

Depends on

Used by

Dependency tree · two levels

11 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