Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

G2 from I2(6): the scaled realization and its twelve roots

Example

Let S={s,t} with m(s,t)=6, let V=RS with Coxeter form B, and let W and ρ:W→GL(V) be the presented Coxeter group and canonical reflection homomorphism. Then B is positive definite and W=I2(6) has order 12. The scaling cs=1, ct=3 has Cartan matrix A=(2−1−32) and scaled root set Φc={±as,±at,±(as+at),±(2as+at),±(3as+at),±(3as+2at)}, where as=es and at=3et. The squared B-norms are 1 on as,as+at,2as+at and 3 on at,3as+at,3as+2at; every root-coroot pairing is integral, including B(as,(2as+at)∨)=1, B(2as+at,(3as+2at)∨)=1 and B(at,(3as+at)∨)=−1. This is the irreducible reduced crystallographic root system of type G2, and its Weyl group is W(Φc)=ρ(W). The other scaling cs′=3, ct′=1 gives AT and satisfies Φc′=(3/2)Φc∨, the dual orientation of the same G2 diagram.

Facts & Assumptions

Given: S={s,t}, m(s,t)=6, V=RS, the Coxeter form B, the presented Coxeter group W, its canonical reflection homomorphism ρ, and the scaling conventions of Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices.

[F1]

The presentation has generators s,t and relators s2=t2=1 and (st)6=1 (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F2]

B(es,es)=B(et,et)=1 and B(es,et)=−cos⁡(π/6) (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F3]

The canonical homomorphism ρ:W→GL(V) satisfies ρ(i)=rei for each i∈S (The canonical reflection homomorphism, roots, reflections, and the positive cone).

[F4]

For a scaling c, ai=ciei, ai∨=2ai/B(ai,ai), and aij=B(ai,aj∨) (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).

[F6]

On a one-edge tree labelled 6, the tree construction with root scale 1 gives the positive crystallographic scaling cs=1, ct=2cos⁡(π/6) (Cartan-number products, allowed edge labels, tree scalings and reflection stability, clause (3)).

[F7]

If c is crystallographic, then B(β,γ∨)∈Z for every β,γ∈Φc, where Φc∨={β∨:β∈Φc} and β∨=2β/B(β,β) (Cartan-number products, allowed edge labels, tree scalings and reflection stability, clause (4)).

[F8]

A reduced crystallographic Euclidean root system is finite, spans its inner-product space, is stable under reflection in every root, has integral Cartan pairings, and has only ±α on each root line (Reduced crystallographic Euclidean root system).

[F9]

Reducibility is an orthogonal decomposition of the root set into two nonempty parts; irreducibility means no such decomposition (Reducible and irreducible root systems).

[F10]

For a regular vector v, positive roots are those with positive inner product with v, and a positive root is simple if it is not a sum of two positive roots (Positive systems and simple roots).

[F11]

An irreducible reduced crystallographic root system of rank two with six positive roots is of type G2; the other irreducible rank-two types have three positive roots (A2) or four (B2≅C2) (Rank-two root-system classification, clause (iv)).

[F12]

The Weyl group W(Φc) is generated by the reflections in all roots of Φc (Weyl group).

[F14]

For B(a,a)≠0, ra(x)=x−2B(x,a)a/B(a,a) (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F15]

Φc={ρ(w)ai:w∈W, i∈S} (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).

Verification

Given: S={s,t} and m(s,t)=6.

Proof technique: direct presentation and orbit computations, followed by verification of the root-system axioms.

1.1F1F2F5F13algebra

Since V=R{s,t}, evaluating functions at s and t shows that (es,et) is a basis. Put z=cos⁡(π/3). Since 0<π/3<π/2, [F5] gives z>0. The supplementary and double-angle identities give −z=cos⁡(2π/3)=2z2−1, so (2z−1)(z+1)=0 and hence z=1/2. Applying the double-angle identity at π/6 and using positivity again gives cos⁡(π/6)=3/2. Thus B(xes+yet,xes+yet)=x2−3xy+y2=(x−32y)2+14y2, which is positive for every nonzero (x,y), so B is positive definite. Set u=st; then u6=1, sus=u−1 and t=su. Moving each s to the right shows every word is uks or uk, with 0≤k<6, so ∣W∣≤12.

2.1F2F4F6step 1.1algebra

