Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 dual numbers are symmetric Frobenius and nonsemisimple over every field

Example

Let k be any field and let A=k[x]/(x2), with ϵ(1)=0 and ϵ(x)=1. The basis (1,x) has pairing matrix

(0110).

It is symmetric and nondegenerate in every characteristic. Its associated coproduct is

Δ(1)=1⊗x+x⊗1,Δ(x)=x⊗x.

The Frobenius algebra is not semisimple as a left module over itself.

Facts & Assumptions

Given: An arbitrary field k and the quotient algebra A=k[x]/(x2).

[F1]

A Frobenius object has a unital associative algebra, counital coassociative coalgebra, and the two typed Frobenius identities; its pairing is ϵμ (Frobenius objects and typed colored knowledgeable sewing data).

[F2]

A nondegenerate associative functional determines the unique coproduct by its inverse-pairing tensor (A Frobenius functional determines a unique Frobenius coproduct).

[F3]

A semisimple module is an internal direct sum of simple submodules, and a simple module is nonzero with no nonzero proper submodule (Semisimple modules as direct sums of simple modules, Simple module: a nonzero module with no proper nonzero submodule).

Verification

1.1givenF1F2construct

Every class in A has a unique form a+bx, so (1,x) is a basis, x2=0, and the multiplication is associative as a quotient of k[x]. The matrix of β(u,v)=ϵ(uv) in this basis is the displayed matrix; its determinant is −1, which is nonzero even in characteristic two. Thus β is symmetric and nondegenerate, so ϵ is a Frobenius functional. The right-dual basis to (1,x) for β is (x,1), so the inverse-pairing tensor is x⊗1+1⊗x. Applying Δ(a)=(a⊗1)(x⊗1+1⊗x) gives the two formulas.

2.1step 1.1F1algebra

Direct computation verifies the coalgebra laws. The two counits on Δ(1) give ϵ(1)x+ϵ(x)1=1 and 1ϵ(x)+xϵ(1)=1; on Δ(x) each gives xϵ(x)=x. Coassociativity on 1 gives on both sides 1⊗x⊗x+x⊗1⊗x+x⊗x⊗1, and on x gives x⊗x⊗x on both sides.

3.1step 1.1step 2.1F1algebra

To check both Frobenius identities it is enough by bilinearity to use the four ordered basis pairs. For (1,1) both sides are Δ(1); for (1,x) both sides are Δ(x); for (x,1) both sides are x⊗x; for (x,x) both sides are 0, since x2=0. These are exactly Δ(ab)=(a⊗1)Δ(b)=Δ(a)(1⊗b), the two typed identities after inserting the vector-space associator. Thus (A,μ,η,Δ,ϵ) is a symmetric Frobenius object.

4.1givenF3algebra∎

Let J=kx. It is a nonzero proper left submodule of A, since x⋅x=0 and scalars preserve J. If L⊆A is any simple left submodule, multiplication by x maps L into L. Its image xL is a submodule, so simplicity gives xL=0 or xL=L. The latter would imply L=xL=x2L=0, contradicting simplicity; hence xL=0. For a+bx∈L, this implies 0=x(a+bx)=ax, so a=0 and L⊆J. Therefore every simple submodule of A is contained in the one-dimensional space J; their sum cannot equal the two-dimensional module A. By [F3], A is not semisimple as a left module over itself.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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