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 cone criterion, monotonicity of the projection, and the greatest sortable element below w

Statement

Let (W,S) be a Coxeter system of finite type, c a Coxeter element, πc the projection of The recursive initial-letter sortable projection, Ccr(v) and Conec(v) the skip roots and cone of c-sortable elements, forced and unforced skips, skip roots, and the chamber cone, and let wC denote the closed chambers of the finite reflection arrangement (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1),(2)) under the identification V≅V∗.

(1) Cone criterion for comparable pairs. If v is c-sortable and v≤Rw, then πc(w)=v  ⟺  wC⊆Conec(v).

(2) Monotonicity. πc is order preserving: x≤Ry implies πc(x)≤Rπc(y).

(3) Greatest sortable below, and full cone criterion. For every w∈W the element πc(w) is the unique greatest c-sortable element below w in ≤R; and for every c-sortable v, πc(w)=v  ⟺  wC⊆Conec(v). Consequently the closed chambers indexed by each fiber of πc have union equal to its cone (assembled in Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone).

(4) Parabolic compatibility. For J⊆S, with c′ the restriction of c and wJ the WJ-prefix, πc′(wJ)=πc(w)J for every w∈W.

Facts & Assumptions

Given: the finite-type system and objects of the Statement. Write Js=S∖{s}, I(w)={tα:α∈N(w−1)}, and Cov(v)={tα:α∈cov⁡(v)} for the cover reflections associated to the positive-root set of The weak parabolic projection, its adjoints, and the cover-join lemmas (4).

[F1]

c-sortable elements, forced and unforced skips, skip roots, and the chamber cone (3),(4) and Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements (1),(2): for c-sortable v, skip roots obey the initial-letter recursion, form a basis, and define the cone by their nonnegative halfspaces.

[F2]

Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements (3): the negative skip roots are {−βt:t∈Cov(v)} and the positive ones {βt:t∈ufsc(v)}.

[F3]

The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic (1)-(5): πc is independent of the initial choices, is sortable-valued and below its input, fixes exactly the sortable elements, detects descent at an initial letter, and restricts to the projection of the restricted Coxeter element on WJ.

[F4]

The weak parabolic projection, its adjoints, and the cover-join lemmas (1): N(wJ−1)=N(w−1)∩ΦJ,+, the prefix is greatest in WJ below w, and the prefix map preserves order.

[F5]

The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1),(2): the closed chambers tile V, their interiors are the components of the root-hyperplane complement, and the fundamental chamber is positive on every positive root and negative on every negative root in its interior.

[F7]

The length identity, the prefix property, left translation, and interval translation for weak order (3) preserves and reflects order under left multiplication by s between two elements above s. It also does so between two elements not above s, by applying (3) to their left multiples, which are above s.

[F8]

Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (1)-(5): weak order is a partial order, every inequality is a chain of simple covers, it is inversion-set inclusion, and s≤Rw is equivalent to es∈N(w−1). A cover deletes exactly one positive inversion root, by The weak parabolic projection, its adjoints, and the cover-join lemmas, Proof 1.3.

[F9]

Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics (2),(3): weak order is a lattice in finite type, and the join of two simple generators is the longest element of their parabolic.

[F11]

The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness (7): standard dihedral alternating words of length at most m(s,t) are reduced in the ambient group. Plane subsystems, their canonical generators, and the angular order of their roots (3) identifies the standard rank-two subgroup with the dihedral group of order 2m. Its 2m elements have alternating representatives of length at most m. Indeed, let A,B be the alternating words of length m beginning with s,t, respectively. Since s,t are involutions, the concatenation AB−1 is alternating of length 2m beginning with s, so AB−1=(st)m=1 by The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness (1),(4); hence A=B. Thus an alternating length-m word is its longest element, and deleting its first s gives a reduced length-m−1 alternating word starting with t.

[F12]

