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 Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id

Statement

Let (W,S) be an irreducible finite-type Coxeter system with ∣S∣=n≥2, with bipartition J⊔K=S and data α1,…,αn, s1,…,sn, a,b,c=ab, h=ord⁡(c), βi,ρi,μi and conditional map μ as in The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a. Put r:=∣J∣, so J={s1,…,sr} and K={sr+1,…,sn}. Let CV:=ρ(c)∈GL(V) denote the linear action of c, let C be the primal chamber in V and C∘ its interior, and let Hα={x∈V:B(x,α)=0} be the root hyperplanes (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset). Write w0 for the longest element (The longest element as the opposition of the chamber, and longest elements of finite parabolics). Then:

(1) The Coxeter-plane eigenvector. The matrix A=(2(δst−B(es,et)))s,t∈S has nonnegative entries, zero diagonal, and connected nonzero off-diagonal pattern. There are p∈R>0S and λ∈(0,2) with Ap=λp, and λ=2cos⁡(π/h).

(2) The invariant plane and chamber sector. Put u:=∑s∈Jpsαs, v:=∑t∈Kptαt, d:=∑s∈Jps2 and P:=span(u,v). Then d>0, B(u,u)=B(v,v)=d, B(u,v)=−λd/2, the plane P is invariant under ρ(a), ρ(b) and CV, and

ρ(a)u=−u,ρ(a)v=v+λu,ρ(b)v=−v,ρ(b)u=u+λv.

Thus CV∣P is a rotation through 2θ, where θ:=arccos⁡(λ/2)=π/h. The intersection C∩P is a sector of angle θ whose relative interior lies in C∘; it contains a point with trivial W-stabiliser. The restrictions of ρ(a) and ρ(b) generate a dihedral group of order 2h on P. Its 2h translates of C∩P are exactly the full-dimensional chamber sections wC∩P: they are the sectors cut out by the h root-hyperplane traces, with pairwise disjoint relative interiors. The set of traces {Hα∩P:α∈Φ} is exactly the set of h reflection lines of this dihedral action.

(3) Enumeration of the roots. Every ρi is a root, ρi+n=CVρi for all i≥1, and

Φ+={ρ1,…,ρnh/2},Φ−=−Φ+={ρnh/2+1,…,ρnh},

with all nh listed roots pairwise distinct; hence the sequence has exact period nh. Moreover ∣Φ+∣=∣T∣=nh/2=ℓ(w0). If h is even then w0=ch/2. If h is odd then n is even, r=∣J∣=∣K∣=n/2, and w0=c(h−1)/2a. Accordingly, the word

(s1⋯sn)h/2or(s1⋯sn)(h−1)/2s1⋯sr

is a reduced expression of w0 of length nh/2, with prefix roots exactly ρ1,…,ρnh/2 in this order.

(4) Invertibility of the linear action minus the identity. The operator CV−idV is invertible. Consequently the conditional map from the preceding definition is defined on all of V and satisfies μ(ρi)=μi for every i≥1.

For n=1 the conclusions are direct: Φ+={α1}={ρ1}, c=s1 and h=2. Reducible systems are handled componentwise using the preceding definition's clause (5), and no uniform nh/2 count is asserted for unequal component Coxeter numbers. No Choice is used.

Facts & Assumptions

Given: An irreducible finite-type Coxeter system (W,S) with ∣S∣=n≥2, the bipartite data αi,si,Ri,a,b,c,h,βi,ρi,μi of The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a, the operator CV=ρ(c), the positive definite space (V,B) with root system Φ=Φ+⊔Φ− and reflection set T, and the transferred primal chamber C and root hyperplanes Hα.

[F1]

The defining data have Γ connected, J={s1,…,sr}, K={sr+1,…,sn}, pairwise orthogonal simple roots within each class, and ρi+n=CVρi, μi+n=CVμi for every i≥1. The vectors βi satisfy B(βi,αj)=δij. The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (1)-(3)

[F2]

B is positive definite, ρ is faithful and preserves B, and every root satisfies B(α,α)=1; for each s, Rs=ρ(s) is the reflection x↦x−2B(x,αs)αs. Finiteness criterion: W is finite exactly when the Coxeter form is positive definite, Descent of the reflection representation, unit root norms, and conjugation of reflections (1)-(3), The root-length criterion and faithfulness of the canonical reflection representation (3)