By [F6] and step 1.1, cs=1 and ct=2cos⁡(π/6)=3 give a crystallographic scaling. Hence as=es, at=3et, B(as,at)=−3/2, ast=B(as,at∨)=−1, and ats=B(at,as∨)=−3, so A=(2−1−32). Choosing t as the tree root gives the other scaling cs′=3, ct′=1; the same Cartan formula gives A′=(2−3−12)=AT.

2.2F2F3F4F14F15step 1.1algebra

In coordinates (x,y) relative to (as,at), the reflection formula [F14] gives ras(x,y)=(−x+3y,y) and rat(x,y)=(x,x−y); each matrix squares to the identity. These maps preserve R:={±(1,0),±(0,1),±(1,1),±(2,1),±(3,1),±(3,2)}: on the six displayed positive pairs their respective images are ((−1,0),(3,1),(2,1),(1,1),(0,1),(3,2)) and ((1,1),(0,−1),(1,0),(2,1),(3,2),(3,1)), and the images of their negatives are the negatives of these. Conversely (1,1)=rat(1,0), (2,1)=ras(1,1), (3,1)=ras(0,1) and (3,2)=rat(3,1). For every orbit vector β=ρ(w)ai, the element ρ(wsiw−1) sends β to −β, so all twelve pairs lie in the orbit of the simple roots. Substituting positive scalar multiples in the reflection formula gives ras=res=ρ(s) and rat=ret=ρ(t); hence R=Φc by [F15]. The squared norm of (x,y) is x2−3xy+3y2, whose values on (1,0),(0,1),(1,1),(2,1),(3,1),(3,2) are respectively 1,3,1,1,3,3. The product U=ρ(st)=rasrat has matrix (2−31−1), with U2=(1−31−2) and U3=−I; hence U has exact order 6. The six maps Uk are distinct, as are Ukρ(s), and the two lists are disjoint since their determinants are 1 and −1. Thus ∣ρ(W)∣≥12; with step 1.1 this gives ∣W∣=12 and ρ is injective.

3.1F2F3F4F7F8F14F15step 2.1step 2.2algebra

For every nonisotropic a, expansion of [F14] gives B(rau,rav)=B(u,v)−2B(u,a)B(a,v)B(a,a)−2B(v,a)B(u,a)B(a,a)+4B(u,a)B(v,a)B(a,a)=B(u,v); applying this to as,at shows the generators of ρ(W) preserve B, hence so does every ρ(w). If β=ρ(w)ai∈Φc by [F15], then B(β,β)=B(ai,ai)>0, and conjugating the reflection formula by the B-isometry ρ(w) gives rβ=ρ(w)raiρ(w)−1, so rβ(Φc)=Φc. The set Φc=R is finite, nonzero and spans V; its root-coroot pairings are integral by [F7] and its reducedness follows from the six distinct root slopes. Therefore Φc is a reduced crystallographic Euclidean root system.

4.1F2F4F9F10F11step 1.1step 2.1step 2.2step 3.1algebra

Let v=6as+103at; the Gram matrix from [F2], [F4] and step 1.1 gives B(v,as)=B(v,at)=1. The vectors as=es and at=3et form a basis. Thus for each listed pair (x,y) with x,y≥0, B(v,xas+yat)=x+y>0, and the six listed vectors are exactly the positive roots. Neither as nor at is a sum of two positive roots, since the only positive root with second coordinate zero is as and the only one with first coordinate zero is at; the other positive roots decompose as as+at, as+(as+at), as+(2as+at) and at+(3as+at). Hence {as,at} is a base. Since B(as,at)=−3/2≠0, these two spanning roots cannot belong to different orthogonal parts in a decomposition, while they already span V; [F9] therefore gives irreducibility. By [F11], the root system is of type G2.

5.1F3F4F7F12step 2.1step 3.1algebra∎

Every root reflection is ρ(w)raiρ(w)−1 as in step 3.1, so [F12] gives W(Φc)⊆ρ(W); conversely ras=ρ(s) and rat=ρ(t) generate ρ(W), so W(Φc)=ρ(W) and it has order 12. For the second scaling, as′=3es=(3/2)as∨ and at′=et=(3/2)at∨; because ρ(w) preserves B, (ρ(w)ai)∨=ρ(w)ai∨, whence Φc′=(3/2)Φc∨ by [F7]. This construction uses only the two fixed generators and finitely many roots, so no form of the Axiom of Choice is used.

No form of the Axiom of Choice is used; all choices and computations involve the two fixed generators and finite sets.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

70 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