Algebras

Algebras

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au
and

Department of Mathematics
University of Wisconsin, Madison
Madison, WI 53706 USA
ram@math.wisc.edu

Last updates: 22 January 2010

Algebras

Let R be a integral domain and let A R be an algebra over R , so that A R has an R -basis b 1 … b d , A R = R -span b 1 … b d and b i b j = ∑ k = 1 d r i j k b k , with r i j k ∈ R , making A R a ring with identity. Let 𝔽 be the field of fractions over R , let 𝔽 ‾ be the algebraic closure of 𝔽 , and set A = 𝔽 ‾ ⊗ R A R = 𝔽 ‾ -span b 1 … b d with multiplication determined by the multiplication in A R . Then A is an algebra over 𝔽 ‾ .

A trace on A is a linear map t → : A → 𝔽 ‾ such that t → a 1 a 2 = a 2 a 1 , for all a 1 a 2 ∈ A . A trace t → on A is nondegenerate if for each b ∈ A there is an a ∈ A such that t → b a ≠ 0 .

Let A be a finite dimensional algebra over a field 𝔽 ; let t → be a trace over A . Define a symmetric bilinear form : A × A → 𝔽 on A by a 1 a 2 = t → a 1 a 2 , for all a 1 a 2 ∈ A . Let B be a basis of A . Let G = b b ′ b b ′ ∈ B be the matrix of the form with respect to B . The following are then equivalent.

  1. The trace t → is nondegenerate.
  2. det G ≠ 0 .
  3. The dual basis B * to the basis B with respect to the form exists.

Proof.
  1. (b) ⇔ (a): The trace t → is degenerate if there is an element a ∈ A , a ≠ 0 , such that t → a c = 0 for all c ∈ B . If a b ∈ 𝔽 ‾ are such that a = ∑ b ∈ B a b , then 0 = a c = ∑ b ∈ B a b b c for all c ∈ B . So a exists if and only if the columns of G are linearly dependent, i.e. if and only if G is not invertible.
  2. (c) ⇔ (b): Let B * = b * be the dual basis to b with respect to and let P be the change of basis matrix from B to B * . Then d * = ∑ b ∈ B P d b b , and δ b c = b d * = ∑ b ∈ B P d c b c = G P t b c . So P t , the transpose of P , is the inverse of the matrix G . So the dual basis to B exists if and only if G is invertible, i.e. if and only if det G ≠ 0 .
□

Let A be an algebra and let t → be a nondegenerate trace on A . Define a symmetric bilinear form : A × A → 𝔽 ‾ on A by a 1 a 2 = t → a 1 a 2 , for all a 1 a 2 ∈ A . Let B be a basis of A and let B * be the dual basis to B with respect to with respect to .

  1. Let a ∈ A . Then a = ∑ b ∈ B b a b * is an element in the center Z A of A and a does not depend on the choice of basis B .
  2. Let M and N be A -modules and let φ ∈ Hom 𝔽 ‾ M N and define φ = ∑ b ∈ B b φ b * . Then φ ∈ Hom A M N and φ does not depend on the choice of basis B .

Proof.
  1. (a): Let c ∈ A . Then c a = ∑ b ∈ B c b a b * = ∑ b ∈ B ∑ d ∈ B c b d * d a d * = ∑ d ∈ B d a ∑ b ∈ B d * c b b * = ∑ d ∈ B d a d * c = a c , since c d d * = t → c b d * = t → d * c b = d * c b . So a ∈ Z A .

    Let D be another basis for A and let D * be the dual basis to D with respect to . Let P = P d b be the transition matrix from D to B and let P -1 be the inverse of P . Then d = ∑ b ∈ B P d b b and d * = P -1 b ~ d b ~ * , since d d ~ * = ∑ b ∈ B P d b ∑ b ~ ∈ B P -1 b ~ d ~ b ~ * = ∑ b b ~ ∈ B P d b P -1 b ~ d ~ δ b b ~ = δ d d ~ . So ∑ d ∈ D d a d * = ∑ d ∈ D ∑ b ∈ B P d b b a ∑ b ~ ∈ B P -1 b ~ d b ~ * = ∑ b b ~ b a t ~ * δ b b ~ = ∑ b ∈ B b a b * . So a does not depend on the choice of the basis B .
  2. (b): The proof of part (b) is the same as the proof for part (b) except a is replaced by φ .
□

Reference

[HA] T. Halverson and A. Ram, Partition algebras, European Journal of Combinatorics 26, (2005), 869-921; arXiv:math/040131v2.

page history