Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Minimal representatives identify core cosets with root-transport arrows

Statement

Let (W,S) be a Coxeter system and let I,K⊆S be finitary, meaning that their standard parabolic subgroups WI and WK are finite. Write ΠL={αs:s∈L}. Sending a core (I,K)-coset p=WIxWK to its minimum-length representative d gives a bijection with the labels d satisfying dΠK=ΠI, namely the arrows I→K in the Brink–Howlett groupoid. Its inverse is d↦WIdWK. Moreover the maximum-length element of p is wId=dwK and has length ℓ(wI)+ℓ(d).

Facts & Assumptions

Given: The data and hypotheses in the Statement.

[F1]

The standard parabolic is WL=⟨L⟩; for finite WL, wL denotes its unique longest element. Core cosets satisfy WIx=WIxWK=xWK; root-transport arrows satisfy dΠK=ΠI, with labels composed from left to right. Core and atomic double cosets Brink–Howlett groupoid

[F3]

In finite rank, (WL,L) is a Coxeter system with intrinsic length equal to ambient length. The minimum d in WLd is characterized by ℓ(sd)>ℓ(d) for every s∈L, and satisfies ℓ(ud)=ℓ(u)+ℓ(d) for every u∈WL. The corresponding assertions for dWL use ℓ(ds)>ℓ(d) and ℓ(du)=ℓ(d)+ℓ(u). Length is invariant under inversion. Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification

[F4]

In finite rank, ℓ(ws)>ℓ(w) if and only if wαs is positive; the canonical reflection representation is faithful. The root-length criterion and faithfulness of the canonical reflection representation

[F5]

In finite rank, if d is minimal on both sides for (I,K) and s∈I satisfies d−1sd∈WK, then d−1αs=αt for some t∈K. The parabolic intersection W_I∩ dW_Jd⁻¹ for d∈^IW^J

[F6]

For every finite H⊆S, the Coxeter group presented by the restricted matrix on H embeds in W as WH, and its intrinsic length equals ambient length. Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank

[F7]

In the geometric representation, s(v)=v−2B(v,αs)αs, where B(αs,αs)=1 and the entries of B are determined by the Coxeter matrix. Positive roots have nonnegative simple-root coordinates. Coxeter-system, roots, length and weak-order conventions

Proof

Given: The data and hypotheses in the Statement.

[F1] The standard parabolic is WL=⟨L⟩; for finite WL, wL denotes its unique longest element. Core cosets satisfy WIx=WIxWK=xWK; root-transport arrows satisfy dΠK=ΠI, with labels composed from left to right. Core and atomic double cosets Brink–Howlett groupoid

[F3] In finite rank, (WL,L) is a Coxeter system with intrinsic length equal to ambient length. The minimum d in WLd is characterized by ℓ(sd)>ℓ(d) for every s∈L, and satisfies ℓ(ud)=ℓ(u)+ℓ(d) for every u∈WL. The corresponding assertions for dWL use ℓ(ds)>ℓ(d) and ℓ(du)=ℓ(d)+ℓ(u). Length is invariant under inversion. Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification

[F4] In finite rank, ℓ(ws)>ℓ(w) if and only if wαs is positive; the canonical reflection representation is faithful. The root-length criterion and faithfulness of the canonical reflection representation

[F5] In finite rank, if d is minimal on both sides for (I,K) and s∈I satisfies d−1sd∈WK, then d−1αs=αt for some t∈K. The parabolic intersection W_I∩ dW_Jd⁻¹ for d∈^IW^J

[F6] For every finite H⊆S, the Coxeter group presented by the restricted matrix on H embeds in W as WH, and its intrinsic length equals ambient length. Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank

[F7] In the geometric representation, s(v)=v−2B(v,αs)αs, where B(αs,αs)=1 and the entries of B are determined by the Coxeter matrix. Positive roots have nonnegative simple-root coordinates. Coxeter-system, roots, length and weak-order conventions

Proof technique: direct.

Goal: Establish the stated dictionary or identification.

1.1givenF1F2F3F4F5F6F7

By [F1], I⊆WI and K⊆WK, so the finite-parabolic hypothesis in the Statement makes I and K finite. For any representative g under consideration, choose a finite H⊆S containing I,K and the letters of a word for g. The whole double coset WIgWK lies in WH. By [F6], all its group equalities and lengths can be computed in the finite-rank Coxeter system on H. The span of ΠH is invariant under every generator in H by the reflection formula [F7]; the restricted form has exactly the entries of that finite system. Thus the finite-system action and the ambient action agree on this span, and positivity agrees because their simple-root coordinates coincide. Consequently [F2]–[F5] apply there to the entire parabolic cosets and to all the transported roots used below. Also each simple reflection preserves B: expanding B(su,sv) with [F7] cancels the two cross terms against the term involving B(αs,αs)=1. Hence every element of WH preserves the restricted form.

2.1F1F2F3F5step 1.1

Let p=WIxWK be core. Its equality with the two one-sided cosets in [F1], and [F2], give its unique minimum d. Since d∈p, those same one-sided cosets are WId=dWK=p, so d−1WId=WK. By [F3], d is minimal on both sides for (I,K) and d−1 is minimal on both sides for (K,I). For every s∈I, its conjugate d−1sd lies in WK, and [F5] gives d−1αs∈ΠK. Applying [F5] to d−1 gives dΠK⊆ΠI as well. The two inclusions imply dΠK=ΠI.

3.1F1F3F4F7step 1.1step 2.1

Conversely suppose dΠK=ΠI. Work in the finite system of step 1.1 with g=d. If dαt=αs for t∈K and s∈I, preservation of B and the reflection formula show that the action of dtd−1 is the reflection with normal dαt=αs. By faithfulness [F4], dtd−1=s. Thus conjugation by d bijects K with I and gives dWKd−1=WI. Both dΠK and d−1ΠI consist of positive simple roots. By [F4], ℓ(dt)>ℓ(d) for t∈K and ℓ(d−1s)>ℓ(d−1) for s∈I; inversion invariance makes the latter ℓ(sd)>ℓ(d). The characterization in [F3] makes d the minimum in both one-sided cosets. Their equality WId=dWK now makes WIdWK core by [F1]. Its unique minimum is d, so this construction and step 2.1 are inverse bijections, with the stated arrow direction.

4.1F1F3step 1.1step 2.1step 3.1∎

Conjugation by d bijects the simple generating sets K and I, so it preserves intrinsic word lengths: it sends any word to a word of the same length, and its inverse gives the reverse inequality. Intrinsic and ambient lengths agree by [F3] and step 1.1. It therefore sends the unique longest element wK to wI. Each element of p=WId is ud for a unique u∈WI, and [F3] gives ℓ(ud)=ℓ(u)+ℓ(d). Hence the unique maximum is wId=dwK, with length ℓ(wI)+ℓ(d). The source, target and left-to-right label convention are those in [F1].

Depends on

Used by · 3

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.