Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]

Statement

Let (W,S) be an irreducible Coxeter system of finite type with S finite of cardinality n≥2, with the data αi, βi, si, Ri, a, b, c, h, (ρi), (μi) and the linear map μ of The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a, and assume the conclusions of The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (so that Φ+={ρ1,…,ρnh/2} and μ(ρi)=μi). Let ℓT, ≤T, M, F be reflection length, absolute order and the moved and fixed spaces, and let Pσ:={α∈Φ+:tα≤Tσ} for σ≤Tc, where tα∈T is the reflection with normal α (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1), 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). Then:

(1) The basic identities. For every i≥1: (c−id)μi=−2ρi, μi⋅ρi=1, and μi∈F(R(ρi)c), i.e. R(ρi)c μi=μi; moreover F(R(ρi)c) is one dimensional and μi is its unique vector satisfying μi⋅ρi=1.

(2) Sign and vanishing identities. (a) μi⋅ρj=−μj+n⋅ρi for all i,j≥1; (b) μi⋅ρj≥0 whenever 1≤i≤j≤nh/2; (c) μi+t⋅ρi=0 for 1≤t≤n−1 and all i≥1; (d) μj⋅ρi≤0 whenever 1≤i<j≤nh/2.

(3) Separation from earlier cones. If 1≤i1<i2<⋯<im<k≤nh/2, then ρk is not a nonnegative linear combination of ρi1,…,ρim.

(4) Canonical simple systems of the subintervals. Fix σ≤Tc with σ≠1, put k:=ℓT(σ)=dim⁡M(σ) and write Pσ={τ1<τ2<⋯<τt} in the global ρ-order. Then:

(i) Pσ is the set of positive roots of the reflection subgroup Wσ:={w∈W:M(w)⊆M(σ)}, and it contains a simple system Δ={δ1,…,δk}: every root of Pσ is a nonnegative linear combination of the δ's and δ1,…,δk are linearly independent; moreover δk=τt and, recursively, δi is the last root of Pσ lying in M(σR(δk)R(δk−1)⋯R(δi+1)); equivalently δi is the first root of Pσ in M(R(δi−1)⋯R(δ1)σ), with the product empty for i=1, so in particular δ1=τ1.

(ii) εi:=R(δ1)R(δ2)⋯R(δi−1)δi is a positive root for each i, and

σ=R(εk)R(εk−1)⋯R(ε1),σ=R(εi) R(δ1)⋯R(δi−1)R(δi+1)⋯R(δk).

(iii) Let Sσ:=cone⁡{δ1,…,δk}∩S(M(σ)) be the spherical simplex, where S(M(σ))={x∈M(σ):B(x,x)=1}. Its closed spherical wall opposite δi is cone⁡{δj:j≠i}∩S(M(σ))=Sσ∩μ(εi)⊥, and its supporting hyperplane in M(σ) is M(σ)∩μ(εi)⊥.

(iv) If i<j and εi>εj in the global order, then εi⋅εj=0, so R(εi) and R(εj) commute; the reordering θ1<θ2<⋯<θk of ε1,…,εk in the global order satisfies σ=R(θk)R(θk−1)⋯R(θ1) and is lexicographically first among all increasing k-tuples η1<⋯<ηk in Pσ for which R(ηk)⋯R(η1)≤Tc and ℓT(R(ηk)⋯R(η1))=k.

(v) If ℓT(σ)=2 then {τ1,τt} is a simple system of Pσ, the only factorizations of σ as a product of two reflections in W are σ=R(τ1)R(τt)=R(τ2)R(τ1)=⋯=R(τt)R(τt−1), and τ1⋅τt≤0 while τi⋅τi+1≥0 for 1≤i<t; dually, for distinct positive roots ρi,ρj with R(ρi)R(ρj)≤Tc one has: if i<j then ρi⋅ρj≤0, and if i>j then ρi⋅ρj≥0.

