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.

Unique minimal double coset representatives and the additive normal form u-d-v

Statement

Let I,J⊆S, let d∈IWJ, and put

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

so that WI∩dWJd−1=WK by The parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J. Write

WIK:={u∈WI:ℓ(us)>ℓ(u) for all s∈K}

for the set of elements of WI with no right descent in K --- the same construction as in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2), applied inside the Coxeter system (WI,I) with its standard parabolic subgroup WK.

(1) Unique minimum. Two elements of IWJ lie in a common double coset WIwWJ only if they are equal. Hence, by Descent reduction, minimum-length elements, and the additive factorization in a double coset (1),(2), every double coset WIwWJ contains exactly one element of IWJ, namely its unique element of minimum length; in particular d is uniquely determined by the double coset WIdWJ.

(2) The additive normal form. Every x∈WIdWJ has a unique representation

x=u d vwith u∈WIK, v∈WJ,

and every product udv with u∈WIK, v∈WJ lies in WIdWJ. Thus

WIK×WJ→WIdWJ,(u,v)↦udv

is a bijection, and for all u∈WIK and v∈WJ

ℓ(udv)=ℓ(u)+ℓ(d)+ℓ(v).

(3) The size of a double coset. ∣WIdWJ∣=∣WIK∣⋅∣WJ∣; and if WI is finite then ∣WIdWJ∣=(∣WI∣/∣WK∣)⋅∣WJ∣, with the quotient a finite integer and the product interpreted as cardinal multiplication.

(4) The restriction to WIK is necessary. For arbitrary u∈WI the representation x=udv is not unique in general: if u=u0z is the factorization of u with u0∈WIK and z∈WK, and z′:=d−1zd∈WJ, then

udv=u0 d (z′v),u0∈WIK, z′v∈WJ,

and z′≠1 whenever z≠1; so the same x has two representations of the form udv with different first factors unless u∈WIK already. This is why the transversal restriction in (2) is recorded explicitly and may not be dropped.

Facts & Assumptions

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

[F1]

Inside the Coxeter system (WI,I) with standard parabolic subgroup WK: WIK={u∈WI:ℓ(us)>ℓ(u) for all s∈K} is the set of minimal-length representatives of the left cosets uWK in WI; every u∈WI has a unique factorization u=u0z with u0∈WIK, z∈WK, and then ℓ(u)=ℓ(u0)+ℓ(z), while ℓ(u0z′)=ℓ(u0)+ℓ(z′) for all z′∈WK; more generally WJ={w:S(w)⊆J} for J⊆S, every left coset aWJ has a unique minimal element, and ℓ(du)=ℓ(d)+ℓ(u) for a minimal representative d∈WJ of aWJ and u∈WJ, with the mirrored statement for right cosets: for the minimal representative d of a right coset WJa one has ℓ(ud)=ℓ(u)+ℓ(d) for all u∈WJ (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).

[F2]

The element x=d−1zd of the statement lies in WJ: indeed WI∩dWJd−1=WK and d−1WKd=Wd−1Kd⊆WJ (The parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J).

[F3]

Every double coset WIwWJ contains an element of IWJ; for d∈IWJ one has ℓ(d)≤ℓ(x) for all x∈WIdWJ with equality if and only if x=d; and every x∈WIdWJ has the form x=adc with a∈WI, c∈WJ and ℓ(x)=ℓ(a)+ℓ(d)+ℓ(c) (Descent reduction, minimum-length elements, and the additive factorization in a double coset).

[F4]

For w=s1⋯sk one has ℓ(w)≤k, so ℓ(uv)≤ℓ(u)+ℓ(v) for all u,v∈W (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F5]

Multiplication in W is associative and equalities in W may be multiplied and cancelled; in particular conjugation w↦cwc−1 is injective (Group and abelian group).

Proof

technique · direct; existence by factoring inside $W_I$ and $W_J$, uniqueness by the intercoset intersection $W_K$, then the cardinality and necessity clauses
1.1F1F2F3F5

Existence of the normal form. Let x∈WIdWJ. By [F3] write x=adc with a∈WI, c∈WJ and ℓ(x)=ℓ(a)+ℓ(d)+ℓ(c); by [F1] factor a=u0z with u0∈WIK, z∈WK and ℓ(a)=ℓ(u0)+ℓ(z). Put z′:=d−1zd∈WJ by [F2], which satisfies zd=dz′ because z=dz′d−1, and put v:=z′c∈WJ. Then x=u0zdc=u0dz′c=u0dv with u0∈WIK, v∈WJ, so every element of the double coset has a representation of the required form.

1.2F1F2F5