[F3]

The roots split as Φ=Φ+⊔Φ− with Φ−=−Φ+ and Φ+ consists exactly of the roots with nonnegative simple-root coordinates; each Rs sends αs to −αs and permutes Φ+∖{αs}. Root sign coherence and the action of simple reflections on positive roots (1)-(3)

[F4]

The transferred chamber is C={x∈V:B(x,αs)≥0 ∀s} with interior defined by strict inequalities; the chambers wC tile V with disjoint interiors, and a point in wCI has stabiliser wWIw−1. In particular a point of C∘ has trivial stabiliser, and a point in the relative interior of CJ has stabiliser WJ. The interior of every chamber is disjoint from every root hyperplane, and Hρ(w)α=ρ(w)Hα. The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset, The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1),(3)

[F5]

For every w∈W and s∈S, ℓ(ws)>ℓ(w) if and only if ρ(w)αs∈Φ+. The root-length criterion and faithfulness of the canonical reflection representation (1)

[F6]

The longest element satisfies ρ(w0)Φ+=Φ−, ℓ(w0)=∣Φ+∣=∣T∣, w02=1, and it is the unique element of length ℓ(w0). The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(ii)-(iv)

[F7]

The map Φ+→T, α↦tα, is a bijection, ρ(tα)=rα, and tα=tβ exactly when α=±β. Thus root hyperplanes are in bijection with T. The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)(i)-(iv)

[F8]

The coordinate norm ∥⋅∥0 and inner product ⟨⋅,⋅⟩0 are the standard Euclidean ones on RS. For n≥1 the coordinate unit sphere is nonempty (it contains each simple basis vector αs) and compact. The identity map is continuous, and a linear map L is continuous because ∥Lx−Ly∥0≤K∥x−y∥0 for some K≥0. The inner product of continuous vector-valued maps is continuous, so q(x)=⟨x,Ax⟩0 is continuous; every continuous real-valued function on a nonempty compact subset of Rn attains a maximum. The real Coxeter form, its radical, reflections, and form-preserving maps, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0, A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions (3), For n≥1, every Euclidean closed ball and every Euclidean sphere of positive radius is compact, For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent (4)

[F9]

For a reducible diagram with components Si, W is the direct product of the WSi and V is their orthogonal direct sum; the root, reflection and bipartite constructions are componentwise. Disconnected diagrams, direct products, and comparison of invariant forms, Coxeter diagrams: edges, labels, components and finite type

Proof

technique · maximize the nonnegative adjacency quadratic form, build the invariant plane, and use the chamber tiling to determine its angle and the roots crossing its walls
1.1F1F2algebra

Write ∥x∥02:=∑s∈Sxs2 for the standard coordinate norm and set q(x):=xTAx. If m(s,t)=∞ for distinct s,t, then B(es+et,es+et)=0, contradicting positive definiteness; hence every off-diagonal Coxeter exponent is finite. Therefore Ass=0 and Ast=−2B(es,et)=2cos⁡(π/m(s,t))≥0 for s≠t, with Ast>0 exactly on the edges of the connected diagram. Also q(x)=2∥x∥02−2B(x,x)<2∥x∥02 for every nonzero x.

1.2F1F2algebra

For 1≤i≤n, the first n prefix vectors satisfy ρi=αi for i≤r and ρi=ρ(a)αi=αi+∑s∈JAsiαs for i>r: the earlier reflections in the same color class fix αi, while each reflection in the other class adds its Asiαs and fixes the other roots of that class. Hence the coordinate matrix of (ρ1,…,ρn) relative to the ordered basis (α1,…,αn) is block upper triangular with identity diagonal blocks, so these vectors form a basis. The cyclic definitions give ρi+n=CVρi and μi+n=CVμi for every i≥1, because each block of n reflections has product c. Each ρi is a root, being the image of a simple root by an element of W.

2.1F2F8step 1.1algebra