(vi) Whenever τi1<⋯<τik is an increasing tuple of roots of Pσ for which R(τik)⋯R(τi1)≤Tc and ℓT(R(τik)⋯R(τi1))=k, one has τij≥θj for every j=1,…,k.

No Choice is used.

Facts & Assumptions

Given: The finite-type irreducible datum with ∣S∣=n≥2 and the bipartite data αi,si,Ri,βi,ρi,μi,a,b,c,h of The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a, the enumeration of The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id, and an element σ≤Tc.

[F1]

Φ+={ρ1,…,ρnh/2} with the ρi pairwise distinct and ρi+n=Cρi, μi+n=Cμi for all i≥1, where C:=ρ(c); C−id is invertible, μ(ρi)=μi, and M(c)=V. Hence ℓT(c)=n. The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (1)-(4) Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)

[F2]

(C−id)μi=−2ρi for all i≥1, and μ is C-equivariant. For 1≤i≤n, μi=βi: each preceding reflection fixes βi by duality. The pairing and fixed-line assertions of (1) are derived in step 1.1 below. The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (4) The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (3)-(4)

[F3]

B is positive definite, every root has B-norm 1, reflections act by rα(x)=x−2B(x,α)α, and B(Cx,Cy)=B(x,y). For each positive root α there is a unique reflection tα with ρ(tα)=rα; its moved space is Rα. The real Coxeter form, its radical, reflections, and form-preserving maps (3) Descent of the reflection representation, unit root norms, and conjugation of reflections (2),(3) The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1) Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)

[F4]

Positive roots have nonnegative simple-root coefficients, and B(f,α)>0 for every f∈C∘ and α∈Φ+. Root sign coherence and the action of simple reflections on positive roots (1),(2)

[F5]

Carter's formula gives ℓT(w)=dim⁡M(w); u≤Tv iff ℓT(v)=ℓT(u)+ℓT(u−1v); u≤Tv implies M(u)⊆M(v); if u,v≤Tc, then u≤Tv iff M(u)⊆M(v); and ℓT is invariant under conjugation and satisfies the triangle inequality. Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)-(3)

[F6]

On the positive-definite space (V,B), M(A)=F(A)⊥ for orthogonal A. For U⊆M(A) there is a unique orthogonal restriction AU≤OA with moved space U, and every line L is the moved space of the unique orthogonal reflection id−2ΠL. For group elements, orthogonal order and reflection order agree by Carter's formula. The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order (1),(3)-(5) Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1),(2)

[F7]

In a reduced reflection factorization w=t1⋯tm, the prefix-conjugated root normals form a basis of M(w). Root normals inside the moved space, factorizations into reflections, and independent normals (3)

[F8]

Every nonidentity w has a reduced reflection factorization of length dim⁡M(w); the factorization lemma also supplies a root normal in M(w) for its induction step. Root normals inside the moved space, factorizations into reflections, and independent normals (1)-(3)

[F10]

For every nonzero point x∈gCI, its stabilizer is gWIg−1. In a finite Coxeter system the chambers are translates of the simplicial fundamental chamber, whose inward unit normals are its simple roots. The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1)-(3)

[F11]

For a canonical rank-two system with finite exponent m≥2, the simple-root Gram entry is −cos⁡(π/m) and the product of its two reflections is a rotation of exact order m, through an angle of magnitude 2π/m. Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)

[F12]

No finite family of proper linear subspaces of a finite-dimensional real vector space covers the whole space. A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces

[F13]

For a reduced simple-generator expression w=s1⋯sm, every prefix-conjugated normal ρ(s1⋯si−1)esi is a positive root. The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (2)

[F14]

(WI,I) is the Coxeter system of the restricted matrix, with intrinsic length equal to ambient length; every element of WI has a reduced expression using only letters of I. If t∈T and ℓ(tw)<ℓ(w), strong exchange expresses t as a prefix-conjugate of one letter of any reduced expression of w. Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)-(2) The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (3)

