Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $R$ be a root system. Suppose $\alpha\in R$ and if for some $k \in \Bbb{R}$ we have $k\alpha\in R$ then how to prove $k=1,2,-1,-2,1/2,-1/2$? I just know $\frac{2(\alpha,\beta)}{<\alpha,\alpha>}$ will be an integer could any one help me why this term is bounded by $2$ above?

I am reading from this link I am at page 3

share|cite|improve this question
up vote 2 down vote accepted

You know that the quantities $m_1 = 2\frac{\langle k\alpha,\alpha\rangle}{\langle k\alpha, k\alpha\rangle} = \frac{2}{k}$ and $m_2 = 2\frac{\langle \alpha,k\alpha \rangle}{\langle \alpha,\alpha \rangle}= 2k$ are always integers. Now write $2k = n$ for some integer $n$ so that $\frac{4}{n}$ is an integer. The only integers $n$ for which $\frac{4}{n}$ is an integer is

$$n = \pm 1, \pm 2,\pm 4$$

so that $k= \pm 1, \pm 2, \pm \frac{1}{2}$.

share|cite|improve this answer

You mean that $\frac{2(\alpha,\beta)}{(\alpha,\alpha)}$ is integer. Now up to reversing the roles of $\alpha$ and $\beta$ in $k\alpha=\beta$, you can assume that $|k|\leq1$, and you then immediately get what you want.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.