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

The diagonal bimodule k[x] is projective on both sides but not over its enveloping algebra

Example

Let k be a field and let A=k[x], with x in internal degree zero. Put F=A in cochain degree zero and zero in every other cochain degree. Then F is finite graded projective as a left A-module and projective as an underlying right A-module, and F⊗A− is naturally the identity on bounded left A-complexes. However, the diagonal bimodule A is not projective as a left module over its enveloping algebra Ae=A⊗kAop.

Verification

Given: A field k, the polynomial algebra A=k[x] graded entirely in internal degree zero, and the one-term cochain complex F=A.

[L1] Field multiplication on all of k is associative and commutative with identity 1 (Field).

[L2] Every field is a commutative ring with 1≠0 and an integral domain (Every field is a commutative ring with 1≠0; it is an integral domain, and it is a commutative division ring).

[L3] An integral domain is a commutative ring with 1≠0 and no zero divisors (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors).

[L4] A polynomial ring on two indeterminates has finite-support coefficients indexed by monomials (The polynomial ring R[xi:i∈I] as finitely supported coefficient families on monomials).

[L5] The notation k[x,y] can be taken as the iterated ring k[x][y] (Polynomial rings in finitely many commuting indeterminates by iteration).

[L6] A polynomial ring in finitely many indeterminates over a domain is a domain, including the case of two indeterminates (A polynomial ring in finitely many indeterminates over an integral domain is an integral domain).

[L8] The tensor relations include (mr)⊗n=m⊗(rn) for a right R-module M and left R-module N (The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums).

[L9] A projective module lifts every module map across every surjective module map (Projective modules and the lifting property).

[L10] The regular graded module A{0} is one of the finite shifted-free modules that are finite graded projective (Finite graded projectives are finite shifted-free summands).

[L11] A bounded bimodule complex with finite graded projective left terms and projective underlying right terms computes its exact derived tensor functor by ordinary signed totalization (A bounded two-sided projective bimodule complex defines exact derived tensor functors).

1.1L10givenalgebra

The regular left A-module is A{0}, generated by its degree-zero unit; [L10] makes it finite graded projective. Thus the sole nonzero term of F meets the left projectivity hypothesis.

1.2L1L2L3L4L5L6L7L8algebra

By [L2, L6] with one and two indeterminates, A=k[x] and R:=k[x,y] are domains, hence commutative rings by [L3]. Define the enveloping action by (a⊗bop)⋅m=amb. The map R→A⊗kAop sending xiyj to xi⊗(xj)op is multiplicative because A is commutative; its inverse sends f(x)⊗g(x)op to f(x)g(y). This inverse is balanced over k, and the maps are inverse on the monomials and elementary tensors that span their modules by [L4, L5, L7, L8]. Thus Ae is isomorphic to the commutative ring R.

2.1L9L11step 1.1construct

The underlying right regular module is projective: given a surjection q:E↠M of right A-modules and a map g:A→M, choose e∈E with q(e)=g(1) and define g~(a)=ea; then qg~=g. Since the complex F is concentrated in degree zero, A⊗AX→X, a⊗z↦az, is a natural chain isomorphism for every bounded left A-complex X, with inverse z↦1⊗z. Under the standing size convention in [L11], its derived tensor functor is represented by this ordinary tensor operation as well.

2.2L2L3L4step 1.2algebra

In these coordinates the action on A is induced by the surjective ring map μ:R→A, f(x,y)↦f(x,x); it is surjective since every g(x)∈A is μ(g(x)). For a monomial xiyj with j≥1, xiyj−xi+j=xi(y−x)∑r=0j−1yj−1−rxr, while the difference is zero for j=0; by finite support [L4], f−f(x,x)∈(x−y) for every f. Hence ker⁡μ=(x−y). This ideal is nonzero because the distinct monomials x and y have nonzero coefficients, and proper because μ(1)=1≠0.

3.1L9step 2.2givenassume-contra

Suppose for contradiction that A is projective as a left R-module. Since μ is a surjection, [L9] lifts id⁡A to an R-linear map s:A→R with μs=id⁡A. Then p=id⁡R−sμ is an R-linear projection onto I:=ker⁡μ: p(R)⊆I and p(i)=i for i∈I. Every R-linear map p:R→R is multiplication by e:=p(1), so I=Re; also p2=p gives e2=e.

4.1L2L3L6step 2.2step 3.1discharge-contradiction: the kernel is nonzero and proper

By [L2, L3, and L6], R is a commutative domain. Thus e2=e implies e(e−1)=0, so e=0 or e=1. Then I=Re is either zero or all of R, contradicting Step 2.2, where I was shown nonzero and proper. Therefore A is not projective over Ae.

5.1

The zero polynomial has empty support and lies in ker⁡μ; the kernel calculation includes empty finite sums. By [L2], 1≠0 in k, so the zero algebra is excluded. In characteristic two, x−y=x+y still has two distinct monomials, so I remains nonzero and proper. The complex F has exactly one nonzero cochain term in degree zero, with zero differential, so both endpoints are covered by the unit calculation. The only lift used is the single lift of id⁡A supplied by projectivity; no family of choices or AC is used. This example proves no iff statement. [L2, L4, L9, L10, step 1.1, step 2.1, step 2.2, step 4.1, given, algebra] □

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

47 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