c-sortable elements, forced and unforced skips, skip roots, and the chamber cone (1) defines decreasing selected blocks. The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment (1) computes them. Thus a sortable non-descent at initial s selects no occurrence of s and lies in WJs; in the descent case deleting the first selected s preserves the per-letter initial-segment condition and gives scs-sortability of sv.

Proof

1.1F1F2F5F6F8given

Chamber signs. For x=ρ(w)y with y∈C∘ and β∈Φ+, invariance gives B(x,β)=B(y,ρ(w−1)β); its sign is negative exactly when β∈N(w−1). Thus wC⊆Conec(v) exactly when every negative skip root −βt has t∈I(w) and every positive skip root βt has t∉I(w). Closure extends the interior signs to the entire chamber. We use this dictionary throughout, so root-hyperplane geometry introduces no dependence on the final cone theorem.

1.2F1F3F4F5F8inductionbase

The identity case. For any c, πc(w)=1 implies w=1. Prove this by rank induction: if an initial s is below w, descent detection excludes value 1; otherwise πc(w)=πsc(wJs), so rank induction gives wJs=1. If w≠1, a first letter r of a reduced word for w is a left descent and differs from s, hence r∈Js and r≤RwJs by [F4], a contradiction. Conversely πc(1)=1. The cone for 1 is C, and wC⊆C exactly when w=1 by disjoint chamber interiors. This is the base for the following inductions on (rank, length of the sortable element).

1.3F3F4F8F10baseinductionih

We prove monotonicity by induction on (rank, ℓ(y)), simultaneously for every Coxeter element and pair x≤Ry. The base y=1 is immediate. It suffices to handle covers. First establish the auxiliary consequence under these inductive hypotheses: for any simple t≤Ry, one has t≤Rπc(y). Choose initial s of c. If s=t, descent detection proves this. If s̸≤Ry, then t∈Js and t≤RyJs; rank induction gives t=πsc(t)≤Rπsc(yJs)=πc(y), since every simple generator is sortable (its one selected occurrence is in the first block).

1.4F3F4F7ih

Cover case with neither x nor y above s. The prefix map preserves xJs≤RyJs, and rank induction gives πsc(xJs)≤Rπsc(yJs), the desired projections. No parabolic membership of x,y is needed. If both are above s, left translation gives sx≤Rsy with the upper length smaller; length induction followed by [F7] gives sπscs(sx)≤Rsπscs(sy).

2.1step 1.1step 1.2F1F3F4F10F12ih

Comparable criterion, neither element above initial s. Only the sortable v, not an arbitrary non-descent w, is asserted to belong to WJs by [F12]. Its skip set is {es}∪Csc(v). The es-inequality holds for wC since s̸≤Rw; all other inequalities involve subsystem roots and therefore depend only on N(wJs−1) by [F4]. Consequently wC⊆Conec(v) is equivalent to wJsCJs⊆Conesc(v). Since v≤Rw gives v≤RwJs, rank induction identifies this with πsc(wJs)=v, the recursion for πc(w).

2.2step 1.2F1F3F6F7F10F12ih

Comparable criterion, both elements above s. Then sv≤Rsw by [F7], sv is scs-sortable, and πc(w)=sπscs(sw). Root transport gives Conec(v)=ρ(s)Conescs(sv), so inclusion of wC is equivalent to inclusion of (sw)C in the latter cone. Induction on the strictly smaller length of sv proves the equivalence with πscs(sw)=sv, hence πc(w)=v.

2.3step 1.3F3F7F8F9F11ih

Auxiliary consequence when s≤Ry and s≠t. Put z=s∨t, the rank-two longest element by [F9]; then z≤Ry, so sz≤Rsy by [F7]. In the rank-two system sz has an alternating reduced word of length m(s,t)−1 beginning with t, by [F11], so it is sortable for ts, the restriction of scs (where s is final). Parabolic restriction and the fixed-point property give πscs(sz)=sz. Since ℓ(sy)<ℓ(y), length induction gives sz≤Rπscs(sy). Both sides are not above s: the left because s(sz)=z lengthens, the right because it is below sy, which is not above s. Apply [F7] to their left multiples to obtain z≤Rsπscs(sy)=πc(y), hence t≤Rπc(y). This proves the auxiliary consequence for all simple t and all c under the stated inductive hypotheses.

