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.

Category O is not semisimple at the rank-one parameter c=1/2

Statement

Let W={1,s}≅Z/2 act on h=C by s=−1. At t=1 and c=1/2, the polynomial standard module has a nonsplit exact sequence 0⟶xC[x]⟶C[x]⟶C⟶0. Thus category O is not semisimple at this parameter.

Facts & Assumptions

Given: The rank-one reflection representation, parameter c=1/2, and the polynomial representation.

[F1]

Reflection data and parameters for a rational Cherednik algebra: choose α=x and α∨(x)=2, so s(x)=−x and s2=1.

[F2]

The rational Cherednik algebra H_{t,c}(W,h): [y,x]=1−2cs in this rank-one normalization.

[F3]

The PBW theorem for rational Cherednik algebras and Standard modules for rational Cherednik category O: the polynomial standard module is C[x] as a vector space.

[F4]

Category O for a rational Cherednik algebra and Standard modules lie in rational Cherednik category O: C[x]∈Oc and its submodules and quotients are objects of Oc.

[F5]

Dunkl operators realize the polynomial standard module: y=ddx−cx(1−s) on C[x], and sf(x)=f(−x).

Proof

technique · direct

Given: [F1]–[F5].

1.1F1F2F5algebra

By [F2] and [F5], y xn=(n−c(1−(−1)n))xn−1 for every n≥1, while y1=0. At c=1/2, this is nxn−1 for even n and (n−1)xn−1 for odd n. In particular, yx=0.

2.1F3F4step 1.1algebra

The subspace I=xC[x] is nonzero and proper. Multiplication by x preserves I, s(xn)=(−1)nxn preserves I, and step 1.1 shows y(xn)∈I for every n≥1: for n=1 it is zero, while for n≥2 its polynomial degree is n−1≥1. By [F3], this is the polynomial standard module; [F4] places it and its submodules in Oc.

3.1F4step 2.1algebra∎

The quotient C[x]/I is one dimensional; x and y act by zero and s acts trivially, so it is simple. If the displayed exact sequence split, its complement would be a one-dimensional submodule J mapping isomorphically to the quotient. A generator f∈J would have nonzero constant term; rescale so f(0)=1. Since xJ⊆J, there would be a scalar λ with xf=λf, or (x−λ)f=0. The polynomial ring C[x] is an integral domain and both factors are nonzero, a contradiction. The sequence is nonsplit, so Oc is not semisimple.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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