Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Rank-two root-system classification

Statement

Let Φ⊆E be a reduced crystallographic root system, and let α,β∈Φ be nonproportional roots. Write nαβ=2(β,α)(α,α),nβα=2(α,β)(β,β) for the two Cartan integers, and let θ∈(0,π) be the angle between α and β.

(i) nαβnβα=4cos⁡2θ∈{0,1,2,3}. With ∣α∣≥∣β∣ the possibilities are exactly: nαβ=nβα=0 and θ=90∘; ∣α∣2=∣β∣2 and either nαβ=nβα=1 with θ=60∘ or nαβ=nβα=−1 with θ=120∘; ∣α∣2=2∣β∣2 and either (nαβ,nβα)=(1,2) with θ=45∘ or (nαβ,nβα)=(−1,−2) with θ=135∘; and ∣α∣2=3∣β∣2 and either (nαβ,nβα)=(1,3) with θ=30∘ or (nαβ,nβα)=(−1,−3) with θ=150∘.

(ii) If (α,β)>0 then α−β∈Φ; if (α,β)<0 then α+β∈Φ.

(iii) If α,β are distinct simple roots of Φ relative to some positive system, then (α,β)≤0 and α−β∉Φ.

(iv) If E has dimension two and {α,β} is a base of Φ, then (α,β)≤0, so the angle is nonacute: it is one of 90∘, 120∘, 135∘, 150∘. The irreducible reduced crystallographic rank-two root systems are exactly A2 (three positive roots), B2≅C2 (four positive roots) and G2 (six positive roots), while the reducible case is A1⊔A1.

Facts & Assumptions

Given: A reduced crystallographic root system Φ in the finite-dimensional real inner product space E, nonproportional roots α,β∈Φ, and the notation nαβ, nβα, θ of the statement.

[L1]

Φ is finite, spans E, 0∉Φ, sγ(Φ)=Φ, 2(δ,γ)/(γ,γ)∈Z, and Rγ∩Φ={±γ} for all roots (Reduced crystallographic Euclidean root system).

[L2]

sγ(x)=x−(x,γ∨)γ=x−2(x,γ)(γ,γ)γ is orthogonal, equals the identity on γ⊥, and sends γ to −γ (Weyl group, Coroot and dual root system).

[L3]

