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 parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J

Statement

Let (S,m), W, ℓ be as in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups, let I,J⊆S, and let d∈IWJ. Put

K:=I∩dJd−1={s∈I:d−1sd∈J},

where dJd−1={djd−1:j∈J}⊆T. Let VI, ΦI be as in Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2) and let α↦tα be the root-reflection dictionary of The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1).

(1) The intersection. WI∩dWJd−1=WK. Conjugating by d−1 gives

d−1WKd=Wd−1Kd,d−1Kd={d−1sd:s∈K}⊆J,

and equivalently WJ∩d−1WId=Wd−1Kd.

(2) The descent form. If y∈WI∩dWJd−1 and y=s1⋯sp is a reduced expression of y with letters s1,…,sp∈I, then

d−1sid∈Jfor every i=1,…,p.

(3) The conjugated positive root is simple. Let s∈I. Then z:=d−1sd is a reflection of W (that is, z∈T), its root is ρ(d)−1es∈Φ+, and z∈J if and only if this root is one of the simple roots ej, j∈J. Moreover, if z∈WJ then already z∈J: a reflection of the form d−1sd with s∈I that lies in WJ is necessarily a simple reflection of the parabolic root system ΦJ=Φ∩VJ of Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2), never a non-simple positive combination such as ej+ej′.

Facts & Assumptions

Given: a finite Coxeter matrix (S,m) with presented group W and length ℓ, subsets I,J⊆S, an element d∈IWJ and the subset K={s∈I:d−1sd∈J}.

[F1]

WI=⟨s:s∈I⟩, IW={w:ℓ(sw)>ℓ(w) for all s∈I}, WJ={w:ℓ(ws)>ℓ(w) for all s∈J} and IWJ=IW∩WJ; in particular d∈IWJ satisfies ℓ(sd)>ℓ(d) for s∈I and ℓ(ds)>ℓ(d) for s∈J (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups).

[F2]

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

[F3]

For d∈IWJ, every x∈WIdWJ admits some factorization x=udv with u∈WI, v∈WJ and ℓ(x)=ℓ(u)+ℓ(d)+ℓ(v); moreover ℓ(d)≤ℓ(x) for all x∈WIdWJ (Descent reduction, minimum-length elements, and the additive factorization in a double coset).

[F4]

Strong exchange: if w=w1⋯wn is a reduced expression and t∈T satisfies ℓ(tw)<ℓ(w), then there is a unique index i with tw=w1⋯wi^⋯wn and t=w1⋯wi−1wiwi−1⋯w1 (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange).

[F5]

The root-reflection dictionary: for α∈Φ and w∈W, s∈S with α=ρ(w)es the element tα:=wsw−1 is well defined, tρ(w)α=wtαw−1, the map Φ+→T, α↦tα, is a bijection and tα=tβ if and only if α=±β (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange).

[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]

T={wsw−1:w∈W, s∈S}, so every conjugate d−1sd of a simple reflection is a reflection (The canonical reflection homomorphism, roots, reflections, and the positive cone).

[F8]

ΦJ=Φ∩VJ, and the reflections lying in WJ are exactly the tα with α∈ΦJ+; in particular the simple roots ej, j∈J, correspond to the simple reflections of WJ, and a reflection of WJ whose positive root is not any ej (j∈J) cannot have length one: by [F2] a length-one element lies in J, and [F5] then identifies its positive root with ej (Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives).

[F9]

For w=s1⋯sk one has ℓ(w)≤k, so ℓ(uv)≤ℓ(u)+ℓ(v), and ℓ(w−1)=ℓ(w) with (ab)−1=b−1a−1 (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Group and abelian group).

Proof

technique · direct; strong exchange at the first letter of a reduced expression, then iteration along the expression
1.1F1F7

The easy inclusion and the conjugation identities. If s∈K, then s∈I⊆WI and d−1sd∈J, so s=d(d−1sd)d−1∈dWJd−1; hence WK⊆WI∩dWJd−1. Conjugation by d−1 is an isomorphism of groups carrying the generating set K to d−1Kd, so d−1WKd=Wd−1Kd, and d−1Kd⊆J holds by the definition of K. Conjugating the coming equality WI∩dWJd−1=WK by d−1 will give WJ∩d−1WId=Wd−1Kd.

1.2F1F2F3F4F9

