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.

Simple and reflection lengths of a long transposition in S5

Example

Let W be the Coxeter group of type A4, with S={s1,…,s4}, reflection representation V=RS with positive definite Coxeter form B, reflection set T and lengths ℓ and ℓT (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator, Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound); fix the isomorphism φ:W→S5 with si↦(i i+1) (Coxeter diagrams: edges, labels, components and finite type, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations). Then:

(i) T={φ−1(τ):τ a transposition of S5} and ℓT(w)=1 for the transpositions w; for a transposition (i j) with i<j one has ℓ(φ−1(i j))=2(j−i)−1.

(ii) For the long transposition φ−1(1 5) the two lengths are ℓ=2⋅4−1=7 while ℓT=1; explicitly (1 5)=(2 5)(1 2)(2 5)−1 is a reflection and has 7 inversions.

(iii) Under the linear isometry esi↦12(ei−ei+1) of (V,B) onto the hyperplane H={x∈R5:∑ixi=0} with the standard inner product (Real and complex inner-product spaces and their induced length, Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces), φ corresponds to the permutation action, so F(φ−1(σ)) corresponds to the fixed space {x∈H:σx=x}, of dimension c(σ)−1 for the cycle count c(σ) (fixed points included). Since dim⁡M=dim⁡V−dim⁡F (In finite dimension, W⊥⊥=W and dim⁡W+dim⁡W⊥=dim⁡V) and ℓT=dim⁡M, one has ℓT(φ−1(σ))=dim⁡H−(c(σ)−1)=5−c(σ) for every σ∈S5. In particular ℓT(φ−1(1 5))=1; for the longest element w0=φ−1((1 5)(2 4)) one has ℓ(w0)=10 while ℓT(w0)=5−3=2 (the reversal has three cycles), and every 5-cycle has ℓT=4=dim⁡V.

Facts & Assumptions

Given: The type-A4 Coxeter datum W,S,V,B,ρ,Φ,T and the isomorphism φ:W→S5 with si↦(i i+1); a permutation σ∈S5 acts on R5 by permuting coordinates.

[F1]

si↦(i i+1) extends to an isomorphism φ:W→S5, ℓ(w)=inv⁡(φ(w)) for the inversion number, and S generates W. Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification

[F2]

ρ(si)=resi, T={wsw−1:w∈W, s∈S}, Φ={ρ(w)es:w∈W, s∈S}, and B(es,et)=−cos⁡(π/m(s,t)) with m(si,sj)=3 for adjacent and 2 for non-adjacent generators of A4. The canonical reflection homomorphism, roots, reflections, and the positive cone The real Coxeter form, its radical, reflections, and form-preserving maps

[F3]

ℓT(w)=dim⁡M(w)=dim⁡V−dim⁡F(w), M(w)=F(w)⊥ and V=M(w)⊕F(w); every line of V is the moved space of a unique reflection of the orthogonal group of (V,B). Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order

[F4]

F(w)=ker⁡(ρ(w)−id) and M(w)=im⁡(ρ(w)−id) for w∈W, and T is the reflection set in which ℓT is computed. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator

[F5]

The inversion number of a permutation is the number of pairs a<b with σ(a)>σ(b). Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations

[F6]

Each ρ(si) is an inner-product-preserving involution with normal esi. An orthogonal operator with moved line L equals id−2ΠL and fixes L⊥ pointwise. Descent of the reflection representation, unit root norms, and conjugation of reflections (1), (2), (4), The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order (3).

[F7]

Write γ=π/2 for the smallest positive cosine zero; 0<γ<2, and cosine is strictly decreasing on [0,2]. Also cos⁡(π/2)=0, cos⁡(π−x)=−cos⁡x, and cos⁡(2x)=2cos⁡2x−1. Pi as twice the smallest positive zero of cosine Cosine has a smallest positive zero, lying strictly between zero and two Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3 Quarter-turn values and shifts by pi/2 and pi Double-angle and quadratic power-reduction identities Parity and the Pythagorean identity for sine and cosine

Verification

technique · direct
1.1F1F2F3F6F7

