Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

A left-projective tensor bimodule need not be right-flat

Example

Let k be a field, let B=k with its trivial grading and let A=k[ε]/(ε2) with ε in degree 0. Let π:A↠k be the augmentation with π(ε)=0, and let M=k be the graded (B,A)-bimodule concentrated in degree 0 whose left B-action is ordinary multiplication and whose right A-action is m⋅a:=π(a)m.

Then M is finite projective as a left B-module, but M⊗A− is not exact: it destroys the monomorphism (ε)↪A in the exact sequence 0→(ε)→A→k→0 of graded left A-modules, because the induced map k⊗A(ε)→k⊗AA is the zero map while its source is a copy of k.

Facts & Assumptions

Given: A field k, the graded k-algebras B=k and A=k[ε]/(ε2) concentrated in degree 0, the augmentation π:A→k, and the graded (B,A)-bimodule M=k with b⋅m=bm and m⋅a=π(a)m.

[L1]

Graded algebras, graded modules, degree-zero maps and graded submodules are defined in Associative graded algebras, bimodules, and internal shifts; all modules here are concentrated in degree 0, so all module maps are degree-zero.

[L2]

The tensor product carries the total-degree grading and the outer actions, in particular (m⊗a)c=m⊗(ac) and b(m⊗a)=(bm)⊗a (Graded balanced tensor product and homogeneous Hom).

[L3]

GrMod⁡0(A) is abelian with degreewise exactness, so a sequence concentrated in degree 0 is exact exactly when the underlying sequence of A-modules is (Graded modules with degree-zero maps form an abelian category).

[L4]

If M is flat as a right A-module then M⊗A− is exact, and if M is finite graded projective as a left B-module then M⊗A− preserves finite graded projectives (Bimodule tensor exactness and preservation of finite projectives have separate hypotheses).

Verification

1.1

The two actions on M commute, since (b⋅m)⋅a=π(a)bm=b⋅(m⋅a), and are additive and unital, so M is a (B,A)-bimodule; both preserve degree 0, so M is graded.

L1
1.2

M=k=B is the free left B-module of rank one, hence a finite direct sum of shifts B{0} and therefore a finite graded projective left B-module.

L1L4
1.3

In A=k[ε]/(ε2) the ideal (ε)=kε has ε2=0, so aε=π(a)ε for every a∈A; hence (ε) is isomorphic to k=A/(ε) as a left A-module by 1↦ε, and the sequence 0→(ε)→A→πk→0 is exact with all maps degree-zero and A-linear.

L1L3
2.1

Tensoring the sequence of step 1.3 with M: the unit isomorphisms identify M⊗AA≅M=k and M⊗Ak≅k, and by step 1.3 also M⊗A(ε)≅M⊗Ak≅k. The induced map M⊗A(ε)→M⊗AA sends 1⊗ε to 1⊗ε=(1⋅ε)⊗1=0, by the balancing relation and the right action 1⋅ε=π(ε)=0 on M. So the induced map is zero while its source is k≠0, and it is not injective.

step 1.2step 1.3L2
3.1

By step 2.1 the functor M⊗A− fails to preserve the monomorphism (ε)→A, so it is not exact and M is not flat as a right A-module; by step 1.2 M is nevertheless finite graded projective over B. Hence finite left B-projectivity of a bimodule does not imply right A-flatness, the hypothesis that the exactness clause of [L4] requires.

step 1.2step 2.1L4
4.1

The example therefore exhibits a bimodule that is finite projective on the tensoring-out side but whose tensor functor is not exact. ∎

step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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