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 weak parabolic projection, its adjoints, and the cover-join lemmas

Statement

Let (W,S) be a Coxeter system of finite type, with S finite; finite type means W is finite (Coxeter diagrams: edges, labels, components and finite type (4)). Use the right and left weak orders, covers, meets and joins of The right and left weak orders, intervals, covers, and meets and joins of subsets, and the inversion sets N(w)={α∈Φ+:ρ(w)α∈Φ−} of The geometric inversion set N(w) of an element of a Coxeter group. For J⊆S, write w=wJd for the unique length-additive factorization with wJ∈WJ and d∈JW the minimal representative of the right coset WJw (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3), Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2)); call wJ the WJ-prefix of w. Put ΦJ,+:=ΦJ∩Φ+, where ΦJ=Φ∩VJ and VJ=span⁡{es:s∈J} (Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2)). Let w0 and w0(J) be the longest elements of W and WJ, respectively (The longest element as the opposition of the chamber, and longest elements of finite parabolics).

(1) Inversion set of the prefix. For every w∈W,

N(wJ−1)=N(w−1)∩ΦJ,+.

Consequently wJ is the greatest element of WJ below w in ≤R, the map w↦wJ is order-preserving, and for every v∈WJ one has v≤Rw if and only if v≤RwJ.

(2) The largest lift. For every z∈WJ, the largest element x∈W with xJ=z is

x=z w0(J) w0.

It satisfies ℓ(x)=ℓ(z)+ℓ(w0)−ℓ(w0(J)), and

N(x−1)=N(z−1)∪(Φ+∖ΦJ,+).

For every y∈W, y≤Rx if and only if yJ≤Rz.

(3) Meet and join preservation. For all x,y∈W,

(x∧y)J=xJ∧yJ,(x∨y)J=xJ∨yJ.

Thus w↦wJ is a surjective lattice homomorphism from the finite weak order on W to the induced weak order on WJ.

(4) Cover-join lemmas. For w∈W define its set of cover roots by

cov⁡(w):={α∈N(w−1):tαw=ws and ℓ(ws)=ℓ(w)−1 for some s∈S}.

For s∈S put J:=S∖{s}. Then:

(i) if es∈cov⁡(w) and tα∈WJ for every α∈cov⁡(w)∖{es}, then w=s∨wJ;

(ii) if y∈WJ, then cov⁡(s∨y)=cov⁡(y)∪{es}.

No Axiom of Choice (AC) is used.

Facts & Assumptions

Given: finite type (W,S), its root system Φ=Φ+⊔Φ−, canonical reflection representation ρ, length function ℓ, and the right and left weak orders.

[F1]

Finite type, or spherical type, is the condition that W is finite (Coxeter diagrams: edges, labels, components and finite type (4)).

[F2]

In the right weak order, a join is the least upper bound and a meet is the greatest lower bound when they exist (The right and left weak orders, intervals, covers, and meets and joins of subsets (3)).

[F3]

The right weak order satisfies u≤Rv exactly when N(u−1)⊆N(v−1) (Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (4)).

[F4]

If a Coxeter system is finite, its right weak order is a lattice (Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics (2)); this applies to W and to each finite WJ once its Coxeter-system structure is identified by [F14].

[F5]

For finite W, w02=1, ρ(w0)Φ+=Φ−, and ℓ(uw0)=ℓ(w0)−ℓ(u)=ℓ(w0u) (The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)).

[F6]

Every right coset WJw has a unique minimal representative d, characterized by ℓ(sd)>ℓ(d) for all s∈J; every w∈W has a unique factorization w=ud with u∈WJ and this d, ℓ(w)=ℓ(u)+ℓ(d), and ℓ(vd)=ℓ(v)+ℓ(d) for every v∈WJ (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3)).

[F8]

ΦJ=Φ∩VJ and ρ(v)VJ=VJ for every v∈WJ (Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2)).

[F9]

N(w)={α∈Φ+:ρ(w)α∈Φ−} (The geometric inversion set N(w) of an element of a Coxeter group (1)).

[F10]
[F25]

If α=ρ(w)es, the root-reflection dictionary defines tα=wsw−1 (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)).

[F11]

Every root is positive or negative, with Φ=Φ+⊔Φ− and Φ−=−Φ+ (Root sign coherence and the action of simple reflections on positive roots (2)).

[F12]

The support S(w) is independent of the reduced expression, and w∈WJ if and only if S(w)⊆J; hence every reduced expression of an element of WJ uses only letters of J (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)).

[F13]

Every cover u⋖Rv has the form v=us for some s∈S with ℓ(v)=ℓ(u)+1 (Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (2)).

