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

All skips and the cone walls of the sortable element s1s2 in A3

Statement

Let (W,S) be of type A3, S={s1,s2,s3}, c=s1s2s3 and v=s1s2. Put Cov(v):={tα:α∈cov⁡(v)} for its cover reflections, with cov⁡(v) the positive-root set of The weak parabolic projection, its adjoints, and the cover-join lemmas (4). Then v is c-sortable, its sorting word is s1s2 at positions 1,2 of the first block of c∞, and its block sequence is the single subset {s1,s2}. (i) The leftmost unselected occurrences are s1 at position 4, s2 at position 5 and s3 at position 3; each skip has i=2, so the associated reflections are ts1=s1s2s1s2s1=s2, ts2=s1s2s1 and ts3=s1s2s3s2s1. The words s1s2s1 and s1s2s3 are reduced while s1s2s2 is not, so the skips of s1 and s3 are unforced and the skip of s2 is forced. (ii) Hence the skip roots are Ccs1(v)=ρ(s1s2)es1=es2,Ccs2(v)=ρ(s1s2)es2=−(es1+es2),Ccs3(v)=ρ(s1s2)es3=es1+es2+es3. These three vectors form a basis of V, Ac(v)={−(es1+es2)} and Bc(v)={es2,es1+es2+es3}. In agreement with Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements (3), the only element covered by v in the weak order is vs2=s1, so Cov(v)={s1s2s1}, whose positive root is es1+es2. (iii) The cone is Conec(v)={x∈V:B(x,es2)≥0, B(x,es1+es2)≤0, B(x,es1+es2+es3)≥0}, and for every x∈C the translate ρ(v)x satisfies the three inequalities, because of the adjoint identity B(ρ(v)x,β)=B(x,ρ(v)−1β) together with ρ(s1s2)es1=es2, ρ(s1s2)es2=−(es1+es2), ρ(s1s2)es3=es1+es2+es3: explicitly B(ρ(v)x,es2)=B(x,es1)≥0, B(ρ(v)x,es1+es2)=−B(x,es2)≤0 and B(ρ(v)x,es1+es2+es3)=B(x,es3)≥0. Thus vC⊆Conec(v), in agreement with the cone criterion πc(w)=v  ⟺  wC⊆Conec(v) at w=v.

Facts & Assumptions

Given: (W,S) of type A3 with S={s1,s2,s3}, m(s1,s2)=m(s2,s3)=3, m(s1,s3)=2, the Coxeter form B with B(esi,esi)=1, B(es1,es2)=B(es2,es3)=−12, B(es1,es3)=0, the reflection representation ρ, the Coxeter element c=s1s2s3, and v=s1s2.

[F1]

The real Coxeter form, its radical, reflections, and form-preserving maps (2): in the type-A3 normalization B(es,es)=1 for all s∈S, B(es1,es2)=B(es2,es3)=−12 and B(es1,es3)=0.

[F2]

Coxeter elements, the oriented Euler form, the skew form, and the periodic word (1),(3): Ec(esi,esj)=K(esi,esj) for i>j, 1 for i=j and 0 for i<j; c∞ has dividers after each block of n=3 letters and the sorting word is the leftmost reduced subword.

[F3]

c-sortable elements, forced and unforced skips, skip roots, and the chamber cone (1),(2),(3),(4): the definitions of the sorting word, the skips, the associated reflection t=a1⋯air ai⋯a1, forced and unforced skips, the skip roots Ccr(v)=ρ(a1⋯ai)er, the sets Ac(v),Bc(v) and the cone Conec(v).

[F4]

The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment (1): the greedy scan selects a position with letter u exactly when u is a left descent of the current remainder and stops at the identity.

[F5]

Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1),(4): the support S(w) of w is independent of the reduced expression, and in type A3 the assignment si↦(i i+1) extends to an isomorphism W→S4; under it the length equals the inversion number of the corresponding permutation.

[F6]

The weak parabolic projection, its adjoints, and the cover-join lemmas (4): the cover roots of w are the roots α∈N(w−1) with tαw=ws and ℓ(ws)=ℓ(w)−1 for some s∈S.

[F7]

Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements (1),(2),(3): skip roots are ±βt with sign governed by forcedness, the skip set is a basis, and Ac(v)={−βt:t∈Cov(v)}.

[F8]

The cone criterion, monotonicity of the projection, and the greatest sortable element below w (1): for c-sortable v with v≤Rw one has πc(w)=v  ⟺  wC⊆Conec(v).

[F9]

