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.

Plane subsystems, their canonical generators, and the angular order of their roots

Statement

Let (W,S) be a Coxeter system of finite type with S finite and n:=∣S∣, canonical reflection representation ρ on V=RS, Coxeter form B (positive definite, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)), root system Φ=Φ+⊔Φ−, reflection set T, the finite reflection arrangement with chamber C and the chamber tiling, and the parabolic subsystems ΦI=Φ∩VI (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, Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2)). For P⊆V, write P⊥:={v∈V:B(v,p)=0 for all p∈P}. For each α∈Φ, let tα∈T be its associated reflection, so ρ(tα)=rα, and for each t∈T let βt∈Φ+ be its unique positive root with tβt=t (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)). Let P⊆V be a 2-dimensional subspace spanned by roots, and let x∈P⊥ satisfy B(x,α)≠0 for every root α∈Φ∖P; if n=2 take x=0. (Existence: the sets P⊥∩Hα for α∈Φ∖P are finitely many proper subspaces of P⊥, since P⊥⊆Hα would force α∈(P⊥)⊥=P, and a finite union of proper subspaces does not cover a vector space over the infinite field R.) (1) Stabilizer and roots. W′:=StabW(x)={u∈W:ρ(u)x=x} is a parabolic subgroup of (W,S), a conjugate of a standard parabolic, of rank two, and its roots are exactly the roots in the plane: tα∈W′  ⟺  α∈P,so{α∈Φ:tα∈W′}=Φ∩P. Moreover Φ∩P spans P. (2) Canonical generators and angular order. ΦP+:=Φ∩P∩V+ is the positive system of the rank-two subsystem Φ∩P and has exactly two extreme rays. Let r1,r2 be the roots on those rays, and put a:=tr1 and b:=tr2 for their corresponding group reflections. Let m:=ord⁡(ab)∈{2,3,… }. For 1≤j≤m, let uj be the alternating word of length 2j−1 in a,b starting with a; these are reflections, since for q:=ab one has u2j+1=qjaq−j and u2j=qjbq−j whenever the indicated index is in range. Thus u1=a and um=b. Then Φ∩P={±βu1,…,±βum}, the positive roots ordered by angle from the ray of r1 to the ray of r2 are βu1,βu2,…,βum, and all positive roots of Φ∩P lie in the closed angular sector spanned by r1,r2. (3) The dihedral subsystem. W′=⟨a,b⟩ is dihedral of order 2m (for m=2 it is Z/2×Z/2); its reflection set is W′∩T={u1,…,um}, and every reflection of W′ is conjugate in W′ to a or b. The root pair {r1,r2} is the canonical system: its positive span contains every positive subsystem root, and neither root is in the positive span of the other positive subsystem roots. (4) Subplanes and reversal. If Q⊆P is a 2-dimensional subspace spanned by roots of Φ∩P, then Q=P, so Φ∩Q=Φ∩P; the same construction in Q gives the same extreme rays, rank-two subsystem and reflection subgroup, with the same angular order. Exchanging the two extreme rays (using the opposite orientation from r2 to r1) reverses the index order u1,…,um to um,…,u1. (5) No Choice. The point x is chosen in the complement of a finite union of proper subspaces of P⊥, which is nonempty without the Axiom of Choice.

Facts & Assumptions

Given: A Coxeter system (W,S) of finite type with V=RS, Coxeter form B, canonical reflection representation ρ, root system Φ=Φ+⊔Φ−, reflection set T, positive cone V+, the chamber C and its interior C∘ of the dual action, and a 2-dimensional subspace P⊆V spanned by roots, with x∈P⊥ satisfying B(x,α)≠0 for every root α∈Φ∖P (and x=0 when n=∣S∣=2).

[F1]

The real Coxeter form, its radical, reflections, and form-preserving maps: (es)s∈S is a basis of V; B is symmetric bilinear with B(es,es)=1, B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t) and B(es,et)=−1 for m(s,t)=∞; and for a with B(a,a)≠0 the reflection with normal a is ra(v)=v−2B(v,a)B(a,a)a.