Proof

technique · direct
1.1F1F2F3F5algebra

For every i≥1, [F2] gives (C−id)μi=−2ρi. Since C is an isometry and B(ρi,ρi)=1, B(μi,ρi)=1 follows by expanding B(Cμi,Cμi)=B(μi−2ρi,μi−2ρi). The same identity gives Cμi=μi−2ρi, so rρiCμi=μi and μi∈F(rρiC). For 1≤i≤n, the reflection word rρiC cancels to R1⋯Ri−1Ri+1⋯Rn, so its reflection length is at most n−1; the triangle inequality and ℓT(c)=n give the lower bound n−1. Thus its fixed space is one-dimensional. Since rρi+nC=C(rρiC)C−1, the same dimension holds for all i. The vector μi is nonzero because μi⋅ρi=1, and it is the unique vector in that line with this pairing. This proves (1).

1.2F1F2algebra

For all i,j≥1, μi⋅ρj=−μj+n⋅ρi. Indeed, ρi=12(μi−Cμi) by [F2], so −μj+n⋅ρi=−Cμj⋅12(μi−Cμi)=12(μj−Cμj)⋅μi=ρj⋅μi, using the isometry of C and [F1]-[F2]. This is (2)(a).

1.3F1F2F4algebra

Suppose 1≤i≤j≤nh/2. If i>n, then j>n and C-equivariance gives μi⋅ρj=μi−n⋅ρj−n. Repeating reduces to a first index at most n while keeping both indices positive and ordered. For i≤n, μi=βi, and βi⋅ρj is the coefficient of αi in the positive root ρj; this is nonnegative by [F4]. Thus (2)(b) holds.

1.4F1F3F5F6

Every reflection lies below c. Indeed, M(c)=V by [F1]. For a positive root α, the orthogonal reflection with moved line Rα is uniquely rα=ρ(tα) by [F3],[F6]; the Wall restriction for this line is below C=ρ(c) and has moved space Rα. The Wall dimension identity and Carter's formula therefore give tα≤Tc.

1.5F3F5algebra

We use two elementary consequences of absolute order. First, if w=r1⋯rm is a reduced reflection factorization and p<q, then rprq≤Tw: distinct root-reflections have product moved space the two-plane spanned by their distinct normal lines, so their product has reflection length 2 by Carter's formula. Write w=xrpyrqz; then (rprq)−1w=rqrpxrpyrqz=(rq(rpxrp)yrq)z, a product of m−2 reflections because conjugation preserves reflections. The triangle inequality forces this complement to have length m−2. Second, if u≤Tv≤Tw, then v−1w≤Tu−1w: write v=ux, w=vy with additive reflection lengths; then u−1w=xy, while y−1xy has the same length as x, so y≤Txy. These facts will be used below.

1.6F3F5F9F10F12

Put E=M(σ) and F=E⊥. Then Wσ={w:M(w)⊆E} is the pointwise stabilizer of F, because M(w)=F(w)⊥. If F≠0, choose x∈F outside {0} and every proper subspace F∩Hα; this is possible by [F9] and [F12]. By [F10], Stab⁡W(x)=gWIg−1 for some g,I. Each conjugate simple generator has a root hyperplane containing x, hence, by the choice of x, containing all of F; therefore every generator of this stabilizer fixes F pointwise. Conversely every element fixing F fixes x, so Wσ=gWIg−1. If F=0, take g=1 and I=S.

2.1F1F2F4step 1.3algebra

To prove (2)(c), first reduce i modulo n using C-equivariance, which preserves μi+t⋅ρi, and assume 1≤i≤n. If i+t≤n, then μi+t=βi+t and ρi=R1⋯Ri−1αi has no αi+t coefficient, so the pairing is zero. If i+t>n, put j=i+t−n, so 1≤j<i. By (2)(a), μi+t⋅ρi=μj+n⋅ρi=−μi⋅ρj=−βi⋅ρj=0, since ρj is supported on α1,…,αj. Now if 1≤i<j≤nh/2 and j<i+n, (2)(d) is (2)(c) with t=j−i; if j≥i+n, (2)(a) and (2)(b) give μj⋅ρi=−μi+n⋅ρj≤0. This proves (2)(c)-(d).