[F14]

For each J⊆S, (WJ,J) is a Coxeter system and its intrinsic length agrees with the ambient length on WJ (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)).

[F15]

For finite WJ, w0(J)2=1 and ℓ(w0(J)u)=ℓ(w0(J))−ℓ(u)=ℓ(uw0(J)) for u∈WJ (The longest element as the opposition of the chamber, and longest elements of finite parabolics (2)).

[F16]

For a reduced word w=s1⋯sn, N(w−1)={ρ(s1⋯si−1)esi:1≤i≤n}, these roots are distinct and positive, and ∣N(w)∣=∣N(w−1)∣=ℓ(w) (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (2)).

[F17]

For every s∈S, ρ(s) permutes Φ+∖{es} and sends es to −es (Root sign coherence and the action of simple reflections on positive roots (3)).

[F20]

If u≤Rv, there is a chain of simple-generator covers from u to v with exactly ℓ(v)−ℓ(u) covers (Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (2),(3)).

[F22]

For each positive root α, tα∈WJ exactly when α∈ΦJ,+ (Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2)).

[F23]

For finite WJ, ℓ(w0(J))=∣ΦJ,+∣ (The longest element as the opposition of the chamber, and longest elements of finite parabolics (2)).

[F24]

The right weak order is defined by u≤Rv exactly when v=ux and ℓ(v)=ℓ(u)+ℓ(x) for some x∈W (The right and left weak orders, intervals, covers, and meets and joins of subsets (1)).

Proof

technique · compute the prefix inversion set from a reduced expression and use the weak-order inversion criterion. Construct the largest lift from the longest elements, prove the projection adjunctions, then establish the cover-root deletion and join identities. All choices are single witnesses in finite sets; AC is not used
1.1F1F6F7F8F9F15given

Finite setup and notation. By [F1], W is finite, and each WJ is finite. Fix J⊆S and w∈W. Write w=wJd for its unique length-additive factorization, with d minimal in WJw by [F6]; wJ, WJ, ΦJ,+, N, w0 and w0(J) have the meanings fixed in the Statement and [F7]-[F9],[F15].

1.2F5F6F8F15F16F23

The minimal representative above the parabolic factor. Let L:=ℓ(w0) and LJ:=ℓ(w0(J)). By [F5], q:=w0(J)w0 has length L−LJ. For each s∈J, [F15] gives ℓ(sw0(J))=LJ−1 and [F5] gives ℓ(sq)=ℓ(sw0(J)w0)=L−(LJ−1)=ℓ(q)+1. Thus q has no left descent in J and is the minimal representative of WJw0 by [F6]. Since w0(J)2=1 by [F15], w0=w0(J)q. Therefore x:=zq=z w0(J) w0 is the length-additive parabolic factorization with prefix z, and ℓ(x)=ℓ(z)+L−LJ. Also N(w0(J)−1)⊆ΦJ,+ by [F8],[F16], and its cardinality is LJ=∣ΦJ,+∣ by [F16],[F23]; consequently w0(J) sends every positive subsystem root to a negative subsystem root.

1.3F10F13F16F25

Deleting a cover root. For α∈cov⁡(w) choose s∈S with tαw=ws and ℓ(ws)=ℓ(w)−1, and write a reduced word w=qs. Then tα=wsw−1=qsq−1=tρ(q)es by [F25]; hence the unique positive root for this reflection is ρ(q)es by [F10]. It is the last prefix root of N(w−1); the prefix formula for N((tαw)−1)=N(q−1) therefore gives N((tαw)−1)=N(w−1)∖{α}. Conversely every cover predecessor v⋖Rw is v=ws for a generator s by [F13], and its conjugate reflection wsw−1=tα has α∈N(w−1) by the prefix formula [F16]; hence v=tαw with α∈cov⁡(w). Thus cover predecessors correspond exactly to deleting their cover roots.

2.1F6F8F12F16F22F25step 1.1

Prefix inversion set. Choose a reduced expression wJ=s1⋯sk with letters in J (available by [F12]) and a reduced expression d=sk+1⋯sn. Their concatenation is reduced by [F6]. The prefix roots for indices i≤k in the formula [F16] are the prefix roots of N(wJ−1) and lie in ΦJ,+, because their reflections are words in J and [F8] identifies the roots of WJ. If a suffix index i>k had prefix root αi∈ΦJ,+, then tαi∈WJ by [F22]. Write w=psir with p=s1⋯si−1 and r=si+1⋯sn. By [F16], αi=ρ(p)esi, and [F25] gives tαi=psip−1; hence tαiw=pr=wJd′, where d′ is represented by the suffix word with si deleted and has length at most ℓ(d)−1. Since tαi∈WJ, tαiw∈WJw=WJd, so d′=wJ−1tαiw∈WJd. This contradicts the minimality of d. Thus no suffix root lies in ΦJ,+, while all prefix roots do; the inversion formula gives N(w−1)∩ΦJ,+=N(wJ−1).