[F2]

The canonical reflection homomorphism, roots, reflections, and the positive cone: ρ(s)=res defines the homomorphism ρ:W→GL(V), Φ={ρ(w)es:w∈W, s∈S}, T={wsw−1}, and V+={∑sλses:λs≥0}.

[F3]

Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2): for B(a,a)≠0, ra is linear, involutive and preserves B, and ker⁡B(−,a) is a hyperplane fixed pointwise by ra.

[F4]

Root sign coherence and the action of simple reflections on positive roots (2): every root lies in V+∖{0} or in −V+∖{0}, and Φ+=Φ∩V+, Φ−=Φ∩(−V+).

[F5]

The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange: every root has B-norm one; for α=ρ(w)es, tα:=wsw−1 is independent of the representation, t−α=tα, ρ(tα)=rα, tρ(w)α=wtαw−1, and the map Φ+→T, α↦tα, is a bijection.

[F6]

Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1): W is finite if and only if B is positive definite.

[F7]

The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset: because W is finite, B is positive definite, and identifying V with V∗ by b one has C={v:B(v,es)≥0 ∀s}, C∘={v:B(v,es)>0 ∀s} and Hα={v:B(v,α)=0}, with A={Hα:α∈Φ} a finite set of hyperplanes permuted by ρ(W).

[F8]

The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1): U=V∗, under the identification V=⋃w∈WwC, the connected components of V∖⋃αHα are exactly the chambers wC∘, and every W-orbit in V meets C in exactly one point.

[F9]

Chamber collisions, point stabilizers, and the intersection rule: (1) wHes=Hρ(w)es; (4) for f∈U and w∈W with w−1⋅f∈C one has Stab⁡W(f)=w WS(w−1⋅f) w−1, where S(f)={s∈S:f(es)=0}.

[F10]

Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2): for I⊆S, ρ(v)VI=VI for v∈WI, and ΦI={ρ(v)es:v∈WI, s∈I}=Φ∩VI; the reflections lying in WI are exactly the tα with α∈ΦI∩Φ+.

[F11]

The dual action, the faces, and the rank-two chamber tiling (2): 0∈C (equivalently CS={0}).

Proof

technique · One induction, on the number of subspaces in the finite-union lemma; the remaining clauses are proved directly, and the alternating-list claims are proved by the dihedral recursion
1.1givenF6F7F8F9

By F6, B is positive definite. Fact [F7] identifies V with V∗ by b(v)=B(v,⋅) and gives b(ρ(w)v)=w⋅b(v); it also gives the vector descriptions of C,C∘,Hα. Thus the chamber tiling and stabilizer statements F8, F9 apply in this model. Put S(v):={s∈S:B(v,es)=0}.

1.2base

Finite-union base cases: if N=0, the empty union misses 0 in every vector space; if N=1, a proper subspace V1⊊W misses a point of W by definition.

1.3ih

Induction hypothesis of the finite-union lemma: for N≥2, assume that for every real vector space W and every family of N−1 proper subspaces the union is not all of W.

2.1step 1.3algebra

Step of the finite-union lemma, N≥2: let V1,…,VN be proper subspaces of W. If VN⊆⋃i<NVi, then ⋃i≤NVi=⋃i<NVi≠W by step 1.3. Otherwise choose u∈W∖⋃i<NVi (nonempty by step 1.3) and w∈W∖VN (nonempty since VN is proper), and form the line L:={u+λw:λ∈R}; each Vi meets L in at most one point, because two distinct points of L in Vi give w∈Vi and then u∈Vi. Hence at most N values of λ are excluded, and since R is infinite some λ has u+λw∉⋃i≤NVi; this proves the lemma for N, and every selection made is a single existential instantiation from a set already known to be nonempty, so no choice principle is used.

2.2step 1.1F8F9F11