The key step: the first letter conjugated lies in WJ. Let y∈WI∩dWJd−1 and let y=s1⋯sp be a reduced expression with p≥1 and all si∈I by [F2]; put y~:=d−1yd∈WJ and write y~=y~1⋯y~p for a reduced expression of y~. Then ℓ(y)=ℓ(y~)=p: indeed yd=dy~, while ℓ(yd)=ℓ(y)+ℓ(d) because y∈WI, d∈IW, and ℓ(dy~)=ℓ(d)+ℓ(y~) because d∈WJ, y~∈WJ, both by [F2]. Consequently the word s1⋯sp followed by a reduced word a1⋯aq of d, and the word a1⋯aq followed by y~1⋯y~p, are two reduced expressions of the same element yd=dy~ of length ℓ(d)+p, where q=ℓ(d). The element s1 is a left descent of yd: s1y=s2⋯sp, so ℓ(s1⋅yd)=ℓ(s1y)+ℓ(d)=(p−1)+ℓ(d)<ℓ(yd), using the additivity of [F2] and [F9] for ℓ(s1y)=p−1. Applying strong exchange [F4] to the reduced expression a1⋯aqy~1⋯y~p of yd and the reflection s1 gives a unique index i with s1(yd) equal to that word with its i-th letter deleted, and s1=a1⋯ai−1aiai−1⋯a1 if i≤q, while s1=Xy~jX−1 with X:=dy~1⋯y~j−1 if i=q+j. The first case is impossible: then the deleted word exhibits di:=a1⋯ai−1ai+1⋯aq with diy~=(s2⋯sp)d, hence di=(s2⋯sp) d y~−1∈WIdWJ, while ℓ(di)≤q−1<q=ℓ(d) by [F9], contradicting the minimality of d in WIdWJ given by [F3]. Hence i=q+j for some j, and substituting X=dy~1⋯y~j−1 gives d−1s1d=y~1⋯y~j−1y~jy~j−1⋯y~1∈WJ, a conjugate in WJ of the letter y~j∈J.

1.3F1F5F6F7F9

The conjugated root is positive. Let s∈I and z:=d−1sd. Then z∈T by [F7], and z=tρ(d)−1es by the dictionary [F5], since d−1sd=d−1tesd=tρ(d−1)es. The root ρ(d)−1es lies in Φ+: because d∈IW we have ℓ(sd)>ℓ(d) by [F1], and ℓ(sd)=ℓ(d−1s) and ℓ(d)=ℓ(d−1) by [F9], so the root-length criterion [F6] applied to w:=d−1, s gives ρ(d−1)es=ρ(d)−1es∈Φ+.

2.1F1F2F9step 1.2

Length one forces simplicity. Let s∈I and suppose z:=d−1sd∈WJ. Repeating the length computation of step 1.2 with (y,y~) replaced by (s,z) is legitimate because s∈WI, z∈WJ and sd=dz: it gives ℓ(z)=ℓ(s)=1. An element of WJ of length one is a product of one generator, hence lies in WJ∩S=J by [F2]. Applying this to the first letter of step 1.2, s1∈K; indeed d−1s1d∈WJ there, so d−1s1d∈J and s1∈I.

2.2F5step 1.3

The root of a conjugate that lies in J. Let s∈I and let φ:=ρ(d)−1es∈Φ+ be the root of z=d−1sd from step 1.3, so that z=tφ. If z∈J, then z=j=tej for an element j∈J, so tφ=tej; by [F5] φ=±ej, and since both φ and ej lie in Φ+ while Φ+ and Φ−=−Φ+ are disjoint, φ=ej. Conversely, if φ=ej with j∈J, then z=tej=j∈J.

3.1F1F2F9step 1.1step 2.1

The intersection. Let y∈WI∩dWJd−1 with reduced expression y=s1⋯sp, letters in I, and write y=dy~d−1 with y~∈WJ. If p=0, then y=1∈WK and there is nothing to prove, so assume p≥1. By step 2.1 the first letter s1 lies in K, i.e. d−1s1d∈J; then y′:=s1y=s2⋯sp satisfies y′∈WI and y′=d (d−1s1d) y~ d−1∈dWJd−1, and it has length p−1, because ℓ(y′)≤p−1 by [F9] and p=ℓ(y)=ℓ(s1y′)≤1+ℓ(y′). Iterating this argument through the suffixes shows d−1sid∈J, hence si∈K, for every i=1,…,p. Thus y∈WK, which proves (2) and, together with the inclusion of step 1.1, gives WI∩dWJd−1=WK, that is (1) and its conjugation identities.

4.1F2F5F8step 1.3step 2.1step 2.2∎

Conclusion of (3). Let s∈I. By step 1.3 the element z=d−1sd lies in T with root φ=ρ(d)−1es∈Φ+; by step 2.2 one has z∈J if and only if φ=ej for some j∈J. If instead z∈WJ, then by step 2.1 (applied to this s) ℓ(z)=1 and z∈WJ∩S=J by [F2], so here too φ=ej for some j∈J: the conjugated positive root is then a simple root of ΦJ=Φ∩VJ and never a non-simple positive combination such as ej+ej′, because [F8] shows that every reflection with a non-simple positive root has length >1, whereas ℓ(z)=1. The illustrative sum ej+ej′ need not itself be a root; when it is a root for distinct j,j′, it is non-simple. This proves (3) for every s∈I.

Remarks

  • The key step is Lusztig's argument for the intersection of parabolic subgroups: strong exchange at the first letter of a reduced expression of y∈WI∩dWJd−1 either deletes a letter of the middle representative d (impossible by minimality) or exhibits d−1s1d as a conjugate inside WJ of a letter of J.
  • The warning in (3) is not vacuous: in a parabolic subsystem of type A2 the sum ej+ej′ is a positive root whose reflection tej+ej′ lies in WJ with length 3, so "lying in WJ" alone would not make the conjugated root simple; it is the length-one conclusion ℓ(d−1sd)=ℓ(s)=1 that forces z∈J and hence φ=ej.

Depends on

Used by

Dependency tree · two levels

59 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