Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Parabolic double cosets of the infinite dihedral group

Example

Let S={s,t} with m(s,t)=∞, so that W=⟨s,t⟩ is the infinite dihedral group with length ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups); put u:=st, so that u has infinite order, W={uk:k∈Z}∪{uks:k∈Z}, sus−1=u−1, and ℓ(uk)=2∣k∣ for every k, while ℓ(uks)=2∣k∣+1 for k≥0 and ℓ(uks)=2∣k∣−1 for k≤−1 (The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness (3)(c), (4) and (7): the alternating words representing these elements are reduced). Let I={s} and J={t}, so that WI={1,s}, WJ={1,t} and WI∩WJ=W∅={1} (Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (1)); these are the standard parabolics of rank 1.

(i) All parabolics of W. The parabolic subgroups of W are exactly {1}, the order-two subgroups {1,r} generated by a reflection r∈T, and W; in particular WI and WJ are distinct, non-conjugate standard parabolics with trivial intersection.

(ii) The quotients. IW={w:ℓ(sw)>ℓ(w)}={u−k:k≥0}∪{u−ks:k≥1}={1,t,ts,tst,… }, WJ={w:ℓ(wt)>ℓ(w)}={uk:k≤0}∪{uks:k≥0}={1,s,ts,sts,tsts,… }, and IWJ=(ts)N={1,ts,tsts,tststs,… }={u−k:k≥0}: the two-sided descent-free elements are exactly the powers of the translation ts.

(iii) The double cosets. For every k≥0 the set WI(ts)kWJ is a double coset with exactly four elements,

WI(ts)kWJ={(ts)k, s(ts)k, (ts)kt, s(ts)kt}={u−k, uks, u−(k+1)s, uk+1},

of lengths 2k,2k+1,2k+1,2k+2, and its minimum is dk=(ts)k with length 2k (Unique minimal double coset representatives and the additive normal form u-d-v (2)). Here K={s′∈I:dk−1s′dk∈J} is empty for every k≥0, so WIK=WI, and ∣WI(ts)kWJ∣=4=∣WI∣⋅∣WJ∣/∣WK∣ in agreement with (3) of the same theorem. Finally W is the disjoint union of the double cosets WI(ts)kWJ, k≥0; the first one is

WIWJ={1,s,t,st},

and as k runs over Z≥0 the elements u−k,uks,u−(k+1)s,uk+1 of these blocks exhaust the lists um and ums (m∈Z) without repetition, so the decomposition is exhaustive and the parts are disjoint.

Facts & Assumptions

Given: the Coxeter matrix with S={s,t}, m(s,t)=∞, the presented group W with length ℓ, u=st, and the subsets I={s}, J={t}.

[F1]

st has infinite order in W and s≠t; alternating words in s,t are reduced in the ambient group, so the value of an alternating word of length q≥1 beginning with s or with t has length exactly q (The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness).

[F2]

WI=⟨s:s∈I⟩, IW={w:ℓ(sw)>ℓ(w) for all s∈I}, WJ={w:ℓ(ws)>ℓ(w) for all s∈J}, IWJ=IW∩WJ, W∅={1}, and the parabolic subgroups are the conjugates wWIw−1 (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups).

[F3]

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

[F4]

Every double coset WIwWJ contains exactly one element of IWJ, its unique minimum; that element d satisfies ℓ(d)≤ℓ(x), with equality only for x=d, and ∣WIdWJ∣=∣WIK∣⋅∣WJ∣ where K=I∩dJd−1, so that for finite WI also ∣WIdWJ∣=∣WI∣∣WJ∣/∣WK∣ (Unique minimal double coset representatives and the additive normal form u-d-v).

[F5]

WI={w∈W:S(w)⊆I} and WI∩S=I; in particular the two-element subgroup {1,s} is WI and {1,t} is WJ (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).

[F6]

The presented group W has the universal property: an assignment of s,t to elements of a group satisfying f(s)2=f(t)2=1 extends to a homomorphism W→G (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F7]

A group homomorphism φ:G→G′ satisfies φ(xy)=φ(x)φ(y) and φ(x−1)=φ(x)−1, hence φ(ghg−1)=φ(g)φ(h)φ(g)−1 for all g,h∈G (Monoid homomorphism and group homomorphism).

Verification

technique · direct reduced-word computations in the infinite dihedral group
1.1F2F3F5F6F7F8

The parabolic subgroups. By [F2] the parabolic subgroups are the conjugates of {1}, WI={1,s}, WJ={1,t} and WS=W; here {1} and W are their own conjugates, and the conjugates of {1,s} or of {1,t} are the two-element subgroups {1,r} with r∈T, while conversely every r∈T is a conjugate of s or of t by [F3]. Hence the parabolic subgroups are exactly {1}, the {1,r} with r∈T, and W. By [F8], WI∩WJ={1}, and the two standard parabolics are not conjugate to each other: the assignment s↦0, t↦1 sends the relators s2,t2 to 0, so by [F6] it defines a homomorphism φ ⁣:W→Z/2, and if w{1,s}w−1={1,t}, then wsw−1=t and [F7] gives 0=φ(s)=φ(wsw−1)=φ(t)=1, a contradiction.

