Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Finite Weyl positive roots and simple reflections

Statement

For the preceding finite reduced crystallographic root system, regular vectors t exist, W is finite, and the simple positive roots are a basis of E. Every root has integral coordinates in this basis of one sign. Each si permutes Φ+∖{αi} and sends αi to −αi. The simple reflections generate W, and every root is the image of a simple root under their group. The simple coroots similarly form an integral basis of the coroot group, and P is the lattice generated by their dual basis; W preserves Q,Q∨,P. All assertions are choice-free, including rank zero.

Facts & Assumptions

Given: The finite Euclidean root system and its conventions.

[F1]

All root, reflection, positivity and lattice definitions are those of Finite Weyl root system, lattice and chamber conventions.

Proof

1.1F1givenalgebra

Choose any finite basis e1,…,er of E. For each nonzero root α, the polynomial ∑j=1r(ej,α)zj−1 is nonzero, since nondegeneracy and spanning prevent all its coefficients vanishing. A nonzero degree-d real polynomial has at most d roots: division by z−a at a zero and induction prove this assertion. Finitely many such polynomials therefore have only finitely many forbidden real values. Choose one other value z and take t=∑jzj−1ej. In rank zero take t=0. Also W acts on the finite spanning set Φ and an operator fixing every root is the identity; this injects W into a finite permutation group. Hence W is finite.

1.2F1givenalgebra

If independent roots α,β have (α,β)<0, the positive integers m=−2(α,β)/(α,α) and n=−2(α,β)/(β,β) obey mn<4, by the strict Cauchy–Schwarz inequality. The latter follows directly by minimizing (α−uβ,α−uβ)>0 over real u. Thus at least one of m,n equals one. The corresponding root reflection produces α+β, proving it is a root. If distinct simple positive roots had positive inner product, apply this result to one and the negative of the other. Their difference would be a root; whichever sign it has expresses one of the simple roots as a sum of two positive roots, a contradiction. Distinct simple roots therefore have nonpositive inner products.

2.1step 1.2F1algebra

Every positive root is a sum of simple roots with nonnegative integer coefficients. If not simple, split it into two positive roots. Both have smaller t-value, and induction on the position in the finite ordered list of positive t-values terminates the splitting. Thus the simple roots span E. They are independent: in a nontrivial real relation separate the positive and negative coefficients to obtain v=∑i∈Iaiαi=∑j∈Jbjαj with disjoint index sets and strictly positive coefficients. Neither side can be empty, since pairing with t would then give a contradiction; it also shows v≠0. Step 1.2 gives (v,v)=∑i,jaibj(αi,αj)≤0, contradicting positive definiteness. Hence they are a basis. Negating gives the negative-root coordinates as well.

3.1step 2.1F1algebra

For β∈Φ+∖{αi}, its simple expansion has a positive coefficient at some index other than i: otherwise reducedness would make β=αi. Reflection si changes only the coefficient at i. Its image is a root and still has that other positive coefficient, so step 2.1 makes every coefficient nonnegative. Thus siβ is positive. The involution si then permutes all these positive roots and reverses αi.

3.2step 2.1F1algebra

The coroot set Φ∨ is a finite reduced crystallographic root system: sαβ∨=(sαβ)∨, its double dual is Φ, and its two integer pairings interchange those of Φ. Its positive roots are positive scalar multiples of the positive roots of Φ, and every positive coroot has nonnegative real coordinates in the basis αi∨. Apply step 2.1's simple-basis conclusion to this dual system. The cone spanned by its positive roots is exactly the cone generated by the αi∨, since those coroots themselves belong to it. The extreme rays of a cone spanned by a basis are exactly its basis rays: a vector with two positive coordinates splits into two nonproportional cone vectors, whereas a single-coordinate vector cannot. The dual simple roots must therefore lie on exactly these rays. Reducedness gives that they are precisely the αi∨. Their integer positive expansions give Q∨=⨁iZαi∨.

4.1step 2.1step 3.1F1algebra

Suppose a positive root β=∑jnjαj is not simple. Since (β,β)=∑jnj(β,αj)>0, some (β,αi)>0. Its positive integral coroot pairing means siβ=β−mαi with an integer m>0. By step 3.1 this root stays positive and has smaller integer height ∑jnj. Repeating finitely many times reaches a simple root. Therefore every positive root is in the group orbit of a simple root; a negative root is obtained by first negating that simple root with its reflection. For any orthogonal u, direct substitution gives suα=usαu−1. Consequently every root reflection lies in the group generated by the si, proving that this group is W.

5.1step 1.1step 3.2F1algebra∎

Let ωi be the basis dual to αi∨ under the nondegenerate form. Step 3.2 implies P=⨁iZωi. Reflection invariance of the root and coroot sets gives invariance of Q,Q∨. If λ∈P and w∈W, then (wλ,α∨)=(λ,w−1α∨)∈Z; hence W preserves P. Every basis and root list used was finite. In rank zero all lists are empty, their groups are zero and W is trivial, so the same conclusions hold.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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