The unit sphere for ∥⋅∥0 is compact, so q attains a maximum λ there; normalizing es+et for an edge {s,t} gives a positive value of q, so λ>0, and step 1.1 at a maximizer gives λ<2. Let p be a unit maximizer. For y with ⟨p,y⟩0=0, maximality at (p+ty)/(1+t2∥y∥02)1/2 gives 2t⟨Ap,y⟩0+t2(q(y)−λ∥y∥02)≤0 for every real t. If ⟨Ap,y⟩0≠0, a sufficiently small t of the same sign makes the linear term dominate the quadratic term, a contradiction. Thus Ap is orthogonal to every y⊥p, so it is a multiple of p; pairing with p gives Ap=λp.

2.2F1F2step 1.2algebra

For 1≤i≤n, duality gives B(βi,αj)=0 for every j≠i, so Rjβi=βi for every j≠i and in particular μi=R1⋯Ri−1βi=βi. Also Riβi=βi−2αi. Thus CVβi=R1⋯Rnβi=R1⋯Ri−1(βi−2αi)=μi−2ρi=βi−2ρi, so (CV−idV)βi=−2ρi.

3.1F1step 2.1algebra

Since every entry of A is nonnegative, q(∣p∣)≥q(p)=λ, while ∥∣p∣∥0=1, so ∣p∣ is also a maximizer and satisfies A∣p∣=λ∣p∣ by step 2.1. Put r:=∣p∣. If rs>0 and Ast>0, then λrt=∑uAturu≥Atsrs>0; since λ>0 and the edge graph of A is connected, positivity propagates to every coordinate. Thus we may take p∈R>0S, proving the existence claim in (1).

3.2F1step 1.2step 2.2algebra

The vectors β1,…,βn form a basis by the construction in the preceding definition, and ρ1,…,ρn form a basis by 1.2; thus 2.2 shows that CV−idV maps one basis to the other up to the nonzero scalar −2, so it is invertible. If i=mn+j with m≥0 and 1≤j≤n, then the cyclic recursions in F1 and the identity in 2.2 give (CV−idV)μi=CVm(CV−idV)μj=−2CVmρj=−2ρi. Applying the conditional map of the preceding definition now yields μ(ρi)=μi for all i≥1, proving (4) and the definition's well-definedness justification.

4.1F1F2step 3.1algebra

Put d′:=∑t∈Kpt2. Since distinct simple roots in either color class are orthogonal, B(u,u)=d and B(v,v)=d′. Multiplying the eigenvector equations ∑t∈KAstpt=λps by ps and summing over s∈J gives ∑s∈J,t∈KpsAstpt=λd; summing the equations indexed by K gives the same left side equal to λd′, hence d=d′>0. Finally B(u,v)=−12∑s∈J,t∈KpsAstpt=−λd/2. The Gram matrix on (u,v) is d(1−λ/2−λ/21) with determinant d2(1−λ2/4)>0, so u,v are independent and P is a plane.

5.1F1F2step 4.1algebra

For s∈J, Rs fixes αs′ for s′∈J∖{s} and negates αs; the corresponding statement holds in K. For t∈K, the commuting reflections in a give ρ(a)αt=αt+∑s∈JAstαs, and for s∈J, ρ(b)αs=αs+∑t∈KAtsαt. Summing with coefficients pt and ps and using Ap=λp yields ρ(a)u=−u, ρ(a)v=v+λu, ρ(b)v=−v, and ρ(b)u=u+λv. Thus P is invariant under ρ(a),ρ(b) and CV=ρ(a)ρ(b).

6.1F2step 5.1algebra

In the basis (u,v), ρ(a)=(−1λ01), ρ(b)=(10λ−1), and CV∣P=(λ2−1−λλ−1). The vectors f1:=u/d and f2:=(v+λ2u)/d(1−λ2/4) are B-orthonormal, and direct substitution gives CVf1=(λ2/2−1)f1+λ1−λ2/4 f2. With θ:=arccos⁡(λ/2)∈(0,π/2) these coefficients are cos⁡(2θ) and sin⁡(2θ); since CV preserves B and has determinant 1 on P, it is the rotation through 2θ.

7.1F1F2step 4.1step 5.1step 6.1algebra

For x=ξu+ηv∈P, one has B(x,αs)=ps(ξ−λ2η) for s∈J and B(x,αt)=pt(η−λ2ξ) for t∈K. Thus C∩P is given by ξ≥λ2η and η≥λ2ξ; because 0<λ/2<1, these inequalities imply ξ,η≥0, and their strict versions place the relative interior in C∘. Its boundary rays are xJ:=λu+2v (the J simple-root hyperplanes) and xK:=2u+λv (the K simple-root hyperplanes). Their squared B-norms are both d(4−λ2) and B(xJ,xK)=λd(2−λ2/2), so the sector angle has cosine λ/2 and equals θ. The restrictions of ρ(a) and ρ(b) are reflections in the lines RxJ and RxK: they fix those lines, are involutions, and are nonidentity on P by 4.1.