3.1step 1.1step 2.1step 2.2F1F3F8F10discharge-induction

Comparable criterion, v̸≥Rs and w≥Rs. Descent detection makes πc(w)≠v, while es is a positive skip root of v and interior points of wC have negative pairing with it. Both sides fail. The fourth possibility v≥Rs, w̸≥Rs is excluded by v≤Rw. These cases prove (1) using only rank and sortable-length induction.

4.1step 1.1step 3.1step 1.3step 2.3step 1.4F1F2F3F4F8ihdischarge-induction

Mixed cover x̸≥Rs, y≥Rs. Their inversion sets differ by one root, necessarily es by [F8]; deleting its cover reflection gives x=sy. Put u=πscs(x). It is below x and not above s. The auxiliary consequence in steps 1.3 and 2.3, applied to scs at the present upper element y, gives πscs(y)≥Rs, so it differs from u. Comparable criterion (1), already proved independently, gives xC⊆Conescs(u) and yC⊈Conescs(u), since u≤Rx≤Ry. The sign dictionary and the single new inversion es show that the skip inequality which changes from satisfied on xC to violated on yC must have positive normal es. Thus es∈Cscs(u), and transport gives −es∈Cc(su); the negative-skip/cover dictionary makes s a cover reflection of su=πc(y). Therefore u=sπc(y)<Rπc(y). Length induction at x, together with parabolic restriction, gives πc(x)=πsc(xJs)=πscs(xJs)≤Ru. Hence πc(x)≤Rπc(y). This proves (2). The separating wall here is Hes; no identification with Hρ(x)es is used.

5.1step 4.1F3F8

Greatest sortable element. The projection is sortable and below w by [F3]. If sortable v≤Rw, monotonicity gives v=πc(v)≤Rπc(w). Antisymmetry proves uniqueness.

6.1step 1.2step 2.1step 2.2step 3.1step 4.1step 5.1F1F3F6F8ihdischarge-induction

Full criterion: induct again on (rank, ℓ(v)), now with arbitrary w. The base v=1 is step 1.2. Cases where neither element is above initial s, or both are above it, use exactly the sign/prefix and conjugation computations in steps 2.1-2.2, with this full induction replacing the comparable induction; no comparison is needed. The case v̸≥Rs, w≥Rs is step 3.1. In the remaining case v≥Rs, w̸≥Rs, descent detection excludes equality. Monotonicity gives πscs(sw)≥Rπscs(s)=s, since sw≥Rs; but sv̸≥Rs. The projections therefore differ. Full induction on the shorter sortable element sv gives (sw)C⊈Conescs(sv), hence wC⊈Conec(v) by conjugation. This proves (3) without applying the comparable criterion to an unverified comparable pair.

6.2step 4.1step 5.1F3F4F8F10

Parabolic compatibility. Since wJ≤Rw, monotonicity and restriction give πc∣J(wJ)=πc(wJ)≤Rπc(w), hence it is below πc(w)J. Conversely πc(w)≤Rw implies πc(w)J≤RwJ. This prefix is c∣J-sortable by [F10], so applying monotonicity of πc∣J gives πc(w)J≤Rπc∣J(wJ). Antisymmetry proves (4).

7.1step 3.1step 4.1step 5.1step 6.1step 6.2discharge-induction∎

Clauses (1)-(4) have been proved in the order comparable criterion, monotonicity, greatest/full criterion, and parabolic compatibility. All choices use finite words, roots or chambers and no Choice is invoked.

Depends on

Used by

Dependency tree · two levels

106 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