2.2F5F8F9F11F12F17step 1.2

Inversion set of the lift. Let x=z w0(J) w0. If α∈ΦJ,+, then β:=ρ(z−1)α is a root of the subsystem. By step 1.2, ρ(w0(J)) reverses the sign of subsystem roots, while ρ(w0) reverses the sign of every root; therefore ρ(x−1)α∈Φ− exactly when ρ(z−1)α∈Φ−, so α∈N(x−1) exactly when α∈N(z−1). If α∈Φ+∖ΦJ,+, choose reduced words for z−1 and w0(J); their letters lie in J by [F12]. At every letter r∈J, the current root remains outside VJ: since ρ(r) is invertible and preserves VJ by [F8], it cannot send a vector outside VJ into VJ. Thus the current root is never er, and [F17] keeps it positive. Then ρ(w0) sends the resulting positive root to a negative root by [F5], so every such α belongs to N(x−1). This proves N(x−1)=N(z−1)∪(Φ+∖ΦJ,+).

3.1F3F6F8F12F16F19F24step 2.1

Greatest prefix and order-preserving projection. If v∈WJ, [F12] says every reduced word for v uses only letters of J, so every prefix root of a reduced word for v lies in ΦJ,+ by [F8] and [F16]. Thus, when v≤Rw, the criterion [F3] and step 2.1 give N(v−1)⊆N(wJ−1), so v≤RwJ; conversely wJ≤Rw by the factorization [F6] and the definition [F24]. This proves the greatest-element claim and v≤Rw  ⟺  v≤RwJ for v∈WJ. If x≤Ry, intersect N(x−1)⊆N(y−1) with ΦJ,+ and apply step 2.1 to both prefixes; [F3] gives xJ≤RyJ.

3.2F2F3F4F6F13F16F19F20F22F24step 2.1step 1.3

Cover-join clause (4)(i). Let J=S∖{s} and assume the hypotheses of (i). By [F16], N(s−1)={es}, so es∈N(w−1) implies s≤Rw by [F3]; also wJ≤Rw by the length-additive factorization [F6] and the definition [F24]. The element w is therefore a common upper bound. Suppose a strict common upper bound u<Rw existed. By [F20], choose a cover predecessor v⋖Rw with u≤Rv; by step 1.3 it deletes some α∈cov⁡(w). If α=es, then es∉N(v−1), so s̸≤Rv by [F3]. If α≠es, then tα∈WJ by hypothesis and α∈ΦJ,+ by [F22]; steps 2.1 and 1.3 give N(vJ−1)=N(wJ−1)∖{α}, so wJ̸≤Rv by [F3]. Both cases contradict u≤Rv and s,wJ≤Ru. Hence no strict common upper bound lies below w. The join s∨wJ exists by [F4], and by its least-upper-bound definition [F2] is at most w; it equals w.

4.1F3step 2.1step 3.1step 2.2

Largest-lift adjunction. If yJ=z, step 2.1 gives N(y−1)∩ΦJ,+=N(z−1), so N(y−1)⊆N(x−1) by step 2.2 and y≤Rx by [F3]. Conversely, if y≤Rx, order preservation from step 3.1 gives yJ≤RxJ=z. More generally, if yJ≤Rz, then N(y−1)∩ΦJ,+=N(yJ−1)⊆N(z−1), while every root outside ΦJ,+ is in N(x−1); hence N(y−1)⊆N(x−1) and y≤Rx. This proves the largest-lift claim and its stated equivalence.

4.2F2F4F14F19step 3.1

Meet preservation. The finite weak orders on W and WJ are lattices by [F4] and [F14]. For u∈WJ, step 3.1 gives u≤Rv exactly when u≤RvJ. By the meet definition [F2], for every u∈WJ, u≤RxJ∧yJ exactly when u≤RxJ and u≤RyJ, exactly when u≤Rx and u≤Ry, exactly when u≤Rx∧y, exactly when u≤R(x∧y)J. Both candidate meets lie in WJ, so antisymmetry [F19] yields (x∧y)J=xJ∧yJ.

5.1F2F3F4F6F14F19step 3.1step 4.1

