Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

Ordered roots and the mu-dot-root matrix in I2(5)

Example

Let S={s1,s2} with m(s1,s2)=5, so W=I2(5) is dihedral of order 10. Let αi=esi and B(α1,α1)=B(α2,α2)=1,B(α1,α2)=−φ2,φ:=2cos⁡(π/5)=1+52. Take the bipartition J={s1}, K={s2}, put c=s1s2, and let CV:=ρ(c). For ρi,μi,βi use the conventions of The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a. Then:

(i) h=5, Φ+={ρ1,…,ρ5}, where ρ1=α1,ρ2=α2+φα1,ρ3=φ(α1+α2),ρ4=α1+φα2,ρ5=α2. Each ρi has B-norm 1, CVρi=ρi+2 for all i≥1, and ρi+5=−ρi.

(ii) The dual basis and subsequent μ-vectors are μ1=β1=4α1+2φα23−φ,μ2=β2=2φα1+4α23−φ, μ3=μ1−2ρ1,μ4=μ2−2ρ2,μ5=μ3−2ρ3. The matrix (μi⋅ρj)1≤i,j≤5 is (1φφ1001φφ1−101φφ−φ−101φ−φ−φ−101).

(iii) The sign assertions of The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] (2) hold for this matrix: entries on and above the diagonal are nonnegative, entries strictly below it are nonpositive, and the entries one step below the diagonal vanish. The cyclicity μi+2⋅ρj+2=μi⋅ρj holds for all i,j≥1.

(iv) The longest element is w0=c2s1=(s1s2)2s1. The displayed word is a reduced S-expression of Coxeter length ℓ(w0)=5=nh/2 and its prefix roots are ρ1,…,ρ5. The vector p=(1,1) is a positive eigenvector of A=2(I−B) with eigenvalue λ=φ=2cos⁡(π/5), and the Coxeter plane is V itself.

No Choice is used; all computations are finite and rank two.

Facts & Assumptions

Given: The rank-two Coxeter system and bilinear form specified in the Example, together with the conventions for βi,ρi,μi, the Coxeter element c, the positive roots, and the longest element from the declared suppliers.

[F1]

rs(x)=x−2B(x,αs)αs; the reflections preserve B, and when m(s1,s2)=5 the product R1R2 has exact order 5. The real Coxeter form, its radical, reflections, and form-preserving maps (2)-(3) Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2),(3)(iv)

[F2]

The canonical homomorphism satisfies ρ(si)=Ri; its root system is Φ={ρ(w)es:w∈W,s∈S}, and CV=ρ(c). The canonical reflection homomorphism, roots, reflections, and the positive cone (1)-(2)

[F3]

CV=R1R2, ρi+2=CVρi, μi+2=CVμi, ρ1=α1, ρ2=R1α2, and μi=βi for i=1,2; the conditional map is μ(v)=−2(CV−id)−1v when the inverse exists. The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (1)-(4)

[F4]

B(CVx,CVy)=B(x,y) for all x,y∈V. Descent of the reflection representation, unit root norms, and conjugation of reflections (2)

[F5]

For n=2, h=5, Φ+={ρ1,…,ρ5}, CV−id is invertible, and μ(ρi)=μi; for odd h, w0=c(h−1)/2a and the corresponding word is reduced of length nh/2 with prefix roots ρ1,…,ρnh/2. The Coxeter plane is P=span⁡(u,v) for u=∑s∈Jpsαs and v=∑t∈Kptαt. The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (2)-(4)

[F6]

ℓ(w0)=∣Φ+∣=5 and w0 is the unique element of length 5. The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(ii)-(iii)

[F7]

From φ=(1+5)/2 one has 1<φ<2, φ2=φ+1 and φ3=2φ+1. [algebra]

[F8]

For 1≤i≤j≤nh/2 one has μi⋅ρj≥0; for 1≤i<j≤nh/2 one has μj⋅ρi≤0; and μi+t⋅ρi=0 for 1≤t≤n−1. The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] (2)(b)-(d)

[F9]

The Coxeter presentation includes the relator (s1s2)5=1 when m(s1,s2)=5, and each simple generator satisfies si2=1. Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups

[F10]