Orbit and stabilizer: by F8 the orbit Wx meets C in exactly one point y (for x=0 one has y=0, and 0∈C by F11); fix w∈W with x=w⋅y. Then Stab⁡W(x)=wStab⁡W(y)w−1=wWS(y)w−1 by F9, where S(y)={s:B(y,es)=0}. Hence W′=Stab⁡W(x) is a conjugate of the standard parabolic WS(y).

3.1step 1.2step 2.1F2F6

Existence of x and clause (5): if n=2, then P=V and the family indexed by Φ∖P is empty, so take x=0. If n>2, some simple root is outside P because the simple roots span V, hence the finite family P⊥∩Hα, α∈Φ∖P, is nonempty. Each member is a proper subspace of P⊥: P⊥⊆Hα would mean B(y,α)=0 for all y∈P⊥, i.e. α∈(P⊥)⊥=P, contrary to α∉P, since B is positive definite. If there is one such subspace, step 1.2 supplies a point outside it; if there are at least two, step 2.1 supplies a point outside their union. This gives x∈P⊥ with B(x,α)≠0 for every root α∈Φ∖P. This proves the existence asserted in the statement and shows that no Choice is used (clause (5)).

4.1step 3.1F1F5

Roots of W′: for α∈Φ one has tα∈W′ if and only if α∈P. If α∈Φ∩P, then B(x,α)=0 because x∈P⊥, so rα(x)=x−2B(x,α)B(α,α)α=x by [F1], and ρ(tα)=rα by F5, hence tα∈Stab⁡W(x)=W′. Conversely, if tα∈W′, then the same two formulas give x=rα(x)=x−2B(x,α)B(α,α)α, hence B(x,α)=0 (as α≠0), and the defining property of x from step 3.1 forces α∈P. In particular {α∈Φ:tα∈W′}=Φ∩P, and this proves the second display of clause (1).

5.1step 4.1F5F10

Rank and span: put J:=S(y) and ΦJ:=Φ∩VJ. By F5 and F10, tα∈wWJw−1  ⟺  w−1tαw∈WJ  ⟺  tρ(w)−1α∈WJ  ⟺  ρ(w)−1α∈Φ∩VJ  ⟺  α∈ρ(w)(Φ∩VJ); the third equivalence also uses t−γ=tγ when γ is negative. Thus the roots of the conjugate parabolic wWJw−1 are ρ(w)(Φ∩VJ). Comparing with step 4.1 gives ρ(w)(Φ∩VJ)=Φ∩P; since es∈ΦJ for s∈J, the set ΦJ spans VJ, and invertibility of ρ(w) shows dim⁡VJ=dim⁡span⁡(Φ∩P)=dim⁡P=2. Hence ∣J∣=dim⁡VJ=2 because (es)s∈J is a basis of VJ, and Φ∩P spans P because it equals the image of ΦJ. Thus W′ is a conjugate of a standard parabolic of rank two.

6.1step 4.1step 5.1F2F4F5F6

The finite dihedral model: WJ=⟨s:s∈J⟩=⟨tes:s∈J⟩, and conjugating the generating set by w gives W′=⟨wtesw−1:s∈J⟩=⟨tρ(w)es:s∈J⟩ by [F2, F5]; each ρ(w)es lies in ρ(w)ΦJ=Φ∩P=:R, so W′ is contained in ⟨tα:α∈R⟩. Conversely every tα for α∈R belongs to W′ by step 4.1, proving equality. Moreover R=ΦP+⊔(−ΦP+) with ΦP+:=Φ∩P∩V+ by [F4], and R is finite by [F6].

7.1step 6.1F1F2F6F10F12

Faithful plane action: W′=wWJw−1 preserves P=ρ(w)VJ, because WJ preserves VJ by F10. Since B is positive definite, V=VJ⊕VJ⊥. Every generator s∈J fixes VJ⊥ pointwise by the reflection formula [F1] and ρ(s)=res [F2]; hence every v∈WJ fixes VJ⊥ pointwise. If u=wvw−1 acts trivially on P, then ρ(v) acts trivially on VJ=ρ(w)−1P and on VJ⊥, so it is the identity on V and v=1 by [F12]. Thus G:=ρ(W′)∣P is faithful.

8.1step 6.1step 7.1F3F5F6

Orthogonal plane action: G is finite by [F6] and is contained in O(P) because W′ preserves P and is generated by the B-isometric reflections from step 6.1 and [F3]. Each tα with α∈R acts as a nontrivial orthogonal reflection on P: [F5] gives B(α,α)=1, so its normal line lies in P and its restriction fixes the one-dimensional orthogonal line and negates α.

8.2step 2.1step 4.1step 6.1step 7.1F1F5F7F8F9F12

Identify plane reflections with group reflections: take g∈G with determinant −1 and let u∈W′ be its unique preimage under the faithful action of step 7.1. Every determinant-−1 map in O(P) is a reflection, since its eigenvalues are 1 and −1. By step 6.1, W′ is generated by tα with α∈R⊆P; each ρ(tα)=rα fixes P⊥ pointwise by [F1]. By positive definiteness [F7], V=P⊕P⊥, so ρ(u) is the reflection g on P and the identity on P⊥, hence has fixed hyperplane M. If M is not a root hyperplane, each M∩Hβ is a proper subspace of M; the arrangement is finite by [F7]. Applying the finite-union lemma from step 2.1 inside M gives z∈M outside every root hyperplane. Choose v∈W with y:=v−1⋅z∈C using F8. The arrangement is W-invariant, so y also avoids every root hyperplane; because y∈C, this makes y∈C∘, and F9 gives Stab⁡W(y)={1}. Since z=v⋅y, its stabilizer is conjugate to the trivial stabilizer of y, contradicting u≠1 and z∈M=Fix⁡(ρ(u)). Therefore M=Hα for some root α. The unique B-orthogonal reflection with fixed hyperplane Hα is rα, so [F5] gives ρ(u)=rα=ρ(tα) and faithfulness [F12] yields u=tα∈T; step 4.1 forces α∈P. Conversely every tα with α∈Φ∩P lies in W′ by step 4.1 and acts as a reflection on P. Hence the determinant-−1 elements of G correspond exactly to T∩W′.

9.1step 7.1step 8.1F3F5algebra

Finite orthogonal plane groups: R spans P, so choose two nonproportional roots in R. Their reflections restrict to distinct reflections of G by steps 6.1 and 8.1, and their product is a nonidentity rotation and the rotation subgroup H:=G∩SO(P) is nontrivial. The determinant maps G onto {±1}, with kernel H, so ∣G∣=2∣H∣. Let θ be the least positive rotation angle in the finite group H. For any angle φ∈(0,2π) of an element of H, division by θ gives φ=dθ+δ with 0≤δ<θ; the rotation of angle δ is in H, so minimality forces δ=0. Dividing 2π by θ likewise gives 2π=Nθ+δ with 0≤δ<θ; the inverse of the rotation through Nθ has angle δ, so again δ=0. Thus h, the rotation through θ, has exact order N and every element of H is a power of h, so N=∣H∣=:k≥2 and θ=2π/k. The coset Ht for any reflection t∈G consists of all k orientation-reversing orthogonal maps, each a reflection in a line of P. If θ0 is the angle of a unit normal to the reflection line of t, then the unit normal to hjt has angle θ0+jπ/k; including both orientations gives 2k equally spaced normal directions.

10.1step 4.1step 5.1step 6.1step 9.1step 8.2F1F4F5F12algebra

Angular order and count: let k:=∣H∣=∣T∩W′∣=∣Φ+∩P∣ by steps 9.1 and 8.2 and the positive-root/reflection bijection [F5]. Put C′:=cone⁡(R∩V+); since R∩V+ spans P by steps 5.1 and 6.1, it is a pointed, finitely generated full-dimensional cone in the plane and has exactly two extreme rays, each containing a generator r1,r2∈R∩V+. Its positive roots lie in the closed angular sector between those rays, and a root in that sector is positive, so this sector contains exactly the k positive roots counted above. The normal lines are spaced by π/k by step 9.1; therefore these k roots occupy consecutive directions, and the sector has angle (k−1)π/k. The unit normals r1,r2 therefore have angle (k−1)π/k, so the product of their linear reflections rr1rr2 is a rotation through 2π/k, of exact order k. Since ρ(ab)=rr1rr2 and ρ is injective by [F12], m:=ord⁡(ab)=k.

11.1step 10.1F1F5algebra

The alternating list: put a:=tr1, b:=tr2 and q:=ab. Step 10.1 gives m=k and the angle between the unit roots r1,r2 as π−π/m, whence B(r1,r2)=−cos⁡(π/m). The conjugate formulas in the Statement show each uj is a reflection in W′. Their positive roots satisfy βu1=r1 and βu2=ρ(a)r2=rr1(r2)=r2+2cos⁡(π/m)r1, which has angle π/m from r1. For 2≤j<m, the alternating-word identity uj+1=quj−1q−1 and the root-conjugation identity [F5] give the root ρ(q)βuj−1 for uj+1; its angle is jπ/m<π, so it is the positive root βuj+1. By step 10.1, ρ(q) rotates through 2π/m. Starting from u1,u2, induction now gives βuj at angle (j−1)π/m from r1 for all 1≤j≤m. These are the m=k consecutive positive roots; at j=m the vector is the unit root on the ray of r2, hence equals r2 and [F5] gives um=b. The conjugate formulas show odd-indexed uj are conjugate to a and even-indexed uj to b.

12.1step 6.1step 7.1step 8.2step 9.1step 10.1step 11.1F5

Clauses (2) and (3): by steps 8.2 and 11.1, the 2k roots of R are {±βu1,…,±βum} with m=k and distinct positive roots, so this is all of Φ∩P and its positive roots are ordered from the ray r1 to r2 between its two extreme rays. By step 6.1, W′ is generated by its reflections T∩W′; steps 8.2 and 11.1 together with [F5] identify that set with the alternating elements uj, each a word in a,b, so W′=⟨a,b⟩. The involutions a,b with product of order m give a surjection from the dihedral group of order 2m onto W′, and ∣W′∣=∣G∣=2k=2m by steps 7.1, 9.1 and 10.1; hence this surjection is an isomorphism. Every reflection is conjugate to a or b by step 11.1. For the canonical-system characterization stated in (3), it remains to check positive spanning and extremality. The roots in ΦP+ lie in the cone generated by the extreme roots r1,r2, so condition (i) holds. Extremality gives condition (ii): if ri were a nonnegative combination of other positive subsystem roots, every nonzero summand would have to lie on its extreme ray; since every root has norm one, the only positive root on that ray is ri itself, a contradiction. Thus {r1,r2} is the canonical system of W′.

13.1step 6.1step 10.1step 11.1step 12.1F5algebra

Clause (4) and the reversal: a 2-dimensional subspace Q⊆P equals P, so Φ∩Q=Φ∩P; therefore the extreme rays, rank-two subsystem, reflection subgroup, and angular order constructed in Q are the same as those already established in steps 10.1--12.1 and 6.1. If the extreme rays are exchanged, let r1′:=r2 and r2′:=r1. Repeating the calculation of step 11.1 with the rays exchanged (so the product is ba=(ab)−1) gives the new alternating roots at angle (j−1)π/m from r2, hence at angle (m−j)π/m from r1; this is the angle of βum+1−j. The root-reflection bijection [F5] then gives uj′=um+1−j, so the index order reverses.

14.1step 1.2step 1.3step 2.1step 3.1step 4.1step 5.1step 6.1step 7.1step 8.1step 9.1step 8.2step 10.1step 11.1step 12.1step 13.1discharge-induction∎

The finite-union induction is discharged by steps 1.2, 1.3 and 2.1, and the alternating-root induction by step 11.1; together with steps 3.1--10.1, 12.1, and 13.1 these establish clauses (1)--(5). The proof uses no Choice.

Depends on

Used by

Dependency tree · two levels

106 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