2.2F3F5F7F8step 1.4

For every σ≤Tc, one has Pσ=Φ+∩M(σ). If α∈Pσ, then M(tα)=Rα⊆M(σ) by [F5]. Conversely, if α∈Φ+∩M(σ), then tα≤Tc by step 1.4 and σ≤Tc, so moved-space rigidity in [F5] gives tα≤Tσ. Also Pσ spans M(σ): choose a reduced reflection factorization of σ; its prefix-conjugated normals are a basis of M(σ) by [F7], and the reflections with those normals have moved lines in M(σ), hence lie below σ by the same common-upper-bound argument. Taking the positive sign of each normal puts a spanning set in Pσ.

2.3F1F2F3F5F6step 1.1step 1.4step 1.5algebra

For any increasing tuple a1<⋯<am of positive roots, one has ℓT(R(a1)⋯R(am)c)=n−m if and only if μ(ai)⋅aj=0 for all i>j. If m=0, the left side is ℓT(c)=n by [F1], and the zero-pairing condition is vacuous; hence assume m≥1. Put ri=R(ai). The length equality is equivalent to the reverse product q=rm⋯r1 being a reduced element below c: its complement is q−1c=r1⋯rmc. In fact, if ℓT(q−1c)=n−m, then ℓT(q)≤m and n=ℓT(c)≤ℓT(q)+ℓT(q−1c)≤n, so both inequalities are equalities; the converse is the defining absolute-order equality. For the forward implication, the pair-product fact in step 1.5 gives rirj≤Tc whenever i>j. Since ℓT(ric)=n−1, this gives rj≤Tric from ℓT(rjric)=n−2; hence M(rj)⊆M(ric)=F(ric)⊥. The vector μ(ai) is a nonzero member of the one-dimensional fixed space F(ric), so μ(ai)⋅aj=0. Conversely, suppose all these pairings vanish. The matrix [μ(ai)⋅aj] is upper triangular with diagonal 1 by (1), so both the ai and the μ(ai) are linearly independent; in particular m≤n. Induct downward on i to prove qi:=rm⋯ri≤Tc with length m−i+1. The base qm=rm is step 1.4. If qi+1≤Tc, then each factor rj with j>i satisfies rj≤Tqi+1: writing a reduced factorization qi+1=xrjy, the product rjqi+1=(rjxrj)y uses one fewer reflections, and the triangle inequality makes that expression reduced. Put v=qi+1−1c. Complement order reversal from step 1.5 gives v≤Trjc, so μ(aj)∈F(rjc)⊆F(v) for every j>i. These m−i independent vectors form a basis of F(v), whose dimension is m−i by Carter's formula. The assumed zero pairings give ai∈F(v)⊥=M(v). The Wall restriction for the line Rai gives ri≤Tv; writing v=riz then gives c=qi+1riz, with lengths adding, so qi=qi+1ri≤Tc and ℓT(qi)=m−i+1. At i=1 this proves the claimed equivalence. The same argument applies to every subtuple because the vanishing conditions are inherited.

3.1step 1.1step 2.1algebra

If ρk=∑r=1marρir with ar≥0 and i1<⋯<im<k, then (2)(d) gives μk⋅ρir≤0 for every r, so 1=μk⋅ρk=∑rar(μk⋅ρir)≤0, a contradiction. This proves (3).

3.2F3F14step 2.2step 1.6