8.1F1F2F4step 6.1step 7.1algebra

Let m0 be the order of CV∣P. Since it rotates through 2θ∈(0,π), m0≥3 and 2θ=2πj/m0 for an integer j with 1≤j<m0/2 and gcd⁡(j,m0)=1. The subgroup D:=⟨ρ(a)∣P,ρ(b)∣P⟩ consists of the m0 distinct rotations (CV∣P)k and the m0 distinct reflections ρ(a)∣P(CV∣P)k, so ∣D∣=2m0. Distinct elements of D have lifts g~∈⟨a,b⟩ with distinct restrictions to P, hence are distinct elements of W; by F4 their chamber interiors are distinct and disjoint. Thus the orbit of S0:=C∩P consists of 2m0 distinct sectors of angle θ, each of the form ρ(g~)C∩P, with pairwise disjoint relative interiors. Hence 2m0θ≤2π, so j=1 and θ=π/m0; equality shows the sectors cover P. As m0∣h by F1, the element cm0 fixes every point of P, in particular a point of C∘∩P; its stabiliser is trivial, so cm0=1 and h∣m0. Thus m0=h and λ=2cos⁡(π/h), completing (1) and the angle claims of (2).

9.1F2F4step 7.1step 8.1algebra

For every root α, the trace Hα∩P is a line: if P⊆Hα, the nonidentity reflection tα fixes a point of C∘∩P, contradicting its trivial stabiliser; otherwise the nonzero linear functional x↦B(x,α) restricts to a nonzero functional on the two-plane P, whose kernel is a line. Each such line is a root-hyperplane trace and cannot meet the relative interior of any sector ρ(g~)S0, because that relative interior lies in the chamber interior ρ(g~)C∘, which is disjoint from the arrangement. Conversely the two boundary lines of S0 are traces of simple-root hyperplanes by 7.1, and their images under D are root-hyperplane traces because ρ(W) permutes roots. These images are all the sector boundary lines: the 2h sectors from 8.1 tile P and have 2h distinct boundary rays, while every root trace must be one of those lines because it cannot meet a sector interior. Opposite rays define the same line, so the traces are exactly h distinct lines. The connected components of the complement of these lines are the sector interiors. Each component is connected and the ambient chamber interiors form a disjoint open cover of it, so it lies in one chamber interior. Conversely, if a full-dimensional chamber section contained points from two components, choose them in its relative interior; their segment lies in that relative interior by convexity and crosses a root trace, contradicting disjointness of chamber interiors from the arrangement. Hence the full-dimensional chamber sections are exactly the 2h sectors.

10.1F1F2F4F7step 6.1step 7.1step 8.1step 9.1algebra

The ray R>0xJ lies in the relative interior of the face CJ, so its stabiliser is WJ; similarly the stabiliser of R>0xK is WK. Every element of WJ reduces to a product of a subset I⊆J because its simple generators are commuting involutions; the subset products are distinct because their ρ-images have different signs on the independent simple roots and ρ is faithful by [F2]. The image of the product for I acts by −1 on span⁡{αs:s∈I} and by +1 on its B-orthogonal complement, so its (−1)-eigenspace has dimension ∣I∣; therefore it is a reflection exactly when ∣I∣=1, and the reflections in WJ are precisely its ∣J∣=r simple generators. The same reasoning gives exactly ∣K∣=n−r reflections in WK. The 2h distinct boundary rays from 8.1 alternate between the two types, so there are h of each; conjugating the stabiliser count around them gives hr+h(n−r)=hn incidences between rays and ambient root hyperplanes. Each hyperplane contributes exactly two incidences because its trace is a line. Hence the arrangement has hn/2 hyperplanes, so ∣T∣=hn/2 by the root-reflection correspondence of [F7].

11.1step 9.1step 10.1algebra