Join preservation and surjectivity. Put z:=xJ∨yJ∈WJ and let X:=z w0(J) w0 be its largest lift from step 4.1. Since xJ,yJ≤Rz, the adjunction in step 4.1 gives x,y≤RX, so x∨y≤RX and order preservation gives (x∨y)J≤Rz. Conversely, order preservation applied to x,y≤Rx∨y gives xJ,yJ≤R(x∨y)J, hence z≤R(x∨y)J. The join definition [F2] makes z the least upper bound of xJ,yJ; the two bounds and antisymmetry [F19] yield (x∨y)J=z. If z∈WJ, then its parabolic factorization is z=z⋅1, so zJ=z; the projection is onto WJ.

6.1F2F3F8F12F13F16F19F20F22step 2.1step 5.1step 1.3

Cover-join clause (4)(ii): the simple root and other parabolic covers. Let y∈WJ and put z:=s∨y. By [F12], every reduced expression of y uses letters in J, so [F16] and [F8] give N(y−1)⊆ΦJ,+. Since J=S∖{s}, the simple basis vector es is not in VJ and hence not in ΦJ,+. Thus N(s−1)∩ΦJ,+=∅ by [F16], and step 2.1 gives N(sJ−1)=∅=N(1). The inversion criterion [F3] and partial order [F19] imply sJ=1. Hence projection-join preservation in step 5.1 gives zJ=y. Further, s̸≤Ry, because N(s−1)={es} by [F16] and es∉ΦJ,+; thus y<Rz. Choose a cover predecessor v⋖Rz with y≤Rv by [F20]. Since s≤Rz, [F16] and [F3] give es∈N(z−1); if es∉cov⁡(z), step 1.3 says no cover predecessor deletes it, so es∈N(v−1) and s≤Rv, contradicting that z is the join of s and y. Hence es∈cov⁡(z). If α∈cov⁡(z)∖{es} and tα∉WJ, then α∉ΦJ,+ by [F22]. The predecessor v=tαz deletes only α by step 1.3, so it retains N(y−1)⊆N(z−1)∩ΦJ,+ and retains es; hence y,s≤Rv<Rz, again contradicting the join. Therefore every such tα lies in WJ.

7.1F2F3F6F8F12F13F16F19F20F22F24step 2.1step 5.1step 1.3step 6.1

The cover roots inside the parabolic. Since zJ=y by step 5.1, write z=yd with d the minimal right-coset representative. If α∈cov⁡(z)∖{es}, step 6.1 gives tα∈WJ, so α∈ΦJ,+ by [F22]. Since WJtαz=WJz, d remains the minimal representative of this coset by [F6], and tαz=(tαy)d is the length-additive parabolic factorization. Thus its prefix is tαy; as tαz covers z, lengths give ℓ(tαy)=ℓ(y)−1. Intersecting the deletion formula of step 1.3 with ΦJ,+ and using step 2.1 gives N((tαy)−1)=N(y−1)∖{α}. By [F3], tαy≤Ry, and the length difference one makes it a cover by [F20]; hence α∈cov⁡(y). Conversely let α∈cov⁡(y). By [F12], a reduced word for y uses only letters in J; its prefix roots have the form in [F16] and lie in ΦJ,+ by [F8], so tα∈WJ by [F22]. Put y′:=tαy and z′:=s∨y′. Since y′=yr for some r∈J with ℓ(y′)=ℓ(y)−1, [F24] gives y′<Ry; therefore z=s∨y is an upper bound of s,y′ and [F2] gives z′=s∨y′≤Rz. Step 5.1 gives zJ′=y′ and zJ=y, so z′≠z; hence z′<Rz. Choose v⋖Rz with z′≤Rv by [F20], and let β∈cov⁡(z) be its deleted root from step 1.3. Since s,y′≤Rv, if β∉N(y−1) then N(y−1)⊆N(v−1) and y≤Rv, contradicting the join. If β∈N(y−1), then step 1.3 gives N((y′)−1)=N(y−1)∖{α}; because y′≤Rv, the deleted root β cannot lie in this latter set, so β=α. Therefore v=tαz and α∈cov⁡(z). This proves cov⁡(z)=cov⁡(y)∪{es}.

8.1F1step 1.1step 1.2step 1.3step 2.1step 2.2step 3.1step 3.2step 4.1step 4.2step 5.1step 6.1step 7.1∎

Choice and conclusion. Steps 2.1 and 3.1 prove (1); steps 1.2, 2.2 and 4.1 prove (2); steps 4.2 and 5.1 prove (3); step 3.2 proves (4)(i); and steps 6.1 and 7.1 prove (4)(ii). Since W is finite and each witness is selected from a finite interval or one fixed reduced expression at a time, no Axiom of Choice is used.

Depends on

Used by

Dependency tree · two levels

53 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