Let ΦI={ρ(u)αs:u∈WI,s∈I} be the intrinsic root system from [F14]; its representation is the restriction to VI=span⁡{αs:s∈I}, since the reflection formulas agree. An ambient reflection t∈T∩WI has a reduced I-expression by [F14]. Apply strong exchange to tt=1: it expresses t as a prefix-conjugate of a letter of that expression, so its root normal belongs to ±ΦI by [F3]. Conversely every intrinsic root gives an ambient reflection in WI. Conjugating by g, the root-reflection dictionary therefore identifies the roots of gWIg−1 with precisely the ambient roots whose reflections fix F pointwise, namely Φ∩E=±Pσ by step 2.2. Their span is both ρ(g)VI and E, since Pσ spans E.

4.1F3F4F10F14step 3.2

Choose f∈C∘ and project it orthogonally to E. Its pairing with every root of Pσ is positive by [F4], so it avoids the subsystem arrangement. Apply [F10] to the finite Coxeter system (WI,I) and transfer its chambers to E by ρ(g). The chamber containing the projection has inward unit normals Δ={ρ(gu)αs:s∈I} for some u∈WI. These are a basis of E, their reflections are the conjugates of the simple generators of WI, and their Gram matrix is the restricted Coxeter Gram matrix. In particular distinct normals have nonpositive pairings. By the root-sign theorem [F4] applied to this conjugate Coxeter system, its positive roots are exactly the roots positive on the projection, hence Pσ, and every such root is a nonnegative combination of Δ. This supplies the simple system and the Coxeter presentation used below.

4.2F1step 1.1step 2.1step 3.1algebra

In any such positive root subsystem with simple system Γ, its first root in the global order is a member of Γ. For if the first root η were not simple, write η=∑γ∈Γbγγ with bγ≥0; each γ is later than η, so (2)(d) gives μ(γ)⋅η≤0. Linearity of μ and (1) would give 1=μ(η)⋅η=∑bγ(μ(γ)⋅η)≤0, impossible. Also the last root of Pσ belongs to Δ: otherwise it is a nonnegative combination of the earlier simple roots, contrary to step 3.1.

5.1F5step 1.4step 1.6step 4.1step 4.2

We prove the recursive selection and the factorization σ=R(δ1)⋯R(δk) by induction on k. For k=1, Wσ has rank one, Pσ has its single positive root δ1, and σ=R(δ1). For k>1, order the simple roots increasingly; step 4.2 makes the last one δk=τt. Put r=R(δk). Since r≤Tσ, write σ=ru with ℓT(u)=k−1; then σ′:=σr=rur has length k−1. Write c=σv with ℓT(v)=n−k. The identity c=σ′(rv) and the bounds ℓT(rv)≤n−k+1 and n=ℓT(c)≤ℓT(σ′)+ℓT(rv) force ℓT(rv)=n−k+1, so σ′≤Tc. Also σ′ fixes F pointwise, hence M(σ′)⊆E.

6.1F1F2F4F5step 1.1step 1.3step 2.2step 5.1algebra

Let q be the global index with δk=ρq and put ν=Cμq=μq+n. For every ρj∈Pσ one has j≤q and, by (2)(a) and C-equivariance, ν⋅ρj=μq+n⋅ρj=−μj+n⋅ρq+n=−μj⋅ρq≤0 by (2)(b); at j=q this is −1. Since μq∈F(rc), conjugating by C gives ν∈F(cr); and ℓT(cr)=n−1, so F(cr)=Rν and M(cr)=ν⊥. Moreover σ′≤Tcr: its complement is σ′−1cr=rvr, of length n−k, while ℓT(cr)=n−1; the lengths add to n−1. Hence U:=M(σ′) is contained in E∩ν⊥, and both have dimension k−1 because ν⋅δk=−1. Thus U=E∩ν⊥. The roots Pσ′=Φ+∩U span U by step 2.2. Each is a nonnegative combination of Δ and is orthogonal to ν; since ν⋅δk=−1 and ν⋅δj≤0 for every j, every root in Pσ′ is a combination only of the δj for which ν⋅δj=0. Those zero-pairing simple roots must span the (k−1)-space U, so they are exactly δ1,…,δk−1. They form a simple system for Pσ′. Induction gives σ′=R(δ1)⋯R(δk−1) and proves the reverse selection at each rank. Therefore σ=R(δ1)⋯R(δk). For each i, its prefix pi:=R(δ1)⋯R(δi) and complementary suffix R(δi+1)⋯R(δk) multiply to σ and have at most i and k−i reflections, so both lengths attain these bounds. Thus M(pi), contained in span⁡(δ1,…,δi), has dimension i and equals that span. Since σR(δk)⋯R(δi+1)=pi, the induction shows that δi is the last root of Pσ in this subspace.

7.1F5step 4.2step 6.1algebra

The other recursive description follows by considering the suffix qi:=R(δi)⋯R(δk). The factorization in step 6.1 gives ℓT(qi)=k−i+1: its prefix and suffix factors together multiply to σ of length k, and their lengths are bounded by their numbers of reflections, whose sum is k. Writing pi:=R(δ1)⋯R(δi−1), the same length equality forces ℓT(pi)=i−1, so qi−1σ=qi−1piqi has length i−1 and qi≤Tσ. If c=σv as above, then qi−1c=qi−1(R(δ1)⋯R(δi−1))qiv has length at most (i−1)+(n−k)=n−ℓT(qi); the triangle inequality forces equality, so qi≤Tc. Its moved space is span⁡(δi,…,δk), since its factors fix the orthogonal complement of that span and its moved dimension is k−i+1. Thus Pqi=Pσ∩M(qi), and {δi,…,δk} is a simple system for this subsystem: a root in the tail span has zero coefficients on δ1,…,δi−1 in its nonnegative Δ-expansion. By step 4.2 the first root of Pqi is a simple root of this tail system; its first simple root is δi. Finally R(δi−1)⋯R(δ1)σ=qi by cancellation, so δi is the first root of Pσ in the moved space in (4)(i), and δ1=τ1. This proves (4)(i).

7.2F3F5F13step 4.1step 6.1algebra

Put Di:=R(δ1)⋯R(δi−1) and εi:=Diδi. The prefix R(δ1)⋯R(δi) has reflection length i by the factorization of σ and the triangle inequality, so this simple-generator word in the Coxeter system of Wσ is reduced. The root-inversion formula [F13], applied to that parabolic system, gives εi∈Pσ, hence it is a positive root. Conjugation gives R(εi)=DiR(δi)Di−1; multiplying these identities and cancelling adjacent inverse prefixes yields σ=R(εk)⋯R(ε1). Also R(εi)DiR(δi+1)⋯R(δk)=DiR(δi)R(δi+1)⋯R(δk)=σ. This proves (4)(ii).

8.1F3F5F11step 2.2step 3.1step 4.1step 6.1step 7.1algebra

Suppose ℓT(σ)=2 and Pσ={τ1<⋯<τt}. By (4)(i), Δ={τ1,τt} and σ=R(τ1)R(τt). Step 4.1 realizes this as a canonical rank-two system. If its exponent is m, [F11] gives simple-root angle π−π/m and a rotation of magnitude 2π/m. Write its generators as r,s and q=rs. The identities rqr=q−1 and s=rq reduce every word to qj or qjr, 0≤j<m; their distinct actions are the m rotations and m reflections in lines spaced by π/m. Every reflection is a conjugate of r or s: the conjugates give respectively q2jr and q2j−1r. The root-reflection dictionary thus gives t=m positive roots, equally spaced between the simple-root rays. The global order agrees with angular order: a decrease after τr would put τr+1 in the cone on earlier roots τ1,τr, contrary to step 3.1. A product of reflections has rotation angle twice the difference of its normal angles, modulo 2π; hence the two-reflection factorizations of σ are exactly R(τ1)R(τt)=R(τ2)R(τ1)=⋯=R(τt)R(τt−1). These exhaust factorizations in W: if σ=R(α)R(β), then M(σ)⊆span⁡(α,β), and both spaces have dimension 2, so the positive representatives of α,β lie in Pσ by step 2.2. The endpoint angle gives τ1⋅τt=−cos⁡(π/t)≤0, while each adjacent angle gives τi⋅τi+1=cos⁡(π/t)≥0.