If h is odd, a semicircle from a point of C∘∩P to its antipode crosses each trace line once; since every root-hyperplane trace is one of these lines, it meets each ambient root hyperplane exactly once. The boundary-ray types alternate, so one type occurs (h+1)/2 times and the other (h−1)/2 times. Counting the hyperplanes met using 10.1 gives hn/2=((h+1)/2)r+((h−1)/2)(n−r) if the more frequent rays have type J, and the same equation with r and n−r interchanged if they have type K. Either equation gives r=n/2. Thus n is even and ∣J∣=∣K∣=n/2.

12.1F1step 9.1step 10.1step 11.1algebra

Choose the direction around the circle so that the first boundary ray of S0 is xJ. The rays then occur in the cyclic order p2k=CVkR>0xJ and p2k+1=CVkρ(a)R>0xK for k=0,…,h−1: ρ(a) reflects across the J boundary, while CV advances by two sector angles. The hyperplanes through p2k are exactly HCVkαs for s=s1,…,sr, and those through p2k+1 are exactly HCVkρ(a)αt for t=sr+1,…,sn, by the stabiliser counts and the description of the reflections in WJ,WK from 10.1. These are precisely the blocks Hρkn+1,…,Hρkn+r and Hρkn+r+1,…,Hρ(k+1)n by the cyclic prefix definition in 1.2. The first h rays carry hn/2 hyperplanes: this is hn/2 from h/2 complete color pairs when h is even, and n(h−1)/2+r=hn/2 when h is odd by 11.1. The opposite semicircle carries the other hn/2 hyperplanes. Each half-turn list is pairwise distinct because every trace line meets that semicircle only once, and the listed hyperplanes in each boundary block are distinct simple-root images.

13.1F3step 1.2step 12.1algebra

Fix k≤hn/2. The first half-turn list of hyperplanes in 12.1 is pairwise distinct, so ρk≠±ρj for every j<k. For 1≤j≤k, put yj:=Rj−1⋯R1ρk, with y1=ρk and yk=αk; for j<k, yj≠±αj, since otherwise applying R1⋯Rj−1 would give ρk=±ρj. Each Rj preserves the sign of every root other than ±αj by [F3], so yj and yj+1=Rjyj have the same sign. Since yk=αk∈Φ+, descending induction gives ρk∈Φ+ for every k≤hn/2.

14.1F5F6step 11.1step 13.1algebra

Let q:=hn/2. The word w=ch/2 for even h, or w=c(h−1)/2a for odd h, has exactly q letters; in the odd case this uses r=n/2 from 11.1. Its prefix roots are ρ1,…,ρq by the cyclic definition, and these are positive by 13.1. At each step the root-length criterion therefore increases the prefix length by one, so the word is reduced and ℓ(w)=q=ℓ(w0). By uniqueness of the longest element, w=w0, proving the formulas for w0 in (3).

15.1F3F5F6step 10.1step 12.1step 13.1step 14.1algebra

The full word (s1⋯sn)h represents 1 and splits after its first q letters, whose product is w0 by 14.1. Its remaining q-letter suffix also represents w0−1=w0, so it is reduced. Every prefix of a reduced word is reduced; applying the root-length criterion at each next letter shows that every prefix root of this suffix is positive. Its corresponding global prefix root is obtained by applying ρ(w0) and is therefore negative by [F6]. The second half in 12.1 has pairwise distinct hyperplanes, so these negative roots are pairwise distinct as well. Hence the first q roots are all of Φ+ because ∣Φ+∣=∣T∣=q by [F6] and 10.1, and the second q are all of Φ−=−Φ+. The first and second lists are disjoint by sign, giving pairwise distinctness of all nh roots; CVh=idV gives period nh, and that distinctness makes it exact. This proves (3).

16.1F9given∎

In rank one, B(α1,α1)=1, CV=−id, ρ1=α1, ρ2=−α1, and μ=idV, so the stated conclusions hold. For a reducible finite-type system, V, B, ρ, the root systems and CV split over the components by [F9]; each rank-one or irreducible component satisfies the result just proved, so CV−idV is a direct sum of invertible operators and the map μ and root enumeration hold componentwise. The total number of positive roots is ∑inihi/2, with no common nh/2 formula asserted when the component orders differ. No Choice is used.

Depends on

Used by

Cited to discharge well-definedness by The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)⁻¹a.

Dependency tree · two levels

143 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