Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generated
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.

The twelve D4 positive roots

PDF p. 27: §7 displayed positive-root list

Example

Let W be the Coxeter group with the D4 diagram whose central vertex 2 is joined to 1,3,4. In its standard real reflection representation let α1,…,α4 be the simple-root basis, and let Φ={wαi:w∈W, 1≤i≤4}. A positive root is a root whose coordinates in this basis are all nonnegative. Then Φ+={α1,α2,α3,α4,α1+α2,α3+α2,α4+α2,α1+α2+α3,α1+α2+α4,α3+α2+α4,α1+α2+α3+α4,α1+2α2+α3+α4}.

Facts & Assumptions

[F1]

The generators si act by si(x)=x−2B(x,αi)αi, where B(αi,αi)=1, B(α2,αj)=−1/2 for j∈{1,3,4}, and the other off-diagonal basis pairings are zero. D4 diagram and generator conventions

[F2]

The root set consists of the W-translates of the simple roots, and W is generated by the simple reflections. Real Coxeter representation and contragredient notation

Verification

Given: the D4 representation and positive-root convention in the Example.

Goal: prove that its positive roots are exactly the twelve displayed vectors.

1.1F1F2given

Write β1,…,β12 for the vectors in the displayed order, and put R={±β1,…,±β12}. For a vector with coordinates (c1,c2,c3,c4), [F1] gives ci′=−ci+∑j∼icj for the coordinate changed by si, leaving the others fixed; j∼i means that j and i are joined in the D4 diagram. Direct substitution gives the following images of βk, where −j denotes −βj and j denotes βj. In the order s1,s2,s3,s4, the rows for k=1,…,12 are (−1,5,1,1), (5,−2,6,7), (3,6,−3,3), (4,7,4,−4), (2,1,8,9), (8,3,2,10), (9,4,10,2), (6,8,5,11), (7,9,11,5), (11,10,7,6), (10,12,9,8), and (12,11,12,12). Thus each si preserves R: the table covers positive entries and linearity covers their negatives. Since R contains every simple root, [F2] gives Φ⊆R.

2.1F1F2step 1.1∎

Conversely, β1,…,β4 are simple roots. The table gives β5=s2β1, β6=s2β3, β7=s2β4, β8=s3β5, β9=s4β5, β10=s4β6, β11=s4β8, and β12=s2β11. Hence all βk are roots. Each negative −βk is also a root: for βk=wαi, it equals wsiαi by [F1]. Therefore R⊆Φ. The twelve βk have nonnegative, nonzero coordinate tuples, whereas their negatives have a negative coordinate, so the stated positive roots are exactly those twelve.

Depends on

Used by · 2

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources