Alphabeta Math
TheoremStatement: 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.

Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives

Statement

Let (S,m), W, ℓ and I,J⊆S be as in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups, so that WI, WI, IW and the descents DL,DR have the meaning fixed there. Let V=RS with its Coxeter form B and positive cone V+={∑s∈Sλses:λs≥0} (The real Coxeter form, its radical, reflections, and form-preserving maps), let ρ:W→GL(V) be the canonical reflection homomorphism with root system Φ=Φ+⊔Φ− (The canonical reflection homomorphism, roots, reflections, and the positive cone, Root sign coherence and the action of simple reflections on positive roots (2)), and for I⊆S put

VI:=span⁡{es:s∈I},ΦI:={ρ(w)es:w∈WI, s∈I}

(Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S); here V∅={0} and Φ∅=∅.

(1) Intersections. For all I,J⊆S,

WI∩WJ=WI∩J.

(2) Parabolic root subsystems. For every I⊆S one has ρ(w)VI=VI for all w∈WI; consequently

ΦI=Φ∩VI={α∈Φ:α is a real linear combination of the simple roots es, s∈I}.

Moreover ΦI=ΦI+⊔ΦI− with ΦI±:=ΦI∩Φ±=Φ±∩VI, and the reflections lying in WI are exactly the elements tα∈T with α∈ΦI+ in the root-reflection dictionary of The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1).

(3) Coset minima are global minima. Let I⊆S, w∈W, and let d∈WI be the unique element of WI∩wWI, i.e. the unique d∈WI with w∈dWI (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2)). Then

ℓ(d)≤ℓ(x)for every x∈wWI,andℓ(d)=ℓ(x)  ⟺  x=d;

equivalently

WI={d∈W:ℓ(d)≤ℓ(dv) for all v∈WI},IW={d∈W:ℓ(d)≤ℓ(vd) for all v∈WI}.

Thus each set wWI contains exactly one element of WI, namely its unique element of minimum length, and symmetrically each right coset WIw contains exactly one element of IW, namely its unique element of minimum length.

Facts & Assumptions

Given: a finite Coxeter matrix (S,m) with presented group W and length ℓ, subsets I,J⊆S, the space V=RS with its Coxeter form B, and the canonical reflection homomorphism ρ with root system Φ and reflection set T.

[F1]

For J⊆S: WJ=⟨J⟩={w∈W:S(w)⊆J}, (WJ,J) is a Coxeter system with intrinsic length ℓ∣WJ, and WJ∩S=J; every right coset WJa has a unique element d of minimal length, characterized by ℓ(sd)>ℓ(d) for all s∈J, satisfying ℓ(ud)=ℓ(u)+ℓ(d) for all u∈WJ; by inversion every left coset aWJ has a unique minimal element d, characterized by ℓ(ds)>ℓ(d) for all s∈J and satisfying ℓ(du)=ℓ(d)+ℓ(u) for all u∈WJ (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).

[F2]

WI=⟨s:s∈I⟩, WI={w:ℓ(ws)>ℓ(w) for all s∈I} and IW={w:ℓ(sw)>ℓ(w) for all s∈I}, and WI=(IW)−1 (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups).

[F3]

B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) for s≠t with m(s,t)<∞, B(es,et)=−1 when m(s,t)=∞; for a with B(a,a)≠0 the reflection with normal a is ra(v)=v−2B(v,a)B(a,a)a (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F4]

ρ(s)=res for every s∈S, so ρ(s)es=−es and ρ(s)et=et−2B(et,es)es for t≠s (The canonical reflection homomorphism, roots, reflections, and the positive cone, The real Coxeter form, its radical, reflections, and form-preserving maps); ρ preserves B, every root α satisfies B(α,α)=1, and ρ(wsw−1)=rρ(w)es for all w∈W, s∈S (Descent of the reflection representation, unit root norms, and conjugation of reflections).

[F5]

Every root lies in V+∖{0} or in −V+∖{0}, but not in both; hence with Φ+=Φ∩V+ and Φ−=Φ∩(−V+) one has Φ=Φ+⊔Φ−, and every α∈Φ+ has all its coefficients ≥0 while every α∈Φ− has all its coefficients ≤0 (Root sign coherence and the action of simple reflections on positive roots).

[F6]

For all w∈W and s∈S: ℓ(ws)>ℓ(w)  ⟺  ρ(w)es∈Φ+, and ℓ(ws)<ℓ(w)  ⟺  ρ(w)es∈Φ− (The root-length criterion and faithfulness of the canonical reflection representation).

[F7]

The root-reflection dictionary: tα:=wsw−1 for any w∈W, s∈S with α=ρ(w)es is well defined, satisfies ρ(tα)=rα and tρ(w)α=wtαw−1, and restricts to a bijection Φ+→T, α↦tα, with tα=tβ if and only if α=±β. Strong exchange: if w=s1⋯sn is reduced and ℓ(tw)<ℓ(w) for a reflection t, then there is a unique i with tw=s1⋯si^⋯sn and t=s1⋯si−1sisi−1⋯s1, and the positive root α with t=tα is ρ(s1⋯si−1)esi (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange).

[F8]

For all w∈W and s∈S one has ℓ(ws)=ℓ(w)±1 (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action).

[F9]

For w=s1⋯sk one has w−1=sk⋯s1, because every generator satisfies s2=1; hence ℓ(w−1)=ℓ(w) and (ab)−1=b−1a−1 for all a,b∈W (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Group and abelian group).

[F10]

WI is the smallest subgroup containing I (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups). The set of finite products of elements of I and their inverses is a subgroup containing I (concatenate words and reverse and invert a word), and is contained in WI; thus it equals WI.

[F11]

VI=span⁡{es:s∈I} is the set of all real linear combinations ∑s∈Iλses; in particular V∅={0} and the coefficients of a vector of VI in the basis (es)s∈S vanish outside I (span⁡(S) is exactly the set of linear combinations of finite lists of elements of S, and span⁡(∅)={0V}); the coordinate assertion follows by evaluating the finite combinations at each s∉I.

Proof

technique · direct, with a strong induction on the length of a reflection for the converse containment of (2)
1.1F1F2

Intersections of standard parabolics. By [F1], w∈WI if and only if S(w)⊆I, and w∈WJ if and only if S(w)⊆J; hence w∈WI∩WJ if and only if S(w)⊆I∩J, if and only if w∈WI∩J. This proves (1) for all subsets I,J, including I∩J=∅, where W∅={1} by [F1] and [F2].

1.2F3F4F5F10F11

Invariance of VI and one containment. Let s∈I. By [F4], ρ(s)es=−es and ρ(s)et=et−2B(et,es)es for t∈I, t≠s; every vector of VI is a linear combination of the et, t∈I, so ρ(s)VI⊆VI, and since ρ(s) is invertible with ρ(s)−1=ρ(s), also ρ(s)VI=VI. Every w∈WI is a product of elements of I and their inverses by [F10], and the latter are again elements of I because s2=1; multiplying the identities ρ(s)VI=VI along such a product gives ρ(w)VI=VI. Consequently, for w∈WI and s∈I the root ρ(w)es lies in Φ∩VI, so ΦI⊆Φ∩VI; for I=∅ this says Φ∅=∅=Φ∩{0}, since 0∉Φ by [F5] and V∅={0} by [F11].

1.3F1F4F5F7F11

Setup of the converse containment. Let φ∈Φ∩VI. By [F5] the root φ lies in Φ+ or in Φ−; replacing φ by −φ, which is again a root in Φ∩VI because Φ and VI are stable under negation, we may assume φ∈Φ+, so by [F5] and [F11] we have φ=∑r∈Iλrer with λr>0 for every r∈supp⁡φ, and φ≠0. Let t:=tφ∈T be the reflection of the dictionary [F7], so that ρ(t)=rφ and B(φ,φ)=1 by [F4]. We prove t∈WI by strong induction on n:=ℓ(t)≥1. If n=1, then t is a word of length one, hence t=r for some r∈S; the dictionary gives ter=r, so t=tφ=ter and the clause "tα=tβ if and only if α=±β" of [F7] yields φ=±er; since φ and er both lie in Φ+ while Φ+ and Φ−=−Φ+ are disjoint by [F5], φ=er, and then r∈supp⁡φ⊆I by [F11], so t=r∈WI.

1.4F1F2

Additivity on the left coset. Let d∈WI. By [F2] one has ℓ(ds)>ℓ(d) for all s∈I, so d is the minimal representative of the left coset dWI characterized in [F1], and therefore ℓ(du)=ℓ(d)+ℓ(u) for all u∈WI.

2.1F3F4F5F6F7F8F9step 1.3

The induction step. Assume n:=ℓ(t)≥2 in the situation of step 1.3 and that the claim holds for all roots in Φ+∩VI whose reflection has length <n. Since 1=B(φ,φ)=∑r∈IλrB(φ,er) by [F3] and [F4], and λr>0 for r∈supp⁡φ, there is r∈supp⁡φ⊆I with B(φ,er)>0; fix such an r. If ∣supp⁡φ∣=1, then φ=λrer with λr>0, and 1=B(φ,φ)=λr2B(er,er)=λr2 gives λr=1, that is φ=er and t=ter=r; then ℓ(t)=1, against n≥2, so necessarily ∣supp⁡φ∣≥2. Put φ′:=ρ(t)er=rφ(er)=er−2B(φ,er)φ; its coefficient at each r′∈supp⁡φ∖{r} equals −2B(φ,er)λr′<0, and this set is nonempty, so φ′∈Φ− by [F5]. Put ψ:=ρ(r)φ=φ−2B(φ,er)er∈Φ∩VI; its coefficient at each r′∈supp⁡φ∖{r} is λr′>0, so ψ∉Φ− and hence ψ∈Φ+ by [F5], while ψ∈VI because φ,er∈VI. By the dictionary [F7], tψ=rtr. Since ρ(t)er=φ′∈Φ−, the root-length criterion [F6] gives ℓ(tr)<ℓ(t) and then ℓ(tr)=ℓ(t)−1 by [F8]; by [F9], ℓ(rt)=ℓ(tr)=ℓ(t)−1. Moreover ρ(rt)er=ρ(r)φ′ has at each r′∈supp⁡φ∖{r} the coefficient −2B(φ,er)λr′<0 of φ′, because ρ(r) alters only the coefficient of er; hence ρ(rt)er∈Φ− by [F5], and the criterion [F6] with w:=rt gives ℓ(tψ)=ℓ(rtr)<ℓ(rt), that is ℓ(tψ)=ℓ(t)−2 by [F8]. Since ψ∈Φ+∩VI and ℓ(tψ)<n, the induction hypothesis applies and yields tψ∈WI; then t=rtψr∈WI because r∈I.

2.2F2F8F9step 1.4

The two descriptions of the quotients. Let d∈W. If d∈WI, then by step 1.4 ℓ(dv)=ℓ(d)+ℓ(v)≥ℓ(d) for every v∈WI, with equality if and only if ℓ(v)=0, that is v=1. Conversely, if ℓ(d)≤ℓ(dv) for all v∈WI, take v=s∈I: then ℓ(ds)≥ℓ(d), and ℓ(ds)≠ℓ(d) by [F8], so ℓ(ds)>ℓ(d) for all s∈I, that is d∈WI by [F2]; hence WI={d:ℓ(d)≤ℓ(dv) for all v∈WI}. Applying this to d−1 and using WI=(IW)−1 from [F2] and the identities (d−1v)−1=v−1d and ℓ(x−1)=ℓ(x) from [F9], we get d∈IW if and only if ℓ(d)≤ℓ(v−1d) for all v∈WI; as v runs over WI so does v−1, so this is the second displayed description.

3.1F1F4F5F7step 1.3step 2.1

The converse containment. We prove by strong induction on n that every φ∈Φ+∩VI satisfies tφ∈WI, the cases n=1 and n≥2 being steps 1.3 and 2.1; the induction is well founded because the length values are natural numbers. First let φ∈Φ+∩VI. Then tφ∈WI, and its positive root is φ. Strong exchange furnishes a representation with letters in I: choosing a reduced expression tφ=s1⋯sm of tφ inside WI with all si∈I by [F1] and applying strong exchange [F7] to w:=tφ and the reflection tφ, whose square is 1 and has length 0<m, produces an index i with tφ=s1⋯si−1sisi−1⋯s1 and φ=ρ(s1⋯si−1)esi with s1⋯si−1∈WI and si∈I. Hence φ∈ΦI for positive φ. If instead φ∈Φ−∩VI, apply this argument to −φ=ρ(w)es with w∈WI, s∈I; then φ=ρ(ws)es∈ΦI, since ρ(s)es=−es and ws∈WI by [F4]. Therefore Φ∩VI⊆ΦI.

3.2F1F2F9step 1.4step 2.2

Every coset has a unique minimum. Let w∈W and let d∈WI be the unique element of WI∩wWI, so that w=dv with v∈WI by [F1] and wWI=dWI. Every x∈dWI has the form x=du with u∈WI, and by step 1.4, ℓ(x)=ℓ(d)+ℓ(u)≥ℓ(d), with equality if and only if ℓ(u)=0, that is u=1 and x=d. If d′∈WI∩dWI is a second such element, write d′=du′ and d=d′u with u,u′∈WI (possible since d′WI=dWI); step 1.4 gives ℓ(d′)=ℓ(d)+ℓ(u′) and ℓ(d)=ℓ(d′)+ℓ(u), so ℓ(u)=ℓ(u′)=0, u=u′=1 and d=d′. Thus dWI=wWI contains exactly one element of WI, namely its unique element of minimum length, which proves the right-handed assertions of (3). The left-handed assertions follow by the same argument applied to the inverses, using the description of IW in step 2.2 and the identities ℓ(x−1)=ℓ(x) of [F9].

4.1F1F5F7F11step 1.2step 3.1∎

Conclusion of (2). Combining steps 1.2 and 3.1 gives ΦI=Φ∩VI, which by [F11] is the displayed set of roots that are real linear combinations of the es, s∈I. Since Φ=Φ+⊔Φ− by [F5], intersecting with VI gives ΦI=ΦI+⊔ΦI− for ΦI±=ΦI∩Φ±=Φ±∩VI. For the reflection identification: if α∈ΦI+, say α=ρ(w)es with w∈WI, s∈I, then tα=wsw−1∈WI by [F7]; conversely, if t∈WI∩T, then t=tα for the unique α∈Φ+ by [F7], and choosing a reduced expression t=s1⋯sm inside WI with letters in I by [F1] and applying strong exchange [F7] to w:=t and the reflection t exhibits t=s1⋯si−1sisi−1⋯s1 and α=ρ(s1⋯si−1)esi, a root in ΦI because s1⋯si−1∈WI and si∈I. Hence the reflections of WI are exactly the tα with α∈ΦI+. Together with steps 1.1 and 3.2 this proves (1), (2) and (3); no Axiom of Choice is used: each proof fixes finitely many witnesses, and no simultaneous selection from an arbitrary family is required.

Remarks

Depends on

Used by

Cited to discharge well-definedness by Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups.

Dependency tree · two levels

77 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