1.2F1F2

The one-sided quotients. First sus−1=s(st)s=ts=u−1, so sums=u−m for every integer m. Every element of W is um or ums with m∈Z: any word in s,t can be shortened by cancelling adjacent equal letters until it alternates, and an alternating word is (st)m, (ts)m, (st)ms or (ts)ms, which is um, u−m, ums or u−ms. The two families are disjoint: if um=um′s then s=um−m′∈⟨u⟩, and s=uk implies u−k=suks=s⋅s⋅s=s=uk, where the first equality uses sus−1=u−1 and s=s−1, so u2k=1 and k=0 by the infinite order of u, whence s=1 and st=t of order 2, contradicting [F1]. Using the reduced alternating forms of [F1]: for m≥1 one has s um=s(st)m=t(st)m−1 of length 2m−1<2m, so um∉IW; for m<0 the element s um=(st)∣m∣s is alternating of length 2∣m∣+1>2∣m∣=ℓ(um), and for m=0 one has s⋅1=s of length 1>0, so no left descent occurs for m≤0; for m≥0 one has s(ums)=u−m of length 2m<2m+1=ℓ(ums), so ums∉IW; and for m≤−1 the element s(ums)=u−m has length 2∣m∣>2∣m∣−1=ℓ(ums), so no left descent occurs. Hence IW={um:m≤0}∪{ums:m≤−1}={u−k:k≥0}∪{u−ks:k≥1}. Dually, for m≥1 one has umt=(st)m−1s of length 2m−1<2m, so um∉WJ; for m≤0 the element umt=(ts)∣m∣t is alternating of length 2∣m∣+1>2∣m∣=ℓ(um), so no right descent occurs; for m≥0 one has umst=um+1 of length 2m+2>2m+1=ℓ(ums), so ums∈WJ; and for m≤−1 the element umst=um+1 has length 2∣m∣−2<2∣m∣−1=ℓ(ums), so ums∉WJ. Hence WJ={um:m≤0}∪{ums:m≥0}.

2.1F1F2F4step 1.2

The blocks of the decomposition. For k≥0 put dk:=(ts)k=u−k. Then s(ts)k=(st)ks=uks, since s t s=sts may be rewritten as (st)s; further (ts)kt=(ts)k+1s=u−(k+1)s, and s(ts)kt=(st)k+1=uk+1. Hence WI(ts)kWJ={u−k,uks,u−(k+1)s,uk+1}, and by the reduced alternating forms of [F1] these four elements have lengths 2k, 2k+1, 2(k+1)−1=2k+1 and 2k+2; they are pairwise distinct, the two translations having different lengths and the two s-multiples being equal only if u2k+1=1, impossible by [F1]. The minimum length among them is 2k=ℓ(dk), and dk=u−k∈IWJ by the description of step 1.2, so [F4] shows that dk is the unique minimum of the double coset WI(ts)kWJ.

2.2F1F2step 1.2

The two-sided quotient. By step 1.2, IWJ=IW∩WJ consists of the elements of the list {um:m≤0}∪{ums:m≤−1} that also lie in the list {um:m≤0}∪{ums:m≥0}. Since the two families are disjoint, an element of the first family lies in the second list precisely when its index already satisfies m≤0, and an element of the second family would have to satisfy m≤−1 (for IW) and m≥0 (for WJ) simultaneously, which is impossible. Hence IWJ={um:m≤0}={u−k:k≥0}={(ts)k:k≥0}.

3.1F1F4step 1.2step 2.1step 2.2∎

The intersection, the sizes and the decomposition. For k≥0 one has dk−1sdk=uksu−k=u2ks because su−ks=uk; the only element of I is s, and u2ks∈J={t} would force u2ks=t=u−1s, hence u2k=u−1 and u2k+1=1, impossible since u has infinite order by [F1]. Hence K=∅, WK={1} and WIK=WI; the size formula of [F4] gives ∣WI(ts)kWJ∣=2⋅2=4=2⋅2/1. Finally each element of W is um or ums with a unique m∈Z, and the four families u−k(k≥0), uk+1(k≥0), uks(k≥0) and u−(k+1)s(k≥0) list exactly um for m≤0, um for m≥1, ums for m≥0 and ums for m≤−1, without repetition by the disjointness of the two families in step 1.2. Hence W is the disjoint union of the double cosets WI(ts)kWJ, k≥0, the first block being WIWJ={1,s,t,st}; this completes the example.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

74 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