Cauchy-Schwarz: ∣(x,y)∣≤∣x∣∣y∣ for all x,y with equality if and only if x,y are linearly dependent (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

[L4]

A reducible rank-two system is the orthogonal disjoint union of root systems spanning pairwise orthogonal subspaces that span E, uniquely up to order (Unique irreducible decomposition).

[L5]

A finite-dimensional vector space over an infinite field is not a finite union of proper linear subspaces (A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces).

Proof

technique · direct
1.1L1L2algebra

For a linear subspace V⊆E with Φ∩V≠∅, the set Φ∩V is a reduced crystallographic root system in span⁡(Φ∩V): it is finite, contains no zero vector, inherits integrality and reducedness, and sγ(Φ∩V)⊆Φ∩V for γ∈Φ∩V because sγ preserves Φ and maps V into V. In particular the plane subsystem Φ∩span⁡(α,β) is a rank-two reduced crystallographic root system.

1.2L1L2L3algebra

Both nαβ and nβα are integers, and nαβnβα=4(α,β)2(α,α)(β,β)=4cos⁡2θ. Since α,β are nonproportional, Cauchy-Schwarz gives ∣(α,β)∣<∣α∣ ∣β∣, so 0≤4cos⁡2θ<4; being a product of integers, 4cos⁡2θ is a nonnegative integer, hence lies in {0,1,2,3}. If ∣α∣≥∣β∣ then ∣nαβ∣=2∣cos⁡θ∣ ∣β∣∣α∣≤2∣cos⁡θ∣ ∣α∣∣β∣=∣nβα∣, and both absolute values cannot be at least 2, since then their product would be at least 4. Hence ∣nαβ∣∈{0,1}; moreover nαβ≠0 if and only if nβα≠0, and then nαβ=±1, nβα=±(nαβnβα) with the same sign, and ∣α∣2/∣β∣2=nβα/nαβ, because nβα/nαβ=(α,α)/(β,β).

1.3L1L2L5algebra

Fix a vector v∈E with (v,γ)≠0 for every γ∈Φ, which exists because Φ is finite and E is not a finite union of the proper subspaces γ⊥ [L5]. Call γ positive when (v,γ)>0 and negative otherwise, so that Φ is the disjoint union of its positive and negative roots and the negative roots are the negatives of the positive ones; call a positive root simple when it is not a sum of two positive roots. If a positive root is not simple, write it as a sum of two positive roots; the value of v on each summand is strictly smaller than on the sum, so iterating the decomposition and always decomposing a summand that is not simple terminates after finitely many steps (the values of v on positive roots form a finite set and strictly decrease along the iteration). The terminal summands are simple, so every positive root is a sum of simple roots.

1.4L1L4algebra

(Reducible case) If Φ is a reducible rank-two root system then Φ=Φ1⊔Φ2 with Φi root systems spanning pairwise orthogonal nonzero subspaces Ei with E=E1⊕E2 [L4]; hence dim⁡Ei=1, and a rank-one reduced crystallographic root system is {±γ} for its unique positive root γ, since every root lies on the line Rγ and reducedness excludes proper multiples. Thus the reducible rank-two system is A1⊔A1.

2.1step 1.2algebra

With ∣α∣≥∣β∣, the identity of step 1.2 enumerates the possibilities. If nαβnβα=0 then (nαβ,nβα)=(0,0) and θ=90∘. If the product is 1 then nαβ=nβα=±1, so ∣α∣2=∣β∣2, 4cos⁡2θ=1, and θ=60∘ if cos⁡θ>0, θ=120∘ if cos⁡θ<0. If the product is 2 then nαβ=±1, nβα=±2 with the same sign, ∣α∣2=2∣β∣2, 4cos⁡2θ=2, and the angle is 45∘ or 135∘ according to the sign of cos⁡θ. If the product is 3 then nαβ=±1, nβα=±3, ∣α∣2=3∣β∣2, and the angle is 30∘ or 150∘.

2.2L2step 1.2algebra

Assume (α,β)>0. Then both Cartan integers are positive, so by step 1.2 the one attached to the longer of the two roots equals 1: if ∣α∣≤∣β∣ then nβα=1 and sβ(α)=α−nβαβ=α−β∈Φ; if ∣α∣≥∣β∣ then nαβ=1 and sα(β)=β−nαβα=β−α∈Φ, so that α−β=−(β−α)∈Φ. Applying this to −α gives the companion statement: if (α,β)<0 then α+β∈Φ.

3.1step 2.2step 1.3algebra

If α,β are distinct simple roots and (α,β)>0, then α−β∈Φ by step 2.2, and this root is positive or negative: if it is positive then α=(α−β)+β exhibits α as a sum of two positive roots, and if it is negative then β=(β−α)+α exhibits β as a sum of two positive roots, contradicting simplicity in either case. Hence (α,β)≤0. The same reasoning shows α−β∉Φ, since a root α−β is positive, giving the first contradiction, or negative, giving the second.

3.2L1L2step 2.2step 1.2step 2.1algebra

(Root strings) Let α∈Φ and β∈Φ with β≠±α. Then the set of integers k with β+kα∈Φ is a nonempty interval {−p,−p+1,…,q} of consecutive integers with p≥0, q≥0, no gaps, and p−q=nαβ; moreover p+q≤3. Indeed, the set is nonempty because k=0 occurs, and is invariant under k↦−nαβ−k because sα(β+kα)=β−(nαβ+k)α∈Φ, so it is finite and symmetric about −nαβ/2. If it had a gap, there would be r<s−1 with β+rα∈Φ, β+sα∈Φ and β+(r+1)α,β+(s−1)α∉Φ; then (β+rα,α)≥0, since otherwise step 2.2 applied to −α would give β+(r+1)α∈Φ, and similarly (β+sα,α)≤0; subtracting gives (s−r)(α,α)≤0, a contradiction. Hence there are no gaps, and the symmetry of an interval about −nαβ/2 gives p−q=nαβ. Finally, replacing β by β+qα reduces to the case q=0 and p=nαβ, and ∣nαβ∣≤3 by steps 1.2 and 2.1 applied to the nonproportional pair (β+qα,α); if that pair is proportional then reducedness gives at most three elements.

4.1L1step 1.3step 3.1step 1.2algebra

In a rank-two root system the simple roots are linearly independent, hence exactly two; explicitly, pairing a nonzero linear combination with coefficients of only one sign against the regular vector v from step 1.3 rules out its being zero, since (v,αi)>0 for every simple root. Thus every nontrivial relation has both signs. If ∑i∈Iciαi=∑j∈Jcjαj with disjoint finite index sets and positive real coefficients ci,cj (which is the shape of every nontrivial linear relation), then for γ=∑i∈Iciαi≠0 one computes 0<(γ,γ)=(∑i∈Iciαi,∑j∈Jcjαj)=∑i∈I,j∈Jcicj(αi,αj)≤0, because the two index sets are disjoint and distinct simple roots have nonpositive inner product by step 3.1. Therefore the simple roots are independent; since they span E by step 1.3, a rank-two system has exactly two simple roots α1,α2, every root is ±(mα1+nα2) with m,n≥0 integers, and the Cartan matrix is one of (2002), (2−1−12), (2−2−12), (2−1−22), (2−3−12), (2−1−32), because both off-diagonal entries are nonpositive integers whose product is one of 0,1,2,3.

4.2L2step 3.1step 3.2step 1.2algebra

(Descent and constraints for a base) Let α1,α2 be the simple roots of a rank-two system in the ordering of step 1.3, and let γ=mα1+nα2 be a positive root, m,n≥0 integers. Write c=nα1α2=2(α1,α2)/(α1,α1) and c′=nα2α1=2(α1,α2)/(α2,α2); both are nonpositive integers with product in {0,1,2,3} by steps 3.1 and 1.2. Then: (a) nα1γ=2m+nc and nα2γ=2n+mc′, and the reflected roots sα1γ=−(m+nc)α1+nα2 and sα2γ=mα1−(n+mc′)α2 again have coefficients of one sign; hence if n≥1 then −(m+nc)≥0, that is m≤n∣c∣, and if m≥1 then n≤m∣c′∣. (b) The string bounds of step 3.2 give ∣2m+nc∣≤3 and ∣2n+mc′∣≤3. (c) Reducedness gives: if n=0 then m=1, and if m=0 then n=1. (d) If γ≠α1 and 2m+nc≥1, then the α1-string through γ contains (m−1)α1+nα2, so this vector lies in Φ and m≥1; and if γ≠α2 and 2n+mc′≥1, then mα1+(n−1)α2∈Φ and n≥1.

5.1L1L2step 3.1step 3.2step 4.1step 1.4step 4.2algebra

(The three irreducible cases) Let Φ be an irreducible rank-two root system with simple roots α1,α2 and Cartan matrix as in step 4.1; exclude the first matrix, which gives a reducible system by step 1.4 (no positive root has both coefficients nonzero by (a) of step 4.2). For the five remaining cases define K={mα1+nα2: (m,n)∈S},S={{(1,0),(0,1),(1,1)},(c,c′)=(−1,−1),{(1,0),(0,1),(1,1),(2,1)},(c,c′)=(−2,−1),{(1,0),(0,1),(1,1),(1,2)},(c,c′)=(−1,−2),{(1,0),(0,1),(1,1),(2,1),(3,1),(3,2)},(c,c′)=(−3,−1),{(1,0),(0,1),(1,1),(1,2),(1,3),(2,3)},(c,c′)=(−1,−3). Every element of K is a root. The α2-string through α1 has p=0: otherwise its no-gap property would give α1−α2∈Φ, contrary to step 3.1. Step 3.2 gives p−q=c′, hence q=−c′ and all roots α1+jα2 for 0≤j≤−c′. Similarly the α1-string through α2 has p=0, q=−c, and contains every jα1+α2 for 0≤j≤−c. These two strings supply all listed elements for the A2 and B2/C2 cases, and all but the last element in either G2 case. When (c,c′)=(−3,−1), reflection gives sα2(3α1+α2)=3α1−(1+3c′)α2=3α1+2α2∈Φ. When (c,c′)=(−1,−3), it gives sα1(α1+3α2)=−(1+3c)α1+3α2=2α1+3α2∈Φ. All these roots are positive by their nonnegative simple-root coefficients, and K has 3, 4, 4, 6, 6 distinct elements and spans E.

6.1L1step 1.3step 4.2step 5.1algebra

(Exhaustiveness) In each of the five cases of step 5.1, every positive root lies in K. Suppose not, and choose a positive root γ=mα1+nα2 of least height among the positive roots outside K; it is not simple, so by step 1.3 it is a sum of two positive roots of smaller heights, and by minimality of h=m+n both summands lie in K. Hence γ is a sum of two elements of K, and each such sum is either an element of K, or violates one of conditions (a)-(c) of step 4.2, or descends by (d) to such a sum, or is excluded by reducedness [L1]; the following complete lists of the coordinate pairs of the sums of two elements of K verify this case by case. For (c,c′)=(−1,−1) the sums are (2,0),(1,1),(2,1),(0,2),(1,2),(2,2): (2,0) and (0,2) violate (c), (2,1) violates m≤n∣c∣=n and (1,2) violates n≤m∣c′∣=m in (a), and (2,2)=2(α1+α2) is excluded by reducedness because α1+α2∈K is a root. For (c,c′)=(−2,−1) the sums with n≥1 are (2,0),(1,1),(2,1),(3,1),(0,2),(1,2),(2,2),(3,2),(4,2): (2,0) and (0,2) violate (c), (3,1) violates m≤2n and (1,2) violates n≤m in (a), (2,2)=2(α1+α2) and (4,2)=2(2α1+α2) are excluded by reducedness, and (3,2) satisfies (a)-(c) but (d) applied to α1 gives (2,2)∈Φ, already excluded. The case (c,c′)=(−1,−2) is the mirror image with the two coordinates and the two simple roots interchanged. For (c,c′)=(−3,−1) the sums of two elements of K are (2,0),(1,1),(2,1),(3,1),(4,1),(4,2),(0,2),(1,2),(2,2),(3,2),(3,3),(4,3),(5,2),(5,3),(6,2),(6,3),(6,4): (2,0) and (0,2) violate (c), (4,1) violates m≤3n and (1,2) violates n≤m in (a), (5,2) and (6,2) violate ∣2m−3n∣≤3 in (b), (3,3)=3(α1+α2), (2,2)=2(α1+α2), (4,2)=2(2α1+α2) and (6,3)=3(2α1+α2) are excluded by reducedness because α1+α2 and 2α1+α2 lie in K and are roots, (5,3) descends by (d) applied to α1 to (4,3), and (4,3) and (6,4) descend by (d) applied to α2 to (4,2) and (6,3), all already excluded, while (1,1),(2,1),(3,1),(3,2) lie in K. The mirror case (c,c′)=(−1,−3) is handled by the same interchange of coordinates and simple roots. Thus no positive root lies outside K, so Φ=K⊔(−K) in each of the five cases, and the irreducible rank-two root systems are exactly the systems with 3, 4, 4, 6, 6 positive roots.

7.1step 2.1step 3.1step 1.4step 6.1algebra∎

The systems of 3, 4 and 6 positive roots are the root systems traditionally called A2, B2≅C2 and G2: for (c,c′)=(−1,−1) the roots are ±α1,±α2,±(α1+α2) with ∣α1∣=∣α2∣ and angle 120∘; for (c,c′)=(−2,−1) they are ±α1,±α2,±(α1+α2),±(2α1+α2) with ∣α2∣2=2∣α1∣2 and angle 135∘; and for (c,c′)=(−3,−1) they are the six positive roots listed in K with ∣α2∣2=3∣α1∣2 and angle 150∘. The two middle cases are isomorphic as root systems: the linear map that rotates the plane by 45∘ and then rescales uniformly sends the four short root directions and the four long root directions of the (−2,−1) system onto those of the (−1,−2) system, and Cartan integers are unchanged by a uniform rescaling. Combining with steps 2.1, 3.1, 1.4 and 6.1 gives the full rank-two classification, and the angle statement of (iv) is step 3.1.

Remarks

The comparison below draws every root from steps 1.4 and 5.1: blue arrows are the positive roots and gray arrows their negatives; the two simple roots have thicker arrows. All arrows start at the origin. In each panel α1=(1,0). The choices for α2 are respectively (0,1), (−1/2,3/2), (−1,1) and (−3/2,3/2). Thus (c,c′) in the convention of step 4.2 is respectively (0,0), (−1,−1), (−2,−1) and (−3,−1), while ∣α2∣2/∣α1∣2 is 1, 1, 2 and 3. The reducible panel chooses equal lengths only for illustration; the two orthogonal components may be scaled independently. Swapping the simple-root names gives the other Cartan orderings. The proof is independent of the illustration.

A1tA1®1®2µ=90±;j©+j=2A2®1®2µ=120±;j©+j=3B2»=C2®1®2µ=135±;j©+j=4G2®1®2µ=150±;j©+j=6

Depends on

Used by

Dependency tree · two levels

15 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