Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Imaginary root spaces need not have multiplicity one

Statement refuted

False claim: every root space of a Kac–Moody algebra has dimension one. For the affine matrix A=(211121112), each mδ, mZ{0}, is an imaginary root of multiplicity two, where δ=α0+α1+α2.

Facts & Assumptions

Given: The symmetric affine A2 matrix, with indices 0,1,2 and D=I.

[F1]

The full Cartan–Serre presentation specifies g(A). (Serre presentation of a kac moody algebra).

[F2]

Imaginary roots are those outside W Pi. (Real and imaginary kac moody roots).

[F3]

The simple-root form equals A for D=I. (Invariant bilinear form for a symmetrizable kac moody algebra).

[F4]

Every nonzero ideal of g(A) meets its Cartan subalgebra. (Kac moody algebra associated to a gcm).

Counterexample

1.1

Let s be the traceless 3×3 complex matrices and put L=(C[t,t1]s)CcCd. Define c central, [d,tmx]=mtmx and [tmx,tny]=tm+n[x,y]+mδm,ntr(xy)c. The central term is antisymmetric since m=n on its support. Matrix trace satisfies tr([x,y]z)=tr(x[y,z]) by cyclic multiplication. In the Jacobi sum for three loop terms, the central coefficient is zero unless m+n+k=0; in that case it is ((m+n)+(n+k)+(k+m))tr([x,y]z)=0. The ordinary matrix part satisfies Jacobi by associativity. The Jacobi identity involving d is the derivation rule: the central term on the right has factor m+n=0 on its support, and the loop terms have degree m+n. Thus L is a Lie algebra.

given
2.1

Let H1=E11E22 and H2=E22E33 and take h=CH1CH2CcCd. Put h1=H1, h2=H2, h0=cH1H2. On a diagonal H=diag(z1,z2,z3) set α1(H)=z1z2, α2(H)=z2z3, and α0(H)=z3z1; all vanish on c, while α0(d)=1 and α1(d)=α2(d)=0. Direct evaluation gives diagonal Cartan entries 2 and off-diagonal entries −1. The coroots are independent because h0 has nonzero c-coordinate; the roots are independent because the d-coordinate separates α0 and the two finite diagonal differences are independent. The matrix has rank two: its row sum is zero and its upper 2×2 minor is 3. Thus dimh=4=232 is minimal.

givenstep 1.1
3.1

Take e0=tE31, e1=E12, e2=E23 and f0=t1E13, f1=E21, f2=E32. The matrix-unit bracket formula gives [e0,f0]=E33E11+c=h0 and [ei,fj]=δijhi for every other pair. The diagonal and d-actions give the stated simple weights and their negatives. The positive pair brackets are [e0,e1]=tE32, [e0,e2]=tE21, [e1,e2]=E13; bracketing each again with either of its two participating e-generators gives zero by the matrix-unit formula. The negative pair brackets are [f0,f1]=t1E23, [f0,f2]=t1E12 and [f1,f2]=E31, with the same double-bracket zeros. No central term occurs in these repeated brackets since the relevant matrix products have trace zero. Thus all Serre relations with exponent two hold, and F1 gives a homomorphism ϕ:g(A)L preserving the Cartan.

F1step 1.1step 2.1
4.1

The degree-zero generators produce all of s: their brackets yield E13,E31 and H1,H2. From tE31, brackets with E23,E12 produce tE21,tE32, then brackets with E12,E23 produce tH1,tH2. Bracketing these diagonals with the degree-zero matrix units produces every tEij, since for each ij at least one of H1,H2 has distinct i,j entries. The same argument from t1E13 starts with [E21,t1E13]=t1E23 and [E32,t1E13]=t1E12 and gives all of t1s. Now [s,s]=s, since diagonal differences are opposite-unit brackets and each off-diagonal unit is a nonzero scalar multiple of its bracket with a diagonal. Induction using [ts,tm1s]=tms for m2, and the negative counterpart, supplies every loop degree. The supplied Cartan contains c,d, so ϕ is onto.

step 1.1step 3.1
5.1

The map ϕ is injective on the Cartan by step 2.1. Its kernel is an ideal of g(A) disjoint from that Cartan, hence zero by [F4]. Thus ϕ is an isomorphism. One can also check recognition directly in L. Its nonzero Cartan weight spaces are CtmEij, of weight εiεj+mδ, and tmd0, of weight mδ for m0, where d0 is the traceless diagonal space and δ(d)=1, δ(d0Cc)=0. Distinct listed weights are distinct functionals. Finite interpolation extracts a nonzero weight vector from any nonzero Cartan-disjoint ideal. A vector tmEij brackets with tmEji to EiiEjj+mc0 in the Cartan. A vector tmH in the diagonal space has m0; choose a traceless diagonal K with tr(HK)0. Such K exists since the trace matrix on H1,H2 is (2112) of determinant 3. Its bracket with tmK is the nonzero Cartan vector mtr(HK)c. Both contradict disjointness.

F4step 1.1step 2.1step 4.1
6.1

The root coordinates give δ=α0+α1+α2. By step 5.1 the space at mδ, m0, has basis tmH1,tmH2, and so dimension two. F3 gives (δ,δ)=66=0. A simple reflection preserves this root form by direct expansion using (αi,λ)=λ(hi) and (αi,αi)=2; hence every root in WΠ has squared length 2. The nonzero root mδ has squared length zero, so is imaginary by F2. This proves the counterexample for every positive or negative nonzero integer m. At m=0 the four-dimensional space is the Cartan and is not a root space.

F2F3step 2.1step 5.1

Sources

Source comparison: Kleshchev, Proposition 1.5.1, Lemma 1.5.3 and Example 1.5.4, pp.20–25; fully computed loop-sl3 adaptation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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