Put c:=cos⁡(π/3). By [F7], 0<π/3<γ<2 gives c>cos⁡γ=0, while 2c2−1=cos⁡(2π/3)=−c, so (2c−1)(c+1)=0 and c=12; also cos⁡(π/2)=0 by [F7]. Put vi:=12(ei−ei+1)∈H for 1≤i≤4. Then ⟨vi,vi⟩=1, ⟨vi,vi+1⟩=−12 and ⟨vi,vj⟩=0 for ∣i−j∣≥2, matching B(esi,esj)=−cos⁡(π/m(si,sj)) by [F2] and [F7]; since the vi are linearly independent (their coordinates in the order (e1,…,e5) are (a,−a+b,−b+c,−c+d,−d)/2 for av1+bv2+cv3+dv4) and every x∈H equals 2∑i=14(x1+⋯+xi)vi, they form a basis of H, so dim⁡H=4 and the map Θ:V→H with Θ(esi)=vi is a linear isometry onto H. For each i the transposition (i i+1) preserves H, reverses vi and fixes vi⊥∩H pointwise, so it is the reflection with normal line Rvi; the image Θρ(si)Θ−1 is by [F2] and [F6] likewise an inner-product-preserving involution of H that reverses vi and fixes vi⊥∩H pointwise, so the two agree on all of H. Since φ is an isomorphism and S generates W [F1], the homomorphisms ΘρΘ−1 and σ↦σ∣H agree on S, hence everywhere: Θρ(w)Θ−1=φ(w)∣H for all w∈W. The permutation action on H is faithful, because if σ acts trivially then σ(ei−ek)=ei−ek for all i≠k, and choosing k∉{i,σ(i)} forces σ(i)=i. Therefore for t=wsw−1∈T the permutation φ(t) has moved line ΘRρ(w)es=R(ep−eq) for some p≠q and fixes the orthogonal hyperplane pointwise, so φ(t)(p q)−1 acts trivially on H and φ(t)=(p q); conversely every transposition (p q)=σ(1 2)σ−1 equals φ(us1u−1) for u:=φ−1(σ), so T={φ−1(τ):τ a transposition}.

1.2F5algebra

For a permutation σ∈S5 the inversion number of the transposition (i j), i<j, is 2(j−i)−1: the pairs a<b with (i j)a>(i j)b are exactly the j−i−1 pairs (i,k) with i<k<j, the single pair (i,j), and the j−i−1 pairs (k,j) with i<k<j. In particular the transposition (1 5) has 2⋅4−1=7 inversions, and the reversal (1 5)(2 4) inverts every one of the (52)=10 pairs, so it has 10 inversions, the maximal value; in S5 this is the longest element.

2.1step 1.1F3F4

By step 1.1 the fixed space of ρ(w) corresponds to {x∈H:σx=x} for σ=φ(w), and ℓT(w)=4−dim⁡{x∈H:σx=x} by [F3]. The fixed space of σ in R5 is spanned by the incidence vectors of its cycles, so it has dimension c(σ) and its intersection with H is defined by the single equation ∑C∣C∣aC=0 on the cycle coefficients aC. Every ∣C∣ is positive, so fixing one cycle lets its coefficient be solved uniquely from the other c(σ)−1 coefficients; the intersection therefore has dimension c(σ)−1; hence ℓT(w)=4−(c(σ)−1)=5−c(σ), with c(σ) the number of cycles of σ (fixed points included). In particular a transposition has c=4 and ℓT=1, the long transposition (1 5) has c=4 and ℓT=1, the reversal (1 5)(2 4) has c=3 and ℓT=2, and a 5-cycle has c=1 and ℓT=4=dim⁡V.

3.1step 1.1step 1.2step 2.1F1F3∎

Collecting the results: by step 1.1 the reflections of W are exactly the φ−1(τ) with τ a transposition, and each has ℓT=1 by step 2.1, which is claim (i)'s first part, while claim (i)'s second part is the inversion count of step 1.2. For the long transposition, ℓ(φ−1(1 5))=7 by steps 1.2 and [F1] and ℓT(φ−1(1 5))=1 by step 2.1, and φ−1(1 5)∈T because (1 5)=(2 5)(1 2)(2 5)−1 exhibits (1 5) as φ(us1u−1) for the element u:=φ−1(2 5); this is claim (ii). Claim (iii)'s dimension formula, the values ℓ(w0)=10 and ℓT(w0)=2, and ℓT=4 for every 5-cycle are steps 1.2, 2.1 and [F1].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

93 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