Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 trace form detects semisimplicity over the complex numbers

Statement

Let A be a finite-dimensional associative C-algebra with unit, and let (⋅,⋅):A×A→C be the trace form (a,b):=tr⁡(Lab), where Lc:A→A is left multiplication by c, Lc(x)=cx, and the trace is that of The basis-independent trace of an endomorphism of a finite-dimensional vector space. Then:

  1. (⋅,⋅) is a symmetric associative bilinear form: (a,b)=(b,a) and (ab,c)=(a,bc) for all a,b,c∈A;
  2. (⋅,⋅) is nondegenerate if and only if A is semisimple (A semisimple ring as a ring whose left regular module is semisimple);
  3. if A is semisimple, then either A=0 or A≅∏i=1rM⁡di(C) with r≥1, di≥1, the simple left A-modules are the natural di-dimensional modules of the factors (Simple modules over a product of matrix rings over division rings), and under such an isomorphism the trace form corresponds to ((Xi),(Yi))⟼∑i=1rdi tr⁡(XiYi), a sum of nondegenerate matrix trace pairings. No statement of this item uses the Axiom of Choice.

Facts & Assumptions

Given: A finite-dimensional associative unital C-algebra A, the left multiplications Lc, and the trace form (a,b)=tr⁡(Lab).

[F1]

Trace of endomorphisms: the trace is defined by any ordered basis and is basis-independent, a nilpotent endomorphism of a finite-dimensional nonzero vector space has a strictly upper triangular matrix in some ordered basis and hence trace 0, matrices of composites multiply, and tr⁡(XY)=tr⁡(YX) (The basis-independent trace of an endomorphism of a finite-dimensional vector space, Characterisations of a nilpotent endomorphism, [S∘T]BD=[S]CD[T]BC, For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA)).

[F2]

C is an algebraic closure of R, hence is algebraically closed; every endomorphism of a nonzero finite-dimensional vector space over an algebraically closed field has an eigenvalue (The complex numbers form an algebraic closure of R, Every endomorphism of a nonzero finite-dimensional vector space over an algebraically closed field has an eigenvalue). Wedderburn-Artin describes nonzero semisimple rings as matrix rings over division rings, and the simple modules of a product of matrix rings over division rings are the column modules (Wedderburn–Artin theorem for semisimple rings, Simple modules over a product of matrix rings over division rings).

[F3]

The Jacobson radical J(A) of a finite-dimensional algebra is a two-sided ideal, it is nilpotent, and A/J(A) is semisimple (The Jacobson radical of a finite-dimensional algebra is the intersection of its maximal left ideals, For a finite-dimensional algebra, the Jacobson radical is nilpotent and the quotient by it is semisimple).

Proof

technique · direct
1.1F1algebra

Left multiplication is C-linear and satisfies La+λb=La+λLb and Lab=La∘Lb, since cx is linear in c with x fixed and (ab)x=a(bx); hence (⋅,⋅) is C-bilinear. Moreover (ab,c)=tr⁡(L(ab)c)=tr⁡(La(bc))=(a,bc), and symmetry of the form follows from (a,b)=tr⁡(LaLb)=tr⁡(LbLa)=(b,a), where the middle equality is the cyclic property of the matrix trace applied to the matrices of La and Lb and their composite, with the matrix of a composite given by the product and the trace read in one basis by [F1]. This proves assertion (1).

1.2F1F2algebra

Assume A is semisimple. If A=0 then the empty product gives assertion (3) and the form is nondegenerate vacuously. If A≠0, Wedderburn-Artin gives a ring isomorphism A≅∏i=1rM⁡ni(Di) with division rings Di and ni≥1 by [F2]; since A is a C-algebra, the scalar copy of C lies in the centre of each factor, so each Di is a finite-dimensional division algebra over C. For d∈Di the left multiplication Ld on the nonzero finite-dimensional C-space Di has an eigenvalue λ∈C by [F2], and Ld−λ=Ld−λ is then not injective, so d−λ, being either 0 or a unit of the division ring Di, must be 0; hence d∈C and Di=C. Thus A≅∏i=1rM⁡di(C), and the simple left A-modules are the column modules Cdi by [F2]. For Z∈M⁡d(C) and the basis {Ekl} of matrix units, LZ(Ekl)=ZEkl=∑izikEil has no diagonal contribution from the summand indexed by (k,l) other than the Ekl-coefficient zkkEkl, so tr⁡(LZ)=∑k,lzkk=dtr⁡(Z). Hence, under the isomorphism, (X,Y)=∑iditr⁡(XiYi); if the first argument is orthogonal to the whole factor i, testing against all matrix units Ekl of that factor shows Xi=0, with di≠0 in C; therefore the form is nondegenerate. This proves the reverse implication of assertion (2) and, with the identification of the simple modules, assertion (3).

2.1F1F3step 1.1algebra

Assume conversely that (⋅,⋅) is nondegenerate. Let J:=J(A), which is a two-sided ideal with A/J semisimple and which is nilpotent by [F3]. For x∈J and b∈A associativity puts xb∈J, so (xb)m=0 for some m≥1 and Lxbm=L(xb)m=0 by the product rule of step 1.1, that is, Lxb is nilpotent; by [F1] it has a strictly upper triangular matrix in some ordered basis, so (x,b)=tr⁡(Lxb)=0. Since b∈A was arbitrary and the form is nondegenerate, x=0. Hence J=0 and A=A/J is semisimple, which is the forward implication of assertion (2).

3.1step 1.1step 1.2step 2.1∎

Assertion (1) is step 1.1, the two directions of assertion (2) are steps 1.2 and 2.1, and assertion (3) is the structure statement proved in step 1.2, including the case A=0 as the empty product. All objects constructed are determined by the cited decomposition theorems and by explicit basis computations; no choice principle is invoked, so the item is choice-free.

Depends on

Used by

Dependency tree · two levels

44 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