Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-generated
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 rank-one Hecke algebra with a perfect symmetrizing form and degenerate regular trace

Statement refuted

A finite-dimensional Hecke algebra over a characteristic-zero field is semisimple whenever it admits a nondegenerate symmetrizing trace pairing.

Facts & Assumptions

Given: The rank-one Coxeter group W={1,s}, coefficient field K=C, parameter v=i, and the specialized normalized Hecke algebra H=K[T]/((T−i)(T+i−1)).

[F1]

The normalized quadratic relation is (Ts−vs)(Ts+vs−1)=0 (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy).

[F2]

For every commutative specialization, the elements (1⊗Tw)w∈W form a basis (The standard basis of the generic Hecke algebra and base change).

[F3]

The regular-trace Gram matrix has entries Tr⁡K(LTxTy) and its determinant is the regular-trace determinant (Finite Hecke specialization and its regular-trace determinant).

[F4]

A simple left module is nonzero and has no proper nonzero submodule (Simple module: a nonzero module with no proper nonzero submodule).

[F5]

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

Counterexample

Given: The data above and the regular left action of H on itself.

1.1givenF1F2algebra

Since i−1=−i, the defining polynomial is (T−i)2, and the standard basis is (1,T) by [F2]. Expanding the relation gives T2=1+2iT.

1.2givenF2F4algebra

Let ϵ:=T−i. The basis (1,T) implies ϵ≠0, while the defining polynomial gives ϵ2=0. For any simple left H-module S, ϵS is a submodule because H is commutative. If ϵS≠0, simplicity [F4] gives ϵS=S, and applying ϵ again yields 0=ϵ2S=ϵS=S, a contradiction. Thus ϵ annihilates every simple module.

2.1step 1.1F3algebra

In the basis (1,T), the columns of LT are (0,1)T and (1,2i)T, so [LT]=(0112i). Hence the regular-trace Gram matrix is G=(Tr⁡(L1)Tr⁡(LT)Tr⁡(LT)Tr⁡(LT2))=(22i2i−2). Its determinant is −4−(2i)2=0, so the regular-trace pairing is degenerate and the regular-trace determinant vanishes.

2.2step 1.1algebra

Define τ(1)=1 and τ(T)=0. From T2=1+2iT, for x=a+bT and y=c+dT one obtains τ(xy)=ac+bd=τ(yx). Its Gram matrix in (1,T) is (1001), so the pairing τ(xy) is nondegenerate and perfect.

3.1step 1.2step 2.2F5algebra∎

If the regular module H were semisimple, it would be a direct sum of simple submodules by [F5], each annihilated by ϵ by step 1.2; then ϵ would annihilate all of H. But ϵ⋅1=ϵ≠0. Therefore H is not semisimple, despite the perfect symmetrizing pairing in step 2.2. This refutes the statement.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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