For real x, cos⁡2x=2cos⁡2x−1, cos⁡3x=4cos⁡3x−3cos⁡x, cos⁡(−x)=cos⁡x and cos⁡(x+π)=−cos⁡x. Double-angle and quadratic power-reduction identities, Triple-angle identities for sine, cosine, and tangent, Parity and the Pythagorean identity for sine and cosine, Quarter-turn values and shifts by pi/2 and pi

Verification

technique · direct calculation
1.1F1F2F7F9F10algebra

Put θ=π/5 and u=cos⁡θ>0, since θ is acute. As 3θ=π−2θ, [F10] gives 4u3−3u=−(2u2−1), or (u+1)(4u2−2u−1)=0. Thus 2u=(1+5)/2=φ, verifying the stated exact value. The Gram matrix is G=(1−φ/2−φ/21) with determinant 1−φ2/4=(3−φ)/4>0, so it is positive definite. By [F2], CV=R1R2, which has exact order 5 by [F1]; [F9] gives c5=1, so h=ord⁡(c)=5. From c=s1s2 and [F9] we have s2=s1c and s1cs1=c−1, so every group word has one of the ten normal forms cq or cqs1, 0≤q<5. The five rotations are distinct by the order of c, as are the five elements cqs1; their determinants under ρ differ, so the two lists are disjoint. Thus ∣W∣=10. In the ordered basis (α1,α2), the reflection matrices give R1=(−1φ01) and R2=(10φ−1), hence CV=R1R2=(φ−φφ−1).

1.2F1F2F3F5F7algebra

Direct application of the reflection formula gives ρ1=(1,0) and ρ2=(φ,1) in simple-root coordinates. Multiplication by CV gives ρ3=(φ,φ), ρ4=(1,φ), and ρ5=(0,1); a second application gives ρ6=(−1,0)=−ρ1 and ρ7=(−φ,−1)=−ρ2. Since ρi+2=CVρi, induction on each parity gives ρi+5=−ρi for every i≥1. The first five vectors are distinct, and [F5] identifies Φ+={ρ1,…,ρ5}, so they exhaust the positive roots. Their squared norms are Q(a,b):=a2+b2−φab: Q(1,0)=Q(φ,1)=Q(φ,φ)=Q(1,φ)=Q(0,1)=1 using [F7]. This proves (i).

1.3F3F5F7algebra

The inverse Gram matrix is G−1=43−φ(1φ/2φ/21), so its columns give the displayed β1,β2. From μi+2=CVμi in [F3] and (CV−id)μi=−2ρi, which follows from [F5] and the definition of μ in [F3], we obtain μi+2=μi−2ρi; taking i=1,2,3 gives the three displayed recursions.

1.4F3F4F7F8algebra

For coefficient vectors (a,b) and (u,v), the pairing is B((a,b),(u,v))=au+bv−φ2(av+bu). The columns of the root-coordinate matrix and the μ-coordinate matrix are respectively R=(1φφ1001φφ1) and M=(4d2φd4d−22φd−2φ4d−2−2φ2φd4d2φd4d−22φd−2φ), with d:=3−φ. Therefore the desired dot-product matrix is MTGR, which, using [F7], is the displayed matrix. For example, its (3,1) entry is (β1−2α1)⋅α1=1−2=−1, and its (4,3) entry is (β2−2ρ2)⋅ρ3=φ−2(φ/2)=0. The displayed entries give the stated signs and the one-step subdiagonal zeros. Specifically, these signs agree with F8(b),(d), and for n=2 the zero immediately below the diagonal is F8(c) with t=1. Finally μi+2=CVμi and ρj+2=CVρj, so μi+2⋅ρj+2=μi⋅ρj by B-invariance of CV. This proves (ii)-(iii).

2.1F5F6F7algebra∎

The odd-h clause of [F5] gives w0=c(5−1)/2a=c2s1=(s1s2)2s1 and asserts the alternating word (s1s2)2s1 is reduced of Coxeter length 5 with prefix roots ρ1,…,ρ5. It is the unique longest element by [F6]. The coordinate matrix A=2(I−B) is (0φφ0), so A(1,1)=φ(1,1); by [F7] and the definition of φ, λ=φ=2cos⁡(π/5). Here J={s1} and K={s2}, so the theorem's u=p1α1 and v=p2α2 span V since p1,p2>0; hence its Coxeter plane P=span⁡(u,v) is V. No Choice is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

91 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