Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04
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.

For a finite group and a field of characteristic p, the group algebra is a symmetric Frobenius algebra via the coefficient of the identity

Statement

Let G be a finite group and k a field. The bilinear form

x,y:=the coefficient of [e] in xy

on the group algebra k[G] is associative, symmetric, and nondegenerate. Hence k[G] is a symmetric Frobenius algebra.

Facts & Assumptions

Given: A finite group G and a field k.

[L1]

Its dimension is G, so this basis is finite (If G is finite then dimkk[G]=G).

Proof

technique · direct
1.1

On basis elements one has [g],[h]={1,h=g1,0,hg1. Thus the matrix of the form in the basis from [F1] is a permutation matrix, so the form is nondegenerate.

F1L1givenalgebra
2.1

Associativity is immediate from the definition, because xy,z and x,yz are both the coefficient of [e] in xyz. Symmetry holds because the coefficient of [e] in [g][h] is 1 exactly when h=g1, which is equivalent to g=h1 and hence to the coefficient of [e] in [h][g] being 1. Bilinearity is clear from the coefficient functional. Therefore the form is associative, symmetric, and nondegenerate.

F1step 1.1algebra
3.1

A finite-dimensional algebra equipped with such a bilinear form is symmetric Frobenius. Hence k[G] has the stated structure.

L1step 2.1

Depends on

Used by

Dependency tree · two levels

6 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