Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedaudited 2026-09-22
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.

Restricted root systems are always reduced

Statement

Assume the Axiom of Choice. False: the restricted-root system of a real semisimple Lie algebra is always a reduced root system.

Facts & Assumptions

Given: The Axiom of Choice; the real semisimple Lie algebra su(2,1) with J=diag(1,1,1), the Cartan involution θ(X)=X, the maximal abelian subspace a=RHp0 for H=E13+E31, and its restricted-root system Σa with the functionals f given by f(H)=1.

[A1]

The Axiom of Choice is The Axiom of Choice; it is the hypothesis required by the restricted-root suppliers used in [L3].

[L1]

Restricted roots and restricted-root spaces are the nonzero functionals λa with g0λ={X:[H,X]=λ(H)X for all Ha}0, and the multiplicity mλ is dimRg0λ (Restricted root and restricted root space).

[L2]

A reduced crystallographic root system satisfies, in addition to the reflection and integrality conditions, the reducedness condition RαΦ={α,α} for every αΦ (Reduced crystallographic Euclidean root system).

[L3]

For g0=su(2,1)={XM3(C):XJ+JX=0, trX=0} with J=diag(1,1,1), θ(X)=X and a=RH, H=E13+E31, the restricted-root system is Σ={±f,±2f} with f(H)=1 and multiplicities m±f=2, m±2f=1; moreover su(2,1) is a real form of sl3(C), hence a real semisimple Lie algebra (Restricted root systems may be nonreduced, Restricted root space decomposition).

Refutation

technique · counterexample
1.1

The algebra su(2,1) with the data of [L3] is a real semisimple Lie algebra with a maximal abelian subspace a=RH of p0 and restricted-root system Σ={±f,±2f}, where f(H)=1 and 2f(H)=2.

A1L1L3
1.2

Both f and 2f are elements of Σ, and 2f{f,f} because 2f(H)=2±1=±f(H) for Ha with f(H)=1.

L1L3
2.1

Reducedness of a root system requires RαΦ={α,α} for every root α; taking α=f in the restricted-root system of step 1.1 gives RfΣ{f,f,2f,2f}, which is strictly larger than {f,f}, so Σ is not reduced and in particular is not a reduced crystallographic root system in the sense of [L2].

L2step 1.1step 1.2
3.1

Consequently the restricted-root system of the real semisimple Lie algebra su(2,1) is not reduced, and the statement that restricted-root systems are always reduced is false; the failure is precisely the occurrence of both a root and its double, which the classification of nonreduced restricted systems records as the type BCr family.

step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

29 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