Uniqueness of the first factor I: the intersection. Suppose udv=u′dv′ with u,u′∈WIK and v,v′∈WJ. Left-multiplying by u−1 and right-multiplying by (v′)−1d−1 and cancelling gives u−1u′=d v (v′)−1d−1∈WI∩dWJd−1, which equals WK by [F2]; hence u′=u z for some z∈WK. Since u,u′∈WIK and WIK consists of the minimal representatives of the left cosets uWK in WI by [F1], u=u′; substituting back gives dv=dv′ and hence v=v′ by cancellation, so the representation has at most one pair of factors and the map of (2) is injective.

2.1F1F3F4step 1.1step 1.2

Additivity along the representation. Let x∈WIdWJ and write x=adc with a∈WI, c∈WJ as in [F3], and factor a=u0z, z′=d−1zd, v=z′c as in step 1.1. First ℓ(z)=ℓ(z′): indeed zd=dz′, while ℓ(zd)=ℓ(z)+ℓ(d) because z∈WK⊆WI and d∈IW, and ℓ(dz′)=ℓ(d)+ℓ(z′) because d∈WJ and z′∈WJ, both by [F1]. Estimating with subadditivity [F4], ℓ(x)≤ℓ(u0)+ℓ(d)+ℓ(v)≤ℓ(u0)+ℓ(d)+ℓ(z′)+ℓ(c)=ℓ(u0)+ℓ(z)+ℓ(d)+ℓ(c)=ℓ(a)+ℓ(d)+ℓ(c)=ℓ(x), where the last equality is [F3]; hence every inequality is an equality, so ℓ(u0dv)=ℓ(u0)+ℓ(d)+ℓ(v) for the representation of step 1.1, and also ℓ(v)=ℓ(z′)+ℓ(c). For any prescribed u∈WIK, v∈WJ, apply this construction to x=udv; uniqueness in step 1.2 identifies the constructed pair with (u,v), proving additivity for every such pair.

2.2F1step 1.1step 1.2

The size formulas. The map WIK×WJ→WIdWJ, (u,v)↦udv, is surjective by step 1.1 and injective by step 1.2, hence a bijection, so ∣WIdWJ∣=∣WIK∣⋅∣WJ∣. If WI is finite, the factorization u=u0z of [F1] is a bijection WIK×WK→WI, so ∣WIK∣=∣WI∣/∣WK∣ and therefore ∣WIdWJ∣=(∣WI∣/∣WK∣)⋅∣WJ∣, also when WJ is infinite.

3.1F3step 1.1step 2.1

Uniqueness of the minimum. Suppose d,d′∈IWJ lie in a common double coset Ω:=WIdWJ=WId′WJ. By [F3] each of d,d′ is a minimum-length element of Ω, so ℓ(d)=ℓ(d′); applying the representation of steps 1.1 and 2.1 with x:=d′ and base point d gives d′=udv with u∈WIK, v∈WJ and ℓ(d′)=ℓ(u)+ℓ(d)+ℓ(v). Hence ℓ(u)+ℓ(v)=0, so u=v=1 and d′=d. Consequently each double coset contains at most one element of IWJ; by [F3] (or its part (1)) it contains at least one, namely its unique minimum.

4.1F1F2F5step 1.1step 1.2step 2.1∎

The normal form and the necessity of the restriction. By steps 1.1, 1.2 and 2.1 every x∈WIdWJ has a unique representation x=udv with u∈WIK, v∈WJ, and then ℓ(x)=ℓ(u)+ℓ(d)+ℓ(v); conversely every product udv with u∈WIK⊆WI and v∈WJ lies in WIdWJ by the definition of the double coset, so the displayed map is a bijection and (2) holds. For (4) let u∈WI and v∈WJ be arbitrary and factor u=u0z with u0∈WIK, z∈WK by [F1]; put z′:=d−1zd∈WJ by [F2]. Then udv=u0zdv=u0dz′v=u0d(z′v) with u0∈WIK and z′v∈WJ, so x=udv has two representations with first factors u and u0; and z′≠1 whenever z≠1, because z=dz′d−1 and conjugation by d is injective by [F5], so u≠u0 whenever z≠1, that is, whenever u∉WIK. This is (4) and completes the proof of (1)-(4); no Axiom of Choice is used.

Remarks

  • The theorem is the algebraic heart of the double coset calculus: (1) and (3) say that the double cosets WIwWJ are parameterized by IWJ, and (2) upgrades the transversal to a normal form with exact length additivity. The counterexample in (4) is the classical failure of uniqueness once the transversal condition on the first factor is dropped.
  • The finite formula of (3) is the parabolic analogue of ∣WIwWJ∣=∣WI∣∣WJ∣/∣WI∩wWJw−1∣; the intersection is written WK by The parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J.

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

42 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