Descent of the reflection representation, unit root norms, and conjugation of reflections (2): ρ(w) is B-preserving, so B(ρ(w)x,β)=B(x,ρ(w)−1β) for all x,β∈V and w∈W.

[F10]

Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: the presentation has the relators s2 for s∈S and (st)m(s,t) for s,t∈S with m(s,t)<∞; in particular s22=1 and (s1s2)3=1.

[F11]

The real Coxeter form, its radical, reflections, and form-preserving maps (3) and The canonical reflection homomorphism, roots, reflections, and the positive cone (1): ra(v)=v−2B(v,a)B(a,a)a for B(a,a)≠0, and ρ(s)=res for every s∈S.

Proof

1.1F2F3F4F5

The element v=s1s2 has ℓ(v)=2 and S(v)={s1,s2} [F5]. The greedy scan of c∞=s1s2s3 s1s2s3⋯ reads the remainders v→s2→1: position 1 has letter s1∈DL(v) and is selected, position 2 has letter s2∈DL(s2) and is selected, and position 3 has letter s3∉DL(1) — the scan stops because the remainder is already 1 after two selections [F4]. Hence the sorting word is s1s2 at positions 1,2 and the block sequence is the single subset {s1,s2}, which is weakly decreasing; so v is c-sortable [F3].

2.1step 1.1F2F3

The selected positions are 1,2, so the leftmost unselected occurrences are s3 at position 3 and s1,s2 at positions 4,5; each follows exactly i=2 selected letters, so all three skips occur in the 3rd position of the sorting word [F3].

3.1step 2.1F3F5F10

The associated reflections are ts1=a1a2s1a2a1=s1s2s1s2s1=s2, ts2=s1s2s2s2s1=s1s2s1 and ts3=s1s2s3s2s1 [F3]; the reductions use (s1s2)3=1 for the first and s22=1 for the second [F10]. The words a1a2s1=s1s2s1 and a1a2s3=s1s2s3 are reduced while a1a2s2=s1s2s2=s1 is not [F5]; hence the skips of s1 and s3 are unforced and the skip of s2 is forced [F3].

4.1step 3.1F1F3F11

The skip roots are Ccs1(v)=ρ(s1s2)es1=es2, Ccs2(v)=ρ(s1s2)es2=−(es1+es2) and Ccs3(v)=ρ(s1s2)es3=es1+es2+es3: the images are computed from [F1] and [F11] as ρ(s2)es1=es1+es2, ρ(s2)es2=−es2, ρ(s2)es3=es2+es3, ρ(s1)es1=−es1, ρ(s1)es2=es1+es2 and ρ(s1)es3=es3, with the sign of the s2-skip negative because that skip is forced [F3].

5.1step 4.1F3algebra

The three vectors es2, −(es1+es2) and es1+es2+es3 form a basis of V: in the basis (es1,es2,es3) they are (0,1,0), (−1,−1,0) and (1,1,1), and the last has a nonzero third coordinate while the first two are independent. By [F3] and step 4.1, Ac(v)={−(es1+es2)} and Bc(v)={es2,es1+es2+es3}.

6.1step 4.1step 5.1F5F6F7F11

Cover reflections: the right descents of v=s1s2 are read off the products vs1=s1s2s1, vs2=s1, vs3=s1s2s3; their lengths are 3, 1 and 3 [F5], so the only cover relation v⋗vs has s=s2 and cover reflection t=vs2v−1=s1s2s1, with positive root −ρ(s1s2)es2=−Ccs2(v)=es1+es2 [F6, F11, step 4.1]. This matches [F7]: the unique negative skip root of v is −(es1+es2) and Cov(v)={s1s2s1}.

7.1step 1.1step 4.1step 5.1F1F3F8F9F11algebra∎

Cone and a chamber check: by [F3] the cone is Conec(v)={x∈V:B(x,es2)≥0, B(x,es1+es2)≤0, B(x,es1+es2+es3)≥0}. For x∈C, i.e. B(x,esi)≥0 for i=1,2,3, the adjoint identity B(ρ(v)x,β)=B(x,ρ(v)−1β) [F9] and the inverse images ρ(v)−1es2=es1, ρ(v)−1(es1+es2)=−es2, ρ(v)−1(es1+es2+es3)=es3 [F11, step 4.1] give B(ρ(v)x,es2)=B(x,es1)≥0, B(ρ(v)x,es1+es2)=−B(x,es2)≤0 and B(ρ(v)x,es1+es2+es3)=B(x,es3)≥0; hence ρ(v)C⊆Conec(v), that is vC⊆Conec(v). This is the instance πc(v)=v of the cone criterion at w=v [F8], consistent with v being c-sortable [step 1.1].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

79 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