Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge 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.

A perfect symmetrizing trace does not imply semisimplicity

Statement refuted

The refuted claim is: every finite-dimensional associative unital algebra A over a field k that has a k-linear map τ:A→k with τ(ab)=τ(ba) and with a↦[b↦τ(ab)] an isomorphism A→Hom⁡k(A,k) has a semisimple left regular module. Here semisimple module means a direct sum of simple submodules (Semisimple modules as direct sums of simple modules), and simple means nonzero with no proper nonzero submodule (Simple module: a nonzero module with no proper nonzero submodule).

Facts & Assumptions

Given: The rank-one Coxeter group W={1,s}, the universal Hecke algebra H=Z[v±1][T]/((T−v)(T+v−1)), the ring homomorphism ϕ:Z[v±1]→C with ϕ(v)=i, and the specialized algebra A=C⊗Z[v±1]H.

[F1]

The rank-one Hecke relation is (T−v)(T+v−1)=0, and the generic standard basis is {1,T}. (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy, The standard basis of the generic Hecke algebra and base change)

[F2]

After any commutative base change, the canonical trace has Gram entries τ(TxTy)=δx−1,y and induces an isomorphism to the module dual. (The canonical Hecke trace is symmetric and perfect)

[F3]

A semisimple module is a direct sum of simple submodules. (Semisimple modules as direct sums of simple modules)

[F4]

A simple module is nonzero and has no submodules other than zero and itself. (Simple module: a nonzero module with no proper nonzero submodule)

Counterexample

1.1F1F2algebra

Since i−1=−i, the specialization of the quadratic relation in [F1] is (T−i)2=0. The specialized basis is {1,T}, so ϵ:=T−i is nonzero and A≅C[ϵ]/(ϵ2). The canonical trace has τ(1)=1, τ(T)=0, and T2=1+2iT; therefore its Gram matrix in (1,T) is (1001). The algebra is commutative, so the trace is symmetric, and this matrix is invertible, so its trace pairing is perfect (also as guaranteed by [F2]).

1.2F3F4algebra

As a left A-module, Aϵ=Cϵ is simple: ϵ acts as zero on this one-dimensional complex vector space, and scalar elements of C act by scalar multiplication, so its only A-submodules are 0 and Cϵ by [F4]. If x=a+bϵ with a≠0, then x is a unit, with inverse a−1−a−2bϵ; hence Ax=A, which is not simple because it contains the proper nonzero submodule Cϵ. Thus a simple submodule cannot contain an element with nonzero constant coefficient. Every nonzero element with zero constant coefficient generates Cϵ, so every simple submodule of A is exactly Cϵ.

2.1F3step 1.1step 1.2∎

The sum of all simple submodules of A is consequently Cϵ, which is proper because 1∉Cϵ. By [F3], the regular module is not a direct sum of simple submodules, so it is not semisimple. Step 1.1 gives a perfect symmetric trace on this finite-dimensional algebra, while this step proves its regular module is not semisimple. This refutes the claim. No choice principle is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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