Let <mi mathvariant="normal">&#x0394;<!-- Δ --> be an indecomposable root system in a real inner

Caleb Proctor

Caleb Proctor

Answered question


Let Δ be an indecomposable root system in a real inner product space E, and suppose that Φ is a simple system of roots in Δ, with respect to an ordering of E. If Φ = { α 1 , , α l }, prove that
α 1 + + α l Δ
I know that any positive root γ may be written as a sum of simple roots, and furthermore that every partial sum is itself a root, but I am unsure if that will help me or not. Any hints to get me started?

Answer & Explanation



Beginner2022-07-04Added 19 answers

First, I would let Φ be a base for an indecomposable root system, and choose labels for the elements of Φ according to the following algorithm:
Suppose you have chosen Φ k := { α 1 , , α k } such that the corresponding root system Δ k is indecomposable (when k = 1 this is automatic). Then, there exists α k + 1 Φ such that Φ k + 1 is a base for an indecomposable root system Δ k + 1 . Indeed, otherwise
s p a n ( Φ k ) s p a n ( Φ Φ k ) ,
so Δ is not indecomposable, a contradiction.
This is enough to obtain strict inequality since, by construction, we must have ( α j , α l ) < 0 for some j < l.
Lucian Maddox

Lucian Maddox

Beginner2022-07-05Added 8 answers

Great, but maybe there is another solution?

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?