8.2F2F3F5step 1.1step 7.2algebra

Fix i. The second factorization in (4)(ii) writes σ=R(εi)qi′ where qi′ is the product of the other k−1 simple reflections in Δ. Thus ℓT(qi′)=k−1, R(εi)≤Tσ, and qi′=R(εi)σ. Since c=σv with ℓT(v)=n−k, R(εi)c=qi′v is reduced, so qi′≤TR(εi)c. It follows that μ(εi)∈F(qi′). The moved space M(qi′) is exactly span⁡{δj:j≠i}: it is contained there because those are its reflection normals, and both dimensions are k−1. Hence μ(εi)⋅δj=0 for j≠i. Since εi−δi is a linear combination of δ1,…,δi−1, (1) gives 1=μ(εi)⋅εi=μ(εi)⋅δi. Thus the restrictions to E of the functionals B(μ(εi),−) form the dual basis to Δ. For x=∑jajδj with aj≥0, μ(εi)⋅x=ai; intersecting the cone with this zero hyperplane and with the unit sphere proves the wall equality, and the supporting hyperplane in E is E∩μ(εi)⊥. This proves (4)(iii).

9.1F3F5step 8.1

If distinct positive roots ρi,ρj satisfy R(ρi)R(ρj)≤Tc, their product has reflection length 2 and belongs to the rank-two case of step 8.1. Both roots lie in the corresponding Pσ by moved-space rigidity. If i<j, the only increasing-order two-factorization in step 8.1 is the endpoint factorization, so ρi⋅ρj≤0. If i>j, the factorization is one of the adjacent descending pairs, so ρi⋅ρj≥0. This proves (4)(v).

10.1F3step 4.1step 7.2step 1.5step 9.1algebra

If i<j and εi>εj, the factorization σ=R(εk)⋯R(ε1) is reduced, and the pair-product fact of step 1.5 gives R(εj)R(εi)≤Tσ≤Tc. The rank-two sign result of step 9.1 gives εi⋅εj≤0. On the other hand, since distinct simple roots have nonpositive pairings by step 4.1, applying R(δj−1),…,R(δi+1) successively to δj yields a nonnegative combination of δi+1,…,δj, and εi⋅εj=−δi⋅(R(δi+1)⋯R(δj−1)δj)≥0. Thus the pairing is zero, and the two reflections commute. Sorting the εi into global order uses only swaps of such inverted commuting pairs, so the product is unchanged and σ=R(θk)⋯R(θ1).

11.1F4F5step 8.2step 2.3step 2.1step 10.1∎

The tuple θ1<⋯<θk has reverse product σ≤Tc of length k, so it is among the tuples in (4)(iv). Let η1<⋯<ηk be any other such tuple. By step 2.3 every prefix η1<⋯<ηr also has reverse product below c of length r, so its r roots are linearly independent. For each s≥r, every root τ∈Pσ with τ<θr has μ(θs)⋅τ=0: its pairing is nonnegative because τ is a nonnegative combination of Δ and the restricted pairing functionals B(μ(εi),−)∣E are dual to Δ by step 8.2, while it is nonpositive by (2)(d). The restrictions to E of the k−r+1 functionals μ(θr),…,μ(θk) are independent, again by the dual-basis property. Their common kernel in E therefore has dimension r−1. If ηr<θr, the r independent roots η1,…,ηr all lie in that kernel, a contradiction. Hence ηr≥θr for every r, which proves componentwise domination (4)(vi) and the lexicographic minimality in (4)(iv). No Choice is used.

Depends on

Used by

Dependency tree · two levels

126 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