Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedaudited 2026-10-02
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.

Matrix-unit rotation for a k–Mat_n(k) Morita pair

Example

Assume the Axiom of Choice (AC). Fix a field k and an integer n≥2, and let A:=k,B:=Mn(k),M:=k1×n,N:=kn×1, where M is the space of row vectors, on which B acts on the right by matrix multiplication, and N is the space of column vectors, on which B acts on the left by matrix multiplication (The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes, Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication). Thus M is a (k,B)-bimodule and N is a (B,k)-bimodule, both finite dimensional over k  ; M is finite projective as a right B-module, because B≅Mn as right B-modules via the rows, and N is the free right k-module of rank n (Generated submodule, cyclic and finitely generated modules, module basis and free module).

Use the index set {0,…,n−1} of The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations. Write e0,…,en−1 for the standard row basis of M and e0T,…,en−1T for the standard column basis of N, so that the row-column product is eiejT=δij, while eiTej=Eij is the matrix unit. Then:

  1. Matrix multiplication identifies M⊗BN with k, by ei⊗ejT↦eiejT=δij.
  2. Matrix multiplication identifies N⊗kM with B, by ejT⊗ei↦ejTei=Eji.
  3. The cyclic rotation sends the class of ei⊗ejT to the class of ejT⊗ei. Under the multiplication identification N⊗kM≅B from (2), this class maps to ejTei=Eji, whose trace is tr⁡(Eji)=δij, matching the scalar eiejT=δij under the identification of (1).
  4. Consequently the rotation identifies HH0(k,k)≅k with HH0(B,B) through the canonical identifications HH0(k,k)=k/[k,k]=k and HH0(B,B)=B/[B,B]≅k, the latter induced by the trace; and by the general derived-cyclicity theorem the higher Hochschild groups agree as well.

Facts & Assumptions

Given: AC, a field k, an integer n≥2, the algebras A=k and B=Mn(k), the row space M=k1×n as a (k,B)-bimodule, and the column space N=kn×1 as a (B,k)-bimodule.

[F1]

For 0≤i,j<n, the matrix unit Eij has a single 1 in entry (i,j) and zeros elsewhere, and EijErs=δjrEis (Matrix units Eij and the Kronecker delta, EijEkℓ=δjkEiℓ).

[F2]
[F4]

Assume AC. For a fixed (A,B)-bimodule M′ finite projective as a right B-module and a fixed (B,A)-bimodule N′ finite projective as a right A-module, the cyclic rotation gives a natural zigzag of chain-homotopy equivalences C∙(A,M′⊗BN′)≃C∙(B,N′⊗AM′); in particular HH0(A,M′⊗BN′)≅HH0(B,N′⊗AM′), and on bar degree zero the rotation is the map [m⊗n]↦[n⊗m] (Double bar comparison for cyclic bimodule tensor products).

[F5]

Assume AC. For a bounded complex M of graded (A,B)-bimodules termwise finite projective as right B-modules and a bounded complex N of graded (B,A)-bimodules termwise finite projective as right A-modules, there are natural isomorphisms HHhyper,p(A,M⊗BLN)≅HHhyper,p(B,N⊗ALM) realized by the cyclic rotation (Derived cyclicity of Hochschild hyperhomology).

[F6]

HH0(A,C)≅C/D(A,C) with D(A,C)=span⁡k{ac−ca} for any k-central bimodule C; the identification is induced by the identity on C (Degree-zero Hochschild homology is bimodule coinvariants).

[F7]

A module with a finite generating set is finitely generated, and a module with a basis is free (Generated submodule, cyclic and finitely generated modules, module basis and free module).

[F8]

Finite-rank free modules are projective without AC (Free modules are projective, with the exact choice boundary), and a direct summand of a projective module is projective (A direct summand of a projective is projective).

Proof

technique · direct
1.1F3F7F8givenconstructalgebra

The row space M is finitely generated by its standard row basis. Let π:B→M take the first row and define σ:M→B by σ(v)=e0Tv, the matrix whose first row is v and whose other rows are zero. Both maps are right B-linear, and πσ(v)=v. Thus M is a direct summand of the free right B-module B, so it is finite projective. The column space N is free of rank n as a right k-module.

1.2F1F3givenalgebra

The row-column pairing (x,y)↦xy is bilinear and balanced over B, since (xb)y=x(by) by associativity. It induces μ:M⊗BN→k with μ(ei⊗ejT)=δij. The balance relations give, for every i,j, ei⊗ejT=e0E0i⊗ejT=e0⊗E0iejT=δij e0⊗e0T. Here 0≤i,j<n. The tensors on the left span M⊗BN, so this quotient is spanned by e0⊗e0T; its image under μ is 1, hence μ is an isomorphism. For the other tensor product, the elementary tensors ejT⊗ei form a k-basis of N⊗kM, and column-row multiplication sends them to the matrix-unit basis Eji of B. Thus N⊗kM≅B by an explicit basis-to-basis isomorphism.

1.3F1F2F6givenalgebra

Every commutator in B has trace zero by [F2], so [B,B]⊆ker⁡(tr⁡). Conversely, if i≠j, then Eij=[Eii,Eij] and Eii−Ejj=[Eij,Eji] by [F1]. The off-diagonal units and the diagonal differences span the trace-zero subspace: for a diagonal matrix diag⁡(d0,…,dn−1) with ∑idi=0, it is ∑i=0n−2di(Eii−En−1,n−1). Thus ker⁡(tr⁡)⊆[B,B]. Since tr⁡(E00)=1, trace is onto k, so B/[B,B]≅k in every characteristic; no division by n is used. For A=k, the commutator subspace is zero, giving HH0(k,k)≅k.

2.1F1F2F4step 1.2givenalgebra

The cyclic rotation of [F4], in bar degree zero, sends the class of ei⊗ejT to the class of ejT⊗ei, which by step 1.2 corresponds to the matrix unit Eji. By [F1] and [F2], tr⁡(Eji)=δij, while the scalar corresponding to ei⊗ejT under the identification of step 1.2 is eiejT=δij. Hence the rotation matches the two identifications: the scalar product of the row and column vectors and the trace of the corresponding matrix unit agree.

3.1F4F5F6step 1.1step 1.2step 2.1step 1.3givenalgebra∎

By step 1.1 the pair (M,N) satisfies the hypotheses of [F4], so the cyclic rotation gives an isomorphism HH0(k,M⊗BN)≅HH0(B,N⊗kM), natural in the pair. Under the identifications M⊗BN≅k and N⊗kM≅B of step 1.2 and the coinvariant description of [F6], this becomes the isomorphism k≅B/[B,B]≅k whose two composites are computed on classes by step 2.1 and step 1.3: the rotation sends [ei⊗ejT] to [Eji], and the trace of Eji is δij, which is exactly the class of the scalar product. For higher Hochschild degrees the same rotation is applied to the terms of the bounded complexes concentrated in cochain degree zero, and the derived-cyclicity isomorphism of [F5] applies with M and N regarded as complexes concentrated in cochain degree zero, in hyperhomology degree −p, giving HHp(k,k)≅HHp(B,B) for every p≥0 (the coefficient complexes are concentrated in cochain degree zero) and showing that the agreement is not special to degree zero.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

67 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